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

Home > Numbers
Prime-go-round (Posted on 2012-02-06) Difficulty: 3 of 5
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).

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Near misses -- Nihil !xdog2012-02-07 20:02:26
Solutioncomputer solutionCharlie2012-02-06 16:50:13
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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