Efficient Simple Tests For Primality

Fayez Fok Al Adeh

doi:10.24297/jam.v9i5.2337

Efficient Simple Tests For Primality

Authors

Fayez Fok Al Adeh President of the Syrian Cosmological Society P.O.Box:13187,Damascus,Syria

DOI:

https://doi.org/10.24297/jam.v9i5.2337

Keywords:

Algorithm, Composite, Generating Function, Greatest Common Divisor, Prime, Quotient, Remainder, Solving Polynomial Equatio, Square

Abstract

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

How to Cite

Adeh, F. F. A. (2014). Efficient Simple Tests For Primality. JOURNAL OF ADVANCES IN MATHEMATICS, 9(5), 2574–2607. https://doi.org/10.24297/jam.v9i5.2337