[{"@context":"http:\/\/schema.org\/","@type":"BlogPosting","@id":"https:\/\/wiki.edu.vn\/en\/wiki43\/reciprocals-of-primes-wikipedia\/#BlogPosting","mainEntityOfPage":"https:\/\/wiki.edu.vn\/en\/wiki43\/reciprocals-of-primes-wikipedia\/","headline":"Reciprocals of primes – Wikipedia","name":"Reciprocals of primes – Wikipedia","description":"From Wikipedia, the free encyclopedia Sequence of numbers The reciprocals of prime numbers have been of interest to mathematicians for","datePublished":"2021-12-23","dateModified":"2021-12-23","author":{"@type":"Person","@id":"https:\/\/wiki.edu.vn\/en\/wiki43\/author\/lordneo\/#Person","name":"lordneo","url":"https:\/\/wiki.edu.vn\/en\/wiki43\/author\/lordneo\/","image":{"@type":"ImageObject","@id":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","height":96,"width":96}},"publisher":{"@type":"Organization","name":"Enzyklop\u00e4die","logo":{"@type":"ImageObject","@id":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","url":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","width":600,"height":60}},"image":{"@type":"ImageObject","@id":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/d\/d2\/Shanks%27s_table_of_primes_just_below_20000_and_their_decimal_periods.png\/700px-Shanks%27s_table_of_primes_just_below_20000_and_their_decimal_periods.png","url":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/thumb\/d\/d2\/Shanks%27s_table_of_primes_just_below_20000_and_their_decimal_periods.png\/700px-Shanks%27s_table_of_primes_just_below_20000_and_their_decimal_periods.png","height":"329","width":"700"},"url":"https:\/\/wiki.edu.vn\/en\/wiki43\/reciprocals-of-primes-wikipedia\/","wordCount":1939,"articleBody":"From Wikipedia, the free encyclopediaSequence of numbersThe 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 all rational numbers, the reciprocals of primes have repeating decimal representations.  In his later years, George Salmon (1819\u20131904) concerned himself with the repeating periods of these decimal representations of reciprocals of primes.[1]Contemporaneously, William Shanks (1812\u20131882) 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]The last part of Shanks’s 1874 table of primes and their repeating periods.  In the top row, 6952 should be 6592 (the error is easy to find, since the period for a prime p must divide p \u2212 1).  In his report extending the table to 30,000 in the same year, Shanks did not report this error, but reported that in the same column, opposite 19841, the 1984 should be 64. *Another error which may have been corrected since his work was published is opposite 19423, the reciprocal repeats every 6474 digits, not every 3237.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 will be equal to or will divide p \u2212 1.[6]The sequence of recurrence periods of the reciprocal primes (sequence A002371 in the OEIS) appears in the 1973 Handbook of Integer Sequences.Unique primes[edit]A prime p \u2260 2, 5 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.[7] 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. Unique primes were described by Samuel Yates in 1980.[8]At present, more than fifty unique primes or probable primes are known. However, there are only twenty-three unique primes below 10100.[citation needed]A040017 contains a list of unique primes and A007615 are those primes ordered by period length; A051627 contains periods (ordered by corresponding primes) and A007498 contains periods, sorted, corresponding with A007615.As of 2021[update] the repunit (108177207\u00a0\u2013\u00a01)\/9 is the largest known probable unique prime.[9]In 1996 the largest proven unique prime was (101132\u00a0+\u00a01)\/10001 or, using the notation above, (99990000)141\u00a0+\u00a01. It has 1128 digits.[citation needed] The record has been improved many times since then. As of 2021[update] the largest proven unique prime is \u03a611867(\u2212100){displaystyle Phi _{11867}(-100)}, it has 23732 digits. Here \u03a6n(b){displaystyle Phi _{n}(b)} denotes the n{displaystyle n}th cyclotomic polynomial evaluated at b{displaystyle b}.[10]References[edit]External links[edit]By formulaBy integer sequenceBy propertyBase-dependentPatternsTwin (p, p\u00a0+\u00a02)Bi-twin chain (n\u00a0\u00b1\u00a01, 2n\u00a0\u00b1\u00a01, 4n\u00a0\u00b1\u00a01, \u2026)Triplet (p, p\u00a0+\u00a02 or p\u00a0+\u00a04, p\u00a0+\u00a06)Quadruplet (p, p\u00a0+\u00a02, p\u00a0+\u00a06, p\u00a0+\u00a08)k-tupleCousin (p, p\u00a0+\u00a04)Sexy (p, p\u00a0+\u00a06)ChenSophie Germain\/Safe (p, 2p\u00a0+\u00a01)Cunningham (p, 2p\u00a0\u00b1\u00a01, 4p\u00a0\u00b1\u00a03, 8p\u00a0\u00b1\u00a07, …)Arithmetic progression (p\u00a0+\u00a0a\u00b7n, n\u00a0=\u00a00,\u00a01,\u00a02,\u00a03,\u00a0…)Balanced (consecutive p\u00a0\u2212\u00a0n, p, p\u00a0+\u00a0n)By sizeComplex numbersComposite numbersRelated topicsFirst 60 primes"},{"@context":"http:\/\/schema.org\/","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki43\/#breadcrumbitem","name":"Enzyklop\u00e4die"}},{"@type":"ListItem","position":2,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki43\/reciprocals-of-primes-wikipedia\/#breadcrumbitem","name":"Reciprocals of primes – Wikipedia"}}]}]