benchmarks.wiki / Public workspace

Omni-MATH / We are given n coins of different weights and n balances, n>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…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

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? [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]
Plain-text mathematical notation (without MathML)
We are given n coins of different weights and n balances, n>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?

[hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]
Original LaTeX notation
We are given $n$ coins of different weights and $n$ balances, $n>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?

[hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import