Repunit Explained

Repunit prime
Terms Number:	11
Con Number:	Infinite
First Terms:	11, 1111111111111111111, 11111111111111111111111
Largest Known Term:	(10^8177207−1)/9
Oeis:	A004022
Oeis Name:	Primes of the form (10^n − 1)/9

In recreational mathematics, a repunit is a number like 11, 111, or 1111 that contains only the digit 1 - a more specific type of repdigit. The term stands for "repeated unit" and was coined in 1966 by Albert H. Beiler in his book Recreations in the Theory of Numbers.

A repunit prime is a repunit that is also a prime number. Primes that are repunits in base-2 are Mersenne primes. As of May 2023, the largest known prime number, the largest probable prime R_8177207 and the largest elliptic curve primality-proven prime R₈₆₄₅₃ are all repunits in various bases.

Definition

The base-b repunits are defined as (this b can be either positive or negative)

R ^{(b)} _{n} \equiv 1 + b + b ^{2} + … + b ^{n-1} = {b ^{n-1\over{b-1}} for|b|\ge2,} n\ge 1 . Thus, the number R_n^(b) consists of n copies of the digit 1 in base-b representation. The first two repunits base-b for n = 1 and n = 2 are R ^{(b)} _{1} = {b -1 \over{b -1 }} = 1 and R ^{(b)} _{2} = {b ^{2-1\over{b-1}}=} b +1 for |b|\ge 2 .

In particular, the decimal (base-10) repunits that are often referred to as simply repunits are defined as

R _{n} \equiv R ^{( 10 )} _{n} = { 10 ^{n-1\over{10-1}}} = { 10 ^{n-1\over9} for} n \ge 1 . Thus, the number R_n = R_n⁽¹⁰⁾ consists of n copies of the digit 1 in base 10 representation. The sequence of repunits base-10 starts with

1, 11, 111, 1111, 11111, 111111, ... .

Similarly, the repunits base-2 are defined as

R ^{( 2 )} _{n} = { 2 ^{n-1\over{2-1}}} = { 2 ^{n-1} forn} \ge 1 . Thus, the number R_n⁽²⁾ consists of n copies of the digit 1 in base-2 representation. In fact, the base-2 repunits are the well-known Mersenne numbers M_n = 2ⁿ - 1, they start with

1, 3, 7, 15, 31, 63, 127, 255, 511, 1023, 2047, 4095, 8191, 16383, 32767, 65535, ... .

Properties

• Any repunit in any base having a composite number of digits is necessarily composite. For example,

R₃₅^(b) = = × 1 = × 1,

since 35 = 7 × 5 = 5 × 7. This repunit factorization does not depend on the base-b in which the repunit is expressed.

Only repunits (in any base) having a prime number of digits can be prime. This is a necessary but not sufficient condition. For example,

R₁₁⁽²⁾ = 2¹¹ − 1 = 2047 = 23 × 89.

• If p is an odd prime, then every prime q that divides R_p^(b) must be either 1 plus a multiple of 2p, or a factor of b − 1. For example, a prime factor of R₂₉ is 62003 = 1 + 2·29·1069. The reason is that the prime p is the smallest exponent greater than 1 such that q divides b^p − 1, because p is prime. Therefore, unless q divides b − 1, p divides the Carmichael function of q, which is even and equal to q − 1.
• Any positive multiple of the repunit R_n^(b) contains at least n nonzero digits in base-b.
• Any number x is a two-digit repunit in base x − 1.
• The only known numbers that are repunits with at least 3 digits in more than one base simultaneously are 31 (111 in base-5, 11111 in base-2) and 8191 (111 in base-90, 1111111111111 in base-2). The Goormaghtigh conjecture says there are only these two cases.
• Using the pigeon-hole principle it can be easily shown that for relatively prime natural numbers n and b, there exists a repunit in base-b that is a multiple of n. To see this consider repunits R₁^(b),...,R_n^(b). Because there are n repunits but only n−1 non-zero residues modulo n there exist two repunits R_i^(b) and R_j^(b) with 1 ≤ i < j ≤ n such that R_i^(b) and R_j^(b) have the same residue modulo n. It follows that R_j^(b) − R_i^(b) has residue 0 modulo n, i.e. is divisible by n. Since R_j^(b) − R_i^(b) consists of j − i ones followed by i zeroes, . Now n divides the left-hand side of this equation, so it also divides the right-hand side, but since n and b are relatively prime, n must divide R_j−i^(b).
• The Feit–Thompson conjecture is that R_q^(p) never divides R_p^(q) for two distinct primes p and q.
• Using the Euclidean Algorithm for repunits definition: R₁^(b) = 1; R_n^(b) = R_n−1^(b) × b + 1, any consecutive repunits R_n−1^(b) and R_n^(b) are relatively prime in any base-b for any n.
• If m and n have a common divisor d, R_m^(b) and R_n^(b) have the common divisor R_d^(b) in any base-b for any m and n. That is, the repunits of a fixed base form a strong divisibility sequence. As a consequence, If m and n are relatively prime, R_m^(b) and R_n^(b) are relatively prime. The Euclidean Algorithm is based on gcd(m, n) = gcd(m − n, n) for m > n. Similarly, using R_m^(b) − R_n^(b) × b^m−n = R_m−n^(b), it can be easily shown that gcd(R_m^(b), R_n^(b)) = gcd(R_m−n^(b), R_n^(b)) for m > n. Therefore, if gcd(m, n) = d, then gcd(R_m^(b), R_n^(b)) = R_d^(b).

