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

Home > Numbers
Scarce primes (Posted on 2011-01-10) Difficulty: 2 of 5
A repunit is a number consisting solely of ones (such as 11 or 11111).
Let us call p(n) a 10-base integer represented by a string of n ones, e.g. p(1)=1, p(5)=11111 etc.
Most of the repunit numbers are composite.
2, 19,23,317 are the first four indices of prime repunits.

Prove: For a prime repunit p(n) to be prime, n has to be prime.

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips Repunits | Comment 2 of 10 |
If n is composite, then n 1's is composite. Say n=xy. Then, n 1's is divisible by x 1's and y 1's. Therefore, if n 1's is prime, then n is prime.


  Posted by Math Man on 2011-01-10 17:40:22
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
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

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information