All about
flooble

fun stuff

Get a free chatterbox

Free JavaScript

Avatars
perplexus
dot
info
Home
>
Numbers
Repunits and bases (
Posted on 20130724
)
11
_{2}
=3 and 111
_{3}
=13 are prime. However, 1111
_{4}
=85=5*17 and 11111
_{5}
=781=11*71 are not prime. What is the least number n>3 such that the repunit consisting of n 1's in base n is prime?
See The Solution
Submitted by
Math Man
No Rating
Comments: (
Back to comment list
 You must be logged in to post comments.
)
re(2): Answer:
 Comment 4 of 6 
(In reply to
re: Answer:
by Charlie)
Good question, Charlie!
It is obvious to me that only odd values of n need to be checked.
If n = 2k, then
((2k)^(2k))1 can be factored into
(
((2k)^(k))1) *
(
((2k)^(k))+1),
and x is not going to be prime if k > 1
Posted by
Steve Herman
on 20130724 12:53:15
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:
blackjack
flooble's webmaster puzzle
Copyright © 2002  2018 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information