Difference between revisions of "2011 IMO Problems"
Humzaiqbal (talk | contribs) |
(→Day 1) |
||
(9 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
− | + | Problems of the 52st [[IMO]] 2011 in Amsterdam, Netherlands. | |
− | Problem 1 | + | == Day 1 == |
+ | === Problem 1 === | ||
+ | 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'' | |
− | |||
− | Problem 3 | + | [[2011 IMO Problems/Problem 1 | Solution]] |
− | f(x + y) | + | |
− | + | === 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. | |
− | Problem 4. Let n > 0 be an integer. We are given a balance and n weights of weight 2^0, 2^1, | + | 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. |
+ | |||
+ | ''Author: Geoffrey Smith, United Kingdom'' | ||
+ | |||
+ | [[2011 IMO Problems/Problem 2 | Solution]] | ||
+ | |||
+ | === Problem 3 === | ||
+ | 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>. | ||
+ | |||
+ | ''Author: Igor Voronovich, Belarus'' | ||
+ | |||
+ | [[2011 IMO Problems/Problem 3 | Solution]] | ||
+ | |||
+ | == Day 2 == | ||
+ | === Problem 4. === | ||
+ | Let <math>n > 0</math> be an integer. We are given a balance and <math>n</math> weights of weight <math>2^0, 2^1,\ldots, 2^{n-1}</math> . We are to place each of the <math>n</math> 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. | Determine the number of ways in which this can be done. | ||
− | 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) | + | ''Author: Morteza Saghafian, Iran'' |
+ | |||
+ | [[2011 IMO Problems/Problem 4 | Solution]] | ||
+ | |||
+ | === Problem 5. === | ||
+ | Let <math>f</math> be a function from the set of integers to the set of positive integers. Suppose that, for any two integers <math>m</math> and <math>n</math>, the difference <math>f(m) - f(n)</math> is divisible by <math>f(m - n)</math>. Prove that, for all integers <math>m</math> and <math>n</math> with <math>f(m) \le f(n)</math>, the number <math>f(n)</math> is divisible by <math>f(m)</math>. | ||
+ | |||
+ | ''Author: Mahyar Sefidgaran, Iran'' | ||
+ | |||
+ | [[2011 IMO Problems/Problem 5 | Solution]] | ||
+ | |||
+ | === Problem 6. === | ||
+ | Let <math>ABC</math> be an acute triangle with circumcircle <math>\Gamma</math>. Let <math>l</math> be a tangent line to <math>\Gamma</math>, and let <math>l_a</math>, <math>l_b</math> and <math>l_c</math> be the lines obtained by reflecting <math>l</math> in the lines <math>BC</math>, <math>CA</math> and <math>AB</math>, respectively. Show that the circumcircle of the triangle determined by the lines <math>l_a</math>, <math>l_b</math> and <math>l_c</math> is tangent to the circle <math>\Gamma</math>. | ||
+ | |||
+ | ''Author: Japan'' | ||
+ | |||
+ | [[2011 IMO Problems/Problem 6 | Solution]] | ||
+ | |||
+ | |||
+ | == Resources == | ||
+ | * [[2011 IMO]] | ||
+ | * [http://www.artofproblemsolving.com/Forum/resources.php?c=1&cid=16&year=2011&sid=8fa5e6d20f9aad1a4dd4efa73519b417 2011 IMO Problems on the Resources page] | ||
− | + | {{IMO box|year=2011|before=[[2010 IMO Problems]]|after=[[2012 IMO Problems]]}} |
Latest revision as of 00:12, 18 February 2021
Problems of the 52st IMO 2011 in Amsterdam, Netherlands.
Contents
Day 1
Problem 1
Given any set of four distinct positive integers, let
be the sum of the positive integers in
. Let
denote the number of pairs
with
for which
divides
. Find all sets
of four distinct positive integers which achieve the largest possible value of
.
Author: Fernando Campos, Mexico
Problem 2
Let be a finite set of at least two points in the plane. Assume that no three points of
are collinear. A windmill is a process that starts with a line
going through a single point
. The line rotates clockwise about the pivot
until the first time that the line meets some other point belonging to
. This point,
, takes over as the new pivot, and the line now rotates clockwise about
, until it next meets a point of
. This process continues indefinitely.
Show that we can choose a point
in
and a line
going through
such that the resulting windmill uses each point of
as a pivot infinitely many times.
Author: Geoffrey Smith, United Kingdom
Problem 3
Let be a real-valued function defined on the set of real numbers that satisfies
for all real numbers
and
. Prove that
for all
.
Author: Igor Voronovich, Belarus
Day 2
Problem 4.
Let be an integer. We are given a balance and
weights of weight
. We are to place each of the
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
Problem 5.
Let be a function from the set of integers to the set of positive integers. Suppose that, for any two integers
and
, the difference
is divisible by
. Prove that, for all integers
and
with
, the number
is divisible by
.
Author: Mahyar Sefidgaran, Iran
Problem 6.
Let be an acute triangle with circumcircle
. Let
be a tangent line to
, and let
,
and
be the lines obtained by reflecting
in the lines
,
and
, respectively. Show that the circumcircle of the triangle determined by the lines
,
and
is tangent to the circle
.
Author: Japan
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 |