| 词条 | François Proth |
| 释义 |
He stated four primality-related theorems.[2] The most famous of these, Proth's theorem, can be used to test whether a Proth number (a number of the form k2n + 1 with k odd and k < 2n) is prime. The numbers passing this test are called Proth primes; they continue to be of importance in the computational search for large prime numbers.[3] Proth also formulated Gilbreath's conjecture on successive differences of primes, 80 years prior to Gilbreath, but his proof of the conjecture turned out to be erroneous.[4] The cause of Proth's death is not known. Publications
References1. ^{{citation|title=Prime Numbers: The Most Mysterious Figures in Math|first=David|last=Wells|publisher=John Wiley & Sons|year=2011|isbn=9781118045718|page=189|url=https://books.google.com/books?id=1MTcYrbTdsUC&pg=PA189}}. {{authority control}}{{DEFAULTSORT:Proth, Francois}}{{france-mathematician-stub}}2. ^{{citation|title=An Introduction to Cryptography|series=Discrete Mathematics and Its Applications|first=Richard A.|last=Mollin|edition=2nd|publisher=CRC Press|year=2010|isbn=9781420011241|page=192|url=https://books.google.com/books?id=Vje8TRcLlycC&pg=PA192}}. 3. ^{{citation | last1 = Chaumont | first1 = Alain | last2 = Leicht | first2 = Johannes | last3 = Müller | first3 = Tom | last4 = Reinhart | first4 = Andreas | doi = 10.1142/S1793042109002031 | issue = 2 | journal = International Journal of Number Theory | mr = 2502805 | pages = 209–218 | title = The continuing search for large elite primes | volume = 5 | year = 2009}}. 4. ^{{Citation |first=Chris |last=Caldwell |url=http://primes.utm.edu/glossary/page.php?sort=GilbreathsConjecture |title=The Prime Glossary: Gilbreath's conjecture |work=The Prime Pages |accessdate= }}. 3 : 1852 births|1879 deaths|19th-century French mathematicians |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。