Olympiad problems

1950 Moscow Mathematical Olympiad, 174

a) Given $555$ weights: of $1$ g, $2$ g, $3$ g, . . . , $555$ g, divide them into three piles of equal mass. b) Arrange $81$ weights of $1^2, 2^2, . . . , 81^2$ (all in grams) into three piles of equal mass.

1990 Tournament Of Towns, (249) 3

Tags: weighing , combinatorics

Fifteen elephants stand in a row. Their weights are expressed by integer numbers of kilograms. The sum of the weight of each elephant (except the one on the extreme right) and the doubled weight of its right neighbour is exactly $15$ tonnes. Determine the weight of each elephant. (F.L. Nazarov)

2000 All-Russian Olympiad Regional Round, 8.5

Tags: weighing , combinatorics

Given are $8$ weights weighing $1, 2, . . . , 8$ grams, but it is not known which one how much does it weigh. Baron Munchausen claims that he remembers which of the weights weighs how much, and to prove that he is right he is ready to conduct one weighing, as a result of which the weight of at least one of the weights will be unambiguously established. Is he cheating?

1990 All Soviet Union Mathematical Olympiad, 534

Tags: weighing , combinatorics

Given $2n$ genuine coins and $2n$ fake coins. The fake coins look the same as genuine coins but weigh less (but all fake coins have the same weight). Show how to identify each coin as genuine or fake using a balance at most $3n$ times.

1997 Tournament Of Towns, (535) 7

Tags: weighing , combinatorics , number theory

You are given a balance and one copy of each of ten weights of $1, 2, 4, 8, 16, 32, 64, 128, 256$ and $512$ grams. An object weighing $M$ grams, where $M$ is a positive integer, is put on one of the pans and may be balanced in different ways by placing various combinations of the given weights on either pan of the balance. (a) Prove that no object may be balanced in more than $89$ ways. (b) Find a value of $M$ such that an object weighing $M$ grams can be balanced in $89$ ways. (A Shapovalov, A Kulakov)

2000 All-Russian Olympiad Regional Round, 9.6

Tags: weighing , combinatorics

Among $2000$ outwardly indistinguishable balls, wines - aluminum weighing 1$0$ g, and the rest - duralumin weighing $9.9$ g. It is required to select two piles of balls so that the masses of the piles are different, and the number of balls in them - the same. What is the smallest number of weighings on a cup scale without weights that can be done?

1992 Tournament Of Towns, (337) 5

Tags: combinatorics , weighing

$100$ silver coins ordered by weight and $101$ gold coins also ordered by weight are given. All coins have different weights. You are given a balance to compare weights of any two coins. How can you find the “middle” coin (that occupies the $101$-st place in weight among all $201$ coins) using the minimal number of weighings? Find this number and prove that a smaller number of weighings would be insufficient. (A. Andjans, Riga)

1993 Tournament Of Towns, (388) 6

Tags: combinatorics , weighing

Construct a set of $k$ integer weights that allows you to get any total integer weight from $1$ up to $55$ grams even if some of the weights of the set are lost. Consider two versions: (a) $k = 10$, and any one of the weights may be lost; (b) $k = 12$, and any two of the weights may be lost. (D Zvonkin) (In both cases prove that the set found has the property required.)

1974 Bundeswettbewerb Mathematik, 2

Tags: combinatorics , weighing

There are $30$ apparently equal balls, $15$ of which have the weight $a$ and the remaining $15$ have the weight $b$ with $a \ne b$. The balls are to be partitioned into two groups of $15$, according to their weight. An assistant partitioned them into two groups, and we wish to check if this partition is correct. How can we check that with as few weighings as possible?

1985 Tournament Of Towns, (081) T2

Tags: game , game strategy , combinatorics , weighing

There are $68$ coins , each coin having a different weight than that of each other . Show how to find the heaviest and lightest coin in $100$ weighings on a balance beam. (S. Fomin, Leningrad)

1987 All Soviet Union Mathematical Olympiad, 442

Tags: weighing , combinatorics , algebra

It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.

2012 Tournament of Towns, 5

Tags: weighing , combinatorics

Among $239$ coins identical in appearance there are two counterfeit coins. Both counterfeit coins have the same weight different from the weight of a genuine coin. Using a simple balance, determine in three weighings whether the counterfeit coin is heavier or lighter than the genuine coin. A simple balance shows if both sides are in equilibrium or left side is heavier or lighter. It is not required to find the counterfeit coins.

1992 Tournament Of Towns, (328) 5

Tags: weighing , combinatorics

$50$ silver coins ordered by weight and $51$ gold coins also ordered by weight are given. All coins have different weights. You are given a balance to compare weights of any two coins. How can you find the “middle” coin (that occupying the $51$st place in weight among all $101$ coins) using $7$ weighings? (A. Andjans)

1951 Moscow Mathematical Olympiad, 192

Tags: weighing , combinatorics , algebra

a) Given a chain of $60$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $59$ g, $60$ g? A broken link also weighs $1$ g. b) Given a chain of $150$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $149$ g, $150$ g? A broken link also weighs $1$ g.