I was wondering if there is an algorithm to derive $p$ and $q$ or is it simply trial and error?
Consider the following RSA crypto-system with public key $(437,13)$. Since the numbers are so small, it is possible to break the crypto-system and determine the private key. What is the value of the two primes $p,\,q$ with $n=p\times q$ used in the key generation.
Hint: You may ignore the value $13$ in your computations.
The answer is $23$ and $19$ but I was wondering if there is an algorithm for it?