Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: number problem
Replies: 30   Last Post: Jul 3, 2013 12:08 AM

 Messages: [ Previous | Next ]
 Timothy Murphy Posts: 657 Registered: 12/18/07
Re: number problem
Posted: Jun 23, 2013 6:01 AM

mathguy wrote:

> Can anyone prove the following:
> let S be a set of distinct integers with the property that
> (a-b)^2 divides ab for distinct a,b in S.
> Show that the number of elements of S <= 5.
>
> for example , {0,2,4} is such a set. I've coded a program to show that
> it's true for n <= 20000 where n is largest element of S, which is
> far from a proof though.

I'd divide a and b by gcd(a,b),
and then consider a prime factor of a-b.

Date Subject Author
6/23/13 mathguy
6/23/13 Timothy Murphy
6/23/13 mathguy
6/24/13 Timothy Murphy
6/24/13 Virgil
6/23/13 quasi
6/23/13 mathguy
6/23/13 quasi
6/24/13 mathguy
6/24/13 mathguy
6/24/13 quasi
6/24/13 mathguy
6/24/13 Don Redmond
6/25/13 mathguy
6/25/13 quasi
6/26/13 mathguy
6/27/13 quasi
6/28/13 mathguy
6/28/13 Tucsondrew@me.com
6/28/13 Peter Percival
6/28/13 quasi
6/30/13 mathguy
6/30/13 Peter Percival
6/30/13 quasi
6/30/13 Bart Goddard
6/30/13 Virgil
7/2/13 mathguy
7/2/13 Bart Goddard
7/2/13 quasi
7/2/13 quasi
7/3/13 Bart Goddard