Olympiad problems

1974 IMO, 5

The variables $a,b,c,d,$ traverse, independently from each other, the set of positive real values. What are the values which the expression \[ S= \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d} \] takes?

1974 IMO, 3

Tags: number theory , Summation , binomial coefficients , Divisibility , modular arithmetic , IMO , IMO 1974

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

1974 IMO, 2

Tags: trigonometry , circumcircle , geometry , Triangle , Trigonometric inequality , IMO , IMO 1974

Let $ABC$ be a triangle. Prove that there exists a point $D$ on the side $AB$ of the triangle $ABC$, such that $CD$ is the geometric mean of $AD$ and $DB$, iff the triangle $ABC$ satisfies the inequality $\sin A\sin B\le\sin^2\frac{C}{2}$. [hide="Comment"][i]Alternative formulation, from IMO ShortList 1974, Finland 2:[/i] We consider a triangle $ABC$. Prove that: $\sin(A) \sin(B) \leq \sin^2 \left( \frac{C}{2} \right)$ is a necessary and sufficient condition for the existence of a point $D$ on the segment $AB$ so that $CD$ is the geometrical mean of $AD$ and $BD$.[/hide]

1974 IMO Shortlist, 6

Tags: number theory , Summation , binomial coefficients , Divisibility , modular arithmetic , IMO , IMO 1974

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

1974 IMO Longlists, 22

Tags: algebra , continuous function , four variables , IMO , IMO 1974

The variables $a,b,c,d,$ traverse, independently from each other, the set of positive real values. What are the values which the expression \[ S= \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d} \] takes?

1974 IMO Longlists, 15

Tags: trigonometry , circumcircle , geometry , Triangle , Trigonometric inequality , IMO , IMO 1974

Let $ABC$ be a triangle. Prove that there exists a point $D$ on the side $AB$ of the triangle $ABC$, such that $CD$ is the geometric mean of $AD$ and $DB$, iff the triangle $ABC$ satisfies the inequality $\sin A\sin B\le\sin^2\frac{C}{2}$. [hide="Comment"][i]Alternative formulation, from IMO ShortList 1974, Finland 2:[/i] We consider a triangle $ABC$. Prove that: $\sin(A) \sin(B) \leq \sin^2 \left( \frac{C}{2} \right)$ is a necessary and sufficient condition for the existence of a point $D$ on the segment $AB$ so that $CD$ is the geometrical mean of $AD$ and $BD$.[/hide]

2011 Morocco TST, 1

Tags: number theory , Summation , binomial coefficients , Divisibility , modular arithmetic , IMO , IMO 1974

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

1974 IMO Shortlist, 10

Tags: trigonometry , circumcircle , geometry , Triangle , Trigonometric inequality , IMO , IMO 1974

Let $ABC$ be a triangle. Prove that there exists a point $D$ on the side $AB$ of the triangle $ABC$, such that $CD$ is the geometric mean of $AD$ and $DB$, iff the triangle $ABC$ satisfies the inequality $\sin A\sin B\le\sin^2\frac{C}{2}$. [hide="Comment"][i]Alternative formulation, from IMO ShortList 1974, Finland 2:[/i] We consider a triangle $ABC$. Prove that: $\sin(A) \sin(B) \leq \sin^2 \left( \frac{C}{2} \right)$ is a necessary and sufficient condition for the existence of a point $D$ on the segment $AB$ so that $CD$ is the geometrical mean of $AD$ and $BD$.[/hide]

1974 IMO Shortlist, 1

Tags: combinatorics , game , algebra , system of equations , IMO , IMO 1974

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

1974 IMO, 4

Tags: rectangle , combinatorics , Chessboard , dissection , IMO , IMO 1974

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<\ldots <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,\ldots ,a_p$.

1974 IMO Shortlist, 3

Tags: algebra , polynomial , number theory , coefficients , degree , IMO , IMO 1974

Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$

1974 IMO Shortlist, 11

Tags: geometry , rectangle , combinatorics , IMO , IMO 1974 , Chessboard , dissection

We consider the division of a chess board $8 \times 8$ in p disjoint rectangles which satisfy the conditions: [b]a)[/b] every rectangle is formed from a number of full squares (not partial) from the 64 and the number of white squares is equal to the number of black squares. [b]b)[/b] the numbers $\ a_{1}, \ldots, a_{p}$ of white squares from $p$ rectangles satisfy $a_1, , \ldots, a_p.$ Find the greatest value of $p$ for which there exists such a division and then for that value of $p,$ all the sequences $a_{1}, \ldots, a_{p}$ for which we can have such a division. [color=#008000]Moderator says: see [url]https://artofproblemsolving.com/community/c6h58591[/url][/color]

1974 IMO, 6

Tags: algebra , polynomial , number theory , coefficients , degree , IMO , IMO 1974

Let $P(x)$ be a polynomial with integer coefficients. We denote $\deg(P)$ its degree which is $\geq 1.$ Let $n(P)$ be the number of all the integers $k$ for which we have $(P(k))^{2}=1.$ Prove that $n(P)- \deg(P) \leq 2.$

1974 IMO Longlists, 30

Tags: number theory , Summation , binomial coefficients , Divisibility , modular arithmetic , IMO , IMO 1974

Prove that for any n natural, the number \[ \sum \limits_{k=0}^{n} \binom{2n+1}{2k+1} 2^{3k} \] cannot be divided by $5$.

1974 IMO Longlists, 1

Tags: geometry , rectangle , combinatorics , IMO , IMO 1974 , Chessboard , dissection

We consider the division of a chess board $8 \times 8$ in p disjoint rectangles which satisfy the conditions: [b]a)[/b] every rectangle is formed from a number of full squares (not partial) from the 64 and the number of white squares is equal to the number of black squares. [b]b)[/b] the numbers $\ a_{1}, \ldots, a_{p}$ of white squares from $p$ rectangles satisfy $a_1, , \ldots, a_p.$ Find the greatest value of $p$ for which there exists such a division and then for that value of $p,$ all the sequences $a_{1}, \ldots, a_{p}$ for which we can have such a division. [color=#008000]Moderator says: see [url]https://artofproblemsolving.com/community/c6h58591[/url][/color]

1974 IMO Longlists, 40

Tags: combinatorics , game , algebra , system of equations , IMO , IMO 1974

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).

1974 IMO Shortlist, 8

Tags: algebra , continuous function , four variables , IMO , IMO 1974

The variables $a,b,c,d,$ traverse, independently from each other, the set of positive real values. What are the values which the expression \[ S= \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d} \] takes?

1974 IMO, 1

Tags: combinatorics , game , algebra , system of equations , IMO , IMO 1974

Three players $A,B$ and $C$ play a game with three cards and on each of these $3$ cards it is written a positive integer, all $3$ numbers are different. A game consists of shuffling the cards, giving each player a card and each player is attributed a number of points equal to the number written on the card and then they give the cards back. After a number $(\geq 2)$ of games we find out that A has $20$ points, $B$ has $10$ points and $C$ has $9$ points. We also know that in the last game B had the card with the biggest number. Who had in the first game the card with the second value (this means the middle card concerning its value).