This week's book giveaway is in the JavaFX forum. We're giving away four copies of Introducing JavaFX 8 Programming and have Herbert Schildt on-line! See this thread for details.

The decimal number, 585 = 1001001001 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.

I expected this to be fairly easy, yet my answer was rejected. I must have missed out some palindromes somewhere. I found 14. How many should I have found?

I would think you could skip about half of those as well, Dennis. Aren't all binary palindromes odd?

Hmm, my quick back-of-the-envelope count is that I'd need to check 1110 different numbers. Haven't actually done it though, so maybe I'm missing something.

Aashu Aggarwal wrote:I have tried to solve it. Is the final sum of all palindromes is xxxxxx?

Hi Aashu. Welcome to the Ranch!

If you want to check any answers, you can register and enter them at Project Euler. I think it's better if you don't publish your answers here, though - they prefer answers not to be published so that the challange remains. Hope you don't mind that I've deleted it from your post.

Aashu Aggarwal
Greenhorn

Joined: Aug 01, 2012
Posts: 4

posted

0

Thanks Matthew for letting me know the site. I am sorry that i posted answer here. Will check on site now on.