赛事资讯 - 第 119 页 - American Mathematics Competitions

2022年USAMO 真题及答案

2022年USAMO 真题：

Day 1

Problem 1

Let $a$ and $b$ be positive integers. The cells of an $(a+b+1)\times (a+b+1)$ grid are colored amber and bronze such that there are at least $a^2+ab-b$ amber cells and at least $b^2+ab-a$ bronze cells. Prove that it is possible to choose $a$ amber cells and $b$ bronze cells such that no two of the $a+b$ chosen cells lie in the same row or column.

Problem 2

Let $b\geq2$ and $w\geq2$ be fixed integers, and $n=b+w$ . Given are $2b$ identical black rods and $2w$ identical white rods, each of side length 1.

We assemble a regular $2n-$ gon using these rods so that parallel sides are the same color. Then, a convex $2b$ -gon $B$ is formed by translating the black rods, and a convex $2w$ -gon $W$ is formed by translating the white rods. An example of one way of doing the assembly when $b=3$ and $w=2$ is shown below, as well as the resulting polygons $B$ and $W$ .

Prove that the difference of the areas of $B$ and $W$ depends only on the numbers $b$ and $w$ , and not on how the $2n$ -gon was assembled.

Problem 3

Let $\mathbb{R}_{>0}$ be the set of all positive real numbers. Find all functions $f:\mathbb{R}_{>0} \to \mathbb{R}_{>0}$ such that for all $x,y\in \mathbb{R}_{>0}$ we have $f(x) = f(f(f(x)) + y) + f(xf(y)) f(x+y).$

Day 2

Problem 4

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

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

2021年USAMO 真题及答案

2021年USAMO 真题：

Day 1

$\textbf{Note:}$ For any geometry problem whose statement begins with an asterisk $(*)$ , the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 1

$(*)$ Rectangles $BCC_1B_2,$ $CAA_1C_2,$ and $ABB_1A_2$ are erected outside an acute triangle $ABC.$ Suppose that $\angle BC_1C+\angle CA_1A+\angle AB_1B=180^{\circ}.$ Prove that lines $B_1C_2,$ $C_1A_2,$ and $A_1B_2$ are concurrent.

Problem 2

The Planar National Park is a subset of the Euclidean plane consisting of several trails which meet at junctions. Every trail has its two endpoints at two different junctions whereas each junction is the endpoint of exactly three trails. Trails only intersect at junctions (in particular, trails only meet at endpoints). Finally, no trails begin and end at the same two junctions.

A visitor walks through the park as follows: she begins at a junction and starts walking along a trail. At the end of that first trail, she enters a junction and turns left. On the next junction she turns right, and so on, alternating left and right turns at each junction. She does this until she gets back to the junction where she started. What is the largest possible number of times she could have entered any junction during her walk, over all possible layouts of the park?

Problem 3

