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

Home > Numbers
Find out (Posted on 2012-01-08) Difficulty: 3 of 5
How many k-digit palindromes are prime?
Please solve for k=1,2,3, ... 9.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
re: computer solution--something bad happened at the unasked-for k=11 Comment 2 of 2 |
(In reply to computer solution by Charlie)

Sloane shows 42042 for k=11, rather than my 7871, so something went wrong. Apparently UBASIC returns a zero for the prmdiv function if its largest prime divisor is bigger than a certain value, such as in:


C'est l'informatique.

  Posted by Charlie on 2012-01-08 13:29:35
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information