A b-palindrome is an integer that is a palindrome in base
b.
Show how to find a number that is a b-palindrome, of at least three digits, for at least 1000 different values of b.
For example, 200 is not a 10-palindrome, but it is a 9-palindrome (242) and a 7-palindrome (404).
(In reply to
A solution by Charlie)
Oh, I see it's 1000 different values of b. Substitute 1000 for the 100 in my solution.
If both my solution and Brian Smith's withstand scrutiny (it does get a little confusing keeping track of those powers of 2), 2^(2^1001) is smaller than 2^(1002!), as 2^1001 is a 302-digit number and 1002! is a 2,574-digit number.
Edited on February 25, 2004, 3:58 pm
|
|
Posted by Charlie
on 2004-02-25 15:43:50 |
re: A solution -- oh, I see
