MathDB

M2565

Part of Kvant 2019

Problems(1)

2019 All Russian MO Grade 11 P3

Source:

5/1/2019
We are given nn coins of different weights and nn balances, n>2n>2. On each turn one can choose one balance, put one coin on the right pan and one on the left pan, and then delete these coins out of the balance. It's known that one balance is wrong (but it's not known ehich exactly), and it shows an arbitrary result on every turn. What is the smallest number of turns required to find the heaviest coin?
Thanks to the user Vlados021 for translating the problem.
combinatorics