Given sigma(n)n, find the smallest possible n
For example, for large enough odd sigma(n)n, it's quite easy to find a possible n. It doesn't take long to find a prime p such that q=(sigma(n)n1p) is also prime and n=p*q is found.
The problem now is determining whether this is the smallest solution (mostly it isn't), and how efficiently can it be found?
