The Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 12
Registered: 6/23/13
number problem
Posted: Jun 23, 2013 3:14 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.