[math-fun] coprime problem
15 Apr
2005
15 Apr
'05
10:14 p.m.
Let a, b >= 1, gcd(a, b) = 1. It is not difficult to show that every sufficiently large integer is of the form ax+by where x, y >= 1. Is the same true with the added condition gcd(x, y) = 1?
7524
Age (days ago)
7524
Last active (days ago)
0 comments
1 participants
participants (1)
-
David Wilson