Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Divisibilityhard
0:00.0

An integer n>1n > 1n>1 is called 'nearly-prime' if it is composite, and for any two of its proper divisors d1,d2d_1, d_2d1​,d2​ (divisors other than 111 and nnn), we have gcd⁡(d1,d2)>1\gcd(d_1, d_2) > 1gcd(d1​,d2​)>1. How many such integers n≤50n \le 50n≤50 exist?