Factorization of decimal repunits

(Prime factors colored means "new factors", i. e. the prime factor divides R_n but does not divide R_k for all k < n) ^[1]

R1 = 1 R2 = R3 = · R4 = 11 · R5 = · R6 = 3 · · 11 · · 37 R7 = · R8 = 11 · · 101 · R9 = 3^2 · 37 · R10 = 11 · 41 · 271 ·

R11 = · R12 = 3 · 7 · 11 · 13 · 37 · 101 · R13 = · · R14 = 11 · 239 · 4649 · R15 = 3 · · 37 · 41 · 271 · R16 = 11 · · 73 · 101 · 137 · R17 = · R18 = 3^2 · 7 · 11 · 13 · · 37 · · 333667 R19 = R20 = 11 · 41 · 101 · 271 · · 9091 ·

R21 = 3 · 37 · · 239 · · 4649 · R22 = 11^2 · · · · 21649 · 513239 R23 = R24 = 3 · 7 · 11 · 13 · 37 · 73 · 101 · 137 · 9901 · R25 = 41 · 271 · · · R26 = 11 · 53 · 79 · · 265371653 · R27 = 3^3 · 37 · · 333667 · R28 = 11 · · 101 · 239 · · 4649 · 909091 · R29 = · · · · R30 = 3 · 7 · 11 · 13 · 31 · 37 · 41 · · · 271 · · 9091 · 2906161

Smallest prime factor of R_n for n > 1 are

11, 3, 11, 41, 3, 239, 11, 3, 11, 21649, 3, 53, 11, 3, 11, 2071723, 3, 1111111111111111111, 11, 3, 11, 11111111111111111111111, 3, 41, 11, 3, 11, 3191, 3, 2791, 11, 3, 11, 41, 3, 2028119, 11, 3, 11, 83, 3, 173, 11, 3, 11, 35121409, 3, 239, 11, ...

Repunit primes

See main article: List of repunit primes.

The definition of repunits was motivated by recreational mathematicians looking for prime factors of such numbers.

It is easy to show that if n is divisible by a, then R_n^(b) is divisible by R_a^(b):

R ^{(b)} _{n} = (1)/(b -1) \prod _{d|n} \Phi _{d(b),}

where

\Phi _{d(x)} is the d ^{th} cyclotomic polynomial and d ranges over the divisors of n. For p prime,\Phi _{p(x)=\sum} ^{p -1} ^{i =0} x ^{i,}

which has the expected form of a repunit when x is substituted with b.

For example, 9 is divisible by 3, and thus R₉ is divisible by R₃ - in fact, 111111111 = 111 · 1001001. The corresponding cyclotomic polynomials

\Phi _{3(x)} and \Phi _{9(x)} are x ^{2+x+1} and x ^{6+x} ^{3+1} , respectively. Thus, for R_n to be prime, n must necessarily be prime, but it is not sufficient for n to be prime. For example, R₃ = 111 = 3 · 37 is not prime. Except for this case of R₃, p can only divide R_n for prime n if p = 2kn + 1 for some k.

Decimal repunit primes

R_n is prime for n = 2, 19, 23, 317, 1031, 49081, 86453 ... (sequence A004023 in OEIS). On April 3, 2007 Harvey Dubner (who also found R₄₉₀₈₁) announced that R₁₀₉₂₉₇ is a probable prime.^[2] On July 15, 2007, Maksym Voznyy announced R₂₇₀₃₄₃ to be probably prime.^[3] Serge Batalov and Ryan Propper found R_5794777 and R_8177207 to be probable primes on April 20 and May 8, 2021, respectively.^[4] As of their discovery each was the largest known probable prime. On March 22, 2022 probable prime R₄₉₀₈₁ was eventually proven to be a prime.^[5] On May 15, 2023 probable prime R₈₆₄₅₃ was eventually proven to be a prime.^[6]

