Download PDFOpen PDF in browserCurrent versionInteger Factorization Is Not in P: Logical ProofEasyChair Preprint 12579, version 14 pages•Date: March 18, 2024AbstractIn this research paper, the problem of testing whether a given integer is Highly Composite Number is formulated. Using Ramanujan's Theorem, it is reasoned that the unique factorization of Highly Composite Number cannot be performed using a polynomial time algorithm. Since the class of Highly Composite Numbers is countably infinite, integer factorization is NOT in class P. Keyphrases: Highly Composite Numbers, polynomial-time algorithm, prime numbers, unique factorization
|