Efficient Simple Tests For Primality
DOI:
https://doi.org/10.24297/jam.v9i5.2337Keywords:
Algorithm, Composite, Generating Function, Greatest Common Divisor, Prime, Quotient, Remainder, Solving Polynomial Equatio, SquareAbstract
The tests form a general method to decide whether a given positive odd integer is composite or prime. The tests are based on the divisibility properties of the sum of two squared positive integers. The algorithms comprising the tests are polynomial- time algorithms.
Downloads
Download data is not yet available.
Downloads
Published
2014-11-14
Issue
Section
Articles
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.
How to Cite
Efficient Simple Tests For Primality. (2014). JOURNAL OF ADVANCES IN MATHEMATICS, 9(5), 2574-2607. https://doi.org/10.24297/jam.v9i5.2337
