Live data from Hacker News

Any positive number can be written as a sum of three palindromes

somethingorotherwhatever.com

11–20 of 114 posts

Re: Any positive number can be written as a sum of three palindromes

#17
Looks like code is at [0]. Didn't read in detail, but how difficult is it to find these 3 palindromes for something like a 100 digit number? Or, asked another way, how hard will it be to crack my new 3-palindrome-sum-factor based encryption scheme (assuming I have rules about not having easy factors)?

0 - https://github.com/christianp/sum-of-palindromes

Re: Any positive number can be written as a sum of three palindromes

#18

Looks like code is at [0]. Didn't read in detail, but how difficult is it to find these 3 palindromes for something like a 100 digit number? Or, asked another way, how hard will it be to crack my new 3-palindrome-sum-factor based encryption scheme (assuming I have rules about not having easy factors)? 0 - https://github.com/christianp/sum-of-palindromes

Uniqueness would be a problem. The sum isn't guaranteed to have unique terms.

2 is (2,0,0) and (1,1,0).

Re: Any positive number can be written as a sum of three palindromes

#20
post #7
post #4

Every positive number is a sum of infinite palindromes since they include 0 as a palindrome. Try entering 101.

Why wouldn't 0 be a palindrome? Every single digit number is.

I think they're saying that 002 is counted as a palindrome, but 112 would not be.

(2 == 002 but 112 != 211 which is an "unfair" property of the number zero)

Post reply on HN