Olympiad problems

1990 IMO Shortlist, 6

Tags: combinatorics , game , game strategy , algorithm , IMO , IMO 1990

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

1990 IMO, 3

Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen

Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1990 IMO Shortlist, 16

Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen

Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1990 IMO Shortlist, 25

Tags: function , number theory , algebra , functional equation , IMO , IMO 1990

Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.

1990 IMO Shortlist, 3

Tags: graph theory , combinatorics , Extremal combinatorics , Coloring , IMO , IMO 1990

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

1990 IMO, 2

Tags: combinatorics , game , game strategy , algorithm , IMO , IMO 1990

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

1990 IMO Longlists, 30

Tags: trigonometry , geometry , similar triangles , tangent , IMO , IMO 1990

Chords $ AB$ and $ CD$ of a circle intersect at a point $ E$ inside the circle. Let $ M$ be an interior point of the segment $ EB$. The tangent line at $ E$ to the circle through $ D$, $ E$, and $ M$ intersects the lines $ BC$ and $ AC$ at $ F$ and $ G$, respectively. If \[ \frac {AM}{AB} \equal{} t, \] find $\frac {EG}{EF}$ in terms of $ t$.

1990 IMO, 1

Tags: trigonometry , geometry , similar triangles , tangent , IMO , IMO 1990

Chords $ AB$ and $ CD$ of a circle intersect at a point $ E$ inside the circle. Let $ M$ be an interior point of the segment $ EB$. The tangent line at $ E$ to the circle through $ D$, $ E$, and $ M$ intersects the lines $ BC$ and $ AC$ at $ F$ and $ G$, respectively. If \[ \frac {AM}{AB} \equal{} t, \] find $\frac {EG}{EF}$ in terms of $ t$.

1990 IMO Longlists, 8

Tags: graph theory , combinatorics , Extremal combinatorics , Coloring , IMO , IMO 1990

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

1990 IMO Shortlist, 11

Tags: trigonometry , geometry , similar triangles , tangent , IMO , IMO 1990

Chords $ AB$ and $ CD$ of a circle intersect at a point $ E$ inside the circle. Let $ M$ be an interior point of the segment $ EB$. The tangent line at $ E$ to the circle through $ D$, $ E$, and $ M$ intersects the lines $ BC$ and $ AC$ at $ F$ and $ G$, respectively. If \[ \frac {AM}{AB} \equal{} t, \] find $\frac {EG}{EF}$ in terms of $ t$.

1990 IMO Longlists, 58

Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen

Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1990 IMO Longlists, 93

Tags: function , number theory , algebra , functional equation , IMO , IMO 1990

Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.

1990 IMO, 1

Tags: function , number theory , algebra , functional equation , IMO , IMO 1990

Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.

1990 IMO, 2

Tags: graph theory , combinatorics , Extremal combinatorics , Coloring , IMO , IMO 1990

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

1990 IMO Shortlist, 23

Tags: modular arithmetic , number theory , Divisibility , IMO 1990 , Orders And LTE , P3

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

1990 IMO, 3

Tags: modular arithmetic , number theory , Divisibility , IMO 1990 , Orders And LTE , P3

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

1990 IMO Longlists, 79

Tags: modular arithmetic , number theory , Divisibility , IMO 1990 , Orders And LTE , P3

Determine all integers $ n > 1$ such that \[ \frac {2^n \plus{} 1}{n^2} \] is an integer.

1990 IMO Longlists, 19

Tags: combinatorics , game , game strategy , algorithm , IMO , IMO 1990

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?