Cut the knot: learn to enjoy mathematics
A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Learning Math Online
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help

III Millennium Olympiad

Games & Puzzles
What Is What
Arithmetic/Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Games to relax

Sites for teachers
Sites for parents

Education & Parenting

Manifesto  |  Bookstore  |  Contents  |  Amazon store  |  Term index  |  What changed?  |  Contact  |  Recommend
RSS Feed: Recent changes at CTK

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.

123...bb+1b+2b+3...a+b
a+1a+2a+3...a+b123...a

There are a + b columns and each integer appears exactly twice in the array. Now, given more than half the integers in {1, 2, ..., a + b}, the given integers appear in the above array, counting multiplicity, more than a + b times. Hence their must be two occurrences of the given integers in the same column. Thus those occurrences differ by a or b.

The reason for the condition b < 2a is that you need only a little over a third of the integers if b = 2a. And the original proof still works if b > 2a.


Copyright © 1996-2009 Alexander Bogomolny

34221992Page copy protected against web site content infringement by Copyscape


Search:
Keywords:

Google
Web CTK