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

Find the number of ordered pairs of integers (x,y)(x, y)(x,y) such that 0<x,y≤1000 < x, y \le 1000<x,y≤100 and gcd(x,100)=gcd(y,100)=1\text{gcd}(x, 100) = \text{gcd}(y, 100) = 1gcd(x,100)=gcd(y,100)=1.