Is there a way to check whether an integer has exactly two prime factors(can be same) that is , it can be expressed as a product of two prime nos ?
EDIT: I dont want to find the factors i just want a formulae or an algo to check whether a certain no can be expressed as a product of two primes either true or false.
NOTE: The supposed existing answer doesn't answer this at all.