Let $n \geq 2$ be an integer. An $n \times n$ board is initially empty. Each minute, you may perform one of three moves: If there is an L-shaped tromino region of three cells without stones on the board (see figure; rotations not allowed), you may place a stone in each of those cells. If all cells in a column have a stone, you may remove all stones from that column. If all cells in a row have a stone, you may remove all stones from that row. $[asy] unitsize(20); draw((0,0)--(4,0)--(4,4)--(0,4)--(0,0)); fill((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--cycle, grey); draw((0.2,3.8)--(1.8,3.8)--(1.8, 1.8)--(3.8, 1.8)--(3.8, 0.2)--(0.2, 0.2)--(0.2, 3.8), linewidth(2)); draw((0,2)--(4,2)); draw((2,4)--(2,0)); [/asy]$ For which $n$ is it possible that, after some non-zero number of moves, the board has no stones?

Day 2

Problem 4

A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$ , there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$ . (The elements $s$ and $t$ could be equal.)

Given this information, find all possible values for the number of elements of $S$ .

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

2020年USAMO 真题及答案

2020年USAMO 真题：

Day 1

Problem 1

Let $ABC$ be a fixed acute triangle inscribed in a circle $\omega$ with center $O$ . A variable point $X$ is chosen on minor arc $AB$ of $\omega$ , and segments $CX$ and $AB$ meet at $D$ . Denote by $O_1$ and $O_2$ the circumcenters of triangles $ADX$ and $BDX$ , respectively. Determine all points $X$ for which the area of triangle $OO_1O_2$ is minimized.

Problem 2

An empty $2020 \times 2020 \times 2020$ cube is given, and a $2020 \times 2020$ grid of square unit cells is drawn on each of its six faces. A beam is a $1 \times 1 \times 2020$ rectangular prism. Several beams are placed inside the cube subject to the following conditions:

$\bullet$ The two $1 \times 1$ faces of each beam coincide with unit cells lying on opposite faces of the cube. (Hence, there are $3 \cdot 2020^2$ possible positions for a beam.)

$\bullet$ No two beams have intersecting interiors.

$\bullet$ The interiors of each of the four $1 \times 2020$ faces of each beam touch either a face of the cube or the interior of the face of another beam.

What is the smallest positive number of beams that can be placed to satisfy these conditions?

Problem 3

Let $p$ be an odd prime. An integer $x$ is called a quadratic non-residue if $p$ does not divide $x - t^2$ for any integer $t$ .

Denote by $A$ the set of all integers $a$ such that $1 \le a < p$ , and both $a$ and $4 - a$ are quadratic non-residues. Calculate the remainder when the product of the elements of $A$ is divided by $p$ .

Day 2

Problem 4

Suppose that $(a_1, b_1), (a_2, b_2), \ldots , (a_{100}, b_{100})$ are distinct ordered pairs of nonnegative integers. Let $N$ denote the number of pairs of integers $(i, j)$ satisfying $1 \le i < j \le 100$ and $|a_ib_j - a_j b_i|=1$ . Determine the largest possible value of $N$ over all possible choices of the $100$ ordered pairs.

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2018年USAMO 真题及答案

2018年USAMO 真题：

Day 1

Note: For any geometry problem whose statement begins with an asterisk ( $*$ ), the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 1

Let $a,b,c$ be positive real numbers such that $a+b+c=4\sqrt[3]{abc}$ . Prove that $2(ab+bc+ca)+4\min(a^2,b^2,c^2)\ge a^2+b^2+c^2.$

Problem 2

Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that

$f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1$ for all $x,y,z >0$ with $xyz =1.$

Problem 3

For a given integer $n\ge 2,$ let $\{a_1,a_2,…,a_m\}$ be the set of positive integers less than $n$ that are relatively prime to $n.$ Prove that if every prime that divides $m$ also divides $n,$ then $a_1^k+a_2^k + \dots + a_m^k$ is divisible by $m$ for every positive integer $k.$

Day 2

Problem 4

Let $p$ be a prime, and let $a_1, \dots, a_p$ be integers. Show that there exists an integer $k$ such that the numbers $a_1 + k, a_2 + 2k, \dots, a_p + pk$ produce at least $\tfrac{1}{2} p$ distinct remainders upon division by $p$ .

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2017年USAMO 真题及答案

2017年USAMO 真题：

Day 1

Problem 1

Prove that there are infinitely many distinct pairs $(a,b)$ of relatively prime positive integers $a > 1$ and $b > 1$ such that $a^b + b^a$ is divisible by $a + b.$

Problem 2

Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$ , define an $A$ -inversion of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds: $a_i \ge w_i > w_j,$ $w_j > a_i \ge w_i,$ or $w_i > w_j > a_i.$ Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$ , and for any positive integer $k$ , the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$ -inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$ -inversions.

Problem 3

( $*$ ) Let $ABC$ be a scalene triangle with circumcircle $\Omega$ and incenter $I$ . Ray $AI$ meets $\overline{BC}$ at $D$ and meets $\Omega$ again at $M$ ; the circle with diameter $\overline{DM}$ cuts $\Omega$ again at $K$ . Lines $MK$ and $BC$ meet at $S$ , and $N$ is the midpoint of $\overline{IS}$ . The circumcircles of $\triangle KID$ and $\triangle MAN$ intersect at points $L_1$ and $L_2$ . Prove that $\Omega$ passes through the midpoint of either $\overline{IL_1}$ or $\overline{IL_2}$ .

Day 2

Problem 4

Let $P_1$ , $P_2$ , $\dots$ , $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$ , other than $(1,0)$ . Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$ , $R_2$ , $\dots$ , $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$ . Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$ , and so on, until we have labeled all of the blue points $B_1, \dots, B_n$ . Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2016年USAMO 真题及答案

2016年USAMO 真题：

Day 1

Problem 1

Let $X_1, X_2, \ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$ . Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$ , that is, $X_i\cap X_{i+1}=\emptyset$ and $X_i\cup X_{i+1}\neq S$ , for all $i\in\{1, \ldots, 99\}$ . Find the smallest possible number of elements in $S$ .

Problem 2

Prove that for any positive integer $k,$ $\left(k^2\right)!\cdot\prod_{j=0}^{k-1}\frac{j!}{\left(j+k\right)!}$ is an integer.

Problem 3

Let $\triangle ABC$ be an acute triangle, and let $I_B, I_C,$ and $O$ denote its $B$ -excenter, $C$ -excenter, and circumcenter, respectively. Points $E$ and $Y$ are selected on $\overline{AC}$ such that $\angle ABY = \angle CBY$ and $\overline{BE}\perp\overline{AC}.$ Similarly, points $F$ and $Z$ are selected on $\overline{AB}$ such that $\angle ACZ = \angle BCZ$ and $\overline{CF}\perp\overline{AB}.$

Lines $\overleftrightarrow{I_B F}$ and $\overleftrightarrow{I_C E}$ meet at $P.$ Prove that $\overline{PO}$ and $\overline{YZ}$ are perpendicular.

Day 2

Problem 4

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all real numbers $x$ and $y$ , $(f(x)+xy)\cdot f(x-3y)+(f(y)+xy)\cdot f(3x-y)=(f(x+y))^2.$

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2015年USAMO 真题及答案

2015年USAMO 真题：

Day 1

Problem 1

Solve in integers the equation $x^2+xy+y^2 = \left(\frac{x+y}{3}+1\right)^3.$

Problem 2

Quadrilateral $APBQ$ is inscribed in circle $\omega$ with $\angle P = \angle Q = 90^{\circ}$ and $AP = AQ < BP$ . Let $X$ be a variable point on segment $\overline{PQ}$ . Line $AX$ meets $\omega$ again at $S$ (other than $A$ ). Point $T$ lies on arc $AQB$ of $\omega$ such that $\overline{XT}$ is perpendicular to $\overline{AX}$ . Let $M$ denote the midpoint of chord $\overline{ST}$ . As $X$ varies on segment $\overline{PQ}$ , show that $M$ moves along a circle.

Problem 3

Let $S = \{1, 2, ..., n\}$ , where $n \ge 1$ . Each of the $2^n$ subsets of $S$ is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set $T \subseteq S$ , we then write $f(T)$ for the number of subsets of T that are blue.

Determine the number of colorings that satisfy the following condition: for any subsets $T_1$ and $T_2$ of $S$ , $f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2).$

