Tournament of the Towns
The Tournament of Towns is an international mathematical competition for school students originating in Russia.
The contest was created by mathematician Nikolay Konstantinov and has participants from over 100 cities in many countries.
Organization
There are two rounds in this contest: Fall and Spring of the same academic year.Both have an O-Level paper and an A-Level paper separated by 1–2 weeks.
The O-Level contains around 5 questions and the A-Level contains around 7 questions.
The duration of the exams is 5 hours for both Levels.
The A-Level problems are more difficult than O-Level but have a greater maximum score.
Participating students are divided into two divisions;
Junior and Senior.
To account for age differences inside of each division, students in different grades have different loadings. A contestant's final score is his/her highest score from the four exams. It is not necessary albeit recommended to write all four exams.
Towns are given handicaps to account for differences in population. A town's score is the average of the scores of its N best students, where its population is N hundred thousand. It is also worth noting that the minimum value of N is 5.
Philosophy
Tournament of Towns differs from many other similar competitions by its philosophy relying much more upon ingenuity than the drill. First, problems are difficult. Second, it allows the participants to choose problems they like as for each paper the participant's score is the sum of his/her 3 best answers.The problems are mostly combinatorial, with the occasional geometry, number theory or algebra problem. They have a different flavor to problems seen in other mathematics competitions, and are usually quite challenging. Some of the problems have become classics, in particular two from the Autumn 1984 paper.