MedVision ad

greatest common divisor (1 Viewer)

M

mamun11

New Member
Joined
Sep 10, 2014
Messages
9
Gender
Male
HSC
N/A
How many pairs of integers (A,B) are there in the range [1,…,N], such that gcd(A,B)=B? Here, N<=10^9.
I want to know the best efficient method to find out the number of pairs with proof .
 
You must log in or register to reply here.

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top