Prime Factorization without Using Any Approximations

This paper proposes a factorization algorithm based on number theory that gets the exact prime factorization without any approximations and the time complexity of the proposed method is less because there is no recursive steps in this proposed algorithm.