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.[1]
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[2] and 1874.[3] 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.[4]
Rules for calculating the periods of repeating decimals from rational fractions were given by James Whitbread Lee Glaisher in 1878.[5] For a prime p, the period of its reciprocal divides p − 1.[6]
The sequence of recurrence periods of the reciprocal primes (sequence A002371 in the OEIS) appears in the 1973 Handbook of Integer Sequences.
...there was one branch of calculation which had a great fascination for him. It was the determination of the number of figures in the recurring periods in the reciprocals of prime numbers.