The question I asked arises in one attack of the following problem: Let S be a set of real numbers. Integer k >= 1 is a divider of S if a rational of reduced form j/k lies strictly between every two elements of S. The question is, is a divider of {0, 1/n, 1/(n-1), ..., 1}also a divider of the set { j/k | j, k in Z, 1 <= k <= n }. ----- Original Message ----- From: perry@globalnet.co.uk To: ham ; math-fun ; David Wilson Sent: Saturday, April 16, 2005 4:52 AM Subject: Re: [math-fun] coprime problem We could add to this: a,b,x,y are all pairwise coprime. Jon Perry perry@globalnet.co.uk On Sat, 16 Apr 2005 00:20 , David Wilson <davidwwilson@comcast.net> sent: 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? _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun ------------------------------------------------------------------------------ Message sent via Global Webmail - http://www.globalnet.co.uk/ Global MAX Broadband 2Mb now just £19.99 a month