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 "2011 IMO Problems"
(→‎Day 1)
 
Line 2: Line 2:
  
 
== Day 1 ==
 
== Day 1 ==
−
=== Problem 1. ===
+
=== Problem 1 ===
−
Given any set <math>A = \{a_1, a_2, a_3, a_4\}</math> of four distinct positive integers, we denote the sum <math>a_1+a_2+a_3+a_4</math> by <math>s(A)</math>. Let <math>n(A)</math> denote the number of pairs <math>(i,j)</math> with <math>1 \le i < j \le 4</math> for which <math>a_i+a_j</math> divides <math>s(A)</math>. Find all sets <math>A</math> of four distinct positive integers which achieve the largest possible value of <math>n(A)</math>.
+
Given any set <math>A = \{a_1, a_2, a_3, a_4\}</math> of four distinct positive integers, let <math>s(A)=a_1+a_2+a_3+a_4</math> be the sum of the positive integers in <math>A</math>. Let <math>n(A)</math> denote the number of pairs <math>(i,j)</math> with <math>1 \le i < j \le 4</math> for which <math>a_i+a_j</math> divides <math>s(A)</math>. Find all sets <math>A</math> of four distinct positive integers which achieve the largest possible value of <math>n(A)</math>.
  
 
''Author: Fernando Campos, Mexico''
 
''Author: Fernando Campos, Mexico''
Line 9: Line 9:
 
[[2011 IMO Problems/Problem 1 | Solution]]
 
[[2011 IMO Problems/Problem 1 | Solution]]
  
−
=== Problem 2. ===  
+
=== Problem 2 ===  
 
Let <math>S</math> be a finite set of at least two points in the plane. Assume that no three points of <math>S</math> are collinear. A windmill is a process that starts with a line <math>l</math> going through a single point <math>P \in S</math>. The line rotates clockwise about the pivot <math>P</math> until the first time that the line meets some other point belonging to <math>S</math>. This point, <math>Q</math>, takes over as the new pivot, and the line now rotates clockwise about <math>Q</math>, until it next meets a point of <math>S</math>. This process continues indefinitely.
 
Let <math>S</math> be a finite set of at least two points in the plane. Assume that no three points of <math>S</math> are collinear. A windmill is a process that starts with a line <math>l</math> going through a single point <math>P \in S</math>. The line rotates clockwise about the pivot <math>P</math> until the first time that the line meets some other point belonging to <math>S</math>. This point, <math>Q</math>, takes over as the new pivot, and the line now rotates clockwise about <math>Q</math>, until it next meets a point of <math>S</math>. This process continues indefinitely.
 
Show that we can choose a point <math>P</math> in <math>S</math> and a line <math>l</math> going through <math>P</math> such that the resulting windmill uses each point of <math>S</math> as a pivot infinitely many times.
 
Show that we can choose a point <math>P</math> in <math>S</math> and a line <math>l</math> going through <math>P</math> such that the resulting windmill uses each point of <math>S</math> as a pivot infinitely many times.
Line 17: Line 17:
 
[[2011 IMO Problems/Problem 2 | Solution]]
 
[[2011 IMO Problems/Problem 2 | Solution]]
  
−
=== Problem 3. ===
+
=== Problem 3 ===
−
Let <math>f : R \rightarrow R</math> be a real-valued function defined on the set of real numbers that satisfies
+
Let <math>f : \mathbb{R} \rightarrow \mathbb{R}</math> be a real-valued function defined on the set of real numbers that satisfies
 
<math>f(x + y) \le yf(x) + f(f(x))</math> for all real numbers <math>x</math> and <math>y</math>. Prove that <math>f(x)=0</math> for all <math>x \le 0</math>.
 
<math>f(x + y) \le yf(x) + f(f(x))</math> for all real numbers <math>x</math> and <math>y</math>. Prove that <math>f(x)=0</math> for all <math>x \le 0</math>.
  
Line 24: Line 24:
  
 
[[2011 IMO Problems/Problem 3 | Solution]]
 
[[2011 IMO Problems/Problem 3 | Solution]]
−
 
  
 
== Day 2 ==
 
== Day 2 ==

Latest revision as of 23:12, 17 February 2021

Problems of the 52st IMO 2011 in Amsterdam, Netherlands.

Day 1

Problem 1

Given any set $A = \{a_1, a_2, a_3, a_4\}$ of four distinct positive integers, let $s(A)=a_1+a_2+a_3+a_4$ be the sum of the positive integers in $A$. Let $n(A)$ denote the number of pairs $(i,j)$ with $1 \le i < j \le 4$ for which $a_i+a_j$ divides $s(A)$. Find all sets $A$ of four distinct positive integers which achieve the largest possible value of $n(A)$.

Author: Fernando Campos, Mexico

Solution

Problem 2

Let $S$ be a finite set of at least two points in the plane. Assume that no three points of $S$ are collinear. A windmill is a process that starts with a line $l$ going through a single point $P \in S$. The line rotates clockwise about the pivot $P$ until the first time that the line meets some other point belonging to $S$. This point, $Q$, takes over as the new pivot, and the line now rotates clockwise about $Q$, until it next meets a point of $S$. This process continues indefinitely. Show that we can choose a point $P$ in $S$ and a line $l$ going through $P$ such that the resulting windmill uses each point of $S$ as a pivot infinitely many times.

Author: Geoffrey Smith, United Kingdom

Solution

Problem 3

Let $f : \mathbb{R} \rightarrow \mathbb{R}$ be a real-valued function defined on the set of real numbers that satisfies $f(x + y) \le yf(x) + f(f(x))$ for all real numbers $x$ and $y$. Prove that $f(x)=0$ for all $x \le 0$.

Author: Igor Voronovich, Belarus

Solution

Day 2

Problem 4.

Let $n > 0$ be an integer. We are given a balance and $n$ weights of weight $2^0, 2^1,\ldots, 2^{n-1}$ . We are to place each of the $n$ weights on the balance, one after another, in such a way that the right pan is never heavier than the left pan. At each step we choose one of the weights that has not yet been placed on the balance, and place it on either the left pan or the right pan, until all of the weights have been placed. Determine the number of ways in which this can be done.

Author: Morteza Saghafian, Iran

Solution

Problem 5.

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m - n)$. Prove that, for all integers $m$ and $n$ with $f(m) \le f(n)$, the number $f(n)$ is divisible by $f(m)$.

Author: Mahyar Sefidgaran, Iran

Solution

Problem 6.

Let $ABC$ be an acute triangle with circumcircle $\Gamma$. Let $l$ be a tangent line to $\Gamma$, and let $l_a$, $l_b$ and $l_c$ be the lines obtained by reflecting $l$ in the lines $BC$, $CA$ and $AB$, respectively. Show that the circumcircle of the triangle determined by the lines $l_a$, $l_b$ and $l_c$ is tangent to the circle $\Gamma$.

Author: Japan

Solution


Resources

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