Guaranteeing consecutive numbers
Prove the minimum selection using five groups and a five-number counterexample.
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- 从一到九里选不同整数,要保证出现相差一的一对。先把“保证”理解为不管怎样选都一定发生。
- 把数字分成一二、三四、五六、七八四个相邻数对,再把九单独放一组,一共五组。
- 如果选六个数,六个选择放进五组,至少有一组会同时选中两个数;双数格里的两个数正好相差一。
- 为什么五个不够?可以选一、三、五、七、九,这五个数任意两个都不相差一。
- 所以选五个仍可能失败,选六个一定成功;能保证的最少个数是六。
- 证明最少值要做两件事:说明六个一定成功,还要给出五个失败的具体选法。
Sources for this explanation
Logical thinking
Group 1–9 into four consecutive pairs and one singleton, then show five choices can still fail.
Worked example
Choose distinct integers from 1 to 9. What minimum number guarantees that two differ by 1?
Six choices guarantee two numbers from one paired group. Five do not: 1, 3, 5, 7, 9 contain no consecutive pair.
Try one question
Five groups cover 1–9, so five choices may avoid a pair but six cannot.