Home > Numbers
Devilish Difference (Posted on 2005-08-22) |
|
Suppose you select 501 numbers from 1 to 1000, inclusive. Show that if no two of the selected numbers differ by 334, then some two of the selected numbers differ by 666.
|
Submitted by McWorter
|
No Rating
|
|
Solution:
|
(Hide)
|
Arrange the numbers in the 2 by 1000 array below.
1 2 ... 666 667 668 ... 1000
335 336 ... 1000 1 2 ... 334
Then each number from 1 to 1000 appears exactly twice in the array. So too do the 501 selected numbers. Hence there are 1002 appearances of selected numbers in the array. Thus some two such appearances occur in the same column (of the 1000 columns). All differences between numbers in the first 666 columns equal 334; whence two appearances of selected numbers must occur in the last 334 columns, where all differences equal 666. |
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|