Home > Numbers
| Prime-go-round (Posted on 2012-02-06) |
 |
For k=2,3,4,5,6 find an example (or prove absence) of a circular prime of k digits (i.e. a prime number that remains prime as its leftmost digit (Most Significant Digit) is moved in turn to the right hand side).
|
|
Submitted by Ady TZIDON
|
|
No Rating
|
|
|
Solution:
|
(Hide)
|
|
Clearly , a circular prime may use only the digits 1, 3, 7 and 9.
Complete list v. Charlie's detailed comment. |
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (1)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
