SP21615 NAJPWG - Playing with GCD

Tanmoy recently learn about euclid gcd algorithm. This algorithm looks like: gcd(a,b): if(b==0):return a return gcd(b,a%b) Now he want to find out how many pair (x,y) can be possible in range N, which gcd is greater than 1. Here pair (x,y) and (y,x) consider as same pair. 1

N/A

N/A