Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2008 IMO Problems"

(→‎Problem 2)
 
Line 1: Line 1:
 
Problems of the 49th [[IMO]] 2008 Spain.
 
Problems of the 49th [[IMO]] 2008 Spain.
  
−
== Day I ==
+
== Day 1 ==
  
 
=== Problem 1 ===
 
=== Problem 1 ===
Line 25: Line 25:
 
[[2008 IMO Problems/Problem 3 | Solution]]
 
[[2008 IMO Problems/Problem 3 | Solution]]
  
−
== Day II ==
+
== Day 2 ==
  
 
=== Problem 4 ===
 
=== Problem 4 ===
Line 37: Line 37:
  
 
=== Problem 5 ===
 
=== Problem 5 ===
−
Let <math>n</math> and <math>k</math> be positive integers with <math>k \geq n</math> and <math>k - n</math> an even number. Let <math>2n</math> lamps labelled <math>1</math>, <math>2</math>, ..., <math>2n</math> be given, each of which can be either ''on'' or ''off''. Initially all the lamps are off. We consider sequences of steps: at each step one of the lamps is switched (from on to off or from off to on).
+
Let <math>n</math> and <math>k</math> be positive integers with <math>k \geq n</math> and <math>k - n</math> an even number. Let <math>2n</math> lamps labelled <math>1, 2, \dots, 2n</math> be given, each of which can be either ''on'' or ''off''. Initially all the lamps are off. We consider sequences of steps: at each step one of the lamps is switched (from on to off or from off to on).
  
 
Let <math>N</math> be the number of such sequences consisting of <math>k</math> steps and resulting in the state where lamps <math>1</math> through <math>n</math> are all on, and lamps <math>n + 1</math> through <math>2n</math> are all off.
 
Let <math>N</math> be the number of such sequences consisting of <math>k</math> steps and resulting in the state where lamps <math>1</math> through <math>n</math> are all on, and lamps <math>n + 1</math> through <math>2n</math> are all off.

Latest revision as of 23:30, 17 February 2021

Problems of the 49th IMO 2008 Spain.

Day 1

Problem 1

Let $H$ be the orthocenter of an acute-angled triangle $ABC$. The circle $\Gamma_{A}$ centered at the midpoint of $BC$ and passing through $H$ intersects line $BC$ at points $A_{1}$ and $A_{2}$. Similarly, define the points $B_{1}$, $B_{2}$, $C_{1}$ and $C_{2}$.

Prove that six points $A_{1}$ , $A_{2}$, $B_{1}$, $B_{2}$, $C_{1}$ and $C_{2}$ are concyclic.

Solution

Problem 2

Let $x, y, z\neq 1$ be three real numbers, such that $xyz = 1$

(i) Prove that; $\frac {x^{2}}{\left(x - 1\right)^{2}} + \frac {y^{2}}{\left(y - 1\right)^{2}} + \frac {z^{2}}{\left(z - 1\right)^{2}} \geq 1$.

(ii) Prove that $\frac {x^{2}}{\left(x - 1\right)^{2}} + \frac {y^{2}}{\left(y - 1\right)^{2}} + \frac {z^{2}}{\left(z - 1\right)^{2}} = 1$ for infinitely many triples of rational numbers $x$, $y$ and $z$.

Solution

Problem 3

Prove that there are infinitely many positive integers $n$ such that $n^{2} + 1$ has a prime divisor greater than $2n + \sqrt {2n}$.

Solution

Day 2

Problem 4

Find all functions $f: (0, \infty) \mapsto (0, \infty)$ (so $f$ is a function from the positive real numbers) such that

$\frac {\left( f(w) \right)^2 + \left( f(x) \right)^2}{f(y^2) + f(z^2) } = \frac {w^2 + x^2}{y^2 + z^2}$

for all positive real numbes $w,x,y,z,$ satisfying $wx = yz.$

Solution

Problem 5

Let $n$ and $k$ be positive integers with $k \geq n$ and $k - n$ an even number. Let $2n$ lamps labelled $1, 2, \dots, 2n$ be given, each of which can be either on or off. Initially all the lamps are off. We consider sequences of steps: at each step one of the lamps is switched (from on to off or from off to on).

Let $N$ be the number of such sequences consisting of $k$ steps and resulting in the state where lamps $1$ through $n$ are all on, and lamps $n + 1$ through $2n$ are all off.

Let $M$ be number of such sequences consisting of $k$ steps, resulting in the state where lamps $1$ through $n$ are all on, and lamps $n + 1$ through $2n$ are all off, but where none of the lamps $n + 1$ through $2n$ is ever switched on.

Determine $\frac {N}{M}$.

Solution

Problem 6

Let $ABCD$ be a convex quadrilateral with $BA$ different from $BC$. Denote the incircles of triangles $ABC$ and $ADC$ by $k_{1}$ and $k_{2}$ respectively. Suppose that there exists a circle $k$ tangent to ray $BA$ beyond $A$ and to the ray $BC$ beyond $C$, which is also tangent to the lines $AD$ and $CD$.

Prove that the common external tangents to $k_{1}$ and $k_{2}$ intersect on $k$.

Solution

Resources

2008 IMO (Problems) • Resources
Preceded by
2007 IMO Problems 		1 • 2 • 3 • 4 • 5 • 6 Followed by
2009 IMO Problems
All IMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2008_IMO_Problems&oldid=147347"