GCD & LCMmedium
0:00.0

Find the smallest integer nn such that gcd(n,6)=1\text{gcd}(n, 6) = 1 and gcd(n,10)=1\text{gcd}(n, 10) = 1, with n>1n > 1.