2016年USAMO 真题:
Day 1
Problem 1
Let
be a sequence of mutually distinct nonempty subsets of a set
. Any two sets
and
are disjoint and their union is not the whole set
, that is,
and
, for all
. Find the smallest possible number of elements in
.
Problem 2
Prove that for any positive integer ![]()
is an integer.
Problem 3
Let
be an acute triangle, and let
and
denote its
-excenter,
-excenter, and circumcenter, respectively. Points
and
are selected on
such that
and
Similarly, points
and
are selected on
such that
and ![]()
Lines
and
meet at
Prove that
and
are perpendicular.
Day 2
Problem 4
Find all functions
such that for all real numbers
and
,![]()
以下是我们为您整理的真题试卷,扫码即可免费领取完整版:


更多USAMO 历年真题+真题详解
扫码添加顾问即可免费领取

