World Library  
Flag as Inappropriate
Email this Article

Proth's theorem

Article Id: WHEBN0003225985
Reproduction Date:

Title: Proth's theorem  
Author: World Heritage Encyclopedia
Language: English
Subject: Lucas–Lehmer–Riesel test, Pépin's test, Fermat number, Seventeen or Bust, Proth number
Collection: Primality Tests, Theorems About Prime Numbers
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Proth's theorem

In number theory, Proth's theorem is a primality test for Proth numbers.

It states that if p is a Proth number, of the form k2n + 1 with k odd and k < 2n, and if there exists an integer a for which

a^{(p-1)/2}\equiv -1 \mod{p},

then p is prime. In this case p is called a Proth prime. This is a practical test because if p is prime, any chosen a has about a 50 percent chance of working.

If a is a quadratic nonresidue modulo p then the converse is also true, and the test is conclusive. Such an a may be found by iterating a over small primes and computing the Jacobi symbol until:

\left(\frac{a}{p}\right)=-1

Thus, in contrast to many Monte Carlo primality tests (randomized algorithms that can return a false positive), the primality testing algorithm based on Proth's theorem is a Las Vegas algorithm, always returning the correct answer but with a running time that varies randomly.

Contents

  • Numerical examples 1
  • History 2
  • See also 3
  • References 4
  • External links 5

Numerical examples

Examples of the theorem include:

  • for p = 3, 21 + 1 = 3 is divisible by 3, so 3 is prime.
  • for p = 5, 32 + 1 = 10 is divisible by 5, so 5 is prime.
  • for p = 13, 56 + 1 = 15626 is divisible by 13, so 13 is prime.
  • for p = 9, which is not prime, there is no a such that a4 + 1 is divisible by 9.

The first Proth primes are (sequence A080076 in OEIS):

3, 5, 13, 17, 41, 97, 113, 193, 241, 257, 353, 449, 577, 641, 673, 769, 929, 1153 ….

As of 2009, the largest known Proth prime is 19249 · 213018586 + 1, found by Seventeen or Bust. It has 3,918,990 digits and is the largest known prime which is not a Mersenne prime. [1]

History

François Proth (1852–1879) published the theorem around 1878.

See also

References

  1. ^ http://primes.utm.edu/top20/page.php?id=3

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.