Divisibilityhard
0:00.0
An integer is called 'nearly-prime' if it is composite, and for any two of its proper divisors (divisors other than and ), we have . How many such integers exist?
An integer is called 'nearly-prime' if it is composite, and for any two of its proper divisors (divisors other than and ), we have . How many such integers exist?