Reciprocals of primes

Template:Short description 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.

Like 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 Template:Mvar, the period of its reciprocal divides Template:Math.

The sequence of recurrence periods of the reciprocal primes Template: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.Template:Overline
5	0	0.2
7	* 6	0.Template:Overline
11	† 2	0.Template:Overline
13	6	0.Template:Overline
17	* 16	0.Template:Overline
19	* 18	0.Template:Overline
23	* 22	0.Template:Overline
29	* 28	0.Template:Overline
31	15	0.Template:Overline
37	† 3	0.Template:Overline
41	5	0.Template:Overline
43	21	0.Template:Overline
47	* 46	0.Template:Overline
53	13	0.Template:Overline
59	* 58	0.Template:Overline
61	* 60	0.Template:Overline
67	33	0.Template:Overline
71	35	0.Template:Overline
73	8	0.Template:Overline
79	13	0.Template:Overline
83	41	0.Template:Overline
89	44	0.Template:Overline
97	* 96	0.Template:Overline
101	† 4	0.Template:Overline
103	34	0.Template:Overline
107	53	0.Template:Overline
109	* 108	0.Template:Overline
113	* 112	0.Template:Overline
127	42	0.Template:Overline

* Full reptend primes are italicised.
† Unique primes are highlighted.

Full reptend primes

Template:Main A full reptend prime, full repetend prime, proper primeTemplate:Rp or long prime in base b is an odd prime number p such that the Fermat quotient

$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$ repeats the digits of the corresponding cyclic number infinitely.

Unique primes

Template:Anchor 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

$\frac{{\mathrm{\Phi }}_n(10)}{\gcd ({\mathrm{\Phi }}_n(10),n)}$

is a power of p, where ${\mathrm{\Phi }}_n(b)$ denotes the $n$th cyclotomic polynomial evaluated at $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 10¹⁰⁰.

The decimal unique primes are

3, 11, 37, 101, 9091, 9901, 333667, 909091, ... Template:OEIS.

External links

• Template:Cite web