It has been conjectured that there are infinitely many repunit primes^[7] and they seem to occur roughly as often as the prime number theorem would predict: the exponent of the Nth repunit prime is generally around a fixed multiple of the exponent of the (N−1)th.

The prime repunits are a trivial subset of the permutable primes, i.e., primes that remain prime after any permutation of their digits.

Particular properties are

• The remainder of R_n modulo 3 is equal to the remainder of n modulo 3. Using 10^a ≡ 1 (mod 3) for any a ≥ 0,
  n ≡ 0 (mod 3) ⇔ R_n ≡ 0 (mod 3) ⇔ R_n ≡ 0 (mod R₃),
  n ≡ 1 (mod 3) ⇔ R_n ≡ 1 (mod 3) ⇔ R_n ≡ R₁ ≡ 1 (mod R₃),
  n ≡ 2 (mod 3) ⇔ R_n ≡ 2 (mod 3) ⇔ R_n ≡ R₂ ≡ 11 (mod R₃).
  Therefore, 3 | n ⇔ 3 | R_n ⇔ R₃ | R_n.
• The remainder of R_n modulo 9 is equal to the remainder of n modulo 9. Using 10^a ≡ 1 (mod 9) for any a ≥ 0,
  n ≡ r (mod 9) ⇔ R_n ≡ r (mod 9) ⇔ R_n ≡ R_r (mod R₉),
  for 0 ≤ r < 9.
  Therefore, 9 | n ⇔ 9 | R_n ⇔ R₉ | R_n.

Algebra factorization of generalized repunit numbers

If b is a perfect power (can be written as mⁿ, with m, n integers, n > 1) differs from 1, then there is at most one repunit in base-b. If n is a prime power (can be written as p^r, with p prime, r integer, p, r >0), then all repunit in base-b are not prime aside from R_p and R₂. R_p can be either prime or composite, the former examples, b = −216, −128, 4, 8, 16, 27, 36, 100, 128, 256, etc., the latter examples, b = −243, −125, −64, −32, −27, −8, 9, 25, 32, 49, 81, 121, 125, 144, 169, 196, 216, 225, 243, 289, etc., and R₂ can be prime (when p differs from 2) only if b is negative, a power of −2, for example, b = −8, −32, −128, −8192, etc., in fact, the R₂ can also be composite, for example, b = −512, −2048, −32768, etc. If n is not a prime power, then no base-b repunit prime exists, for example, b = 64, 729 (with n = 6), b = 1024 (with n = 10), and b = −1 or 0 (with n any natural number). Another special situation is b = −4k⁴, with k positive integer, which has the aurifeuillean factorization, for example, b = −4 (with k = 1, then R₂ and R₃ are primes), and b = −64, −324, −1024, −2500, −5184, ... (with k = 2, 3, 4, 5, 6, ...), then no base-b repunit prime exists. It is also conjectured that when b is neither a perfect power nor −4k⁴ with k positive integer, then there are infinity many base-b repunit primes.

The generalized repunit conjecture

A conjecture related to the generalized repunit primes:^{[8] [9]} (the conjecture predicts where is the next generalized Mersenne prime, if the conjecture is true, then there are infinitely many repunit primes for all bases

b )

For any integer

b , which satisfies the conditions:|b|> 1 .b is not a perfect power. (since when b is a perfect r th power, it can be shown that there is at most one n value such that (b ^{n-1})/(b -1) is prime, and this n value is r itself or a root of r )b is not in the form -4 k ^{4} . (if so, then the number has aurifeuillean factorization)

has generalized repunit primes of the form

R _{p(b) = (b ^{p-1})/(b -1)}

for prime

p , the prime numbers will be distributed near the best fit lineY = G ⋅ log _{|b|} \left( log _{|b|} \left( R _{(b)} (n) \right) \right) + C,

where limit

n → inf ty , G = (1)/(e ^{\gamma}) =0 . 561459483566 ...

and there are about

\left( log _{e(N)+m} ⋅ log _{e(2)} ⋅ log _{e} ( log _{e(N)} ) + (1)/(\sqrt N) - \delta \right) ⋅ (e ^{\gamma})/(log _{e(|b|)})

base-b repunit primes less than N.

e is the base of natural logarithm.\gamma is Euler–Mascheroni constant.log _{|b|} is the logarithm in base |b| R _{(b)} (n) is the n th generalized repunit prime in baseb (with prime p)C is a data fit constant which varies with b .\delta =1 if b> 0 , \delta =1 . 6 if b< 0 .m is the largest natural number such that - b is a 2 ^{m-1} th power.

We also have the following 3 properties:

