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

Find the smallest integer N>1N > 1N>1 such that GCD(N,105)=1\text{GCD}(N, 105) = 1GCD(N,105)=1 and GCD(N,70)=1\text{GCD}(N, 70) = 1GCD(N,70)=1.