Day 2

Problem 4

Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform stone moves, defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$ , such that $i<j$ and $k<l$ . A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively, or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively.

Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.

How many different non-equivalent ways can Steve pile the stones on the grid?

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2019年USAMO 真题及答案

2019年USAMO 真题：

Day 1

Note: For any geometry problem whose statement begins with an asterisk $(*)$ , the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 1

Let $\mathbb{N}$ be the set of positive integers. A function $f:\mathbb{N}\to\mathbb{N}$ satisfies the equation $\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}$ for all positive integers $n$ . Given this information, determine all possible values of $f(1000)$ .

Problem 2

Let $ABCD$ be a cyclic quadrilateral satisfying $AD^2 + BC^2 = AB^2$ . The diagonals of $ABCD$ intersect at $E$ . Let $P$ be a point on side $\overline{AB}$ satisfying $\angle APD = \angle BPC$ . Show that line $PE$ bisects $\overline{CD}$ .

Problem 3

Let $K$ be the set of all positive integers that do not contain the digit $7$ in their base- $10$ representation. Find all polynomials $f$ with nonnegative integer coefficients such that $f(n)\in K$ whenever $n\in K$ .

Day 2

Problem 4

Let $n$ be a nonnegative integer. Determine the number of ways that one can choose $(n+1)^2$ sets $S_{i,j}\subseteq\{1,2,\ldots,2n\}$ , for integers $i,j$ with $0\leq i,j\leq n$ , such that: for all $0\leq i,j\leq n$ , the set $S_{i,j}$ has $i+j$ elements; and $S_{i,j}\subseteq S_{k,l}$ whenever $0\leq i\leq k\leq n$ and $0\leq j\leq l\leq n$ .

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2010年AMC 10B 真题及答案

2010年AMC 10B 真题：

Problem 1

