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

Home > Numbers
Prime repunits (Posted on 2016-11-24) Difficulty: 2 of 5
A number like 11, 111, or 1111 i.e. a number containing only the digit 1
is called repunit.

List all base-8 prime repunits.

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts Almost a proof | Comment 3 of 5 |
The base is 8, which makes me think the proof will be based off of a polynomial factorization.

Create a set of polynomials P_n(x) = x^(3n) + x^(3n-3) + ... + x^3 + 1.  Then each base 8 repunit is P_n(2) for a repunit of n+1 digits.

Playing with set of polynomials, it seems that every P_n(x) is factorable with a factor of the form x^n + x^(n-1) + ... + x + 1.  

If I assume this is true then the proof falls into place by simply factoring each polynomial P_n(x) and picking up the oddball cases where one of the factors turns out to evaluate to 1.

  Posted by Brian Smith on 2016-11-24 21:14:05
Please log in:
Remember me:
Sign up! | Forgot password

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

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