Let a and b be positive integers, with a < b < 2a. Then, given more than half of the integers in the set {1, 2, ..., a + b}, some two of the given integers differ by a or by b.

|Contact| |Front page| |Contents| |Up| |Store|

Copyright © 1996-2017 Alexander Bogomolny
Let a and b be positive integers, with a < b < 2a. Then, given more than half of the integers in the set {1, 2, ..., a + b}, some two of the given integers differ by a or by b.

The proof is by William A McWorter Jr.

Form the array below.

1 | 2 | 3 | ... | b | b+1 | b+2 | b+3 | ... | a+b |

a+1 | a+2 | a+3 | ... | a+b | 1 | 2 | 3 | ... | a |

There are a + b columns and each integer appears exactly twice in the array. Now, given more than half the integers in

The reason for the condition b < 2a is that you need only a little over a third of the integers if

|Contact| |Front page| |Contents| |Up| |Store|

Copyright © 1996-2017 Alexander Bogomolny62103929 |