×
Suggest this Article to:
TOP INDEXERS
Public Paper
-
Efficient Simple Tests for Primality
ISSN: en
Publisher: author
Efficient Simple Tests for Primality
View Paper PDF
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. Two main such   algorithms are given in TEST-4- and TEST-5-.Keywords: Algorithm, Composite, Divisibility, Generating Function, Greatest Common Divisor, Infinite Descent, Prime, Quotient, Remainder, Solving Polynomial Equation, Square.Subj. Class: Number Theory, General Mathematics
SUBMIT CONCEPT ASK QUESTION
International Category Code (ICC):
ICC-0202
Fayez Fok Al Adeh
International Article Address (IAA):
IAA.ZONE/en8274en
Paper Profile:
Private
Visitors: 0
Paper Evaluation: Pending
ASI-Factor: 0
Paper Improving: Pending
Paper Flaws: 0
References
No citation was entered yet.
