Clever Geek Handbook
📜 ⬆️ ⬇️

Unique simple

In number theory, a unique prime number is a certain kind of prime number . A prime p ≠ 2, 5 is called unique if there is no other prime q such that the length of the decomposition period into the decimal fraction of the reciprocal , 1 / p , is equal to the length of the period 1 / q . Unique primitives were first described by Samuel Yates in 1980.

It can be shown that a prime p is unique with period n if and only if there exists a positive integer c such that

Φn(ten)gcd(Φn(ten),n)=pc{\ displaystyle {\ frac {\ Phi _ {n} (10)} {\ gcd (\ Phi _ {n} (10), n)}} = p ^ {c}} {\ displaystyle {\ frac {\ Phi _ {n} (10)} {\ gcd (\ Phi _ {n} (10), n)}} = p ^ {c}} ,

where Φ n ( x ) is the nth circular polynomial . Currently, more than fifty unique simple or possibly simple are known. However, only twenty three unique primes less than 10,100 are known. The table below shows 23 unique primes less than 10 100 (sequence A040017 in OEIS ) and their periods (sequence A051627 in OEIS ):

Period lengthSimple
one3
2eleven
337
four101
ten9,091
129,901
9333,667
14909,091
2499,990,001
36999,999,000,001
489,999,999,900,000,001
38909,090,909,090,909,091
nineteen1,111,111,111,111,111,111
2311,111,111,111,111,111,111,111
39900,900,900,900,990,990,990,991
62909,090,909,090,909,090,909,090,909,091
120100,009,999,999,899,989,999,000,000,010,001
15010,000,099,999,999,989,999,899,999,000,000,000,100,001
1069,090,909,090,909,090,909,090,909,090,909,090,909,090,909,090,909,091
93900,900,900,900,900,900,900,900,900,900,990,990,990,990,990,990,990,990,990,991
134909,090,909,090,909,090,909,090,909,090,909,090,909,090,909,090,909,090,909,090,909,091
294142,857,157,142,857,142,856,999,999,985,714,285,714,285,857,142,857,142,855,714,285,571,428,571,428,572,857,143
196999,999,999,999,990,000,000,000,000,099,999,999,999,999,000,000,000,000,000,009,999,999,999,999,900,000,000,000,000.001

A prime with a period of 294 is similar to the inverse of 7 (0.142857142857142857 ...)

The twenty-fourth unique prime not shown in the table contains 128 characters and a period of length 320. It can be written as (9 32 0 32 ) 2 + 1, where index n means n consecutive copies of the digit or group of digits before the index.

Although unique primes are rare, there is a hypothesis of an infinite number of unique primes based on the study of simple single-digit primes (any simple reunite is unique).

For 2010, the reunite (10 270343 -1) / 9 is the largest known possibly unique prime number. [one]

In 1996, the largest tested unique prime was (10 1132 + 1) / 10001, or, using the record used above, (99990000) 141 + 1. Its period is 2264. The record has since been improved several times since. By 2010, the largest verified unique prime number was 10,081 characters. [2]

Links

  • The Prime Glossary: ​​Unique prime
  • Prime top tens
  • Unique Period Primes
  • Factorization of 11 ... 11 (Repunit)

Notes

  1. ↑ PRP Records: Probable Primes Top 10000
  2. ↑ The Top Twenty Unique ; Chris caldwell
Source - https://ru.wikipedia.org/w/index.php?title=Unique_simple&oldid=83284996


More articles:

  • Watson, CJ
  • Shcherbatov, Osip Ivanovich
  • First Division World Ice Hockey Championships 2013 junior teams (women)
  • War Cemetery № 3 (Ojenna)
  • Eucalyptus nitida
  • Italian languages ​​- Wikipedia
  • Brown Charles John
  • Krivodanovka (village)
  • Jeruse, Eugene
  • Safonovsky Local History Museum

All articles

Clever Geek | 2019