All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 B-Palindromes (Posted on 2004-02-25)
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).

 No Solution Yet Submitted by DJ Rating: 4.0000 (6 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 Shorter Still? | Comment 4 of 11 |

Those formulae work, but the numbers are enormous .. my intended answer yields a somewhat large number as well, but on a substantially smaller order.

For example, say you were looking for a number that worked for just 7 values of b, instead of 1000. 2^(7!) is 1518 digits long, 2^(2^8)+2^(2^7+1) is 78 digits long, but mine is only three digits long in decimal.

So, while your answers are perfectly fine, there is still much room for optimization. Remember, if you are in, say, base 25, a value of 22 is still a single digit (even though we don't have a way to represent it as such with the current system). In other words, if you want an ideal solution, your palindromes will probably contain more than just zeroes and ones.

 Posted by DJ on 2004-02-26 15:17:08

 Search: Search body:
Forums (0)