Hi,

For any a, b >= 0, how can one find the number of positive integers whichbe expressed as ax + by where gcd(x,y) = 1 and x,y > 1cannot

E.g for x,y = 3,4 the number of such integers is 3

I think that extended euledian algorithm can be used here but am not sure how.

Thanks.