Browse · MathNet
PrintBaltic Way 2019
Baltic Way 2019 counting and probability
Problem
Magician puts on the board cards with numbers from to in a "snake-like" line so that consecutive numbers are side-to-side adjacent (either horizontally or vertically, not diagonally). The numbers are written on the bottom sides of the cards, the upper sides are empty. After that the magician turns cards by his choice. For what minimum can it happen that open cards determine uniquely the whole snake?
Solution
Answer: .
Example. Put in the low left corner and in the cell above it.
Estimation. One open card does not determine the snake uniquely, because all the cells of board can be considered as one cyclic path: let the rows of the board be denoted by letters a, b, c and columns be numbered from to , then that path is If we open only one card in this path we can orient this path in two ways and put cards such that they increase in the direction of the chosen orientation. So we have at least two configurations here.
Example. Put in the low left corner and in the cell above it.
Estimation. One open card does not determine the snake uniquely, because all the cells of board can be considered as one cyclic path: let the rows of the board be denoted by letters a, b, c and columns be numbered from to , then that path is If we open only one card in this path we can orient this path in two ways and put cards such that they increase in the direction of the chosen orientation. So we have at least two configurations here.
Final answer
2
Techniques
Coloring schemes, extremal argumentsOther