1. The number of prime numbers of the form

(b ^{n-1})/(b -1) (with prime p ) less than or equal to n is about e ^{\gamma} ⋅ log _{|b|} ( log _{|b|} (n) ) .

1. The expected number of prime numbers of the form

(b ^{n-1})/(b -1) with prime p between n and |b| ⋅ n is about e ^{\gamma} .

1. The probability that number of the form

(b ^{n-1})/(b -1) is prime (for prime p ) is about (e ^{\gamma})/(p ⋅ log _{e(|b|)}) .

History

Although they were not then known by that name, repunits in base-10 were studied by many mathematicians during the nineteenth century in an effort to work out and predict the cyclic patterns of repeating decimals.

It was found very early on that for any prime p greater than 5, the period of the decimal expansion of 1/p is equal to the length of the smallest repunit number that is divisible by p. Tables of the period of reciprocal of primes up to 60,000 had been published by 1860 and permitted the factorization by such mathematicians as Reuschle of all repunits up to R₁₆ and many larger ones. By 1880, even R₁₇ to R₃₆ had been factored and it is curious that, though Édouard Lucas showed no prime below three million had period nineteen, there was no attempt to test any repunit for primality until early in the twentieth century. The American mathematician Oscar Hoppe proved R₁₉ to be prime in 1916 and Lehmer and Kraitchik independently found R₂₃ to be prime in 1929.

Further advances in the study of repunits did not occur until the 1960s, when computers allowed many new factors of repunits to be found and the gaps in earlier tables of prime periods corrected. R₃₁₇ was found to be a probable prime circa 1966 and was proved prime eleven years later, when R₁₀₃₁ was shown to be the only further possible prime repunit with fewer than ten thousand digits. It was proven prime in 1986, but searches for further prime repunits in the following decade consistently failed. However, there was a major side-development in the field of generalized repunits, which produced a large number of new primes and probable primes.

Since 1999, four further probably prime repunits have been found, but it is unlikely that any of them will be proven prime in the foreseeable future because of their huge size.

The Cunningham project endeavours to document the integer factorizations of (among other numbers) the repunits to base 2, 3, 5, 6, 7, 10, 11, and 12.

Demlo numbers

D. R. Kaprekar has defined Demlo numbers as concatenation of a left, middle and right part, where the left and right part must be of the same length (up to a possible leading zero to the left) and must add up to a repdigit number, and the middle part may contain any additional number of this repeated digit.^[10] They are named after Demlo railway station (now called Dombivili) 30 miles from Bombay on the then G.I.P. Railway, where Kaprekar started investigating them.He calls Wonderful Demlo numbers those of the form 1, 121, 12321, 1234321, ..., 12345678987654321. The fact that these are the squares of the repunits has led some authors to call Demlo numbers the infinite sequence of these, 1, 121, 12321, ..., 12345678987654321, 1234567900987654321, 123456790120987654321, ...,, although one can check these are not Demlo numbers for p = 10, 19, 28, ...

See also

• All one polynomial — Another generalization
• Goormaghtigh conjecture
• Repeating decimal
• Repdigit

b = -2

Footnotes

References

External links

• • The main tables of the Cunningham project.
• Repunit at The Prime Pages by Chris Caldwell.
• Repunits and their prime factors at World!Of Numbers.
• Prime generalized repunits of at least 1000 decimal digits by Andy Steward
• Repunit Primes Project Giovanni Di Maria's repunit primes page.
• Smallest odd prime p such that (b^p-1)/(b-1) and (b^p+1)/(b+1) is prime for bases 2<=b<=1024
• Factorization of repunit numbers
• Generalized repunit primes in base -50 to 50

Notes and References

1. For more information, see Factorization of repunit numbers.
2. Harvey Dubner, New Repunit R(109297)
3. Maksym Voznyy, New PRP Repunit R(270343)
4. Indices of prime repunits: numbers n such that 11...111 (with n 1's) = (10^n - 1)/9 is prime..
5. Web site: PrimePage Primes: R(49081) . 2022-03-21 . PrimePage Primes . 2022-03-31.
6. Web site: PrimePage Primes: R(86453) . 2023-05-16 . PrimePage Primes . 2023-05-16.
7. Web site: Chris Caldwell . repunit . The Prime Glossary . Prime Pages.
8. http://primes.utm.edu/mersenne/heuristic.html Deriving the Wagstaff Mersenne Conjecture
9. https://listserv.nodak.edu/cgi-bin/wa.exe?A2=ind0906&L=NMBRTHRY&P=R295&1=NMBRTHRY&9=A&J=on&d=No+Match%3BMatch%3BMatches&z=4 Generalized Repunit Conjecture
10. ,