Efficient Simple Tests For Primality

Fayez Fok Al Adeh

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.


Full Text:

PDF

References


[ 1 ] Aigner, Martin; Ziegler, Gunter M. (2002)

"Proofs from The Book" ,New York ; Springer – Verlag.

[ 2 ] Ribenboim, Paulo (1988) "The Book of Prime Number Records " , New York; Sprintger.

[ 3 ] Wilf, Herbert S . (1994) " Generatingfunctionology", London; Academic Press.

[ 4 ] Dickson, Leonard Eugene (1922) " First Course in The Theory of Equations " , New York; John Wiley.

[ 5 ] Schroeder, M.R.(1986) " Number Theory in Science and Communication ", New York ; Springer – Verlag.

[ 6 ] Rader, Robert J.(1978) " Advanced Software Design Techniques" , Princeton; Petrocelli Books,Inc.

[ 7 ] Koblitz,Neal (1987) " A Course in Number Theory and Cryptography ", New York ; Springer – Verlag.

[ 8 ] Guy, Richard K.(1994) " Unsolved Problems in Number Theory" , New York ; Springer – Verlag.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Journal of Progressive Research in Mathematics

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright © 2016 Journal of Progressive Research in Mathematics. All rights reserved.

ISSN: 2395-0218.

For any help/support contact us at editorial@scitecresearch.com, jprmeditor@scitecresearch.com.