• P = NP, IN THE FACTORIZATION OF ALL ODD NUMBERS
Abstract
This article demonstrate that the problem P = NP in the factorization of odd numbers because it solves the primary problem. Having "(N ) in finite time. (ord(a) Î Z).
Keywords
prime number; multiplication between odd numbers; odd number power; equations, algorithm.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |