Reciprocals of primes
In-game article clicks load inline without leaving the challenge.
The reciprocals of prime numbers have been of interest to mathematicians for various reasons. They do not have a finite sum, as Leonhard Euler proved in 1737.
As rational numbers, the reciprocals of primes have repeating decimal representations. In his later years, George Salmon (1819–1904) concerned himself with the repeating periods of these decimal representations of reciprocals of primes.
Contemporaneously, William Shanks (1812–1882) calculated numerous reciprocals of primes and their repeating periods, and published two papers "On Periods in the Reciprocals of Primes" in 1873 and 1874. In 1874 he also published a table of primes, and the periods of their reciprocals, up to 20,000 (with help from and "communicated by the Rev. George Salmon"), and pointed out the errors in previous tables by three other authors.
Rules for calculating the periods of repeating decimals from rational fractions were given by James Whitbread Lee Glaisher in 1878. For a prime p, the period of its reciprocal divides p − 1.
The sequence of recurrence periods of the reciprocal primes (sequence A002371 in the OEIS) appears in the 1973 Handbook of Integer Sequences.
List of reciprocals of primes
| Prime (p) | Period length | Reciprocal (1/p) |
|---|---|---|
| 2 | 0 | 0.5 |
| 3 | † 1 | 0.3 |
| 5 | 0 | 0.2 |
| 7 | * 6 | 0.142857 |
| 11 | † 2 | 0.09 |
| 13 | 6 | 0.076923 |
| 17 | * 16 | 0.0588235294117647 |
| 19 | * 18 | 0.052631578947368421 |
| 23 | * 22 | 0.0434782608695652173913 |
| 29 | * 28 | 0.0344827586206896551724137931 |
| 31 | 15 | 0.032258064516129 |
| 37 | † 3 | 0.027 |
| 41 | 5 | 0.02439 |
| 43 | 21 | 0.023255813953488372093 |
| 47 | * 46 | 0.0212765957446808510638297872340425531914893617 |
| 53 | 13 | 0.0188679245283 |
| 59 | * 58 | 0.0169491525423728813559322033898305084745762711864406779661 |
| 61 | * 60 | 0.016393442622950819672131147540983606557377049180327868852459 |
| 67 | 33 | 0.014925373134328358208955223880597 |
| 71 | 35 | 0.01408450704225352112676056338028169 |
| 73 | 8 | 0.01369863 |
| 79 | 13 | 0.0126582278481 |
| 83 | 41 | 0.01204819277108433734939759036144578313253 |
| 89 | 44 | 0.01123595505617977528089887640449438202247191 |
| 97 | * 96 | 0.010309278350515463917525773195876288659793814432989690721649484536082474226804123711340206185567 |
| 101 | † 4 | 0.0099 |
| 103 | 34 | 0.0097087378640776699029126213592233 |
| 107 | 53 | 0.00934579439252336448598130841121495327102803738317757 |
| 109 | * 108 | 0.009174311926605504587155963302752293577981651376146788990825688073394495412844036697247706422018348623853211 |
| 113 | * 112 | 0.0088495575221238938053097345132743362831858407079646017699115044247787610619469026548672566371681415929203539823 |
| 127 | 42 | 0.007874015748031496062992125984251968503937 |
* Full reptend primes are italicised. † Unique primes are highlighted.
Full reptend primes
A full reptend prime, full repetend prime, proper prime or long prime in base b is an odd prime number p such that the Fermat quotient
q p ( b ) = b p − 1 − 1 p {\displaystyle q_{p}(b)={\frac {b^{p-1}-1}{p}}}
(where p does not divide b) gives a cyclic number with p − 1 digits. Therefore, the base b expansion of 1 / p {\displaystyle 1/p} repeats the digits of the corresponding cyclic number infinitely.
Unique primes
A prime p (where p ≠ 2, 5 when working in base 10) is called unique if there is no other prime q such that the period length of the decimal expansion of its reciprocal, 1/p, is equal to the period length of the reciprocal of q, 1/q. For example, 3 is the only prime with period 1, 11 is the only prime with period 2, 37 is the only prime with period 3, 101 is the only prime with period 4, so they are unique primes. The next larger unique prime is 9091 with period 10, though the next larger period is 9 (its prime being 333667). Unique primes were described by Samuel Yates in 1980. A prime number p is unique if and only if there exists an n such that
Φ n ( 10 ) gcd ( Φ n ( 10 ) , n ) {\displaystyle {\frac {\Phi _{n}(10)}{\gcd(\Phi _{n}(10),n)}}}
is a power of p, where Φ n ( b ) {\displaystyle \Phi _{n}(b)} denotes the n {\displaystyle n}th cyclotomic polynomial evaluated at b {\displaystyle b}. The value of n is then the period of the decimal expansion of 1/p.
At present, more than fifty decimal unique primes or probable primes are known. However, there are only twenty-three unique primes below 10100.
The decimal unique primes are
3, 11, 37, 101, 9091, 9901, 333667, 909091, ... (sequence A040017 in the OEIS).
External links
- Parker, Matt (March 14, 2022). . YouTube.