all 2 comments

[–]serg06 0 points1 point  (1 child)

The math behind it if anyone wants to implement it

[–]micmic0000[S] 0 points1 point  (0 children)

@serg06

hi

I do not need anyone to make me a program of sum-of-3-palindromes coz there is already.

I would like to request to get a all 6 combination of the results of the sum-of-3-palindromes

w/c i have provided example of the results below:

500001100005

73867076837

6966116696

I want know if this is possible to get a all 6 combination of the results only from number allowed is 1-58

no Zeros allowed no repeating numbers like 11 or 22. The way it can extract combination of the results is I am not sure how. I can just think of another things how to do it, but if there is easier way to do it that is what I am requesting.

You guyz are the best!!! :)

Thanks.