Writing Numbers on a Tape
Source: Tournament of Towns Spring 2016
February 22, 2017
combinatorics
Problem Statement
All integers from to one million are written on a tape in some arbitrary order. Then the tape is cut into pieces containing two consecutive digits each. Prove that these pieces contain all two-digit integers for sure, regardless of the initial order of integers.(4 points)
Alexey Tolpygo