1974 IMO Problems

Problems of the 16th IMO 1974 in East Germany.

Problem 1

Three players $A, B$ and $C$ play the following game: On each of three cards an integer is written. These three numbers $p, q, r$ satisfy $0 < p < q < r$ . The three cards are shuffled and one is dealt to each player. Each then receives the number of counters indicated by the card he holds. Then the cards are shuffled again; the counters remain with the players.

This process (shuffling, dealing, giving out counters) takes place for at least two rounds. After the last round, $A$ has 20 counters in all, $B$ has 10 and $C$ has 9. At the last round $B$ received $r$ counters. Who received $q$ counters on the first round?

Solution

Problem 2

In the triangle $ABC$ , prove that there is a point $D$ on side $AB$ such that $CD$ is the geometric mean of $AD$ and $DB$ if and only if $\sin{A} \sin{B} \leq \sin^2 \frac{C}{2}.$

Solution

Problem 3

Prove that the number $\textstyle \sum_{k = 0}^n \tbinom{2n+1}{2k+1} 2^{3k}$ is not divisible by 5 for any integer $n \geq 0$ .

Solution

Problem 4

Consider decompositions of an $8 \times 8$ chessboard into p non-overlapping rectangles subject to the following conditions:

(i) Each rectangle has as many white squares as black squares.

(ii) If $a_i$ is the number of white squares in the $i$ -th rectangle, then $a_1 < a_2 < \cdots < a_p$ .

Find the maximum value of $p$ for which such a decomposition is possible. For this value of $p$ , determine all possible sequences $a_1, a_2, \cdots, a_p$ .

Solution

Problem 5

Determine all possible values of $S = \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d}$ where $a, b, c, d$ are arbitrary positive numbers.

Solution

Problem 6

Let $P$ be a non-constant polynomial with integer coefficients. If $n(P)$ is the number of distinct integers $k$ such that $(P(k))^2 = 1$ , prove that $n(P) - \deg(P) \leq 2$ , where $\deg(P)$ denotes the degree of the polynomial $P$ .

Solution

Page

Toolbox

Search

1974 IMO Problems

Contents

Problem 1

Problem 2

Problem 3

Problem 4

Problem 5

Problem 6