User:Rowechen

Revision as of 08:00, 30 May 2020 by Rowechen (talk | contribs)

Here's the AIME compilation I will be doing:

Problem 1

The 8 eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of 50 mm and a length of 80 mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least 200 mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters.

[asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy] Solution

Compute, to the nearest integer, the area of the region enclosed by the graph of

\[13x^2-20xy+52y^2-10x+52y=563\]

Problem 6

A flat board has a circular hole with radius $1$ and a circular hole with radius $2$ such that the distance between the centers of the two holes is $7$. Two spheres with equal radii sit in the two holes such that the spheres are tangent to each other. The square of the radius of the spheres is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 9

Let $x$ and $y$ be real numbers such that $\frac{\sin x}{\sin y} = 3$ and $\frac{\cos x}{\cos y} = \frac12$. The value of $\frac{\sin 2x}{\sin 2y} + \frac{\cos 2x}{\cos 2y}$ can be expressed in the form $\frac pq$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Solution

Problem 9

Let $x_1< x_2 < x_3$ be the three real roots of the equation $\sqrt{2014} x^3 - 4029x^2 + 2 = 0$. Find $x_2(x_1+x_3)$.

Solution

Problem 9

Let $S$ be the set of all ordered triple of integers $(a_1,a_2,a_3)$ with $1 \le a_1,a_2,a_3 \le 10$. Each ordered triple in $S$ generates a sequence according to the rule $a_n=a_{n-1}\cdot | a_{n-2}-a_{n-3} |$ for all $n\ge 4$. Find the number of such sequences for which $a_n=0$ for some $n$.

Solution


Problem 12

Suppose that the angles of $\triangle ABC$ satisfy $\cos(3A)+\cos(3B)+\cos(3C)=1$. Two sides of the triangle have lengths 10 and 13. There is a positive integer $m$ so that the maximum possible length for the remaining side of $\triangle ABC$ is $\sqrt{m}$. Find $m$.

Solution

Problem 11

Consider arrangements of the $9$ numbers $1, 2, 3, \dots, 9$ in a $3 \times 3$ array. For each such arrangement, let $a_1$, $a_2$, and $a_3$ be the medians of the numbers in rows $1$, $2$, and $3$ respectively, and let $m$ be the median of $\{a_1, a_2, a_3\}$. Let $Q$ be the number of arrangements for which $m = 5$. Find the remainder when $Q$ is divided by $1000$.

Solution

Problem 10

The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point $A$. At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path $AJABCHCHIJA$, which has $10$ steps. Let $n$ be the number of paths with $15$ steps that begin and end at point $A.$ Find the remainder when $n$ is divided by $1000$.

[asy] size(6cm);  draw(unitcircle); draw(scale(2) * unitcircle); for(int d = 90; d < 360 + 90; d += 72){ draw(2 * dir(d) -- dir(d)); }  dot(1 * dir( 90), linewidth(5)); dot(1 * dir(162), linewidth(5)); dot(1 * dir(234), linewidth(5)); dot(1 * dir(306), linewidth(5)); dot(1 * dir(378), linewidth(5)); dot(2 * dir(378), linewidth(5)); dot(2 * dir(306), linewidth(5)); dot(2 * dir(234), linewidth(5)); dot(2 * dir(162), linewidth(5)); dot(2 * dir( 90), linewidth(5));  label("$A$", 1 * dir( 90), -dir( 90)); label("$B$", 1 * dir(162), -dir(162)); label("$C$", 1 * dir(234), -dir(234)); label("$D$", 1 * dir(306), -dir(306)); label("$E$", 1 * dir(378), -dir(378)); label("$F$", 2 * dir(378), dir(378)); label("$G$", 2 * dir(306), dir(306)); label("$H$", 2 * dir(234), dir(234)); label("$I$", 2 * dir(162), dir(162)); label("$J$", 2 * dir( 90), dir( 90)); [/asy]

Solution

Problem 11

Find the least positive integer $n$ such that when $3^n$ is written in base $143$, its two right-most digits in base $143$ are $01$.


Solution

Problem 14

In $\triangle ABC$, $AB=10$, $\measuredangle A=30^{\circ}$, and $\measuredangle C=45^{\circ}$. Let $H$, $D$, and $M$ be points on line $\overline{BC}$ such that $AH\perp BC$, $\measuredangle BAD=\measuredangle CAD$, and $BM=CM$. Point $N$ is the midpoint of segment $HM$, and point $P$ is on ray $AD$ such that $PN\perp BC$. Then $AP^2=\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 14

For each integer $n \ge 2$, let $A(n)$ be the area of the region in the coordinate plane defined by the inequalities $1\le x \le n$ and $0\le y \le x \left\lfloor \sqrt x \right\rfloor$, where $\left\lfloor \sqrt x \right\rfloor$ is the greatest integer not exceeding $\sqrt x$. Find the number of values of $n$ with $2\le n \le 1000$ for which $A(n)$ is an integer.

Solution


Problem 13

Let $\triangle ABC$ have side lengths $AB=30$, $BC=32$, and $AC=34$. Point $X$ lies in the interior of $\overline{BC}$, and points $I_1$ and $I_2$ are the incenters of $\triangle ABX$ and $\triangle ACX$, respectively. Find the minimum possible area of $\triangle AI_1I_2$ as $X$ varies along $\overline{BC}$.

Solution

Problem 15

David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, $A,\text{ }B,\text{ }C$, which can each be inscribed in a circle with radius $1$. Let $\varphi_A$ denote the measure of the acute angle made by the diagonals of quadrilateral $A$, and define $\varphi_B$ and $\varphi_C$ similarly. Suppose that $\sin\varphi_A=\frac{2}{3}$, $\sin\varphi_B=\frac{3}{5}$, and $\sin\varphi_C=\frac{6}{7}$. All three quadrilaterals have the same area $K$, which can be written in the form $\dfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution

Problem 13

Misha rolls a standard, fair six-sided die until she rolls 1-2-3 in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution