Question

what is a Prime factorization method?

Answer 1

Unsolved problem in computer science: Can integer factorization be solved in polynomial time on a classical computer? In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers.

Answer 2

Unsolved problem in computer science: Can integer factorization be solved in polynomial time on a classical computer? In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers.