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.)
 Smallest? Comment 11 of 11 |

The number 105700299921216001 is an 18-digit number that is palindromic in at least 1005 bases.

The number is equal to:
2^9 * 3^6 * 5^3 * 7^3 * 11^2 * 13^2 * 17 * 19 + 1

I believe that this is probably the smallest or close to the smallest value that is palindromic in over 1000 bases.

Edited on April 10, 2006, 10:13 am
 Posted by Justin on 2006-04-10 08:07:03

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: