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… (More)
Wikipedia

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… (More)
Is this relevant?
2015
2015
Nowadays, public-key cryptography is widely used to ensure data protection (privacy, integrity, authentication). Public-key… (More)
  • figure 1
  • figure 3
  • figure 2
  • table I
  • table II
Is this relevant?
2008
2008
Leading-edge companies require flexible, reliable and robust systems with capabilities to adapt quickly to changes and/or… (More)
Is this relevant?
Review
2005
Review
2005
Application of Polyacrylamide to Enhance Silt Fence Performance Jeyarathan Arjunan, Sandeep Yeri, Dr. Ellen W. Stevens, Dr. Bill… (More)
Is this relevant?
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… (More)
Is this relevant?
1992
1992
Using third roots of unity Proth's theorem for primality testing is generalized to integers of the formN=k3n+1, avoiding the use… (More)
Is this relevant?
1990
1990
663777 • 27650 ± 1 , 571305 • 27701 ± 1 and 1706595 • 211235 ± 1 are twin primes. A search for large twin prime pairs of the form… (More)
Is this relevant?