Skip to search formSkip to main contentSkip to account menu

Proth's theorem

Known as: Proth theorem, Proth's number 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Las Vegas algorithmLucas–Lehmer–Riesel testMonte Carlo algorithmPrimality test

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Gaussian Mersenne and Eisenstein Mersenne primes
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous… 
2007
2007
Relevance for T Cell-Mediated Hepatitis Production by Invariant NKT Cells : The ProTh 1 Cytokine IL-12 Enhances IL-4 Schneider and
2006
2006
A polynomial algorithm for a bi-criteria cyclic scheduling problem.
The minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short WTEG) under throughput constraint is a… 
Review
2005
Review
2005
Sensor based monitoring of surface quality in grinding process
Application of Polyacrylamide to Enhance Silt Fence Performance Jeyarathan Arjunan, Sandeep Yeri, Dr. Ellen W. Stevens, Dr. Bill… 
1992
1992
A generalization of proth's theorem
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gaus sums leads to a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)