Browse · MathNet
PrintDutch Mathematical Olympiad
Netherlands counting and probability
Problem
In a room there are vases numbered from to . In each vase we want to put a note with a positive integer from on it. The numbers on the notes do not necessarily have to be distinct. The following should now apply to each vase. Look at the note inside the vase, find the (not necessarily different) vase with the number written on the note, and look at the note inside this vase. Then the average of the numbers on the two notes must be exactly equal to the number of the first selected vase. For example, if we put a note with the number in vase , then vase should contain a note with the number on it: after all, the average of and is .
Determine all possible ways to provide each vase with a note.
Determine all possible ways to provide each vase with a note.
Solution
A possible way to provide each vase with a note is to put in vase a note with , in vase a note with , in vase a note with , , and in vase a note with . We will use induction to show that this is the only distribution. Note that for a valid distribution it does not matter in which order we fill the vases.
Take a look at vase . Suppose we put a note in it with . Then in vase we put a note with , such that or . Since and are positive integers, it must hold that . So the two vases here were the same and vase contains a note with .
For the induction step, we assume that the first vases each contain a note with the number of the vase. We want to show that in vase we have to put a note with . Suppose in vase we put a note with . If , then vase also contains a note with because of the induction hypothesis. It must then hold that , but this contradicts . We conclude that . If , we do not know yet which number has to go on the note in vase . Call this number . Then it must hold that , and so . But then we find a contradiction if we were to consider vase first: in it we find a note with , and in vase we then find, because of the induction hypothesis, another note with . However, , because and . We conclude that must hold: in vase we also put a note with on it. Induction now gives that in each vase we put a note with the number of the vase on it. So this is the only possible distribution of the notes.
Take a look at vase . Suppose we put a note in it with . Then in vase we put a note with , such that or . Since and are positive integers, it must hold that . So the two vases here were the same and vase contains a note with .
For the induction step, we assume that the first vases each contain a note with the number of the vase. We want to show that in vase we have to put a note with . Suppose in vase we put a note with . If , then vase also contains a note with because of the induction hypothesis. It must then hold that , but this contradicts . We conclude that . If , we do not know yet which number has to go on the note in vase . Call this number . Then it must hold that , and so . But then we find a contradiction if we were to consider vase first: in it we find a note with , and in vase we then find, because of the induction hypothesis, another note with . However, , because and . We conclude that must hold: in vase we also put a note with on it. Induction now gives that in each vase we put a note with the number of the vase on it. So this is the only possible distribution of the notes.
Final answer
Each vase contains the note equal to its own label; that is, for every k from 1 to 2023, vase k contains k.
Techniques
Functional equationsInduction / smoothing