2011 USAMO Problems真题及答案
完整版真题免费下载
+答案解析请参考文末
Day 1
Problem 1
Let ,
,
be positive real numbers such that
. Prove that
Problem 2
An integer is assigned to each vertex of a regular pentagon so that the sum of the five integers is 2011. A turn of a solitaire game consists of subtracting an integer from each of the integers at two neighboring vertices and adding
to the opposite vertex, which is not adjacent to either of the first two vertices. (The amount
and the vertices chosen can vary from turn to turn.) The game is won at a certain vertex if, after some number of turns, that vertex has the number 2011 and the other four vertices have the number 0. Prove that for any choice of the initial integers, there is exactly one vertex at which the game can be won.
Problem 3
In hexagon , which is nonconvex but not self-intersecting, no pair of opposite sides are parallel. The internal angles satisfy
,
, and
. Furthermore,
,
, and
. Prove that diagonals
,
, and
are concurrent.
Day 2
Problem 4
Consider the assertion that for each positive integer , the remainder upon dividing
by
is a power of 4. Either prove the assertion or find (with proof) a counterexample.
Problem 5
Let be a given point inside quadrilateral
. Points
and
are located within
such that
,
,
,
. Prove that
if and only if
.
Problem 6
Let be a set with
, meaning that
has 225 elements. Suppose further that there are eleven subsets
,
,
of
such that
for
and
for
. Prove that
, and give an example for which equality holds.
完整版2011USAMO真题pdf版本免费下载
2011USAMO真题参考答案及详解
AMC8/AMC10/AMC12/AIME
报名及辅导请联系


Aaron 李老师 15618605663 微信:linstitute4
Aaron 李老师 15618605663 微信:linstitute4