MathDB
Weighings using a balance

Source: 45th International Tournament of Towns, Senior A-Level P7, Fall 2023

December 10, 2023
combinatorics

Problem Statement

On the table there are 2n2n coins that look the same. It is known that nn of them weigh 9 g. each, while the remaining nn weigh 10 g. each. It is required to split the coins into nn pairs with total weight of each pair 19 g. Prove that this can be done in less than nn weighings using a balance without additional weights (the balance shows which pan is heavier or that their weight is equal).