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… · Discussion

Discussing 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… · Omni-MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.