I need to prove this and find a group without three consecutive numbers. I've tried to come with a solution by pigeonhole principle, but I think I am not close to that. I having a hard time to provide a combinatorial solution and declaring what is the pigeonholes and what is the pigeon number. Help please.
Prove that each subgroup of size $68$ of $\{100, \ldots, 2, 1\}$ has three consecutive numbers. Find a subgroup of size $67$ that does not have three consecutive numbers.
It seems pretty obvious that the best you can do to get as many numbers without getting three consecutive numbers is to pick $1,2,4,5,7,8,10,11,$ etc. This ends with $97,98,100$, which gives a total of $67$ numbers. You could also end with $97,99,100$, and in fact you can ‘shift’ numbers in quite a few ways, so there are many solutions with $67$ numbers
Now, why exactly can't you add one more number and get to $68$? Well, consider that the sequence as indicated has exactly $2$ numbers out of every consecutive $3$ ... So, that's really the maximum you can get.