Repunit primes are repunits that are prime. For example, 11, 1111111111111111111, and 11111111111111111111111 (2, 19, and 23 digits). The only other known repunit primes are the ones with 317 digits: (10317-1)/9, 1,031 digits and (101031-1)/9.
During 1999 Dubner discovered R49081 = (1049081-1)/9 was a probable prime. In October 2000, Lew Baxter discovered the next repunit probable prime is R86453. In 2007 the probable primes R109297 (Bourdelais and Dubner) and R270343 (Voznyy and Budnyy) were found. It will be some time before these giant primes are proven! As the poet wrote:
Ah, but a man's reach should exceed his grasp, or what's a heaven for? (Robert Browning)What makes these repunits R so difficult to prove prime is that we do not have an easy way to factor R-1 or R+1. The (practically) quick methods of primality proving all require factoring.
Even though only a few are known, it has been conjectured that there are infinitely many repunit primes. To see why just look at the graph of the known repunit primes and probable primes (here we graph log(log(Rn)) verses n.
- A. Beiler, Recreations in the theory of numbers, Dover Pub., New York, NY, 1964.
- J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman and S. S. Wagstaff, Jr., Factorizations of bn ± 1, b=2,3,5,6,7,10,12 up to high powers, Amer. Math. Soc., 1988. Providence RI, pp. xcvi+236, ISBN 0-8218-5078-4. MR 90d:11009 (Annotation available)
- Dubner, Harvey, "Repunit R49081 is a probable prime," Math. Comp., 71:238 (2002) 833--835 (electronic). (http://dx.doi.org/10.1090/S0025-5718-01-01319-9) MR 1885632 (Abstract available)
- H. C. Williams and H. Dubner, "The primality of R1031," Math. Comp., 47:176 (1986) 703--711. MR 87k:11141
- H. C. Williams, "Some primes with interesting digit patterns," Math. Comp., 32 (1978) 1306--1310. Corrigendum in 39 (1982), 759. MR 58:484
- S. Yates, Repunits and repetends, Star Publishing Co., Inc., Boynton Beach, Florida, 1982. pp. vi+215, MR 83k:10014