Problem

Source:

Tags: combinatorics, algorithm, IMO Shortlist, IMO Longlist



We are given a bag of sugar, a two-pan balance, and a weight of $1$ gram. How do we obtain $1$ kilogram of sugar in the smallest possible number of weighings?