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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
This paper addresses the 0-1 outcome feature selection problem. In such a problem, a set of features leads to an outcome that is… 
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… 
2010
2010
The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous… 
2008
2008
Leading-edge companies require flexible, reliable and robust systems with capabilities to adapt quickly to changes and/or… 
2006
2006
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
Application of Polyacrylamide to Enhance Silt Fence Performance Jeyarathan Arjunan, Sandeep Yeri, Dr. Ellen W. Stevens, Dr. Bill… 
1992
1992
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gaus sums leads to a…