Difference between revisions of "2019 AIME I Problems"

Revision as of 18:25, 14 March 2019

Problem 1

Consider the integer $N = 9 + 99 + 999 + 9999 + \cdots + \underbrace{99\ldots 99}_\text{321 digits}.$ Find the sum of the digits of $N$ .

Problem 2

Jenn randomly chooses a number $J$ from $1, 2, 3,\ldots, 19, 20$ . Bela then randomly chooses a number $B$ from $1, 2, 3,\ldots, 19, 20$ distinct from $J$ . The value of $B - J$ is at least $2$ with a probability that can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ .

Problem 3

In $\triangle PQR$ , $PR=15$ , $QR=20$ , and $PQ=25$ . Points $A$ and $B$ lie on $\overline{PQ}$ , points $C$ and $D$ lie on $\overline{QR}$ , and points $E$ and $F$ lie on $\overline{PR}$ , with $PA=QB=QC=RD=RE=PF=5$ . Find the area of hexagon $ABCDEF$ .

Problem 4

A soccer team has 22 available players. A fixed set of 11 players starts the game, while the other 11 are available as substitutes. During the game, the coach may make as many as 3 substitutions, where any one of the 11 players in the game is replaced by one of the substitutes. No player removed from the game may reenter the game, although a substitute entering the game may be replaced later. No two substitutions can happen at the same time. The players involved and the order of the substitutions matter. Let $n$ be the number of ways the coach can make substitutions during the game (including the possibility of making no substitutions). Find the remainder when $n$ is divided by 1000.

Problem 5

A moving particle starts at the point $(4,4)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $(a,b)$ , it moves at random to one of the points $(a-1,b)$ , $(a,b-1)$ , or $(a-1,b-1)$ , each with probability $\frac{1}{3}$ , independently of its previous moves. The probability that it will hit the coordinate axes at $(0,0)$ is $\frac{m}{3^n}$ , where $m$ and $n$ are positive integers. Find $m + n$ .

Problem 6

In convex quadrilateral $KLMN$ side $\overline{MN}$ is perpendicular to diagonal $\overline{KM}$ , side $\overline{KL}$ is perpendicular to diagonal $\overline{LN}$ , $MN = 65$ , and $KL = 28$ . The line through $L$ perpendicular to side $\overline{KN}$ intersects diagonal $\overline{KM}$ at $O$ with $KO = 8$ . Find $MO$ .

Problem 7

There are positive integers $x$ and $y$ that satisfy the system of equations $\log_{10} x + 2 \log_{10} (\gcd(x,y)) = 60$ $\log_{10} y + 2 \log_{10} (\text{lcm}(x,y)) = 570.$ \end{align*}Let $m$ be the number of (not necessarily distinct) prime factors in the prime factorization of $x$ , and let $n$ be the number of (not necessarily distinct) prime factors in the prime factorization of $y$ . Find $3m+2n$ .

Problem 8

Let $x$ be a real number such that $\sin^{10}x+\cos^{10} x = \tfrac{11}{36}$ . Then $\sin^{12}x+\cos^{12} x = \tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ .

@@ Line 26: / Line 26: @@
 There are positive integers <math>x</math> and <math>y</math> that satisfy the system of equations
-\begin{align*}
+<cmath>\log_{10} x + 2 \log_{10} (\gcd(x,y)) = 60</cmath> <cmath>\log_{10} y + 2 \log_{10} (\text{lcm}(x,y)) = 570.</cmath>
-\log_{10} x + 2 \log_{10} (\gcd(x,y)) &= 60 \\ \log_{10} y + 2 \log_{10} (\text{lcm}(x,y)) &= 570.
 \end{align*}Let <math>m</math> be the number of (not necessarily distinct) prime factors in the prime factorization of <math>x</math>, and let <math>n</math> be the number of (not necessarily distinct) prime factors in the prime factorization of <math>y</math>. Find <math>3m+2n</math>.

Page

Toolbox

Search