What is $100(100-3)-(100\cdot100-3)$ ?

$\textbf{(A)}\ -20,000 \qquad \textbf{(B)}\ -10,000 \qquad \textbf{(C)}\ -297 \qquad \textbf{(D)}\ -6 \qquad \textbf{(E)}\ 0$

Problem 2

Markala attended two meetings during her $9$ -hour work day. The first meeting took $45$ minutes and the second meeting took twice as long. What percent of her work day was spent attending meetings?

$\textbf{(A)}\ 15 \qquad \textbf{(B)}\ 20 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 30 \qquad \textbf{(E)}\ 35$

Problem 3

A drawer contains red, green, blue, and white socks with at least 2 of each color. What is the minimum number of socks that must be pulled from the drawer to guarantee a matching pair?

$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$

Problem 4

For a real number $x$ , define $\heartsuit(x)$ to be the average of $x$ and $x^2$ . What is $\heartsuit(1)+\heartsuit(2)+\heartsuit(3)$ ?

$\textbf{(A)}\ 3 \qquad \textbf{(B)}\ 6 \qquad \textbf{(C)}\ 10 \qquad \textbf{(D)}\ 12 \qquad \textbf{(E)}\ 20$

Problem 5

A month with $31$ days has the same number of Mondays and Wednesdays. How many of the seven days of the week could be the first day of this month?

$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

Problem 6

A circle is centered at $O$ , $\overline{AB}$ is a diameter and $C$ is a point on the circle with $\angle COB = 50^\circ$ . What is the degree measure of $\angle CAB$ ?

$\textbf{(A)}\ 20 \qquad \textbf{(B)}\ 25 \qquad \textbf{(C)}\ 45 \qquad \textbf{(D)}\ 50 \qquad \textbf{(E)}\ 65$

Problem 7

A triangle has side lengths $10$ , $10$ , and $12$ . A rectangle has width $4$ and area equal to the area of the triangle. What is the perimeter of this rectangle?

$\textbf{(A)}\ 16 \qquad \textbf{(B)}\ 24 \qquad \textbf{(C)}\ 28 \qquad \textbf{(D)}\ 32 \qquad \textbf{(E)}\ 36$

以下是我们为您整理的真题试卷，扫码即可免费领取完整版：

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

2010年AMC 10A 真题及答案

2010年AMC 10A 真题：

Problem 1

Mary’s top book shelf holds five books with the following widths, in centimeters: $6$ , $\dfrac{1}{2}$ , $1$ , $2.5$ , and $10$ . What is the average book width, in centimeters?

$\mathrm{(A)}\ 1 \qquad \mathrm{(B)}\ 2 \qquad \mathrm{(C)}\ 3 \qquad \mathrm{(D)}\ 4 \qquad \mathrm{(E)}\ 5$

Problem 2

Four identical squares and one rectangle are placed together to form one large square as shown. The length of the rectangle is how many times as large as its width?

$[asy] unitsize(8mm); defaultpen(linewidth(.8pt)); draw((0,0)--(4,0)--(4,4)--(0,4)--cycle); draw((0,3)--(0,4)--(1,4)--(1,3)--cycle); draw((1,3)--(1,4)--(2,4)--(2,3)--cycle); draw((2,3)--(2,4)--(3,4)--(3,3)--cycle); draw((3,3)--(3,4)--(4,4)--(4,3)--cycle); [/asy]$ $\mathrm{(A)}\ \dfrac{5}{4} \qquad \mathrm{(B)}\ \dfrac{4}{3} \qquad \mathrm{(C)}\ \dfrac{3}{2} \qquad \mathrm{(D)}\ 2 \qquad \mathrm{(E)}\ 3$

Problem 3

Tyrone had $97$ marbles and Eric had $11$ marbles. Tyrone then gave some of his marbles to Eric so that Tyrone ended with twice as many marbles as Eric. How many marbles did Tyrone give to Eric?

$\mathrm{(A)}\ 3 \qquad \mathrm{(B)}\ 13 \qquad \mathrm{(C)}\ 18 \qquad \mathrm{(D)}\ 25 \qquad \mathrm{(E)}\ 29$

Problem 4

A book that is to be recorded onto compact discs takes $412$ minutes to read aloud. Each disc can hold up to $56$ minutes of reading. Assume that the smallest possible number of discs is used and that each disc contains the same length of reading. How many minutes of reading will each disc contain?