Difference between revisions of "2013 UMO Problems"
m |
|||
Line 24: | Line 24: | ||
==Problem 3== | ==Problem 3== | ||
− | Find all <math>x</math> with <math>1 | + | Find all <math>x</math> with <math>1 \le x \le 999</math> such that the last three digits of <math>x^2</math> are all equal to the same nonzero |
digit. | digit. | ||
Line 31: | Line 31: | ||
==Problem 4== | ==Problem 4== | ||
− | Given line <math>\ell_1</math> and distinct points <math>I</math> and <math>X</math> on line <math>\ell_1</math>, draw lines <math>\ell_2</math> and <math>\ell_3 | + | Given line <math>\ell_1</math> and distinct points <math>I</math> and <math>X</math> on line <math>\ell_1</math>, draw lines <math>\ell_2</math> and <math>\ell_3</math> through point <math>I</math>, with angles <math>\alpha</math> and <math>\beta</math> as marked in the figure. Also, draw line segment <math>XY</math> at an angle of <math>\gamma</math> from line <math>\ell_1</math> such that it intersects line <math>\ell_2</math> at <math>Y</math>. Establish necessary and sufficient conditions on <math>\alpha</math> , <math>\beta</math> , and <math>\gamma</math> such that a triangle can be drawn with one of its sides as <math>XY</math> with lines <math>\ell_1</math>, <math>\ell_2</math>, and <math>\ell_3</math> as the angle bisectors of that triangle. |
[[2013 UMO Problems/Problem 4|Solution]] | [[2013 UMO Problems/Problem 4|Solution]] | ||
Line 37: | Line 37: | ||
==Problem 5== | ==Problem 5== | ||
− | Cooper and Malone take turns replacing a, b, and c in the equation below with real numbers. | + | Cooper and Malone take turns replacing <math>a</math>, <math>b</math>, and <math>c</math> in the equation below with real numbers. |
− | < | + | <math>P(x) = x^3 + ax^2 + bx + c</math> . Once a coefficient has been replaced, no one can choose to |
change that coefficient on their turn. The game ends when all three coefficients have been chosen. | change that coefficient on their turn. The game ends when all three coefficients have been chosen. | ||
− | Malone wins if < | + | Malone wins if <math>P(x)</math> has a non-real root and Cooper wins otherwise. If Malone goes first, find the person who has a winning strategy and describe it with proof. |
[[2013 UMO Problems/Problem 5|Solution]] | [[2013 UMO Problems/Problem 5|Solution]] | ||
Line 46: | Line 46: | ||
==Problem 6== | ==Problem 6== | ||
− | How many ways can one tile the border of a triangular grid of hexagons of length < | + | How many ways can one tile the border of a triangular grid of hexagons of length <math>n</math> completely using |
− | only < | + | only <math>1 \times 1</math> and <math>1 \times 2</math> hexagon tiles? Express your answer in terms of a well-known sequence, and |
− | prove that your answer holds true for all positive integers < | + | prove that your answer holds true for all positive integers <math>n \ge 3</math> (examples of such grids for <math>n = 3</math>, |
− | < | + | <math>n = 4</math>, <math>n = 5</math>, and <math>n = 6</math> are shown below). |
[[2013 UMO Problems/Problem 6|Solution]] | [[2013 UMO Problems/Problem 6|Solution]] |
Revision as of 00:35, 14 October 2014
Problem 1
Consider the following diagram.
(a) Show that you can retrace the diagram without lifting up your pencil using exactly nine (possibly overlapping) line segments.
(b) Show that you cannot retrace the diagram in the same way using eight or fewer segments.
Problem 2
Alice and Carl play the following game using a square sheet of paper. On each turn, the player makes a straight cut through the sheet (not necessarily parallel to the sides of the page), creating two new sheets. The sheet with smaller area is discarded (either one if the two are equal), and the player gives the larger sheet to the other player. The first player to receive a sheet of area less than 1 square centimeter from the opposing player loses. If Alice goes first, describe (with proof) the sizes of paper for which she has a winning strategy.
Problem 3
Find all with
such that the last three digits of
are all equal to the same nonzero
digit.
Problem 4
Given line and distinct points
and
on line
, draw lines
and
through point
, with angles
and
as marked in the figure. Also, draw line segment
at an angle of
from line
such that it intersects line
at
. Establish necessary and sufficient conditions on
,
, and
such that a triangle can be drawn with one of its sides as
with lines
,
, and
as the angle bisectors of that triangle.
Problem 5
Cooper and Malone take turns replacing ,
, and
in the equation below with real numbers.
. Once a coefficient has been replaced, no one can choose to
change that coefficient on their turn. The game ends when all three coefficients have been chosen.
Malone wins if
has a non-real root and Cooper wins otherwise. If Malone goes first, find the person who has a winning strategy and describe it with proof.
Problem 6
How many ways can one tile the border of a triangular grid of hexagons of length completely using
only
and
hexagon tiles? Express your answer in terms of a well-known sequence, and
prove that your answer holds true for all positive integers
(examples of such grids for
,
,
, and
are shown below).