Difference between revisions of "User:Lightest"
(→Problem 4) |
(→Solution outline) |
||
Line 31: | Line 31: | ||
Since the length of the arc <math>P_nP_a</math> is <math>\{(a-n)\alpha\}</math> (where <math>\{x\}</math> equals to <math>x</math> subtracted by the greatest integer not exceeding <math>x</math>) and length of the arc <math>P_bP_n</math> is <math>\{(n-b)\alpha\} = \{a\alpha\}</math>, we now consider a point <math>P_0</math> which is defined by <math>P_1</math> traveling clockwise on the circle such that the length of arc <math>P_0P_1</math> is <math>\alpha</math>. We claim that either <math>P_0</math> is on the interior of the arc <math>P_nP_a</math> or on the interior of the arc <math>P_bP_n</math>. Algebraically, it is equivalent to either <math> \{0-n\alpha\} < \{(a-n)\alpha\}</math> or <math>\{n\alpha -0 \} < \{a\alpha\}</math>. Suppose the former fails, i.e. <math> \{0-n\alpha\} \ge \{(a-n)\alpha\}</math>. Then suppose <math>-n\alpha = m_1 + r_1</math> and <math>(a-n)\alpha = m_2 + r_2</math>, where <math>m_1</math>, <math>m_2</math> are integers and <math>1> r_1 \ge r_2 \ge 0</math>. We now have | Since the length of the arc <math>P_nP_a</math> is <math>\{(a-n)\alpha\}</math> (where <math>\{x\}</math> equals to <math>x</math> subtracted by the greatest integer not exceeding <math>x</math>) and length of the arc <math>P_bP_n</math> is <math>\{(n-b)\alpha\} = \{a\alpha\}</math>, we now consider a point <math>P_0</math> which is defined by <math>P_1</math> traveling clockwise on the circle such that the length of arc <math>P_0P_1</math> is <math>\alpha</math>. We claim that either <math>P_0</math> is on the interior of the arc <math>P_nP_a</math> or on the interior of the arc <math>P_bP_n</math>. Algebraically, it is equivalent to either <math> \{0-n\alpha\} < \{(a-n)\alpha\}</math> or <math>\{n\alpha -0 \} < \{a\alpha\}</math>. Suppose the former fails, i.e. <math> \{0-n\alpha\} \ge \{(a-n)\alpha\}</math>. Then suppose <math>-n\alpha = m_1 + r_1</math> and <math>(a-n)\alpha = m_2 + r_2</math>, where <math>m_1</math>, <math>m_2</math> are integers and <math>1> r_1 \ge r_2 \ge 0</math>. We now have | ||
<cmath>\{n\alpha\} = \{-m_1-1 + (1 -r_1)\}=1-r_1</cmath> and <cmath>a\alpha = \{m_2-m_1-1 + (1-r_2+r_1)\} = 1-r_2+r_1>1-r_1</cmath> | <cmath>\{n\alpha\} = \{-m_1-1 + (1 -r_1)\}=1-r_1</cmath> and <cmath>a\alpha = \{m_2-m_1-1 + (1-r_2+r_1)\} = 1-r_2+r_1>1-r_1</cmath> | ||
− | Therefore <math>P_0</math> is either closer to <math>P_n</math> on the <math>P_a</math> side, or closer to <math>P_n</math> on the <math>P_b</math> side. Hence <math>P_c</math> or <math>P_d</math> is <math>P_1</math>, therefore <math>c+d \le n+1</math> | + | Therefore <math>P_0</math> is either closer to <math>P_n</math> than <math>P_a</math> on the <math>P_a</math> side, or closer to <math>P_n</math> than <math>P_b</math> on the <math>P_b</math> side. In other words, <math>P_1</math> is the closest adjacent point of <math>P_{n+1}</math> on the <math>P_{a+1}</math> side, or the closest adjacent point of <math>P_{n+1}</math> on the <math>P_{b+1}</math> side. Hence <math>P_c</math> or <math>P_d</math> is <math>P_1</math>, therefore <math>c+d \le n+1</math>. |
(ii) Suppose <math>a+b\le n-1</math> | (ii) Suppose <math>a+b\le n-1</math> |
Revision as of 20:24, 6 May 2012
For any information, please contact me at MATHTAM@gmail.com
Contents
Notes
USAJMO Problem 1
Given a triangle , let
and
be points on segments
and
, respectively, such that
. Let
and
be distinct points on segment
such that
lies between
and
,
, and
. Prove that
,
,
,
are concyclic (in other words, these four points lie on a circle).
Problem 2
Find all integers such that among any
positive real numbers
,
,
,
with
there exist three that are the side lengths of an acute triangle.
Problem 3
Let ,
,
be positive real numbers. Prove that
Problem 4
Let be an irrational number with
, and draw a circle in the plane whose circumference has length 1. Given any integer
, define a sequence of points
,
,
,
as follows. First select any point
on the circle, and for
define
as the point on the circle for which the length of arc
is
, when travelling counterclockwise around the circle from
to
. Supose that
and
are the nearest adjacent points on either side of
. Prove that
.
Solution outline
Use mathematical induction. For it is true because one point can't be closest to
in both ways, and that
. Suppose that for some
, the nearest adjacent points
and
on either side of
satisfy
. Then consider the nearest adjacent points
and
on either side of
. It is by the assumption of the nearness we can see that either
,
, or one of
or
equals two
. Let's consider the following two cases.
(i) Suppose .
Since the length of the arc is
(where
equals to
subtracted by the greatest integer not exceeding
) and length of the arc
is
, we now consider a point
which is defined by
traveling clockwise on the circle such that the length of arc
is
. We claim that either
is on the interior of the arc
or on the interior of the arc
. Algebraically, it is equivalent to either
or
. Suppose the former fails, i.e.
. Then suppose
and
, where
,
are integers and
. We now have
and
Therefore
is either closer to
than
on the
side, or closer to
than
on the
side. In other words,
is the closest adjacent point of
on the
side, or the closest adjacent point of
on the
side. Hence
or
is
, therefore
.
(ii) Suppose
Then either
when
and
, or
when one of
or
is
.
In either case, is true.
Problem 5
For distinct positive integers ,
, define
to be the number of integers
with
such that the remainder when
divided by 2012 is greater than that of
divided by 2012. Let
be the minimum value of
, where
and
range over all pairs of distinct positive integers less than 2012. Determine
.
Problem 6
Let be a point in the plane of triangle
, and
a line passing through
. Let
,
,
be the points where the reflections of lines
,
,
with respect to
intersect lines
,
,
, respectively. Prove that
,
,
are collinear.