Indexing
All Issues
Submission
Author Guidelines
Reviewers
Editorial Members
Publication Fee
Vol.1 , No. 2, Publication Date: Sep. 24, 2016, Page: 79-88
| [1] | Fayez Fok Al Adeh, President of the Syrian Cosmological Society, Damascus, Syria. |
The tests form ageneral 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.
Keywords
Algorithm, Composite, Generating Function, Greatest Common Divisor, Prime, Quotient, Remainder, Solving Polynomial Equation, Square
Reference
| [01] | Aigner, Martin; Ziegler, Gunter M. (2002) "Proofs from The Book", New York; Springer – Verlag. |
| [02] | Ribenboim, Paulo (1988) "The Book of Prime Number Records", New York; Sprintger. |
| [03] | Wilf, Herbert S. (1994) "Generatingfunctionology", London; Academic Press. |
| [04] | Dickson, Leonard Eugene (1922) “First Course in The Theory of Equations”, New York; John Wiley. |
| [05] | Schroeder, M. R. (1986) "Number Theory in Science and Communication", New York; Springer – Verlag. |
| [06] | Rader, Robert J. (1978) "Advanced Software Design Techniques", Princeton; Petrocelli Books, Inc. |
| [07] | Koblitz, Neal (1987) "A Course in Number Theory and Cryptography", New York; Springer – Verlag. |
| [08] | Guy, Richard K. (1994) "Unsolved Problems in Number Theory", New York; Springer – Verlag. |
| [09] | Govindarajan, Sathish; Maheshwan, Anil, Editors, (2016) "Alogorithms and Discrete Applied Mathematics", New York; Springer – Verlag. |
| [10] | Moreno, Carlos J.; Wagstaff, Samuel S. Jr. (2005), "Sums of Squares of Integers", CRC Press. |
