If S is a subset of {1,2,...,n} having size 2n+1 prove S contains 3 consecutive numbers. Show that this is best possible by exhibiting a set of size 2n for which the conclusion is false.
I think I'm going to be using pigeonhole principle (placing more than kn objects in n classes puts more than k objects into some class.) which means i'll have to partition the objects into classes???? oh boy.
2007-04-22
04:42:27
·
4 answers
·
asked by
ClooneyIsAGenius
2
in
Science & Mathematics
➔ Mathematics
Apologies... Let S be a subset of {1,2,...,3n} having size 2n+1...
2007-04-22
05:00:14 ·
update #1