Maths Olympiad Prep

Library / /110 of 129

Number theory Difficulty 6.4 National Olympiad Prove it Slovenia

Every school in the region has sent 3 students to a contest. Andrej, Blaž and Žan represented the same school. When all the contestants lined up to receive their start numbers, Andrej realized that there were exactly as many contestants in the line before him as there were behind. Both his friends were behind him: Blaž was 19th and Žan was 28th. How many schools are there in this region?

Solution

Let xx denote the number of contestants in line before Andrej. Then there were also xx contestants behind Andrej and there were 2x+12x+1 contestants altogether. Hence, the total number of contestants was odd. Since Andrej was standing in line before Blaž, who was 19th, there were at most 17 contestants in line before Andrej and x17x \le 17. This gives us the maximum of 2x+1217+1=352x+1 \le 2 \cdot 17+1 = 35 contestants. Since Žan was 28th in line, there were at least 28 contestants. As each of the schools has sent 3 contestants the total number of contestants must be divisible by 3. The only two numbers between 28 and 35 that are divisible by 3 are 30 and 33. Of these only 33 is odd. There were 33 contestants, hence there are 11 schools in the region.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.