olymmath

ISL 2011 C1

Let n>0n>0 be an integer. We are given a balance and nn weights of weight 20,21,…,2n−12^{0}, 2^{1}, \ldots, 2^{n-1}. In a sequence of nn moves we place all weights on the balance. In the first move we choose a weight and put it on the left pan. In each of the following moves we choose one of the remaining weights and we add it either to the left or to the right pan. Compute the number of ways in which we can perform these nn moves in such a way that the right pan is never heavier than the left pan.

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2011 Shortlist booklet, page 7.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

These problems have the most words in common with this statement.

Locator isl/2011/c1 · Tag D9ZRQ81VVV · Edit this page on GitHub · Keys: j next, k previous