Guest Session: 1 Question Remaining. Create Account to save progress.
Login
GCD & LCMhard
0:00.0

Find the smallest integer nnn such that gcd⁡(n,2)=1,gcd⁡(n,3)=1,gcd⁡(n,5)=1\gcd(n, 2)=1, \gcd(n, 3)=1, \gcd(n, 5)=1gcd(n,2)=1,gcd(n,3)=1,gcd(n,5)=1 and n>30n > 30n>30.