problem_id
stringlengths 32
32
| link
stringlengths 75
84
| problem
stringlengths 14
5.33k
| solution
stringlengths 15
6.63k
| letter
stringclasses 5
values | answer
stringclasses 957
values |
|---|---|---|---|---|---|
bf3ffc78287fe32fa9ccb286343337b3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_7 | Let $a, b, c,$ and $d$ be real numbers that satisfy the system of equations \begin{align*} a + b &= -3, \\ ab + bc + ca &= -4, \\ abc + bcd + cda + dab &= 14, \\ abcd &= 30. \end{align*} There exist relatively prime positive integers $m$ and $n$ such that \[a^2 + b^2 + c^2 + d^2 = \frac{m}{n}.\] Find $m + n$ | Let the four equations from top to bottom be listed 1 through 4 respectively. We factor equation 3 like so: \[abc+d(ab+bc+ca)=14\] Then we plug in equation 2 to receive $abc-4d=14$ . By equation 4 we get $abc=\frac{30}{d}$ . Plugging in, we get $\frac{30}{d}-4d=14$ . Multiply by $d$ on both sides to get the quadratic equation $4d^2+14d-30=0$ . Solving using the quadratic equation, we receive $d=\frac{3}{2},d=-5$ . So, we have to test which one is correct. We repeat a similar process as we did above for equations 1 and 2. We factor equation 2 to get \[ab+c(a+b)=-4\] After plugging in equation 1, we get $ab-3c=-4$ . Now we convert it into a quadratic to receive $3c^2-4c-abc=0$ . The value of $abc$ will depend on $d$ . So we obtain the discriminant $16+12abc$ .
Let d = -5.
Then $abc = \frac{30}{-5}$ , so $abc=-6$ , discriminant is $16-72$ , which makes this a dead end. Thus $d=\frac{3}{2}$ For $d=\frac{3}{2}$ , making $abc=20$ . This means the discriminant is just $256$ , so we obtain two values for $c$ as well. We get either $c=\frac{10}{3}$ or $c=-2$ . So, we must AGAIN test which one is correct.
We know $ab=3c-4$ , and $a+b=-3$ , so we use these values for testing.
Let $c=\frac{10}{3}$ .
Then $ab=6$ , so $a=\frac{6}{b}$ . We thus get $\frac{6}{b}+b=-3$ , which leads to the quadratic $b^2+3b+6$ . The discriminant for this is $9-24$ . That means this value of $c$ is wrong, so $c=-2$ . Thus we get polynomial $b^2+3b-10$ . The discriminant this time is $49$ , so we get two values for $b$ . Through simple inspection, you may see they are interchangeable, as if you take the value $b=2$ , you get $a=-5$ . If you take the value $b=-5$ , you get $a=2$ . So it doesn't matter. That means the sum of all their squares is \[\frac{9}{4}+4+4+25=\frac{141}{4}\] so the answer is $141+4=\boxed{145}.$ ~amcrunner | null | 145 |
bf3ffc78287fe32fa9ccb286343337b3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_7 | Let $a, b, c,$ and $d$ be real numbers that satisfy the system of equations \begin{align*} a + b &= -3, \\ ab + bc + ca &= -4, \\ abc + bcd + cda + dab &= 14, \\ abcd &= 30. \end{align*} There exist relatively prime positive integers $m$ and $n$ such that \[a^2 + b^2 + c^2 + d^2 = \frac{m}{n}.\] Find $m + n$ | Let the four equations from top to bottom be listed $(1)$ through $(4)$ respectively. Multiplying both sides of $(3)$ by $d$ and factoring some terms gives us $abcd + d^2(ab + ac + bc) = 14d$ . Substituting using equations $(4)$ and $(2)$ gives us $30 -4 d^2 = 14d$ , and solving gives us $d = -5$ or $d = \frac{3}{2}$ . Plugging this back into $(3)$ gives us $abc + d(ab + ac + bc) = abc + (-5)(-4) = abc + 20 = 14$ , or using the other solution for $d$ gives us $abc - 6 = 14$ . Solving both of these equations gives us $abc = -6$ when $d = -5$ and $abc = 14$ when $d = \frac{3}{2}$
Multiplying both sides of $(2)$ by $c$ and factoring some terms gives us $abc + c^2 (a + b) = abc -3c^2 = -4c$ . Testing $abc = -6$ will give us an imaginary solution for $c$ , so therefore $abc = 14$ and $d = \frac{3}{2}$ . This gets us $14 - 3c^2 = -4c$ . Solving for $c$ gives us $c = \frac{3}{10}$ or $c = -2$ . With a bit of testing, we can see that the correct value of $c$ is $c=-2$ . Now we know $a+b = -3$ and $ab + bc + ca = ab + c(a+b) = ab + 6 = -4$ $ab = -10$ , and it is obvious that $a = -5$ and $b = 2$ or the other way around, and therefore, $a^2 + b^2 + c^2 + d^2 = 25 + 4 + 4 + \frac{9}{4} = \frac{141}{4}$ , giving us the answer $141 + 4 = \boxed{145}$ ~hihitherethere | null | 145 |
1764eb0d05c9a69bcfcc8bad68335175 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_8 | An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | For all positive integers $k,$ let
The base case occurs at $k=1,$ from which $\left(N(1,\mathrm{BB}),N(1,\mathrm{BT}),N(1,\mathrm{TB}),N(1,\mathrm{TT})\right)=(2,1,0,0).$
Suppose the ant makes exactly $k$ moves for some $k\geq2.$ We perform casework on its last move:
Alternatively, this recursion argument is illustrated below, where each dashed arrow indicates $1$ way, and each solid arrow indicates $2$ ways: [asy] /* Made by MRENTHUSIASM */ size(9cm); pair A, B, C, D, E, F, G, H, X, Y; A=(0,6); B=(0,4); C=(0,2); D=(0,0); E=(10,6); F=(10,4); G=(10,2); H=(10,0); X=(-1,8); Y=(11,8); label("BB", A, (-2,0)); label("BT", B, (-2,0)); label("TB", C, (-2,0)); label("TT", D, (-2,0)); label("BB", E, (2,0)); label("BT", F, (2,0)); label("TB", G, (2,0)); label("TT", H, (2,0)); label("\textbf{The \boldmath{$k$}th Move}", shift(0.3,0)*X); label("\textbf{The \boldmath{$(k+1)$}th Move}", shift(-0.3,-0.085)*Y); draw(A--E,0.8+black+dashed,EndArrow); draw(A--F,0.8+black+dashed,EndArrow); draw(B--H,0.8+black,EndArrow); draw(C--E,0.8+black,EndArrow); draw(D--G,0.8+black+dashed,EndArrow); draw(D--H,0.8+black+dashed,EndArrow); dot(A^^B^^C^^D^^E^^F^^G^^H, 5+black); [/asy] Therefore, we have the following relationships: \begin{align*} N(1,\mathrm{BB})&=2, \\ N(1,\mathrm{BT})&=1, \\ N(1,\mathrm{TB})&=0, \\ N(1,\mathrm{TT})&=0, \\ N(k+1,\mathrm{BB})&=N(k,\mathrm{BB})+2\cdot N(k,\mathrm{TB}), \\ N(k+1,\mathrm{BT})&=N(k,\mathrm{BB}), \\ N(k+1,\mathrm{TB})&=N(k,\mathrm{TT}), \\ N(k+1,\mathrm{TT})&=N(k,\mathrm{TT})+2\cdot N(k,\mathrm{BT}). \end{align*} Using these equations, we recursively fill out the table below: \[\begin{array}{c||c|c|c|c|c|c|c|c} \hspace{7mm}&\hspace{6.5mm}&\hspace{6.5mm}&\hspace{6.75mm}&\hspace{6.75mm}&\hspace{6.75mm}&\hspace{6.75mm}&& \\ [-2.5ex] \boldsymbol{k} & \boldsymbol{1} & \boldsymbol{2} & \boldsymbol{3} & \boldsymbol{4} & \boldsymbol{5} & \boldsymbol{6} & \boldsymbol{7} & \boldsymbol{8} \\ \hline \hline &&&&&&&& \\ [-2.25ex] \boldsymbol{N(k,\mathrm{BB})} &2&2&2&6&18&38&66&118 \\ \hline &&&&&&&& \\ [-2.25ex] \boldsymbol{N(k,\mathrm{BT})} &1&2&2&2&6&18&38&66 \\ \hline &&&&&&&& \\ [-2.25ex] \boldsymbol{N(k,\mathrm{TB})} &0&0&2&6&10&14&26&62 \\ \hline &&&&&&&& \\ [-2.25ex] \boldsymbol{N(k,\mathrm{TT})} &0&2&6&10&14&26&62&138 \\ \hline \hline &&&&&&&& \\ [-2.25ex] \textbf{Total}&\boldsymbol{3}&\boldsymbol{6}&\boldsymbol{12}&\boldsymbol{24}&\boldsymbol{48}&\boldsymbol{96}&\boldsymbol{192}&\boldsymbol{384} \end{array}\] By the Multiplication Principle, there are $3\cdot2^{k-1}$ ways to make exactly $k$ moves. So, we must get \[N(k,\mathrm{BB})+N(k,\mathrm{BT})+N(k,\mathrm{TB})+N(k,\mathrm{TT})=3\cdot2^{k-1}\] for all values of $k.$
Finally, the requested probability is \[\frac{N(8,\mathrm{BT})+N(8,\mathrm{TT})}{N(8,\mathrm{BB})+N(8,\mathrm{BT})+N(8,\mathrm{TB})+N(8,\mathrm{TT})}=\frac{66+138}{118+66+62+138}=\frac{204}{384}=\frac{17}{32},\] from which the answer is $17+32=\boxed{049}.$ | null | 049 |
1764eb0d05c9a69bcfcc8bad68335175 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_8 | An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | Let the state from bottom to top be $B2T,$ from top to top be $T2T,$ from top to bottom be $T2B,$ and from bottom to bottom be $B2B.$ We can draw the following State Transition Diagram with Markov Chain . The numbers on the transition arc are the transition probabilities.
The probabilities of being in a state after $n$ steps and after $n-1$ steps has the following relationships: \begin{align*} B2T(n) &= B2B(n-1) \cdot \frac12\\ T2T(n) &= B2T(n-1) + T2T(n-1) \cdot \frac12\\ T2B(n) &= T2T(n-1) \cdot \frac12\\ B2B(n) &= T2B(n-1) + B2B(n-1) \cdot \frac12 \end{align*} Those probabilities are calculated by Dynamic Programming in the following table: \[\begin{array}{c|cccc} & & & & \\ [-2ex] n & B2T(n) & T2T(n) & T2B(n) & B2B(n) \\ [1ex] \hline & & & & \\ [-1ex] 1 & \frac13 & 0 & 0 & \frac23\\ & & & & \\ 2 & \frac23 \cdot \frac12 = \frac13 & \frac13 & 0 & \frac23 \cdot \frac12 = \frac13 \\ & & & & \\ 3 & \frac13 \cdot \frac12 = \frac16 & \frac13 + \frac13 \cdot \frac12 = \frac12 & \frac13 \cdot \frac12 = \frac16 & \frac13 \cdot \frac12 = \frac16 \\ & & & & \\ 4 & \frac16 \cdot \frac12 = \frac{1}{12} & \frac16 + \frac12 \cdot \frac12 = \frac{5}{12} & \frac12 \cdot \frac12 = \frac14 & \frac16 + \frac16 \cdot \frac12 = \frac14 \\ & & & & \\ 5 & \frac14 \cdot \frac12 = \frac18 & \frac{1}{12} + \frac{5}{12} \cdot \frac{1}{2} = \frac{7}{24} & \frac{5}{12} \cdot \frac12 = \frac{5}{24} & \frac14 + \frac14 \cdot \frac12 = \frac38 \\ & & & & \\ 6 & \frac38 \cdot \frac12 = \frac{3}{16} & \frac18 + \frac{7}{24} \cdot \frac12 = \frac{13}{48} & \frac{7}{24} \cdot \frac12 = \frac{7}{48} & \frac{5}{24} + \frac38 \cdot \frac12 = \frac{19}{48} \\ & & & & \\ 7 & \frac{19}{48} \cdot \frac12 = \frac{19}{96}& \frac{3}{16} + \frac{13}{48} \cdot \frac{1}{2} = \frac{31}{96}& \frac{13}{48} \cdot \frac{1}{2} = \frac{13}{96} & \frac{7}{48} + \frac{19}{48} \cdot \frac12 = \frac{11}{32}\\ & & & & \\ 8 & \frac{11}{32} \cdot \frac{1}{2} = \frac{11}{64} & \frac{19}{96} + \frac{31}{96} \cdot \frac12 = \frac{23}{64} & \frac{31}{96} \cdot \frac12 = \frac{31}{192} & \frac{13}{96} + \frac{11}{32} \cdot \frac12 = \frac{59}{192} \\ [1ex] \end{array}\] Finally, the requested probability is $\frac{11}{64} + \frac{23}{64} = \frac{17}{32},$ from which the answer is $17 + 32 = \boxed{049}.$ | null | 049 |
1764eb0d05c9a69bcfcc8bad68335175 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_8 | An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | Note that we don't care which exact vertex the ant is located at, just which level (either top face or bottom face).
Consider the ant to be on any of the two levels and having moved at least one move. Define $p_i$ to be the probability that after $i$ moves, the ant ends up on the level it started on.
On the first move, the ant can stay on the bottom level with $\frac{2}{3}$ chance and $7$ moves left. Or, it can move to the top level with $\frac{1}{3}$ chance and $6$ moves left (it has to spend another on the top as it can not return immediately). So the requested probability is $P = \frac{2}{3}(1 - p_7) + \frac{1}{3}p_6$
Consider when the ant has $i$ moves left (and it's not the ant's first move). It can either stay on its current level with $\frac{1}{2}$ chance and $i - 1$ moves left, or travel to the opposite level with $\frac{1}{2}$ chance, then move to another vertex on the opposite level, to have $i - 2$ moves left. Thus we obtain the recurrence \[p_i = \frac{1}{2}p_{i - 1} + \frac{1}{2}(1 - p_{i - 2})\]
Computing $p_i$ with the starting conditions $p_0 = 1$ and $p_1 = \frac{1}{2}$ , we obtain $p_6 = \frac{33}{64}$ and $p_7 = \frac{59}{128}$ . Hence $P = \frac{2}{3}(1 - p_7) + \frac{1}{3}p_6= \frac{17}{32}$ as desired; $\boxed{049}$ | null | 049 |
1764eb0d05c9a69bcfcc8bad68335175 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_8 | An ant makes a sequence of moves on a cube where a move consists of walking from one vertex to an adjacent vertex along an edge of the cube. Initially the ant is at a vertex of the bottom face of the cube and chooses one of the three adjacent vertices to move to as its first move. For all moves after the first move, the ant does not return to its previous vertex, but chooses to move to one of the other two adjacent vertices. All choices are selected at random so that each of the possible moves is equally likely. The probability that after exactly $8$ moves that ant is at a vertex of the top face on the cube is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n.$ | On each move, we can either stay on the level we previously were (stay on the bottom/top) or switch levels (go from top to bottom and vise versa). Since we start on the bottom, ending on the top means that we will have to switch an odd number of times; since we cannot switch twice in a row, over an eight-move period we can either make one or three switches. Furthermore, once we switch to a level we can choose one of two directions of traveling on that level: clockwise or counterclockwise (since we can't go back to our previous move, our first move on the level after switching determines our direction).
Our probability is then $\frac{176 + 28}{3 \cdot 2^7} = \frac{17}{32}$ , so the answer is $17+32=\boxed{049}$ | null | 049 |
f4548af43141835ff768574118b4a842 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_9 | Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1$ | This solution refers to the Remarks section.
By the Euclidean Algorithm, we have \[\gcd\left(2^m+1,2^m-1\right)=\gcd\left(2,2^m-1\right)=1.\] We are given that $\gcd\left(2^m+1,2^n-1\right)>1.$ Multiplying both sides by $\gcd\left(2^m-1,2^n-1\right)$ gives \begin{align*} \gcd\left(2^m+1,2^n-1\right)\cdot\gcd\left(2^m-1,2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \\ \gcd\left(\left(2^m+1\right)\left(2^m-1\right),2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \hspace{12mm} &&\text{by }\textbf{Claim 1} \\ \gcd\left(2^{2m}-1,2^n-1\right)&>\gcd\left(2^m-1,2^n-1\right) \\ 2^{\gcd(2m,n)}-1&>2^{\gcd(m,n)}-1 &&\text{by }\textbf{Claim 2} \\ \gcd(2m,n)&>\gcd(m,n), \end{align*} which implies that $n$ must have more factors of $2$ than $m$ does.
We construct the following table for the first $30$ positive integers: \[\begin{array}{c|c|c} && \\ [-2.5ex] \boldsymbol{\#}\textbf{ of Factors of }\boldsymbol{2} & \textbf{Numbers} & \textbf{Count} \\ \hline && \\ [-2.25ex] 0 & 1,3,5,7,9,11,13,15,17,19,21,23,25,27,29 & 15 \\ && \\ [-2.25ex] 1 & 2,6,10,14,18,22,26,30 & 8 \\ && \\ [-2.25ex] 2 & 4,12,20,28 & 4 \\ && \\ [-2.25ex] 3 & 8,24 & 2 \\ && \\ [-2.25ex] 4 & 16 & 1 \\ \end{array}\] To count the ordered pairs $(m,n),$ we perform casework on the number of factors of $2$ that $m$ has:
Together, the answer is $225+56+12+2=\boxed{295}.$ | null | 295 |
a966758859d1b6e03044f61177716ff6 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_10 | Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$ . The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$ . The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | This solution refers to the Diagram section.
As shown below, let $O_1,O_2,O_3$ be the centers of the spheres (where sphere $O_3$ has radius $13$ ) and $T_1,T_2,T_3$ be their respective points of tangency to plane $\mathcal{P}.$ Let $\mathcal{R}$ be the plane that is determined by $O_1,O_2,$ and $O_3.$ Suppose $A$ is the foot of the perpendicular from $O_3$ to line $\ell,$ so $\overleftrightarrow{O_3A}$ is the perpendicular bisector of $\overline{O_1O_2}.$ We wish to find $T_3A.$ [asy] /* Made by MRENTHUSIASM */ size(300); import graph3; import solids; currentprojection=orthographic((1,1/2,0)); triple O1, O2, O3, T1, T2, T3, A, L1, L2; O1 = (0,-36,0); O2 = (0,36,0); O3 = (0,0,-sqrt(1105)); T1 = (864*sqrt(1105)/1105,-36,-828*sqrt(1105)/1105); T2 = (864*sqrt(1105)/1105,36,-828*sqrt(1105)/1105); T3 = (24*sqrt(1105)/85,0,-108*sqrt(1105)/85); A = (0,0,-36*sqrt(1105)/23); L1 = shift(0,-80,0)*A; L2 = shift(0,80,0)*A; draw(surface(L1--L2--(-T2.x,L2.y,T2.z)--(-T1.x,L1.y,T1.z)--cycle),pink); draw(surface(L1--L2--(L2.x,L2.y,40)--(L1.x,L1.y,40)--cycle),gray); draw(shift(O1)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O2)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O3)*rotate(90,O1,O2)*scale3(13)*unithemisphere,red,light=White); draw(surface(L1--L2--(T2.x,L2.y,T2.z)--(T1.x,L1.y,T1.z)--cycle),palegreen); draw(surface(L1--L2--(-T2.x,L2.y,L2.z-abs(T2.z))--(-T1.x,L1.y,L2.z-abs(T1.z))--cycle),palegreen); draw(surface(L1--L2--(L2.x,L2.y,L2.z-abs(T1.z))--(L1.x,L1.y,L1.z-abs(T2.z))--cycle),gray); draw(surface(L1--L2--(T2.x,L2.y,L2.z-abs(T1.z))--(T1.x,L1.y,L1.z-abs(T2.z))--cycle),pink); draw(O1--O2--O3--cycle^^O3--A,dashed); draw(T1--T2--T3--cycle^^T3--A,heavygreen); draw(O1--T1^^O2--T2^^O3--T3,mediumblue+dashed); draw(L1--L2,L=Label("$\ell$",position=EndPoint,align=3*E),red); label("$\mathcal{P}$",midpoint(L1--(T1.x,L1.y,T1.z)),(0,-3,0),heavygreen); label("$\mathcal{Q}$",midpoint(L1--(T1.x,L1.y,L1.z-abs(T2.z))),(0,-3,0),heavymagenta); label("$\mathcal{R}$",O1,(0,-24,0)); dot("$O_1$",O1,(0,-1,1),linewidth(4.5)); dot("$O_2$",O2,(0,1,1),linewidth(4.5)); dot("$O_3$",O3,(0,-1.5,0),linewidth(4.5)); dot("$T_1$",T1,(0,-1,-1),heavygreen+linewidth(4.5)); dot("$T_2$",T2,(0,1,-1),heavygreen+linewidth(4.5)); dot("$T_3$",T3,(0,-1,-1),heavygreen+linewidth(4.5)); dot("$A$",A,(0,0,-2),red+linewidth(4.5)); [/asy] Note that:
Now, we focus on cross-sections $O_1O_3T_3T_1$ and $\mathcal{R}:$
We have the following diagram: [asy] size(300); import graph3; import solids; currentprojection=orthographic((1,1/2,0)); triple O1, O3, T1, T3, A, B, C, D; O1 = (0,-36,0); O3 = (0,0,-sqrt(1105)); T1 = (864*sqrt(1105)/1105,-36,-828*sqrt(1105)/1105); T3 = (24*sqrt(1105)/85,0,-108*sqrt(1105)/85); A = (0,0,-36*sqrt(1105)/23); B = intersectionpoint(O1--O1+100*(O3-O1),T1--T1+100*(T3-T1)); C = (0,-36,-36*sqrt(1105)/23); D = (0,-36,-sqrt(1105)); draw(C--O1--O3--A^^D--O3--B,dashed); draw(T1--T3--A^^T3--B,heavygreen); draw(O1--T1^^O3--T3,mediumblue+dashed); draw(shift(0,-80,0)*A--shift(0,80,0)*A,L=Label("$\ell$",position=EndPoint,align=3*E),red); dot("$O_1$",O1,(0,-1,1),linewidth(4.5)); dot("$O_3$",O3,(0,1,1),linewidth(4.5)); dot("$T_1$",T1,(0,-1,-1),heavygreen+linewidth(4.5)); dot("$T_3$",T3,(0,-1,-1),heavygreen+linewidth(4.5)); dot("$A$",A,(0,0,-2),red+linewidth(4.5)); dot("$B$",B,(0,0,-2),red+linewidth(4.5)); dot("$C$",C,(0,0,-2),red+linewidth(4.5)); dot("$D$",D,(0,-2,0),linewidth(4.5)); [/asy] In cross-section $O_1O_3T_3T_1,$ since $\overline{O_1T_1}\parallel\overline{O_3T_3}$ as discussed, we obtain $\triangle O_1T_1B\sim\triangle O_3T_3B$ by AA, with the ratio of similitude $\frac{O_1T_1}{O_3T_3}=\frac{36}{13}.$ Therefore, we get $\frac{O_1B}{O_3B}=\frac{49+O_3B}{O_3B}=\frac{36}{13},$ or $O_3B=\frac{637}{23}.$
In cross-section $\mathcal{R},$ note that $O_1O_3=49$ and $DO_3=\frac{O_1O_2}{2}=36.$ Applying the Pythagorean Theorem to right $\triangle O_1DO_3,$ we have $O_1D=\sqrt{1105}.$ Moreover, since $\ell\perp\overline{O_1C}$ and $\overline{DO_3}\perp\overline{O_1C},$ we obtain $\ell\parallel\overline{DO_3}$ so that $\triangle O_1CB\sim\triangle O_1DO_3$ by AA, with the ratio of similitude $\frac{O_1B}{O_1O_3}=\frac{49+\frac{637}{23}}{49}.$ Therefore, we get $\frac{O_1C}{O_1D}=\frac{\sqrt{1105}+DC}{\sqrt{1105}}=\frac{49+\frac{637}{23}}{49},$ or $DC=\frac{13\sqrt{1105}}{23}.$
Finally, note that $\overline{O_3T_3}\perp\overline{T_3A}$ and $O_3T_3=13.$ Since quadrilateral $DCAO_3$ is a rectangle, we have $O_3A=DC=\frac{13\sqrt{1105}}{23}.$ Applying the Pythagorean Theorem to right $\triangle O_3T_3A$ gives $T_3A=\frac{312}{23},$ from which the answer is $312+23=\boxed{335}.$ | null | 335 |
a966758859d1b6e03044f61177716ff6 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_10 | Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$ . The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$ . The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | The centers of the three spheres form a $49$ $49$ $72$ triangle. Consider the points at which the plane is tangent to the two bigger spheres; the line segment connecting these two points should be parallel to the $72$ side of this triangle. Take its midpoint $M$ , which is $36$ away from the midpoint $A$ of the $72$ side, and connect these two midpoints.
Now consider the point at which the plane is tangent to the small sphere, and connect $M$ with the small sphere's tangent point $B$ . Extend $\overline{MB}$ through $B$ until it hits the ray from $A$ through the center of the small sphere (convince yourself that these two intersect). Call this intersection $D$ , the center of the small sphere $C$ , we want to find $BD$
By Pythagoras, $AC=\sqrt{49^2-36^2}=\sqrt{1105}$ , and we know that $MA=36$ and $BC=13$ . We know that $\overline{MA}$ and $\overline{BC}$ must be parallel, using ratios we realize that $CD=\frac{13}{23}\sqrt{1105}$ . Apply the Pythagorean theorem to $\triangle BCD$ $BD=\frac{312}{23}$ , so $312 + 23 = \boxed{335}$ | null | 335 |
a966758859d1b6e03044f61177716ff6 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_10 | Two spheres with radii $36$ and one sphere with radius $13$ are each externally tangent to the other two spheres and to two different planes $\mathcal{P}$ and $\mathcal{Q}$ . The intersection of planes $\mathcal{P}$ and $\mathcal{Q}$ is the line $\ell$ . The distance from line $\ell$ to the point where the sphere with radius $13$ is tangent to plane $\mathcal{P}$ is $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | This solution refers to the Diagram section. [asy] /* Made by MRENTHUSIASM */ size(300); import graph3; import solids; currentprojection=orthographic((10,-3,-40)); triple O1, O2, O3, T1, T2, T3, A, L1, L2, M; O1 = (0,-36,0); O2 = (0,36,0); O3 = (0,0,-sqrt(1105)); T1 = (864*sqrt(1105)/1105,-36,-828*sqrt(1105)/1105); T2 = (864*sqrt(1105)/1105,36,-828*sqrt(1105)/1105); T3 = (24*sqrt(1105)/85,0,-108*sqrt(1105)/85); A = (0,0,-36*sqrt(1105)/23); L1 = shift(0,-80,0)*A; L2 = shift(0,80,0)*A; M = midpoint(T1--T2); draw(shift(O1)*rotate(-90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O2)*rotate(-90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O3)*rotate(-90,O1,O2)*scale3(13)*unithemisphere,red,light=White); draw(surface(L1--L2--(L2.x,L2.y,40)--(L1.x,L1.y,40)--cycle),gray); draw(shift(O1)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O2)*rotate(90,O1,O2)*scale3(36)*unithemisphere,yellow,light=White); draw(shift(O3)*rotate(90,O1,O2)*scale3(13)*unithemisphere,red,light=White); draw(surface(T2--T1--T3--A--cycle),cyan); draw(surface(L1--L2--(L2.x,L2.y,L2.z-abs(T1.z))--(L1.x,L1.y,L1.z-abs(T2.z))--cycle),gray); draw(T1--T2--T3--cycle^^M--A--T2,blue); dot("$O_1$",O1,(0,-1,1),linewidth(4.5)); dot("$O_2$",O2,(0,1,1),linewidth(4.5)); dot("$O$",O3,(0.5,-1,0),linewidth(4.5)); dot("$T_1$",T1,(0,-1,-1),blue+linewidth(4.5)); dot("$T_2$",T2,(0,1,-1),blue+linewidth(4.5)); dot("$T$",T3,(1,1,2),blue+linewidth(4.5)); dot("$M$",M,(0,0,5),blue+linewidth(4.5)); dot("$A$",A,(-0.5,-1.5,0),red+linewidth(4.5)); [/asy] The isosceles triangle of centers $O_1 O_2 O$ $O$ is the center of sphere of radii $13$ ) has sides $O_1 O = O_2 O = 36 + 13 = 49,$ and $O_1 O_2 = 36 + 36 = 72.$
Let $N$ be the midpoint $O_1 O_2$
The isosceles triangle of points of tangency $T_1 T_2 T$ has sides $T_1 T = T_2 T = 2 \sqrt{13 \cdot 36} = 12 \sqrt{13}$ and $T_1 T_2 = 72.$
Let $M$ be the midpoint $T_1 T_2.$
The height $TM$ is $\sqrt {12^2 \cdot 13 - 36^2} = 12 \sqrt {13-9} = 24.$
The tangents of the half-angle between the planes is $\frac {TO}{AT} = \frac {MN - TO}{TM},$ so $\frac {13}{AT} = \frac {36 - 13}{24},$ \[AT = \frac{24\cdot 13}{23} = \frac {312}{23} \implies 312 + 23 = \boxed{335}.\] vladimir.shelomovskii@gmail.com, vvsss | null | 335 |
fe58b39c8e327b4bf8c959bea63fcafd | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_11 | A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ | Note that $\operatorname{lcm}(6,7)=42.$ It is clear that $42\not\in S$ and $84\not\in S,$ otherwise the three other elements in $S$ are divisible by neither $6$ nor $7.$
In the table below, the multiples of $6$ are colored in yellow, and the multiples of $7$ are colored in green. By the least common multiple, we obtain cycles: If $n$ is a possible maximum value of $S,$ then $n+42$ must be another possible maximum value of $S,$ and vice versa. By observations, we circle all possible maximum values of $S.$ [asy] /* Made by MRENTHUSIASM */ size(20cm); fill((5,0)--(6,0)--(6,2)--(5,2)--cycle,yellow); fill((11,0)--(12,0)--(12,3)--(11,3)--cycle,yellow); fill((17,1)--(18,1)--(18,3)--(17,3)--cycle,yellow); fill((23,1)--(24,1)--(24,3)--(23,3)--cycle,yellow); fill((29,1)--(30,1)--(30,3)--(29,3)--cycle,yellow); fill((35,1)--(36,1)--(36,3)--(35,3)--cycle,yellow); fill((6,0)--(7,0)--(7,2)--(6,2)--cycle,green); fill((13,0)--(14,0)--(14,3)--(13,3)--cycle,green); fill((20,1)--(21,1)--(21,3)--(20,3)--cycle,green); fill((27,1)--(28,1)--(28,3)--(27,3)--cycle,green); fill((34,1)--(35,1)--(35,3)--(34,3)--cycle,green); fill((42,3)--(41,3)--(41,2)--cycle,yellow); fill((42,2)--(41,2)--(41,1)--cycle,yellow); fill((42,3)--(42,2)--(41,2)--cycle,green); fill((42,2)--(42,1)--(41,1)--cycle,green); for (real i=9.5; i<=41.5; ++i) { label("$"+string(i+0.5)+"$",(i,2.5),fontsize(9pt)); } for (real i=0.5; i<=41.5; ++i) { label("$"+string(i+42.5)+"$",(i,1.5),fontsize(9pt)); } for (real i=0.5; i<=14.5; ++i) { label("$"+string(i+84.5)+"$",(i,0.5),fontsize(9pt)); } draw(circle((6.5,1.5),0.45)); draw(circle((6.5,0.5),0.45)); draw(circle((7.5,1.5),0.45)); draw(circle((7.5,0.5),0.45)); draw(circle((8.5,1.5),0.45)); draw(circle((8.5,0.5),0.45)); draw(circle((13.5,2.5),0.45)); draw(circle((13.5,1.5),0.45)); draw(circle((13.5,0.5),0.45)); draw(circle((14.5,2.5),0.45)); draw(circle((14.5,1.5),0.45)); draw(circle((14.5,0.5),0.45)); draw(circle((20.5,2.5),0.45)); draw(circle((20.5,1.5),0.45)); draw(circle((23.5,2.5),0.45)); draw(circle((23.5,1.5),0.45)); draw(circle((29.5,2.5),0.45)); draw(circle((29.5,1.5),0.45)); draw(circle((30.5,2.5),0.45)); draw(circle((30.5,1.5),0.45)); draw(circle((35.5,2.5),0.45)); draw(circle((35.5,1.5),0.45)); draw(circle((36.5,2.5),0.45)); draw(circle((36.5,1.5),0.45)); draw(circle((37.5,2.5),0.45)); draw(circle((37.5,1.5),0.45)); draw((9,3)--(42,3)); draw((0,2)--(42,2)); draw((0,1)--(42,1)); draw((0,0)--(15,0)); for (real i=0; i<9; ++i) { draw((i,2)--(i,0)); } for (real i=9; i<16; ++i) { draw((i,3)--(i,0)); } for (real i=16; i<=42; ++i) { draw((i,3)--(i,1)); } [/asy] From the second row of the table above, we perform casework on the possible maximum value of $S:$ \[\begin{array}{c||c|c|l} & & & \\ [-2.5ex] \textbf{Max Value} & \boldsymbol{S} & \textbf{Valid?} & \hspace{16.25mm}\textbf{Reasoning/Conclusion} \\ [0.5ex] \hline & & & \\ [-2ex] 49 & \{46,47,48,49\} & & \text{The student who gets } 46 \text{ will reply yes.} \\ 50 & \{47,48,49,50\} & \checkmark & \text{Another possibility is } S=\{89,90,91,92\}. \\ 51 & \{48,49,50,51\} & & \text{The student who gets } 51 \text{ will reply yes.} \\ 56 & \{53,54,55,56\} & & \text{The student who gets } 53 \text{ will reply yes.} \\ 57 & \{54,55,56,57\} & & \text{The student who gets } 57 \text{ will reply yes.} \\ 63 & \{60,61,62,63\} & & \text{The students who get } 60,61,62 \text{ will reply yes.} \\ 66 & \{63,64,65,66\} & & \text{The students who get } 64,65,66 \text{ will reply yes.} \\ 72 & \{69,70,71,72\} & & \text{The student who gets } 69 \text{ will reply yes.} \\ 73 & \{70,71,72,73\} & & \text{The student who gets } 73 \text{ will reply yes.} \\ 78 & \{75,76,77,78\} & & \text{The student who gets } 75 \text{ will reply yes.} \\ 79 & \{76,77,78,79\} & \checkmark & \text{Another possibility is } S=\{34,35,36,37\}. \\ 80 & \{77,78,79,80\} & & \text{The student who gets } 80 \text{ will reply yes.} \end{array}\] Finally, all possibilities for $S$ are $\{34,35,36,37\}, \{47,48,49,50\}, \{76,77,78,79\},$ and $\{89,90,91,92\},$ from which the answer is $37+50+79+92=\boxed{258}.$ | null | 258 |
fe58b39c8e327b4bf8c959bea63fcafd | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_11 | A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ | We know right away that $42\not\in S$ and $84\not\in S$ as stated in Solution 1.
To get a feel for the problem, let’s write out some possible values of $S$ based on the teacher’s remarks. The first multiple of 7 that is two-digit is 14. The closest multiple of six from 14 is 12, and therefore there are two possible sets of four consecutive integers containing 12 and 14; $\{11,12,13,14\}$ and $\{12,13,14,15\}$ . Here we get our first crucial idea; that if the multiples of 6 and 7 differ by two, there will be 2 possible sets of $S$ without any student input. Similarly, if they differ by 3, there will be only 1 possible set, and if they differ by 1, 3 possible sets.
Now we read the student input. Each student says they can’t figure out what $S$ is just based on the teacher’s information, which means each student has to have a number that would be in 2 or 3 of the possible sets (This is based off of the first line of student input). However, now that each student knows that all of them have numbers that fit into more than one possible set, this means that S cannot have two possible sets because otherwise, when shifting from one set to the other, one of the end numbers would not be in the shifted set, but we know each number has to fall in two or more possible sets. For example, take $\{11,12,13,14\}$ and $\{12,13,14,15\}$ . The numbers at the end, 11 and 15, only fall in one set, but each number must fall in at least two sets. This means that there must be three possible sets of S, in which case the actual S would be the middle S.
Take for example $\{33,34,35,36\}$ $\{34,35,36,37\}$ , and $\{35,36,37,38\}$ . 37 and 34 fall in two sets while 35 and 36 fall in all three sets, so the condition is met. Now, this means that the multiple of 6 and 7 must differ by 1.
Since 42 means the difference is 0, when you add/subtract 6 and 7, you will obtain the desired difference of 1, and similarly adding/subtracting 6 or 7 from 84 will also obtain the difference of 1. Thus there are four possible sets of $S$ $\{34,35,36,37\}$ $\{47,48,49,50\}$ $\{76,77,78,79\}$ and $\{89,90,91,92.\}$ . Therefore the sum of the greatest elements of the possible sets $S$ is $37+50+79+92=\boxed{258}$ | null | 258 |
fe58b39c8e327b4bf8c959bea63fcafd | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_11 | A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ | In a solution that satisfies these constraints, the multiple of 6 must be adjacent to multiple of 7. The other two numbers must be on either side.
WLOG assume the set is $\{a,6j,7k,b\}$ . The student with numbers $a$ $6j$ , and $7k$ can think the set is $\{a-1, a,6j,7k\}$ or $\{a,6j,7k,b\}$ , and the students with number $6j$ $7k$ , and $b$ can think the set is $\{a,6j,7k,b\}$ or $\{6j,7k,b, b+1\}$ . Therefore, none of the students know the set for sure.
Playing around with the arrangement of the multiple of 6 and multiple of 7 shows that this is the only configuration viewed as ambiguous to all the students. (Therefore when they hear nobody else knows either, they can find out it is this configuration)
Considering $S$ as $\{a,6j,7k,b\}$ ,b is 2 mod 6 and 1 mod 7, so $b$ is 8 mod 42. (since it is all 2-digit, the values are either 50 or 92).
Similarly, considering $S$ as $\{a,7j,6k,b\}$ $b$ is 1 mod 6 and 2 mod 7, so $b$ is 37 mod 42. The values that satisfy that are 37 and 79.
The total sum of all these values is therefore $50+92+37+89=\boxed{258}$ | null | 258 |
fe58b39c8e327b4bf8c959bea63fcafd | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_11 | A teacher was leading a class of four perfectly logical students. The teacher chose a set $S$ of four integers and gave a different number in $S$ to each student. Then the teacher announced to the class that the numbers in $S$ were four consecutive two-digit positive integers, that some number in $S$ was divisible by $6$ , and a different number in $S$ was divisible by $7$ . The teacher then asked if any of the students could deduce what $S$ is, but in unison, all of the students replied no.
However, upon hearing that all four students replied no, each student was able to determine the elements of $S$ . Find the sum of all possible values of the greatest element of $S$ | Consider the tuple $(a, a+1, a+2, a+3)$ as a possible $S$ . If one of the values in $S$ is $3$ or $4 \pmod{7}$ , observe the student will be able to deduce $S$ with no additional information. This is because, if a value is $b = 3 \pmod{7}$ and $S$ contains a $0 \pmod{7}$ , then the values of $S$ must be $(b-3, b-2, b-1, b)$ . Similarly, if we are given a $b \equiv 4 \pmod{7}$ and we know that $0 \pmod{7}$ is in $S$ $S$ must be $(b, b+1, b+2, b+3).$ Hence, the only possibility for $a$ is $5, 6 \pmod{7}.$
In either case, we are guaranteed there is a $6, 0, 1 \pmod{7}$ value in $7$ . The difference comes down to if there is a $5 \pmod{7}$ value or a $1 \pmod{7}$ value. The person receiving such value will be able to determine all of $S$ but the $6, 0, 1 \pmod{7}$ people will not be able to differentiate the two cases ... yet.
Now consider which value among the consecutive integers is $c \equiv 3 \pmod{6}$ , if any. The person will know that $S$ is either $(c-3, c-2, c-1, c)$ or $(c, c+1, c+2, c+3)$ to have a $0 \pmod{6}$ value in $S$ . Neither the $6, 1 \pmod{7}$ person can be $3 \pmod{7}$ , else they can decipher what $S$ is right off the bat by considering which set has $0 \pmod{7}.$ This translates to the possible $5 \pmod{7}$ or $1 \pmod{7}$ person cannot be $0 \pmod{6}$ . We are given that $0 \pmod{7}$ and $0 \pmod{6}$ cannot be the same person. Hence we conclude one of the $6 \pmod{7}$ or $1 \pmod{7}$ must be the $0 \pmod{6}$ person.
Let the $6 \pmod{7}$ person be $0 \pmod{6}.$ Then--hypothetical-- $c \equiv 2 \pmod{7}$ person is $3 \pmod{6}.$ After the first round, the $6, 0, 1 \pmod{7}$ people realize that $2 \pmod{7}$ is not in $S$ else they would have deduced $S$ by noting $S$ was either $(c-3, c-2, c-1, c)$ or $(c, c+1, c+2, c+3)$ to have a $0 \pmod{6}$ and choosing the former based on where $0 \pmod{7}$ is. Hence they figure out $S$ by knowing $5 \pmod{7}.$ So $a \equiv 5 \pmod{7}$ and $a \equiv 5 \pmod{6}$ (from $6 \pmod{7}$ person being $0 \pmod{6}$ ).
Similarly, if $1 \pmod{7}$ person is $0 \pmod{6}$ we find that $a \equiv 6 \pmod{7}$ (so a $2 \pmod{7}$ is in $S$ ) and $a \equiv 4 \pmod{6}.$
By CRT, the possibilities are $a \equiv 5, 34 \pmod{42}.$ The sum of the greatest values of $S$ are the sum of $a + 3$ and so we get $(34 + 3) + (47 + 3) + (76 + 3) + (89 + 3) = \boxed{258}.$ | null | 258 |
9e3cabffc8a8f6c96389e852053c8395 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_12 | A convex quadrilateral has area $30$ and side lengths $5, 6, 9,$ and $7,$ in that order. Denote by $\theta$ the measure of the acute angle formed by the diagonals of the quadrilateral. Then $\tan \theta$ can be written in the form $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | Since we are asked to find $\tan \theta$ , we can find $\sin \theta$ and $\cos \theta$ separately and use their values to get $\tan \theta$ . We can start by drawing a diagram. Let the vertices of the quadrilateral be $A$ $B$ $C$ , and $D$ . Let $AB = 5$ $BC = 6$ $CD = 9$ , and $DA = 7$ . Let $AX = a$ $BX = b$ $CX = c$ , and $DX = d$ . We know that $\theta$ is the acute angle formed between the intersection of the diagonals $AC$ and $BD$ [asy] unitsize(4cm); pair A,B,C,D,X; A = (0,0); B = (1,0); C = (1.25,-1); D = (-0.75,-0.75); draw(A--B--C--D--cycle,black+1bp); X = intersectionpoint(A--C,B--D); draw(A--C); draw(B--D); label("$A$",A,NW); label("$B$",B,NE); label("$C$",C,SE); label("$D$",D,SW); dot(X); label("$X$",X,S); label("$5$",(A+B)/2,N); label("$6$",(B+C)/2,E); label("$9$",(C+D)/2,S); label("$7$",(D+A)/2,W); label("$\theta$",X,2.5E); label("$a$",(A+X)/2,NE); label("$b$",(B+X)/2,NW); label("$c$",(C+X)/2,SW); label("$d$",(D+X)/2,SE); [/asy] We are given that the area of quadrilateral $ABCD$ is $30$ . We can express this area using the areas of triangles $AXB$ $BXC$ $CXD$ , and $DXA$ . Since we want to find $\sin \theta$ and $\cos \theta$ , we can represent these areas using $\sin \theta$ as follows: \begin{align*} 30 &=[ABCD] \\ &=[AXB] + [BXC] + [CXD] + [DXA] \\ &=\frac{1}{2} ab \sin (\angle AXB) + \frac{1}{2} bc \sin (\angle BXC) + \frac{1}{2} cd \sin (\angle CXD) + \frac{1}{2} da \sin (\angle AXD) \\ &=\frac{1}{2} ab \sin (180^\circ - \theta) + \frac{1}{2} bc \sin (\theta) + \frac{1}{2} cd \sin (180^\circ - \theta) + \frac{1}{2} da \sin (\theta). \end{align*} We know that $\sin (180^\circ - \theta) = \sin \theta$ . Therefore it follows that: \begin{align*} 30 &=\frac{1}{2} ab \sin (180^\circ - \theta) + \frac{1}{2} bc \sin (\theta) + \frac{1}{2} cd \sin (180^\circ - \theta) + \frac{1}{2} da \sin (\theta) \\ &=\frac{1}{2} ab \sin (\theta) + \frac{1}{2} bc \sin (\theta) + \frac{1}{2} cd \sin (\theta) + \frac{1}{2} da \sin (\theta) \\ &=\frac{1}{2}\sin\theta (ab + bc + cd + da). \end{align*} From here we see that $\sin \theta = \frac{60}{ab + bc + cd + da}$ . Now we need to find $\cos \theta$ . Using the Law of Cosines on each of the four smaller triangles, we get following equations: \begin{align*} 5^2 &= a^2 + b^2 - 2ab\cos(180^\circ-\theta), \\ 6^2 &= b^2 + c^2 - 2bc\cos \theta, \\ 9^2 &= c^2 + d^2 - 2cd\cos(180^\circ-\theta), \\ 7^2 &= d^2 + a^2 - 2da\cos \theta. \end{align*} We know that $\cos (180^\circ - \theta) = -\cos \theta$ for all $\theta$ . We can substitute this value into our equations to get: \begin{align*} 5^2 &= a^2 + b^2 + 2ab\cos \theta, &&(1) \\ 6^2 &= b^2 + c^2 - 2bc\cos \theta, &&(2) \\ 9^2 &= c^2 + d^2 + 2cd\cos \theta, &&(3) \\ 7^2 &= d^2 + a^2 - 2da\cos \theta. &&(4) \end{align*} If we subtract $(2)+(4)$ from $(1)+(3)$ , the squared terms cancel, leaving us with: \begin{align*} 5^2 + 9^2 - 6^2 - 7^2 &= 2ab \cos \theta + 2bc \cos \theta + 2cd \cos \theta + 2da \cos \theta \\ 21 &= 2\cos \theta (ab + bc + cd + da). \end{align*} From here we see that $\cos \theta = \frac{21/2}{ab + bc + cd + da}$
Since we have figured out $\sin \theta$ and $\cos \theta$ , we can calculate $\tan \theta$ \[\tan \theta = \frac{\sin \theta}{\cos \theta} = \frac{\frac{60}{ab + bc + cd + da}}{\frac{21/2}{ab + bc + cd + da}} = \frac{60}{21/2} = \frac{120}{21} = \frac{40}{7}.\] Therefore our answer is $40 + 7 = \boxed{047}$ | null | 047 |
9e3cabffc8a8f6c96389e852053c8395 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_12 | A convex quadrilateral has area $30$ and side lengths $5, 6, 9,$ and $7,$ in that order. Denote by $\theta$ the measure of the acute angle formed by the diagonals of the quadrilateral. Then $\tan \theta$ can be written in the form $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | In convex quadrilateral $ABCD,$ let $AB=5,BC=6,CD=9,$ and $DA=7.$ Let $A'$ and $C'$ be the feet of the perpendiculars from $A$ and $C,$ respectively, to $\overline{BD}.$ We obtain the following diagram: [asy] /* Made by MRENTHUSIASM */ size(500); pair A, B, C, D, P, A1, C1; B = origin; D = (3*sqrt(32498*(29400*sqrt(47)+312523))/32498,0); A = intersectionpoints(Circle(B,5),Circle(D,7))[0]; C = intersectionpoints(Circle(B,6),Circle(D,9))[1]; P = intersectionpoint(A--C,B--D); A1 = foot(A,B,D); C1 = foot(C,B,D); markscalefactor=3/160; draw(rightanglemark(A,A1,D),red); draw(rightanglemark(C,C1,B),red); dot("$A$",A,1.5*dir(aCos(7/sqrt(1649)))); dot("$B$",B,1.5*W); dot("$C$",C,1.5*dir(180+aCos(7/sqrt(1649)))); dot("$D$",D,1.5*E); dot("$E$",P,dir(180-(180-aCos(7/sqrt(1649)))/2)); dot("$A'$",A1,dir(-75)); dot("$C'$",C1,N); label("$\theta$",P,dir(180+aCos(7/sqrt(1649))/2),red); draw(A--A1^^C--C1,dashed); draw(A--B--C--D--cycle^^A--C^^B--D); [/asy] Let $BC'=p,C'E=q,EA'=r,A'D=s,AA'=h_1,$ and $CC'=h_2.$ We apply the Pythagorean Theorem to right triangles $\triangle ABA',\triangle BCC',\triangle CDC',$ and $\triangle DAA',$ respectively: \[\begin{array}{ccccccccccccccccc} (p+q+r)^2&+&h_1^2&=&5^2, &&&&&&&&&&&&\hspace{36mm}(1) \\ [1ex] p^2&+&h_2^2&=&6^2, &&&&&&&&&&&&\hspace{36mm}(2) \\ [1ex] (q+r+s)^2&+&h_2^2&=&9^2, &&&&&&&&&&&&\hspace{36mm}(3) \\ [1ex] s^2&+&h_1^2&=&7^2. &&&&&&&&&&&&\hspace{36mm}(4) \end{array}\] Let the brackets denote areas. We get \begin{align*} [ABD]+[CBD]&=[ABCD] \\ \frac12(p+q+r+s)h_1+\frac12(p+q+r+s)h_2&=30 \\ \frac12(p+q+r+s)(h_1+h_2)&=30 \\ (p+q+r+s)(h_1+h_2)&=60. \hspace{49.25mm}(5) \end{align*} We subtract $(2)+(4)$ from $(1)+(3):$ \begin{align*} (p+q+r)^2+(q+r+s)^2-p^2-s^2&=21 \\ \left[(p+q+r)^2-s^2\right]+\left[(q+r+s)^2-p^2\right]&=21 \\ (p+q+r+s)(p+q+r-s)+(p+q+r+s)(-p+q+r+s)&=21 \\ (p+q+r+s)(2q+2r)&=21 \\ 2(p+q+r+s)(q+r)&=21 \\ (p+q+r+s)(q+r)&=\frac{21}{2}. \hspace{9.5mm}(6) \end{align*} From right triangles $\triangle AEA'$ and $\triangle CEC',$ we have $\tan\theta=\frac{h_1}{r}=\frac{h_2}{q}.$ It follows that \begin{alignat*}{8} \tan\theta&=\frac{h_1}{r}\qquad&\implies\qquad h_1&=r\tan\theta, \hspace{64mm}&(1\star)\\ \tan\theta&=\frac{h_2}{q}\qquad&\implies\qquad h_2&=q\tan\theta. &(2\star) \end{alignat*} Finally, we divide $(5)$ by $(6):$ \begin{align*} \frac{h_1+h_2}{q+r}&=\frac{40}{7} \\ \frac{r\tan\theta+q\tan\theta}{q+r}&=\frac{40}{7} \hspace{15mm} &&\text{by }(1\star)\text{ and }(2\star)\\ \frac{(r+q)\tan\theta}{q+r}&=\frac{40}{7} \\ \tan\theta&=\frac{40}{7}, \end{align*} from which the answer is $40+7=\boxed{047}.$ | null | 047 |
9e3cabffc8a8f6c96389e852053c8395 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_12 | A convex quadrilateral has area $30$ and side lengths $5, 6, 9,$ and $7,$ in that order. Denote by $\theta$ the measure of the acute angle formed by the diagonals of the quadrilateral. Then $\tan \theta$ can be written in the form $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | By Bretschneider's Formula, \[30=\tfrac{1}{4}\sqrt{4u^2v^2-(b^2+d^2-a^2-c^2)^2}=\tfrac{1}{4}\sqrt{4u^2v^2-441}.\] Thus, $uv=3\sqrt{1649}$ . Also, \[[ABCD]=\tfrac 12 \cdot uv\sin{\theta};\] solving for $\sin{\theta}$ yields $\sin{\theta}=\tfrac{40}{\sqrt{1649}}$ . Since $\theta$ is acute, $\cos{\theta}$ is positive, from which $\cos{\theta}=\tfrac{7}{\sqrt{1649}}$ . Solving for $\tan{\theta}$ yields \[\tan{\theta}=\frac{\sin{\theta}}{\cos{\theta}}=\frac{40}{7},\] for a final answer of $\boxed{047}$ | null | 047 |
af4c335a061949402c6494f39ecafcd8 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_13 | Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$ | Recall that $1000$ divides this expression if $8$ and $125$ both divide it. It should be fairly obvious that $n \geq 3$ ; so we may break up the initial condition into two sub-conditions.
(1) $5^n \equiv n \pmod{8}$ . Notice that the square of any odd integer is $1$ modulo $8$ (proof by plugging in $1^2,3^2,5^2,7^2$ into modulo $8$ ), so the LHS of this expression goes $5,1,5,1,\ldots$ , while the RHS goes $1,2,3,4,5,6,7,8,1,\ldots$ . The cycle length of the LHS is $2$ , RHS is $8$ , so the cycle length of the solution is $\operatorname{lcm}(2,8)=8$ . Indeed, the $n$ that solve this congruence are exactly those such that $n \equiv 5 \pmod{8}$
(2) $2^n \equiv n \pmod{125}$ . This is extremely computationally intensive if we try to calculate all $2^1,2^2,\ldots,2^{100} \pmod{125}$ , so we take a divide-and-conquer approach instead. In order for this expression to be true, $2^n \equiv n \pmod{5}$ is necessary; it shouldn't take too long for us to go through the $20$ possible LHS-RHS combinations, considering that $n$ must be odd. We only need to test $10$ values of $n$ and obtain $n \equiv 3 \pmod{20}$ or $n \equiv 17 \pmod{20}$
With this in mind we consider $2^n \equiv n \pmod{25}$ . By the Generalized Fermat's Little Theorem, $2^{20} \equiv 1 \pmod{25}$ , but we already have $n$ modulo $20$ . Our calculation is greatly simplified. The LHS's cycle length is $20$ and the RHS's cycle length is $25$ , from which their least common multiple is $100$ . In this step we need to test all the numbers between $1$ to $100$ that $n \equiv 3 \pmod{20}$ or $n \equiv 17 \pmod{20}$ . In the case that $n \equiv 3 \pmod{20}$ , the RHS goes $3,23,43,63,83$ , and we need $2^n \equiv n \equiv 2^3 \pmod{25}$ ; clearly $n \equiv 83 \pmod{100}$ . In the case that $n \equiv 17 \pmod{20}$ , by a similar argument, $n \equiv 97 \pmod{100}$
In the final step, we need to calculate $2^{97}$ and $2^{83}$ modulo $125$
Note that $2^{97}\equiv2^{-3}$ ; because $8\cdot47=376\equiv1\pmod{125},$ we get $2^{97} \equiv 47\pmod{125}$
Note that $2^{83}$ is $2^{-17}=2^{-16}\cdot2^{-1}$ . We have \begin{align*} 2^{-1}&\equiv63, \\ 2^{-2}&\equiv63^2=3969\equiv-31, \\ 2^{-4}&\equiv(-31)^2=961\equiv-39, \\ 2^{-8}&\equiv1521\equiv21, \\ 2^{-16}&\equiv441, \\ 2^{-17}&\equiv63\cdot441\equiv7\cdot(-31)=-217\equiv33. \end{align*} This time, LHS cycle is $100$ , RHS cycle is $125$ , so we need to figure out $n$ modulo $500$ . It should be $n \equiv 283,297 \pmod{500}$
Put everything together. By the second subcondition, the only candidates less than $1000$ are $283,297,783,797$ . Apply the first subcondition, $n=\boxed{797}$ is the desired answer. | null | 797 |
af4c335a061949402c6494f39ecafcd8 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_13 | Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$ | We have that $2^n + 5^n \equiv n\pmod{1000}$ , or $2^n + 5^n \equiv n \pmod{8}$ and $2^n + 5^n \equiv n \pmod{125}$ by CRT. It is easy to check $n < 3$ don't work, so we have that $n \geq 3$ . Then, $2^n \equiv 0 \pmod{8}$ and $5^n \equiv 0 \pmod{125}$ , so we just have $5^n \equiv n \pmod{8}$ and $2^n \equiv n \pmod{125}$ . Let us consider both of these congruences separately.
First, we look at $5^n \equiv n \pmod{8}$ . By Euler's Totient Theorem (ETT), we have $5^4 \equiv 1 \pmod{8}$ , so $5^5 \equiv 5 \pmod{8}$ . On the RHS of the congruence, the possible values of $n$ are all nonnegative integers less than $8$ and on the RHS the only possible values are $5$ and $1$ . However, for $5^n$ to be $1 \pmod{8}$ we must have $n \equiv 0 \pmod{4}$ , a contradiction. So, the only possible values of $n$ are when $n \equiv 5 \pmod{8} \implies n = 8k+5$
Now we look at $2^n \equiv n \pmod{125}$ . Plugging in $n = 8k+5$ , we get $2^{8k+5} \equiv 8k+5 \pmod{125} \implies 2^{8k} \cdot 32 \equiv 8k+5 \pmod{125}$ . Note, for $2^n \equiv n\pmod{125}$ to be satisfied, we must have $2^n \equiv n \pmod{5}$ and $2^n \equiv n\pmod{25}$ . Since $2^{8k} \equiv 1\pmod{5}$ as $8k \equiv 0\pmod{4}$ , we have $2 \equiv -2k \pmod{5} \implies k = 5m-1$ . Then, $n = 8(5m-1) + 5 = 40m-3$ . Now, we get $2^{40m-3} \equiv 40m-3 \pmod{125}$ . Using the fact that $2^n \equiv n\pmod{25}$ , we get $2^{-3} \equiv 15m-3 \pmod{25}$ . The inverse of $2$ modulo $25$ is obviously $13$ , so $2^{-3} \equiv 13^3 \equiv 22 \pmod{25}$ , so $15m \equiv 0 \pmod{25} \implies m = 5s$ . Plugging in $m = 5s$ , we get $n = 200s - 3$
Now, we are finally ready to plug $n$ into the congruence modulo $125$ . Plugging in, we get $2^{200s-3} \equiv 200s - 3 \pmod{125}$ . By ETT, we get $2^{100} \equiv 1 \pmod{125}$ , so $2^{200s- 3} \equiv 2^{-3} \equiv 47 \pmod{125}$ . Then, $200s \equiv 50 \pmod{125} \implies s \equiv 4 \pmod{5} \implies s = 5y+4$ . Plugging this in, we get $n = 200(5y+4) - 3 = 1000y+797$ , implying the smallest value of $n$ is simply $\boxed{797}$ | null | 797 |
af4c335a061949402c6494f39ecafcd8 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_13 | Find the least positive integer $n$ for which $2^n + 5^n - n$ is a multiple of $1000$ | We wish to find the least positive integer $n$ for which $2^n+5^n-n\equiv0\pmod{1000}.$ Rearranging gives \[2^n+5^n\equiv n\pmod{1000}.\] Applying the Chinese Remainder Theorem, we get the following system of congruences: \begin{align*} 2^n+5^n &\equiv n \pmod{8}, \\ 2^n+5^n &\equiv n \pmod{125}. \end{align*} It is clear that $n\geq3,$ from which we simplify to \begin{align*} 5^n &\equiv n \pmod{8}, \hspace{15mm} &(1) \\ 2^n &\equiv n \pmod{125}. &(2) \end{align*} We solve each congruence separately:
Finally, combining the two results from above (bolded) generates the least such positive integer $n$ at $s=19:$ \begin{align*} n&=8r+5 \\ &=8(5s+4)+5 \\ &=40s+37 \\ &=\boxed{797} ~MRENTHUSIASM (inspired by Math Jams's 2021 AIME II Discussion | null | 797 |
df1f13c45d7f53baca18af95734df601 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_14 | Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$ . Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$ . Let $Y$ be the intersection of lines $XG$ and $BC$ . Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | In this solution, all angle measures are in degrees.
Let $M$ be the midpoint of $\overline{BC}$ so that $\overline{OM}\perp\overline{BC}$ and $A,G,M$ are collinear. Let $\angle ABC=13k,\angle BCA=2k$ and $\angle XOY=17k.$
Note that:
Together, we conclude that $\triangle OAM \sim \triangle OXY$ by AA, so $\angle AOM = \angle XOY = 17k.$
Next, we express $\angle BAC$ in terms of $k.$ By angle addition, we have \begin{align*} \angle AOM &= \angle AOB + \angle BOM \\ &= 2\angle BCA + \frac12\angle BOC \hspace{10mm} &&\text{by Inscribed Angle Theorem and Perpendicular Bisector Property} \\ &= 2\angle BCA + \angle BAC. &&\text{by Inscribed Angle Theorem} \end{align*} Substituting back gives $17k=2(2k)+\angle BAC,$ from which $\angle BAC=13k.$
For the sum of the interior angles of $\triangle ABC,$ we get \begin{align*} \angle ABC + \angle BCA + \angle BAC &= 180 \\ 13k+2k+13k&=180 \\ 28k&=180 \\ k&=\frac{45}{7}. \end{align*} Finally, we obtain $\angle BAC=13k=\frac{585}{7},$ from which the answer is $585+7=\boxed{592}.$ | null | 592 |
df1f13c45d7f53baca18af95734df601 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_14 | Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$ . Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$ . Let $Y$ be the intersection of lines $XG$ and $BC$ . Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Let $M$ be the midpoint of $BC$ . Because $\angle{OAX}=\angle{OGX}=\angle{OGY}=\angle{OMY}=90^o$ $AXOG$ and $OMYG$ are cyclic, so $O$ is the center of the spiral similarity sending $AM$ to $XY$ , and $\angle{XOY}=\angle{AOM}$ . Because $\angle{AOM}=2\angle{BCA}+\angle{BAC}$ , it's easy to get $\frac{585}{7} \implies \boxed{592}$ from here. | null | 592 |
df1f13c45d7f53baca18af95734df601 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_14 | Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$ . Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$ . Let $Y$ be the intersection of lines $XG$ and $BC$ . Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Firstly, let $M$ be the midpoint of $BC$ . Then, $\angle OMB = 90^o$ . Now, note that since $\angle OGX = \angle XAO = 90^o$ , quadrilateral $AGOX$ is cyclic. Also, because $\angle OMY + \angle OGY = 180^o$ $OMYG$ is also cyclic. Now, we define some variables: let $\alpha$ be the constant such that $\angle ABC = 13\alpha, \angle ACB = 2\alpha,$ and $\angle XOY = 17\alpha$ . Also, let $\beta = \angle OMG = \angle OYG$ and $\theta = \angle OXG = \angle OAG$ (due to the fact that $AGOX$ and $OMYG$ are cyclic). Then, \[\angle XOY = 180 - \beta - \theta = 17\alpha \implies \beta + \theta = 180 - 17\alpha.\] Now, because $AX$ is tangent to the circumcircle at $A$ $\angle XAC = \angle CBA = 13\alpha$ , and $\angle CAO = \angle OAX - \angle CAX = 90 - 13\alpha$ . Finally, notice that $\angle AMB = \angle OMB - \angle OMG = 90 - \beta$ . Then, \[\angle BAM = 180 - \angle ABC - \angle AMB = 180 - 13\alpha - (90 - \beta) = 90 + \beta - 13\alpha.\] Thus, \[\angle BAC = \angle BAM + \angle MAO + \angle OAC = 90 + \beta - 13\alpha + \theta + 90 - 13\alpha = 180 - 26\alpha + (\beta + \theta),\] and \[180 = \angle BAC + 13\alpha + 2\alpha = 180 - 11\alpha + \beta + \theta \implies \beta + \theta = 11\alpha.\] However, from before, $\beta+\theta = 180 - 17 \alpha$ , so $11 \alpha = 180 - 17 \alpha \implies 180 = 28 \alpha \implies \alpha = \frac{180}{28}$ . To finish the problem, we simply compute \[\angle BAC = 180 - 15 \alpha = 180 \cdot \left(1 - \frac{15}{28}\right) = 180 \cdot \frac{13}{28} = \frac{585}{7},\] so our final answer is $585+7=\boxed{592}$ | null | 592 |
df1f13c45d7f53baca18af95734df601 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_14 | Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$ . Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$ . Let $Y$ be the intersection of lines $XG$ and $BC$ . Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | [asy] /* Made by MRENTHUSIASM */ size(375); pair A, B, C, O, G, X, Y; A = origin; B = (1,0); C = extension(A,A+10*dir(585/7),B,B+10*dir(180-585/7)); O = circumcenter(A,B,C); G = centroid(A,B,C); Y = intersectionpoint(G--G+(100,0),B--C); X = intersectionpoint(G--G-(100,0),A--scale(100)*rotate(90)*dir(O-A)); pair O1=circumcenter(O,G,A); real r1=length(O1-O); markscalefactor=3/160; filldraw(O--X--Y--cycle, rgb(255,255,0)); draw(rightanglemark(O,G,X),red); draw(A--O--B,fuchsia+0.4); draw(Arc(O1,r1,-40,50),royalblue+0.5); draw(circumcircle(O,G,Y), heavygreen+0.5); dot("$A$",A,1.5*dir(180+585/7),linewidth(4)); dot("$B$",B,1.5*dir(-585/7),linewidth(4)); dot("$C$",C,1.5N,linewidth(4)); dot("$O$",O,1.5N,linewidth(4)); dot("$G$",G,1.5S,linewidth(4)); dot("$Y$",Y,1.5E,linewidth(4)); dot("$X$",X,1.5W,linewidth(4)); draw(A--B--C--cycle^^X--O--Y--cycle^^A--X^^O--G^^circumcircle(A,B,C)); [/asy] $\angle OAX = \angle OGX = 90^\circ \implies$ quadrilateral $XAGO$ is cyclic $\implies$
$\angle GXO = \angle GAO,$ as they share the same intersept $\overset{\Large\frown} {GO}.$
$\angle OGY = \angle OMY = 90^\circ \implies$ quadrilateral $OGYM$ is cyclic $\implies$
$\angle GYO = \angle OMG,$ as they share the same intercept $\overset{\Large\frown} {GO}.$
In triangles $\triangle XOY$ and $\triangle AOM,$ two pairs of angles are equal, which means that the third angles $\angle XOY = \angle AOM$ are also equal.
$\angle ABC : \angle BCA : \angle AOM = 13 : 2 : 17,$ so $\angle AOM = \angle ABC + 2 \angle BCA.$
According to the Claim $\triangle ABC$ is isosceles, \[\angle ABC : \angle BCA : \angle BAC = 13 : 2 : 13.\] \[\angle BAC = \frac{13} {13 + 2 + 13} \cdot 180^\circ = \frac {585^\circ}{7} \implies 585 + 7 = \boxed{592}.\] | null | 592 |
df1f13c45d7f53baca18af95734df601 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_14 | Let $\Delta ABC$ be an acute triangle with circumcenter $O$ and centroid $G$ . Let $X$ be the intersection of the line tangent to the circumcircle of $\Delta ABC$ at $A$ and the line perpendicular to $GO$ at $G$ . Let $Y$ be the intersection of lines $XG$ and $BC$ . Given that the measures of $\angle ABC, \angle BCA,$ and $\angle XOY$ are in the ratio $13 : 2 : 17,$ the degree measure of $\angle BAC$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Extend $XA$ and meet line $CB$ at $P$ . Extend $AG$ to meet $BC$ at $F$ . Since $AF$ is the median from $A$ to $BC$ $A,G,F$ are collinear. Furthermore, $OF$ is perpendicular to $BC$
Draw the circumcircle of $\triangle{XPY}$ , as $OA\bot XP, OG\bot XY, OF\bot PY$ $A,G,F$ are collinear, $O$ lies on $(XYP)$ as $AGF$ is the Simson line of $O$ with respect to $\triangle{XPY}$ . Thus, $\angle{P}=180-17x, \angle{PAB}=\angle{C}=2x, 180-15x=13x, x=\frac{45}{7}$ , the answer is $180-15\cdot \frac{45}{7}=\frac{585}{7}$ which is $\boxed{592}$ | null | 592 |
69840e503c9f83bf08e000985b6f67f3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_15 | Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\] and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\] for positive integers $n$ . Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$ | Consider what happens when we try to calculate $f(n)$ where n is not a square. If $k^2<n<(k+1)^2$ for (positive) integer k, recursively calculating the value of the function gives us $f(n)=(k+1)^2-n+f((k+1)^2)=k^2+3k+2-n$ . Note that this formula also returns the correct value when $n=(k+1)^2$ , but not when $n=k^2$ . Thus $f(n)=k^2+3k+2-n$ for $k^2<n \leq (k+1)^2$
If $2 \mid (k+1)^2-n$ $g(n)$ returns the same value as $f(n)$ . This is because the recursion once again stops at $(k+1)^2$ . We seek a case in which $f(n)<g(n)$ , so obviously this is not what we want. We want $(k+1)^2,n$ to have a different parity, or $n, k$ have the same parity. When this is the case, $g(n)$ instead returns $(k+2)^2-n+g((k+2)^2)=k^2+5k+6-n$
Write $7f(n)=4g(n)$ , which simplifies to $3k^2+k-10=3n$ . Notice that we want the LHS expression to be divisible by 3; as a result, $k \equiv 1 \pmod{3}$ . We also want n to be strictly greater than $k^2$ , so $k-10>0, k>10$ . The LHS expression is always even (since $3k^2+k-10$ factors to $k(3k+1)-10$ , and one of $k$ and $3k+1$ will be even), so to ensure that $k$ and $n$ share the same parity, $k$ should be even. Then the least $k$ that satisfies these requirements is $k=16$ , giving $n=258$
Indeed - if we check our answer, it works. Therefore, the answer is $\boxed{258}$ | null | 258 |
69840e503c9f83bf08e000985b6f67f3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_15 | Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\] and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\] for positive integers $n$ . Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$ | Since $n$ isn't a perfect square, let $n=m^2+k$ with $0<k<2m+1$ . If $k$ is odd, then $f(n)=g(n)$ . If $k$ is even, then \begin{align*} f(n)&=(m+1)^2-(m^2+k)+(m+1)=3m+2-k, \\ g(n)&=(m+2)^2-(m^2+k)+(m+2)=5m+6-k, \end{align*} from which \begin{align*} 7(3m+2-k)&=4(5m+6-k) \\ m&=3k+10. \end{align*} Since $k$ is even, $m$ is even. Since $k\neq 0$ , the smallest $k$ is $2$ which produces the smallest $n$ \[k=2 \implies m=16 \implies n=16^2+2=\boxed{258}.\] ~Afo | null | 258 |
69840e503c9f83bf08e000985b6f67f3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_15 | Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\] and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\] for positive integers $n$ . Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$ | To begin, note that if $n$ is a perfect square, $f(n)=g(n)$ , so $f(n)/g(n)=1$ , so we must look at values of $n$ that are not perfect squares (what a surprise). First, let the distance between $n$ and the first perfect square greater than or equal to it be $k$ , making the values of $f(n+k)$ and $g(n+k)$ integers. Using this notation, we see that $f(n)=k+f(n+k)$ , giving us a formula for the numerator of our ratio. However, since the function of $g(n)$ does not add one to the previous inputs in the function until a perfect square is achieved, but adds values of two, we can not achieve the value of $\sqrt{n+k}$ in $g(n)$ unless $k$ is an even number. However, this is impossible, since if $k$ was an even number, $f(n)=g(n)$ , giving a ratio of one. Thus, $k$ must be an odd number.
Thus, since $k$ must be an odd number, regardless of whether $n$ is even or odd, to get an integral value in $g(n)$ , we must get to the next perfect square after $n+k$ . To make matters easier, let $z^2=n+k$ . Thus, in $g(n)$ , we want to achieve $(z+1)^2$
Expanding $(z+1)^2$ and substituting in the fact that $z=\sqrt{n+k}$ yields:
\[(z+1)^2=z^2+2z+1=n+k+2\sqrt{n+k}+1\]
Thus, we must add the quantity $k+2z+1$ to $n$ to achieve a integral value in the function $g(n)$ . Thus.
\[g(n)=(k+2z+1)+\sqrt{n+k+2\sqrt{n+k}+1}\]
However, note that the quantity within the square root is just $(z+1)^2$ , and so:
\[g(n)=k+3z+2\]
Thus, \[\frac{f(n)}{g(n)}=\frac{k+z}{k+3z+2}\]
Since we want this quantity to equal $\frac{4}{7}$ , we can set the above equation equal to this number and collect all the variables to one side to achieve
\[3k-5z=8\]
Substituting back in that $z=\sqrt{n+k}$ , and then separating variables and squaring yields that
\[9k^2-73k+64=25n\]
Now, if we treat $n$ as a constant, we can use the quadratic formula in respect to $k$ to get an equation for $k$ in terms of $n$ (without all the squares). Doing so yields
\[\frac{73\pm\sqrt{3025+900n}}{18}=k\]
Now, since $n$ and $k$ are integers, we want the quantity within the square root to be a perfect square. Note that $55^2=3025$ . Thus, assume that the quantity within the root is equal to the perfect square, $m^2$ . Thus, after using a difference of squares, we have \[(m-55)(m+55)=900n\] Since we want $n$ to be an integer, we know that the $LHS$ should be divisible by five, so, let's assume that we should have $m$ divisible by five. If so, the quantity $18k-73$ must be divisible by five, meaning that $k$ leaves a remainder of one when divided by 5 (if the reader knows LaTeX well enough to write this as a modulo argument, please go ahead and do so!).
Thus, we see that to achieve integers $n$ and $k$ that could potentially satisfy the problem statement, we must try the values of $k$ congruent to one modulo five. However, if we recall a statement made earlier in the solution, we see that we can skip all even values of $k$ produced by this modulo argument.
Also, note that $k=1,6$ won't work, as they are too small, and will give an erroneous value for $n$ . After trying $k=11,21,31$ , we see that $k=31$ will give a value of $m=485$ , which yields $n=\boxed{258}$ , which, if plugged in to for our equations of $f(n)$ and $g(n)$ , will yield the desired ratio, and we're done. | null | 258 |
69840e503c9f83bf08e000985b6f67f3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_15 | Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\] and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\] for positive integers $n$ . Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$ | First of all, if $n$ is a perfect square, $f(n)=g(n)=\sqrt{n}$ and their quotient is $1.$ So, for the rest of this solution, assume $n$ is not a perfect square.
Let $a^2$ be the smallest perfect square greater than $n$ and let $b^2$ be the smallest perfect square greater than $n$ with the same parity as $n,$ and note that either $b=a$ or $b=a+1.$ Notice that $(a-1)^2 < n < a^2.$
With a bit of inspection, it becomes clear that $f(n) = a+(a^2-n)$ and $g(n) = b+(b^2-n).$
If $a$ and $n$ have the same parity, we get $a=b$ so $f(n) = g(n)$ and their quotient is $1.$ So, for the rest of this solution, we let $a$ and $n$ have opposite parity. We have two cases to consider.
Case 1: $n$ is odd and $a$ is even
Here, we get $a=2k$ for some positive integer $k.$ Then, $b = 2k+1.$ We let $n = a^2-(2m+1)$ for some positive integer $m$ so $f(n) = 2k+2m+1$ and $g(n) = 2k+1+2m+1+4k+1 = 6k+2m+3.$
We set $\frac{2k+2m+1}{6k+2m+3}=\frac{4}{7},$ cross multiply, and rearrange to get $6m-10k=5.$ Since $k$ and $m$ are integers, the LHS will always be even and the RHS will always be odd, and thus, this case yields no solutions.
Case 2: $n$ is even and $a$ is odd
Here, we get $a=2k+1$ for some positive ineger $k.$ Then, $b=2k+2.$ We let $n = a^2-(2m+1)$ for some positive integer $m$ so $f(n)=2k+1+2m+1=2k+2m+2$ and $g(n)=2k+2+2m+1+4k+3 = 6k+2m+6.$
We set $\frac{2k+2m+2}{6k+2m+6} = \frac{4}{7},$ cross multiply, and rearrange to get $5k=3m-5,$ or $k=\frac{3}{5}m-1.$ Since $k$ and $m$ are integers, $m$ must be a multiple of $5.$ Some possible solutions for $(k,m)$ with the least $k$ and $m$ are $(2,5), (5,10), (8,15),$ and $(11,20).$
We wish to minimize $k$ since $a=2k+1.$ One thing to keep in mind is the initial assumption $(a-1)^2 < n < a^2.$
The pair $(2,5)$ gives $a=2(2)+1=5$ and $n=5^2-(2(5)+1)=14.$ But $4^2<14<5^2$ is clearly false, so we discard this case.
The pair $(5,10)$ gives $a=2(5)+1=11$ and $n=11^2-(2(10)+1)=100,$ which is a perfect square and therefore can be discarded.
The pair $(8,15)$ gives $a=2(8)+1=17$ and $n=17^2-(2(15)+1)=258,$ which is between $16^2$ and $17^2$ so it is our smallest solution.
So, $\boxed{258}$ is the correct answer. | null | 258 |
69840e503c9f83bf08e000985b6f67f3 | https://artofproblemsolving.com/wiki/index.php/2021_AIME_II_Problems/Problem_15 | Let $f(n)$ and $g(n)$ be functions satisfying \[f(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 1 + f(n+1) & \text{ otherwise} \end{cases}\] and \[g(n) = \begin{cases}\sqrt{n} & \text{ if } \sqrt{n} \text{ is an integer}\\ 2 + g(n+2) & \text{ otherwise} \end{cases}\] for positive integers $n$ . Find the least positive integer $n$ such that $\tfrac{f(n)}{g(n)} = \tfrac{4}{7}$ | Say the answer is in the form n^2-x, then x must be odd or else f(x) = g(x). Say y = n^2-x. f(y) = x+n, g(y) = 3n+2+x. Because f(y)/g(y) = 4*(an integer)/7*(an integer), f(y) is 4*(an integer) so n must be odd or else f(y) would be odd. Solving for x in terms of n gives integer x = (5/3)n+8/3 which means n is 2 mod 3, because n is also odd, n is 5 mod 6. x must be less than 2n-1 or else the minimum square above y would be (n-1)^2. We set an inequality
(5/3)n+8/3<2n-1 => 5n+8<6n-3 => n>11.
Since n is 5 mod 6, n = 17 and x = 31 giving 17^2-31 = $\boxed{258}$ | null | 258 |
65a86405a46b21e2f42d093d5d9d0517 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_1 | In $\triangle ABC$ with $AB=AC,$ point $D$ lies strictly between $A$ and $C$ on side $\overline{AC},$ and point $E$ lies strictly between $A$ and $B$ on side $\overline{AB}$ such that $AE=ED=DB=BC.$ The degree measure of $\angle ABC$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | [asy] size(10cm); pair A, B, C, D, F; A = (0, tan(3 * pi / 7)); B = (1, 0); C = (-1, 0); F = rotate(90/7, A) * (A - (0, 2)); D = rotate(900/7, F) * A; draw(A -- B -- C -- cycle); draw(F -- D); draw(D -- B); label("$A$", A, N); label("$B$", B, E); label("$C$", C, W); label("$D$", D, W); label("$E$", F, E); [/asy]
If we set $\angle{BAC}$ to $x$ , we can find all other angles through these two properties:
1. Angles in a triangle sum to $180^{\circ}$ .
2. The base angles of an isosceles triangle are congruent.
Now we angle chase. $\angle{ADE}=\angle{EAD}=x$ $\angle{AED} = 180-2x$ $\angle{BED}=\angle{EBD}=2x$ $\angle{EDB} = 180-4x$ $\angle{BDC} = \angle{BCD} = 3x$ $\angle{CBD} = 180-6x$ . Since $AB = AC$ as given by the problem, $\angle{ABC} = \angle{ACB}$ , so $180-4x=3x$ . Therefore, $x = 180/7^{\circ}$ , and our desired angle is \[180-4\left(\frac{180}{7}\right) = \frac{540}{7}\] for an answer of $\boxed{547}$ | null | 547 |
65a86405a46b21e2f42d093d5d9d0517 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_1 | In $\triangle ABC$ with $AB=AC,$ point $D$ lies strictly between $A$ and $C$ on side $\overline{AC},$ and point $E$ lies strictly between $A$ and $B$ on side $\overline{AB}$ such that $AE=ED=DB=BC.$ The degree measure of $\angle ABC$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | Let $\angle{BAC}$ be $x$ in degrees. $\angle{ADE}=x$ .
By Exterior Angle Theorem on triangle $AED$ $\angle{BED}=2x$ .
By Exterior Angle Theorem on triangle $ADB$ $\angle{BDC}=3x$ .
This tells us $\angle{BCA}=\angle{ABC}=3x$ and $3x+3x+x=180$ .
Thus $x=\frac{180}{7}$ and we want $\angle{ABC}=3x=\frac{540}{7}$ to get an answer of $\boxed{547}$ | null | 547 |
65a86405a46b21e2f42d093d5d9d0517 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_1 | In $\triangle ABC$ with $AB=AC,$ point $D$ lies strictly between $A$ and $C$ on side $\overline{AC},$ and point $E$ lies strictly between $A$ and $B$ on side $\overline{AB}$ such that $AE=ED=DB=BC.$ The degree measure of $\angle ABC$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$ | graph soon
We write equations based on the triangle sum of angles theorem. There are angles that do not need variables as the less variables the better.
\begin{align*} \angle A &= y \\ \angle B &= x+z \\ \angle C &= \frac{180-x}{2} \\ \end{align*}
Then, using triangle sum of angles theorem, we find that
\begin{align*} \angle A + \angle B + \angle C = x+y+z+\frac{180-x}{2}=180 \\ \end{align*}
Now we just need to find the variables.
\begin{align*} (180-2y)+z = 180& \\ (180-2z)+y+\frac{180-x}{2} = 180& \\ \end{align*}
Notice how all the equations equal 180. We can use this to write
\begin{align*} (180-2y)+z = (180-2z)+y+\frac{180-x}{2}=x+y+z+\frac{180-x}{2} \\ \end{align*}
Simplifying, we get
\begin{align*} (180-2y)+z=(180-2z)+y+\frac{180-x}{2} \\ 360-4y+2z=360-4z+2y+180-x \\ \end{align*}
\begin{align*} 6z=6y+180-x \\ x=6y-6z+180 \\ \end{align*}
\begin{align*} (180-2y)+z=6y-6z+180+y+z+\frac{180-(6y-6+180)}{2} \\ 360-4y+2z=12y-12z+360+2y+2z+180-6y+6z-180 \\ \end{align*}
\begin{align*} 6z=12y& \\ z=2y& \\ \end{align*}
Theres more. We are at a dead end right now because we forgot that the problem states that the triangle is isosceles. With this, we can write the equation
\begin{align*} \frac{180-x}{2}=x+z \\ \end{align*}
Substituting $z$ with $2y$ , we get
\begin{align*} \frac{180-x}{2}=x+2y \\ 180-x=2x+4y \\ \end{align*} \begin{align*} 180-(6y-6z+180)=2(6y-6z+180)+4y& \\ 180-6y+12y-180=12y-24y+360+4y& \\ \end{align*} \begin{align*} 6y=-8y+360& \\ \end{align*}
With this, we get
\begin{align*} y=\frac{180}{7} \\ x=\frac{180}{7} \\ z=\frac{360}{7} \\ \end{align*}
And a final answer of $\frac{180}{7}+\frac{360}{7} = \frac{540}{7} = \boxed{547}$ | null | 547 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | Since these form a geometric series, $\frac{\log_2{x}}{\log_4{x}}$ is the common ratio. Rewriting this, we get $\frac{\log_x{4}}{\log_x{2}} = \log_2{4} = 2$ by base change formula. Therefore, the common ratio is 2. Now $\frac{\log_4{x}}{\log_8{2x}} = 2 \implies \log_4{x} = 2\log_8{2} + 2\log_8{x} \implies \frac{1}{2}\log_2{x} = \frac{2}{3} + \frac{2}{3}\log_2{x}$
$\implies -\frac{1}{6}\log_2{x} = \frac{2}{3} \implies \log_2{x} = -4 \implies x = \frac{1}{16}$ . Therefore, $1 + 16 = \boxed{017}$ | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | If we set $x=2^y$ , we can obtain three terms of a geometric sequence through logarithm properties. The three terms are \[\frac{y+1}{3}, \frac{y}{2}, y.\] In a three-term geometric sequence, the middle term squared is equal to the product of the other two terms, so we obtain the following: \[\frac{y^2+y}{3} = \frac{y^2}{4},\] which can be solved to reveal $y = -4$ . Therefore, $x = 2^{-4} = \frac{1}{16}$ , so our answer is $\boxed{017}$ | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | Let $r$ be the common ratio. We have \[r = \frac{\log_4{(x)}}{\log_8{(2x)}} = \frac{\log_2{(x)}}{\log_4{(x)}}\] Hence we obtain \[(\log_4{(x)})(\log_4{(x)}) = (\log_8{(2x)})(\log_2{(x)})\] Ideally we change everything to base $64$ and we can get: \[(\log_{64}{(x^3)})(\log_{64}{(x^3)}) = (\log_{64}{(x^6)})(\log_{64}{(4x^2)})\] Now divide to get: \[\frac{\log_{64}{(x^3)}}{\log_{64}{(4x^2)}} = \frac{\log_{64}{(x^6)}}{\log_{64}{(x^3)}}\] By change-of-base we obtain: \[\log_{(4x^2)}{(x^3)} = \log_{(x^3)}{(x^6)} = 2\] Hence $(4x^2)^2 = x^3 \rightarrow 16x^4 = x^3 \rightarrow x = \frac{1}{16}$ and we have $1+16 = \boxed{017}$ as desired. | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | Let $r$ be the common ratio, and let $a$ be the starting term ( $a=\log_{8}{(2x)}$ ). We then have: \[\log_{8}{(2x)}=a, \log_{4}{(x)}=ar, \log_{2}{(x)}=ar^2\] Rearranging these equations gives: \[8^a=2x, 4^{ar}=x, 2^{ar^2}=x\] Deal with the last two equations first: Setting them equal gives: \[4^{ar}=2^{ar^2} \implies 2^{2ar}=2^{ar^2} \implies 2ar=ar^2 \implies r=2\] Using this value of $r$ , substitute into the first and second equations (or the first and third, it doesn't really matter) to get: \[8^a=2x, 4^{2a}=x\] Changing these to a common base gives: \[2^{3a}=2x, 2^{4a}=x\] Dividing the first equation by 2 on both sides yields: \[2^{3a-1}=x\] Setting these equations equal to each other and removing the exponent again gives: \[3a-1=4a \implies a=-1\] Substituting this back into the first equation gives: \[8^{-1}=2x \implies 2x=\frac{1}{8} \implies x=\frac{1}{16}\] Therefore, $m+n=1+16=\boxed{017}$ | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | We can relate the logarithms as follows:
\[\frac{\log_4{x}}{\log_8{(2x)}}=\frac{\log_2{x}}{\log_4{x}}\] \[\log_8{(2x)}\log_2{x}=\log_4{x}\log_4{x}\]
Now we can convert all logarithm bases to $2$ using the identity $\log_a{b}=\log_{a^c}{b^c}$
\[\log_2{\sqrt[3]{2x}}\log_2{x}=\log_2{\sqrt{x}}\log_2{\sqrt{x}}\]
We can solve for $x$ as follows:
\[\frac{1}{3}\log_2{(2x)}\log_2{x}=\frac{1}{4}\log_2{x}\log_2{x}\] \[\frac{1}{3}\log_2{(2x)}=\frac{1}{4}\log_2{x}\] \[\frac{1}{3}\log_2{2}+\frac{1}{3}\log_2{x}=\frac{1}{4}\log_2{x}\] We get $x=\frac{1}{16}$ . Verifying that the common ratio is positive, we find the answer of $\boxed{017}$ | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | If the numbers are in a geometric sequence, the middle term must be the geometric mean of the surrounding terms. We can rewrite the first two logarithmic expressions as $\frac{1+\log_2{x}}{3}$ and $\frac{1}{2}\log_2{x}$ , respectively. Therefore: \[\frac{1}{2}\log_2{x}=\sqrt{\left(\frac{1+\log_2{x}}{3}\right)\left(\log_2{x}\right)}\] Let $n=\log_2{x}$ . We can rewrite the expression as: \[\frac{n}{2}=\sqrt{\frac{n(n+1)}{3}}\] \[\frac{n^2}{4}=\frac{n(n+1)}{3}\] \[4n(n+1)=3n^2\] \[4n^2+4n=3n^2\] \[n^2+4n=0\] \[n(n+4)=0\] \[n=0 \text{ and } -4\] Zero does not work in this case, so we consider $n=-4$ $\log_2{x}=-4 \rightarrow x=\frac{1}{16}$ . Therefore, $1+16=\boxed{017}$ | null | 017 |
505335cdde76bf6e03e28edbdd1c02e7 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_2 | There is a unique positive real number $x$ such that the three numbers $\log_8{2x}$ $\log_4{x}$ , and $\log_2{x}$ , in that order, form a geometric progression with positive common ratio. The number $x$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | Again, by the Change of Base Formula, obtain that the common ratio is 2. If we let $y$ be the exponent of $\log_8 (2x)$ , then we have $8^y=2x;\:4^{2y}=x;\:2^{4y}=x.$ Wee can then divide the first equation by two to have the right side be $x$ . Also, $2^{4y}=\left(2^{4}\right)^y=16^y$ . Setting this equal to $\frac{8^y}{2}$ , we can divide the two equations to get $2^y=\frac12$ . Therefore, $y=-1$ . After that, we can raise $16$ to the $-1$ th power to get $x=16^{-1}\Rightarrow x=\frac1{16}$ . We then get our sum of $1+16=\boxed{017}$ | null | 017 |
b731b9fe83ab1defd907f754faf05e0e | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_3 | A positive integer $N$ has base-eleven representation $\underline{a}\kern 0.1em\underline{b}\kern 0.1em\underline{c}$ and base-eight representation $\underline1\kern 0.1em\underline{b}\kern 0.1em\underline{c}\kern 0.1em\underline{a},$ where $a,b,$ and $c$ represent (not necessarily distinct) digits. Find the least such $N$ expressed in base ten. | From the given information, $121a+11b+c=512+64b+8c+a \implies 120a=512+53b+7c$ . Since $a$ $b$ , and $c$ have to be positive, $a \geq 5$ . Since we need to minimize the value of $n$ , we want to minimize $a$ , so we have $a = 5$ . Then we know $88=53b+7c$ , and we can see the only solution is $b=1$ $c=5$ . Finally, $515_{11} = 621_{10}$ , so our answer is $\boxed{621}$ | null | 621 |
5c254ab37b293331b101b31f28559e6c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_4 | Let $S$ be the set of positive integers $N$ with the property that the last four digits of $N$ are $2020,$ and when the last four digits are removed, the result is a divisor of $N.$ For example, $42,020$ is in $S$ because $4$ is a divisor of $42,020.$ Find the sum of all the digits of all the numbers in $S.$ For example, the number $42,020$ contributes $4+2+0+2+0=8$ to this total. | We note that any number in $S$ can be expressed as $a(10,000) + 2,020$ for some integer $a$ . The problem requires that $a$ divides this number, and since we know $a$ divides $a(10,000)$ , we need that $a$ divides 2020. Each number contributes the sum of the digits of $a$ , as well as $2 + 0 + 2 +0 = 4$ . Since $2020$ can be prime factorized as $2^2 \cdot 5 \cdot 101$ , it has $(2+1)(1+1)(1+1) = 12$ factors. So if we sum all the digits of all possible $a$ values, and add $4 \cdot 12 = 48$ , we obtain the answer.
Now we list out all factors of $2,020$ , or all possible values of $a$ $1,2,4,5,10,20,101,202,404,505,1010,2020$ . If we add up these digits, we get $45$ , for a final answer of $45+48=\boxed{093}$ | null | 093 |
5c254ab37b293331b101b31f28559e6c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_4 | Let $S$ be the set of positive integers $N$ with the property that the last four digits of $N$ are $2020,$ and when the last four digits are removed, the result is a divisor of $N.$ For example, $42,020$ is in $S$ because $4$ is a divisor of $42,020.$ Find the sum of all the digits of all the numbers in $S.$ For example, the number $42,020$ contributes $4+2+0+2+0=8$ to this total. | Note that for all $N \in S$ $N$ can be written as $N=10000x+2020=20(500x+101)$ for some positive integer $x$ . Because $N$ must be divisible by $x$ $\frac{20(500x+101)}{x}$ is an integer. We now let $x=ab$ , where $a$ is a divisor of $20$ . Then $\frac{20(500x+101)}{x}=(\frac{20}{a})( \frac{500x}{b}+\frac{101}{b})$ . We know $\frac{20}{a}$ and $\frac{500x}{b}$ are integers, so for $N$ to be an integer, $\frac{101}{b}$ must be an integer. For this to happen, $b$ must be a divisor of $101$ $101$ is prime, so $b\in \left \{ 1, 101 \right \}$ . Because $a$ is a divisor of $20$ $a \in \left \{ 1,2,4,5,10,20\right\}$ . So $x \in \left\{1,2,4,5,10,20,101,202,404,505,1010,2020\right\}$ . Be know that all $N$ end in $2020$ , so the sum of the digits of each $N$ is the sum of the digits of each $x$ plus $2+0+2+0=4$ . Hence the sum of all of the digits of the numbers in $S$ is $12 \cdot 4 +45=\boxed{093}$ | null | 093 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Realize that any sequence that works (ascending) can be reversed for descending, so we can just take the amount of sequences that satisfy the ascending condition and multiply by two.
If we choose any of the numbers $1$ through $6$ , there are five other spots to put them, so we get $6 \cdot 5 = 30$ . However, we overcount some cases. Take the example of $132456$ . We overcount this case because we can remove the $3$ or the $2$ . Therefore, any cases with two adjacent numbers swapped is overcounted, so we subtract $5$ cases (namely, $213456, 132456, 124356, 123546, 123465$ ,) to get $30-5=25$ , but we have to add back one more for the original case, $123456$ . Therefore, there are $26$ cases. Multiplying by $2$ gives the desired answer, $\boxed{052}$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Similar to above, a $1-1$ correspondence between ascending and descending is established by subtracting each number from $7$
We note that the given condition is equivalent to "cycling" $123456$ for a contiguous subset of it. For example,
$12(345)6 \rightarrow 125346, 124536$
It's not hard to see that no overcount is possible, and that the cycle is either $1$ "right" or $1$ "left." Therefore, we consider how many elements we flip by. If we flip $1$ or $2$ such elements, then there is one way to cycle them. Otherwise, we have $2$ ways. Therefore, the total number of ascending is $1 + 5 + 2(4 + 3 + 2 + 1) = 26$ , and multiplying by two gives $\boxed{052}.$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Similarly to above, we find the number of ascending arrangements and multiply by 2.
We can choose $5$ cards to be the ascending cards, therefore leaving $6$ places to place the remaining card. There are $\binom{6}{5}\cdot 6=36$ to do this. However, since the problem is asking for the number of arrangements, we overcount cases such as $123456$ . Notice that the only arrangements that overcount are $123456$ (case 1) or if two adjacent numbers of $123456$ are switched (case 2).
$\text{Case 1: }$ This arrangement is counted $6$ times. Each time it is counted for any of the $5$ numbers selected. Therefore we need to subtract $5$ cases of overcounting.
$\text{Case 2: }$ Each time $2$ adjacent numbers of switched, there is one overcount. For example, if we have $213456$ , both $1$ or $2$ could be removed. Since there are $5$ possible switches, we need to subtract $5$ cases of overcounting.
Therefore, we have $36-5-5=26$ total arrangements of ascending numbers. We multiply by two (for descending) to get the answer of $\boxed{052}.$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Like in previous solutions, we will count the number of ascending arrangements and multiply by 2.
First, consider the arrangement 1-2-3-4-5-6. That gives us 1 arrangement which works.
Next, we can switch two adjacent cards. There are 5 ways to pick two adjacent cards, so this gives us 5 arrangements.
Now, we can "cycle" 3 adjacent cards. For example, 1-2-3 becomes 2-3-1 which becomes 3-1-2. There are 4 ways to pick a set of 3 adjacent cards, so this gives us 4x2=8 arrangements.
Cycling 4 adjacent cards, we get the new arrangements 2-3-4-1 (which works), 3-4-1-2 (which doesn't work), and 4-1-2-3 (which does work). We get 6 arrangements.
Similarly, when cycling 5 cards, we find 2x2=4 arrangements, and when cycling 6 cards, we find 2x1=2 arrangements.
Adding, we figure out that there are 1+5+8+6+4+2=26 ascending arrangements. Multiplying by 2, we get the answer $\boxed{052}.$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | First count the number of permutations of the cards such that if one card is removed, the remaining cards will be in ascending order. There is $1$ such permutation where all the cards appear in order: $123456.$ There are $5$ such permutations where two adjacent cards are interchanged, as in $124356.$ The other such permutations arise from removing one card from $123456$ and placing it in a position at least two away from its starting location. There are $4$ such positions to place each of the cards numbered $1$ and $6,$ and $3$ such positions for each of the cards numbered $2, 3, 4,$ and $5.$ This accounts for $2\cdot4 + 4\cdot3 =20$ permutations. Thus there are $1 + 5 + 20 = 26$ permutations where one card can be removed so that the remaining cards are in ascending order. There is an equal number of permutations that result in the cards' being in descending order. This gives the total $26 + 26 = \boxed{52}$ | null | 52 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | More generally, suppose there are $n \geq 4$ cards numbered $1, 2, 3, \dots, n$ arranged in ascending order. If any one of the $n$ cards is removed and placed in one of the $n$ positions in the arrangement, the resulting permutation will have the property that one card can be removed so that the remaining cards are in ascending order. This accounts for $n\cdot n = n^2$ permutations. However, the original ascending order has been counted $n$ times, and each order that arises by switching two neighboring cards has been counted twice. Hence the number of arrangements where one card can be removed resulting in the remaining cards' being in ascending order is $n^2-(n-1)-(n-1)=(n-1)^2+1.$ When $n = 6$ , this is $(6-1)^2+1 = 26$ , and the final answer is $2\cdot26 = \boxed{52}$ | null | 52 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | For ascending, if the $1$ goes in anything but the first two slots, the rest of the numbers have to go in ascending from $2$ , which are $4$ cases if there are $6$ cards. If $1$ goes in the second spot, then you can put any of the rest in the first slot but then the rest are determined, so in the case of $6$ cards, that gives $5$ more. If $1$ goes in the first slot, that means that you are doing the same problem with $n-1$ cards. So the recursion is $a_n=(n-2)+(n-1)+a_{n-1}$ . There's $a_1=1$ and $a_2=2$ , so you get $a_3=2+3=5$ $a_4=5+5=10$ $a_5=7+10=17$ , and $a_6=9+17=26$ . Or you can see that $a_n=(n-1)^2+1$ . We double to account for descending and get $\boxed{052}$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | First, we know that ascending order and descending order are symmetrical to each other (namely, if we get 132456 where after we take out 3, it will be one scenario; and if we flip it and write 654231, it will be another scenario)
Thus, we only need to consider either descending or ascending and then times 2.
WLOG let us consider ascending order
Case 1: after we take out 1, the rest will be in ascending order:
Notice that 1 can be tucked in any one of the 6 spaces, thus there are 6 scenarios.
Case 2: after we take out 2, the rest will be in ascending order:
Notice that if we put 2 next to 1 (to the right or to the left of 1), it will be an overcount, so there are only 4 cases for 2.
It is easy to see that this is the same for 3, 4, 5, and 6.
Thus, in total, we have \[(6+4\times5)\times2=\boxed{052}\] ~Adali | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | We start with five cards in ascending order, then insert the sixth card to obtain a valid arrangement.
Based on the card to be inserted, we have six cases. As shown below, the red squares indicate the possible positions to insert the sixth card. [asy] /* Made by MRENTHUSIASM */ unitsize(7mm); void drawSquare(real x, real y) { draw((x+0.5,y+0.5)--(x-0.5,y+0.5)--(x-0.5,y-0.5)--(x+0.5,y-0.5)--cycle,red); } label("$2$",(0.5,8)); label("$3$",(2.5,8)); label("$4$",(4.5,8)); label("$5$",(6.5,8)); label("$6$",(8.5,8)); label("Insert $1.$",(13.5,8),red); drawSquare(-0.5,8); drawSquare(1.5,8); drawSquare(3.5,8); drawSquare(5.5,8); drawSquare(7.5,8); drawSquare(9.5,8); label("$1$",(0.5,6.5)); label("$3$",(2.5,6.5)); label("$4$",(4.5,6.5)); label("$5$",(6.5,6.5)); label("$6$",(8.5,6.5)); label("Insert $2.$",(13.5,6.5),red); drawSquare(3.5,6.5); drawSquare(5.5,6.5); drawSquare(7.5,6.5); drawSquare(9.5,6.5); label("$1$",(0.5,5)); label("$2$",(2.5,5)); label("$4$",(4.5,5)); label("$5$",(6.5,5)); label("$6$",(8.5,5)); label("Insert $3.$",(13.5,5),red); drawSquare(-0.5,5); drawSquare(5.5,5); drawSquare(7.5,5); drawSquare(9.5,5); label("$1$",(0.5,3.5)); label("$2$",(2.5,3.5)); label("$3$",(4.5,3.5)); label("$5$",(6.5,3.5)); label("$6$",(8.5,3.5)); label("Insert $4.$",(13.5,3.5),red); drawSquare(-0.5,3.5); drawSquare(1.5,3.5); drawSquare(7.5,3.5); drawSquare(9.5,3.5); label("$1$",(0.5,2)); label("$2$",(2.5,2)); label("$3$",(4.5,2)); label("$4$",(6.5,2)); label("$6$",(8.5,2)); label("Insert $5.$",(13.5,2),red); drawSquare(-0.5,2); drawSquare(1.5,2); drawSquare(3.5,2); drawSquare(9.5,2); label("$1$",(0.5,0.5)); label("$2$",(2.5,0.5)); label("$3$",(4.5,0.5)); label("$4$",(6.5,0.5)); label("$5$",(8.5,0.5)); label("Insert $6.$",(13.5,0.5),red); drawSquare(-0.5,0.5); drawSquare(1.5,0.5); drawSquare(3.5,0.5); drawSquare(5.5,0.5); [/asy] Note that all arrangements of the six cards are distinct.
There are $26$ arrangements in which removing one card will leave the remaining five cards in ascending order. By symmetry, there are $26$ arrangements in which removing one card will leave the remaining five cards in descending order. So, the answer is $26\cdot2=\boxed{052}.$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | We first realize that as long as we have an ascending sequence of $5$ numbers, we can just plug in a $6$ th to make a sequence that works. For example, if we have $12345$ , we can plug in a $6$ in any of $6$ spaces, before $1$ , between $1$ and $2$ , and so on to after $5$ . We can also realize that this is completely symmetrical if the sequence is in descending order. For example, we could have $54321$ , and we could plug in a 6 in 6 of the spaces. For the total number of combinations, we have 6 ascending cases multiplied by the $6$ places that can hold whatever number is missing, and multiply by 2 because there is descending and ascending number cases.
But wait, what if we have $12345$ and plug in a $6$ at the end and $12346$ and plug in a $5$ at the $5$ th spot? We have overcounted, so we need to subtract off the identical pairs. Assume that one of them is the "right" combination. That means that there are $1$ "right" combination because all the rest will have $2$ of their combinations taken by the previous one. For example, if I have $12356$ and $12346$ , I would count those $123456$ as $12356$ 's instead of $12346$ 's. Therefore, we have $6+4+4+4+4+4 = 26$ combinations of ascending order, and since we need to count those of descending order as well, we have $26\cdot2=\boxed{052}.$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | Like the previous solutions, we calculate ascending possibilities then multiply by two. Then, the configuration can look like +++++ or +-+++ (the minus can go anywhere), where "+" indicates an increase, and "-" indicates a decrease. Obviously, for the first case, the only possibility is 123456. For the second case, we can start with 123456, and then take either a card after the "-" and put it before the "-", or we could take a card before the "-" and put it after the "-". This means that every card other than the one at the position of the "-" can be used in one way. There are five ways to have 4 plus's, and one minus, and for each way, there are 5 ways to rearrange 123456 to achieve that. So, our answer is $2(5\cdot5+1)=\boxed{052}$ | null | 052 |
b948c1a1d38f5862d7a85a2006eaa17c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_5 | Six cards numbered $1$ through $6$ are to be lined up in a row. Find the number of arrangements of these six cards where one of the cards can be removed leaving the remaining five cards in either ascending or descending order. | First, we select $5$ of the $6$ cards to put in ascending or descending order. Then, we must add the other card to the group to arrange the six cards such that one can be removed so that the remaining cards are in ascending or descending order. Then, it would seem that the answer is $(6C5)*2$ (ascending or descending)* $6$ (the number of ways to place the last card). However, this overcounts some cases. For example, 123456 and 654321 can be made with 12345 and 6, 12346 and 5, etc. Furthermore, 654312 can be made with 65432 and 1 or 65431 and 2. Therefore, we first find that $(6C5)*2*4$ $48$ . Then, we add the special cases ( $123456$ $654321$ $654312$ $123465$ ) to obtain $\boxed{052}$ | null | 052 |
51bc1feeb99643c84e99354ecbdcd24f | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/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.$ | [asy] size(10cm); pair A, B, C, D, O, P, H, L, X, Y; A = (-1, 0); B = (1, 0); H = (0, 0); C = (5, 0); D = (9, 0); L = (7, 0); O = (0, sqrt(160/13 - 1)); P = (7, sqrt(160/13 - 4)); X = (0, sqrt(160/13 - 4)); Y = (O + P) / 2; draw(A -- O -- B -- cycle); draw(C -- P -- D -- cycle); draw(B -- C); draw(O -- P); draw(P -- X, dashed); draw(O -- H, dashed); draw(P -- L, dashed); draw(circle(O, sqrt(160/13))); draw(circle(P, sqrt(160/13))); path b = brace(L-(0,1), H-(0,1),0.5); draw(b); label("$r$", O -- Y, N); label("$r$", Y -- P, N); label("$r$", O -- A, NW); label("$r$", P -- D, NE); label("$1$", A -- H, N); label("$2$", L -- D, N); label("$7$", b, S); dot(A^^B^^C^^D^^O^^P^^H^^L^^X^^Y,linewidth(4)); [/asy] Set the common radius to $r$ . First, take the cross section of the sphere sitting in the hole of radius $1$ . If we draw the perpendicular bisector of the chord (the hole) through the circle, this line goes through the center. Connect the center also to where the chord hits the circle, for a right triangle with hypotenuse $r$ and base $1$ . Therefore, the height of this circle outside of the hole is $\sqrt{r^2-1}$
The other circle follows similarly for a height (outside the hole) of $\sqrt{r^2-4}$ . Now, if we take the cross section of the entire board, essentially making it two-dimensional, we can connect the centers of the two spheres, then form another right triangle with base $7$ , as given by the problem. The height of this triangle is the difference between the heights of the parts of the two spheres outside the holes, which is $\sqrt{r^2-1} - \sqrt{r^2-4}$ . Now we can set up an equation in terms of $r$ with the Pythagorean theorem: \[\left(\sqrt{r^2-1} - \sqrt{r^2-4}\right)^2 + 7^2 = (2r)^2.\] Simplifying a few times, \begin{align*} r^2 - 1 - 2\left(\sqrt{(r^2-1)(r^2-4)}\right) + r^2 - 4 + 49 &= 4r^2 \\ 2r^2-44 &= -2\left(\sqrt{(r^2-1)(r^2-4)}\right) \\ 22-r^2 &= \left(\sqrt{r^4 - 5r^2 + 4}\right) \\ r^4 -44r^2 + 484 &= r^4 - 5r^2 + 4 \\ 39r^2&=480 \\ r^2&=\frac{480}{39} = \frac{160}{13}. \end{align*} Therefore, our answer is $\boxed{173}$ | null | 173 |
55df6670e356626314d96e25fd5566ff | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_7 | A club consisting of $11$ men and $12$ women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as $1$ member or as many as $23$ members. Let $N$ be the number of such committees that can be formed. Find the sum of the prime numbers that divide $N.$ | Let $k$ be the number of women selected. Then, the number of men not selected is $11-(k-1)=12-k$ .
Note that the sum of the number of women selected and the number of men not selected is constant at $12$ . Each combination of women selected and men not selected corresponds to a committee selection. Since choosing 12 individuals from the total of 23 would give $k$ women and $12-k$ men, the number of committee selections is $\binom{23}{12}$ .
The answer is $\boxed{081}$ .
~awang11's sol | null | 081 |
55df6670e356626314d96e25fd5566ff | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_7 | A club consisting of $11$ men and $12$ women needs to choose a committee from among its members so that the number of women on the committee is one more than the number of men on the committee. The committee could have as few as $1$ member or as many as $23$ members. Let $N$ be the number of such committees that can be formed. Find the sum of the prime numbers that divide $N.$ | We casework on the amount of men on the committee.
If there are no men in the committee, there are $\dbinom{12}{1}$ ways to pick the women on the committee, for a total of $\dbinom{11}{0} \cdot \dbinom{12}{1}$ . Notice that $\dbinom{11}{0}$ is equal to $\dbinom{11}{11}$ , so the case where no men are picked can be grouped with the case where all men are picked. When all men are picked, all women must also be picked, for a total of $\dbinom{12}{12}$ . Therefore, these cases can be combined to \[\dbinom{11}{0} \cdot \left(\dbinom{12}{1} + \dbinom{12}{12}\right)\] Since $\dbinom{12}{12} = \dbinom{12}{0}$ , and $\dbinom{12}{0} + \dbinom{12}{1} = \dbinom{13}{1}$ , we can further simplify this to \[\dbinom{11}{0} \cdot \dbinom{13}{1}\]
All other cases proceed similarly. For example, the case with one men or ten men is equal to $\dbinom{11}{1} \cdot \dbinom{13}{2}$ . Now, if we factor out a $13$ , then all cases except the first two have a factor of $121$ , so we can factor this out too to make our computation slightly easier. The first two cases (with $13$ factored out) give $1+66=67$ , and the rest gives $121(10+75+270+504) = 103,939$ . Adding the $67$ gives $104,006$ . Now, we can test for prime factors. We know there is a factor of $2$ , and the rest is $52,003$ . We can also factor out a $7$ , for $7,429$ , and the rest is $17 \cdot 19 \cdot 23$ . Adding up all the prime factors gives $2+7+13+17+19+23 = \boxed{081}$ | null | 081 |
466c83ebadd3a3456255daced3ba4dce | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_8 | A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | [asy] size(8cm); pair O, A, B, C, D, F, G, H, I, P, X; O = (0, 0); A = (5, 0); X = (8, 0); P = (5, 5 / sqrt(3)); B = rotate(-120, A) * ((O + A) / 2); C = rotate(-120, B) * ((A + B) / 2); D = rotate(-120, C) * ((B + C) / 2); F = rotate(-120, D) * ((C + D) / 2); G = rotate(-120, F) * ((D + F) / 2); H = rotate(-120, G) * ((F + G) / 2); I = rotate(-120, H) * ((G + H) / 2); draw(O -- A -- B -- C -- D -- F -- G -- H -- I); draw(A -- X, dashed); markscalefactor = 0.05; path angle = anglemark(X, A, B); draw(angle); dot(P); dot(O); dot(A); dot(B); dot(C); dot(D); label("$O$", O, W); label("$P$", P, E); label("$A$", A, S); label("$B$", B, E); label("$C$", C, E); label("$D$", D, W); label("$60^\circ$", angle, ENE*3); [/asy]
We notice that the moves cycle every 6 moves, so we plot out the first 6 moves on the coordinate grid with point $O$ as the origin. We will keep a tally of the x-coordinate and y-coordinate separately. Then, we will combine them and account for the cycling using the formula for an infinite geometric series.
First move: The ant moves right $5$ .
Second move: We use properties of a $30-60-90$ triangle to get $\frac{5}{4}$ right, $\frac{5\sqrt{3}}{4}$ up.
Third move: $\frac{5}{8}$ left, $\frac{5\sqrt{3}}{8}$ up.
Fourth move: $\frac{5}{8}$ left.
Fifth move: $\frac{5}{32}$ left, $\frac{5\sqrt{3}}{32}$ down.
Sixth move: $\frac{5}{64}$ right, $\frac{5\sqrt{3}}{64}$ down.
Total of x-coordinate: $5 + \frac{5}{4} - \frac{5}{8} - \frac{5}{8} - \frac{5}{32} + \frac{5}{64} = \frac{315}{64}$ .
Total of y-coordinate: $0 + \frac{5\sqrt{3}}{4} + \frac{5\sqrt{3}}{8} + 0 - \frac{5\sqrt{3}}{32} - \frac{5\sqrt{3}}{64} = \frac{105\sqrt{3}}{64}$
After this cycle of six moves, all moves repeat with a factor of $(\frac{1}{2})^6 = \frac{1}{64}$ . Using the formula for a geometric series, multiplying each sequence by $\frac{1}{1-\frac{1}{64}} = \frac{64}{63}$ will give us the point $P$
Now, knowing the initial $x$ and $y,$ we plug this into the geometric series formula ( $\frac{a}{1-r}$ ), and we get $\frac{315}{64} \cdot \frac{64}{63} = 5$ $\frac{105\sqrt{3}}{64} \cdot \frac{64}{63} = \frac{5\sqrt{3}}{3}$ .
Therefore, the coordinates of point $P$ are $(5,\frac{5\sqrt{3}}{3})$ , so using the Pythagorean Theorem, $OP^2 = \frac{100}{3}$ , for an answer of $\boxed{103}$ | null | 103 |
466c83ebadd3a3456255daced3ba4dce | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_8 | A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | We place the ant at the origin of the complex plane with its first move being in the positive real direction. Then the ant's journey can be represented as the infinite series \[5\left(1 + \frac{e^{\frac{i\pi}{3}}}{2} + \left(\frac{e^{\frac{i\pi}{3}}}{2}\right)^2 + \cdots\right)\] Using the formula for an infinite geometric series, this is equal to \[\frac{5}{1 - \frac12e^{\frac{i\pi}{3}}} = \frac{5}{1 - \frac{1 + i\sqrt{3}}{4}} = \frac{20}{3 - i\sqrt{3}} = 5 + \frac{5i\sqrt{3}}{3}\] We are looking for the square of the modulus of this value: \[\left|\frac{5 + 5i\sqrt{3}}{3}\right|^2 = 25 + \frac{25}{3} = \frac{100}{3}\] so the answer is $100 + 3 = \boxed{103}$ | null | 103 |
466c83ebadd3a3456255daced3ba4dce | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_8 | A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | The ant goes in the opposite direction every $3$ moves, going $(1/2)^3=1/8$ the distance backwards. Using geometric series, he travels $1-1/8+1/64-1/512...=(7/8)(1+1/64+1/4096...)=(7/8)(64/63)=8/9$ the distance of the first three moves over infinity moves. Now, we use coordinates meaning $(5+5/4-5/8, 0+5\sqrt3/4+5\sqrt3/8)$ or $(45/8, 15\sqrt3/8)$ . Multiplying these by $8/9$ , we get $(5, 5\sqrt3/3)$ $\implies$ $\boxed{103}$ | null | 103 |
466c83ebadd3a3456255daced3ba4dce | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_8 | A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | The bug goes forward and backward in three directions: straight east, northeast, and northwest. It travels $5-\frac{5}{8}+\frac{5}{64}-\cdots=\frac{40}{9}$ units east. Thus, it goes northeast $\frac{\frac{40}{9}}{2}=\frac{20}{9}$ units northeast and $\frac{10}{9}$ units northwest. Now, the bug travels a total of $\frac{40}{9}+\frac{10}{9}-\frac{5}{9}=\frac{45}{9}=5$ units east and a total of $\frac{10\sqrt{3}}{9}+\frac{5\sqrt{3}}{9}=\frac{15\sqrt{3}}{9}=\frac{5\sqrt{3}}{3}$ units north because of the 30-60-90 right triangles formed. Now, $OP^2=5^2+\frac{5^2}{3}=\frac{100}{3}$ by the Pythagorean Theorem, and the answer is $\boxed{103}$ | null | 103 |
466c83ebadd3a3456255daced3ba4dce | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_8 | A bug walks all day and sleeps all night. On the first day, it starts at point $O$ , faces east, and walks a distance of $5$ units due east. Each night the bug rotates $60^\circ$ counterclockwise. Each day it walks in this new direction half as far as it walked the previous day. The bug gets arbitrarily close to the point $P$ . Then $OP^2=\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | The bug's bearings on each traversal are $0^\circ, 60^\circ, 120^\circ,$ and so on; in general, the $n-$ th traversal has length $5\cdot (1/2)^{n-1}$ and bearing $60(n-1).$ This means that the $x$ and $y$ displacements for the $n-$ th traversal are
\[(\Delta x_n, \Delta y_n)=(5\cdot (1/2)^{n-1}\cos (60(n-1))^\circ,5\cdot (1/2)^{n-1}\sin (60(n-1))^\circ).\]
Summing this over all the displacements, we get
\[x_P=\sum_{n=1}^{\infty} 5\cdot (1/2)^{n-1}\cos (60(n-1))^\circ, y_P=\sum_{n=1}^{\infty} 5\cdot (1/2)^{n-1}\sin (60(n-1))^\circ.\]
We then have
\begin{align} OP^2 &= x_P^2+y_P^2 \\ &=\sum_{n=1}^{\infty} (5\cdot (1/2)^{n-1}\cos ^2(60(n-1))^\circ) + (5\cdot (1/2)^{n-1}\sin ^2(60(n-1))^\circ) \\ &= \sum_{n=1}^{\infty} (5\cdot (1/2)^{n-1})^2(\cos ^2 (60(n-1))^\circ+\sin ^2 (60(n-1))^\circ) \\ &= \sum_{n=1}^{\infty} (25\cdot (1/4)^{n-1}) \\ &= \dfrac{25}{1-1/4} \\ &= 100/3. \end{align}
Thus, the answer is $100+3=\boxed{103}.$ --MenuThreeOne | null | 103 |
ddba73cbc64709141086c7ce7b431d53 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_9 | Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random with replacement from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m.$ | [asy] size(12cm); for (int x = 1; x < 18; ++x) { draw((x, 0) -- (x, 9), dotted); } for (int y = 1; y < 9; ++y) { draw((0, y) -- (18, y), dotted); } draw((0, 0) -- (18, 0) -- (18, 9) -- (0, 9) -- cycle); pair b1, b2, b3; pair c1, c2, c3; pair a1, a2, a3; b1 = (3, 0); b2 = (12, 0); b3 = (16, 0); c1 = (0, 2); c2 = (0, 4); c3 = (0, 8); a1 = b1 + c1; a2 = b2 + c2; a3 = b3 + c3; draw(b1 -- a1 -- c1); draw(b2 -- a2 -- c2); draw(b3 -- a3 -- c3); dot(a1); dot(a2); dot(a3); label("$a_1$", a1, NE); label("$a_2$", a2, NE); label("$a_3$", a3, NE); label("$b_1$", b1, S); label("$b_2$", b2, S); label("$b_3$", b3, S); label("$c_1$", c1, W); label("$c_2$", c2, W); label("$c_3$", c3, W); [/asy]
First, prime factorize $20^9$ as $2^{18} \cdot 5^9$ . Denote $a_1$ as $2^{b_1} \cdot 5^{c_1}$ $a_2$ as $2^{b_2} \cdot 5^{c_2}$ , and $a_3$ as $2^{b_3} \cdot 5^{c_3}$
In order for $a_1$ to divide $a_2$ , and for $a_2$ to divide $a_3$ $b_1\le b_2\le b_3$ , and $c_1\le c_2\le c_3$ . We will consider each case separately. Note that the total amount of possibilities is $190^3$ , as there are $(18+1)(9+1)=190$ choices for each factor.
We notice that if we add $1$ to $b_2$ and $2$ to $b_3$ , then we can reach the stronger inequality $0\le b_1<b_2+1<b_3+2\le 20$ . Therefore, if we pick $3$ integers from $0$ to $20$ , they will correspond to a unique solution, forming a 1-1 correspondence between the numbers $b_1$ $b_2+1$ , and $b_3+2$ . This is also equivalent to applying stars and bars on distributing the powers of 2 and 5 through differences. The amount of solutions to this inequality is $\dbinom{21}{3}$
The case for $c_1$ $c_2$ , and $c_3$ proceeds similarly for a result of $\dbinom{12}{3}$ . Therefore, the probability of choosing three such factors is \[\frac{\dbinom{21}{3} \cdot \dbinom{12}{3}}{190^3}.\] Simplification gives $\frac{77}{1805}$ , and therefore the answer is $\boxed{077}$ | null | 077 |
ddba73cbc64709141086c7ce7b431d53 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_9 | Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random with replacement from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m.$ | Same as before, say the factors have powers of $b$ and $c$ $b_1, b_2, b_3$ can either be all distinct, all equal, or two of the three are equal. As well, we must have $b_1 \leq b_2 \leq b_3$ . If they are all distinct, the number of cases is simply ${19 \choose 3}$ . If they are all equal, there are only $19$ cases for the general value. If we have a pair equal, then we have $2 \cdot {19\choose 2}$ . We need to multiply by $2$ because if we have two values $b_i < b_j$ , we can have either $(b_i, b_i, b_j)$ or $(b_i, b_j, b_j)$
\[{19 \choose 3} + 2 \cdot {19 \choose 2} + 19 = 1330\]
Likewise for $c$ , we get
\[{10 \choose 3} + 2 \cdot {10 \choose 2} + 10 = 220\]
The final probability is simply $\frac{1330 \cdot 220}{190^3}$ . Simplification gives $\frac{77}{1805}$ , and therefore the answer is $\boxed{077}$ | null | 077 |
ddba73cbc64709141086c7ce7b431d53 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_9 | Let $S$ be the set of positive integer divisors of $20^9.$ Three numbers are chosen independently and at random with replacement from the set $S$ and labeled $a_1,a_2,$ and $a_3$ in the order they are chosen. The probability that both $a_1$ divides $a_2$ and $a_2$ divides $a_3$ is $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m.$ | Similar to before, we calculate that there are $190^3$ ways to choose $3$ factors with replacement. Then, we figure out the number of triplets ${a,b,c}$ and ${d,f,g}$ , where $a$ $b$ , and $c$ represent powers of $2$ and $d$ $f$ , and $g$ represent powers of $5$ , such that the triplets are in non-descending order. The maximum power of $2$ is $18$ , and the maximum power of $5$ is $9$ . Using the Hockey Stick identity, we figure out that there are $\dbinom{12}{3}$ ways to choose $d$ $f$ and $g$ , and $\dbinom{21}{3}$ ways to choose $a$ $b$ , and $c$ . Therefore, the probability of choosing $3$ factors which satisfy the conditions is \[\frac{\dbinom{21}{3} \cdot \dbinom{12}{3}}{190^3}.\] This simplifies to $\frac{77}{1805}$ , therefore $m =$ $\boxed{077}$ | null | 077 |
bc8425bf2efc4ca0dcf9089a4c993d3c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_10 | Let $m$ and $n$ be positive integers satisfying the conditions
$\quad\bullet\ \gcd(m+n,210)=1,$
$\quad\bullet\ m^m$ is a multiple of $n^n,$ and
$\quad\bullet\ m$ is not a multiple of $n.$
Find the least possible value of $m+n.$ | Taking inspiration from $4^4 \mid 10^{10}$ we are inspired to take $n$ to be $p^2$ , the lowest prime not dividing $210$ , or $11 \implies n = 121$ . Now, there are $242$ factors of $11$ , so $11^{242} \mid m^m$ , and then $m = 11k$ for $k \geq 22$ . Now, $\gcd(m+n, 210) = \gcd(11+k,210) = 1$ . Noting $k = 26$ is the minimal that satisfies this, we get $(n,m) = (121,286)$ . Thus, it is easy to verify this is minimal and we get $\boxed{407}$ . ~awang11 | null | 407 |
bc8425bf2efc4ca0dcf9089a4c993d3c | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_10 | Let $m$ and $n$ be positive integers satisfying the conditions
$\quad\bullet\ \gcd(m+n,210)=1,$
$\quad\bullet\ m^m$ is a multiple of $n^n,$ and
$\quad\bullet\ m$ is not a multiple of $n.$
Find the least possible value of $m+n.$ | Assume for the sake of contradiction that $n$ is a multiple of a single digit prime number, then $m$ must also be a multiple of that single digit prime number to accommodate for $n^n | m^m$ . However that means that $m+n$ is divisible by that single digit prime number, which violates $\gcd(m+n,210) = 1$ , so contradiction.
$n$ is also not 1 because then $m$ would be a multiple of it.
Thus, $n$ is a multiple of 11 and/or 13 and/or 17 and/or...
Assume for the sake of contradiction that $n$ has at most 1 power of 11, at most 1 power of 13...and so on...
Then, for $n^n | m^m$ to be satisfied, $m$ must contain at least the same prime factors that $n$ has. This tells us that for the primes where $n$ has one power of, $m$ also has at least one power, and since this holds true for all the primes of $n$ $n|m$ . Contradiction.
Thus $n$ needs more than one power of some prime.
The obvious smallest possible value of $n$ now is $11^2 =121$ .
Since $121^{121}=11^{242}$ , we need $m$ to be a multiple of 11 at least $242$ that is not divisible by $121$ and most importantly, $\gcd(m+n,210) = 1$ $242$ is divisible by $121$ , out. $253+121$ is divisible by 2, out. $264+121$ is divisible by 5, out. $275+121$ is divisible by 2, out. $286+121=37\cdot 11$ and satisfies all the conditions in the given problem, and the next case $n=169$ will give us at least $169\cdot 3$ , so we get $\boxed{407}$ | null | 407 |
46c1d2442cc661b3e471bceff745af24 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_11 | For integers $a,b,c$ and $d,$ let $f(x)=x^2+ax+b$ and $g(x)=x^2+cx+d.$ Find the number of ordered triples $(a,b,c)$ of integers with absolute values not exceeding $10$ for which there is an integer $d$ such that $g(f(2))=g(f(4))=0.$ | There can be two different cases for this problem, either $f(2)=f(4)$ or not. If it is, note that by Vieta's formulas $a = -6$ . Then, $b$ can be anything. However, $c$ can also be anything, as we can set the root of $g$ (not equal to $f(2) = f(4)$ ) to any integer, producing a possible integer value of $d$ . Therefore there are $21^2 = 441$ in this case*. If it isn't, then $f(2),f(4)$ are the roots of $g$ . This means by Vieta's, that:
\[f(2)+f(4) = -c \in [-10,10]\] \[20 + 6a + 2b \in [-10,10]\] \[3a + b \in [-15,-5].\]
Solving these inequalities while considering that $a \neq -6$ to prevent $f(2) = f(4)$ , we obtain $69$ possible tuples and adding gives $441+69=\boxed{510}$ .
~awang11 | null | 510 |
46c1d2442cc661b3e471bceff745af24 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_11 | For integers $a,b,c$ and $d,$ let $f(x)=x^2+ax+b$ and $g(x)=x^2+cx+d.$ Find the number of ordered triples $(a,b,c)$ of integers with absolute values not exceeding $10$ for which there is an integer $d$ such that $g(f(2))=g(f(4))=0.$ | Define $h(x)=x^2+cx$ . Since $g(f(2))=g(f(4))=0$ , we know $h(f(2))=h(f(4))=-d$ . Plugging in $f(x)$ into $h(x)$ , we get $h(f(x))=x^4+2ax^3+(2b+a^2+c)x^2+(2ab+ac)x+(b^2+bc)$ . Setting $h(f(2))=h(f(4))$ \[16+16a+8b+4a^2+4ab+b^2+4c+2ac+bc=256+128a+32b+16a^2+8ab+b^2+16c+4ac+bc\] . Simplifying and cancelling terms, \[240+112a+24b+12a^2+4ab+12c+2ac=0\] \[120+56a+12b+6a^2+2ab+6c+ac=0\] \[6a^2+2ab+ac+56a+12b+6c+120=0\] \[6a^2+2ab+ac+20a+36a+12b+6c+120=0\] \[a(6a+2b+c+20)+6(6a+2b+c+20)=0\] \[(a+6)(6a+2b+c+20)=0\]
Therefore, either $a+6=0$ or $6a+2b+c=-20$ . The first case is easy: $a=-6$ and there are $441$ tuples in that case. In the second case, we simply perform casework on even values of $c$ , to get $77$ tuples, subtracting the $8$ tuples in both cases we get $441+77-8=\boxed{510}$ | null | 510 |
34b3509ceeeaf53295b7f637945eee99 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_12 | Let $n$ be the least positive integer for which $149^n-2^n$ is divisible by $3^3\cdot5^5\cdot7^7.$ Find the number of positive integer divisors of $n.$ | As usual, denote $v_p(n)$ the highest power of prime $p$ that divides $n$ Lifting the Exponent shows that \[3=v_3(149^n-2^n) = v_3(n) + v_3(147) = v_3(n)+1\] so thus, $3^2$ divides $n$ . It also shows that \[7=v_7(149^n-2^n) = v_7(n) + v_7(147) = v_7(n)+2\] so thus, $7^5$ divides $n$
Now, setting $n = 4c$ (necessitated by $149^n \equiv 2^n \pmod 5$ in order to set up LTE), we see \[v_5(149^{4c}-2^{4c}) = v_5(149^{4c}-16^{c})\] and since $149^{4} \equiv 1 \pmod{25}$ and $16^1 \equiv 16 \pmod{25}$ then $v_5(149^{4c}-2^{4c})=v_5(149^4-16)+v_5(c)=1+v_5(c)$ meaning that we have that by LTE, $5^4 | c$ and $4 \cdot 5^4$ divides $n$
Since $3^2$ $7^5$ and $4\cdot 5^4$ all divide $n$ , the smallest value of $n$ working is their LCM, also $3^2 \cdot 7^5 \cdot 4 \cdot 5^4 = 2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5$ . Thus the number of divisors is $(2+1)(2+1)(4+1)(5+1) = \boxed{270}$ | null | 270 |
34b3509ceeeaf53295b7f637945eee99 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_12 | Let $n$ be the least positive integer for which $149^n-2^n$ is divisible by $3^3\cdot5^5\cdot7^7.$ Find the number of positive integer divisors of $n.$ | Note that for all $n$ $149^n - 2^n$ is divisible by $149-2 = 147$ by difference of $n$ th powers. That is $3\cdot7^2$ , so now we can clearly see that the smallest $n$ to make the expression divisible by $3^3$ is just $3^2$ . Similarly, we can reason that the smallest $n$ to make the expression divisible by $7^7$ is just $7^5$
Finally, for $5^5$ , take $\pmod {5}$ and $\pmod {25}$ of each quantity (They happen to both be $-1$ and $2$ respectively, so you only need to compute once). One knows from Fermat's theorem that the maximum possible minimum $n$ for divisibility by $5$ is $4$ , and other values are factors of $4$ . Testing all of them(just $1$ $2$ $4$ using mods-not too bad), $4$ is indeed the smallest value to make the expression divisible by $5$ , and this clearly is NOT divisible by $25$ .
Therefore, the smallest $n$ to make this expression divisible by $5^5$ is $2^2 \cdot 5^4$
Calculating the LCM of all these, one gets $2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5$ . Using the factor counting formula,
the answer is $3\cdot3\cdot5\cdot6$ $\boxed{270}$ | null | 270 |
34b3509ceeeaf53295b7f637945eee99 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_12 | Let $n$ be the least positive integer for which $149^n-2^n$ is divisible by $3^3\cdot5^5\cdot7^7.$ Find the number of positive integer divisors of $n.$ | As usual, denote $v_p(n)$ the highest power of prime $p$ that divides $n$ . For divisibility by $3^3$ , notice that $v_3(149^3 - 2^3) = 2$ as $149^3 - 2^3 =$ $(147)(149^2 + 2\cdot149 + 2^2)$ , and upon checking mods, $149^2 + 2\cdot149 + 2^2$ is divisible by $3$ but not $9$ . In addition, $149^9 - 2^9$ is divisible by $3^3$ because $149^9 - 2^9 = (149^3 - 2^3)(149^6 + 149^3\cdot2^3 + 2^6)$ , and the rightmost factor equates to $1 + 1 + 1 \pmod{3} \equiv 0 \pmod{3}$ . In fact, $n = 9 = 3^2$ is the least possible choice to ensure divisibility by $3^3$ because if $n = a \cdot 3^b$ , with $3 \nmid a$ and $b < 2$ , we write \[149^{a \cdot 3^b} - 2^{a \cdot 3^b} = (149^{3^b} - 2^{3^b})(149^{3^b(a - 1)} + 149^{3^b(a - 2)}\cdot2^{3^b}+\cdots2^{3^b(a - 1)}).\] Then, the rightmost factor is equivalent to $\pm a \pmod{3} \not\equiv 0 \pmod{3}$ , and $v_3(149^{3^b} - 2^{3^b}) = b + 1 < 3$
For divisibility by $7^7$ , we'll induct, claiming that $v_7(149^{7^k} - 2^{7^k}) = k + 2$ for whole numbers $k$ . The base case is clear. Then, \[v_7(149^{7^{k+1}} - 2^{7^{k+1}}) = v_7(149^{7^k} - 2^{7^k}) + v_7(149^{6\cdot7^k} + 2^{7^k}\cdot149^{5\cdot7^k} + \cdots + 2^{5\cdot7^k}\cdot149^{7^k} + 2^{6\cdot7^k}).\] By the induction hypothesis, $v_7(149^{7^k} - 2^{7^k}) = k + 2$ . Then, notice that \[S(k) = 149^{6\cdot7^k} + 2^{7^k}\cdot149^{5\cdot7^k} + \cdots + 2^{5\cdot7^k}\cdot149^{7^k} + 2^{6\cdot7^k} \equiv 7 \cdot 2^{6\cdot7^k}\pmod{7} \equiv 7 \cdot 2^{6\cdot7^k}\pmod{49}.\] This tells us that $S(k)$ is divisible by $7$ , but not $49$ so that $v_7\left(S(k)\right) = 1$ , completing our induction. We can verify that $7^5$ is the least choice of $n$ to ensure divisibility by $7^7$ by arguing similarly to the $3^3$ case.
Finally, for $5^5$ , we take the powers of $149$ and $2$ in mod $5$ and mod $25$ . Writing out these mods, we have that $149^n \equiv 2^n \pmod{5}$ if and only if $4 | n$ , in which $149^n \equiv 2^n \equiv 1 \pmod{5}$ . So here we claim that $v_5(149^{4\cdot5^k} - 2^{4\cdot5^k}) = k + 1$ and perform yet another induction. The base case is true: $5 | 149^4 - 2^4$ , but $149^4 - 2^4 \equiv 1 - 16 \pmod{25}$ . Now then, assuming the induction statement to hold for some $k$ \[v_5(149^{4\cdot5^{k+1}} - 2^{4\cdot5^{k+1}}) = (k+1) + v_5(149^{4\cdot4\cdot5^k}+2^{4\cdot5^k}\cdot149^{3\cdot4\cdot5^k}+\cdots+2^{3\cdot4\cdot5^k}\cdot149^{4\cdot5^k}+2^{4\cdot4\cdot5^k}).\] Note that $S'(k) = 149^{4\cdot4\cdot5^k}+2^{4\cdot5^k}\cdot149^{3\cdot4\cdot5^k}+\cdots+2^{3\cdot4\cdot5^k}\cdot149^{4\cdot5^k}+2^{4\cdot4\cdot5^k}$ equates to $S''(k) = 1 + 2^{4\cdot5^k} + \cdots + 2^{16\cdot5^k}$ in both mod $5$ and mod $25$ . We notice that $S''(k) \equiv 0 \pmod{5}$ . Writing out the powers of $2$ mod $25$ , we have $S''(0) \equiv 5 \pmod{25}$ . Also $2^n \equiv 1 \pmod{25}$ when $n$ is a multiple of $20$ . Hence for $k > 0$ $S''(k) \equiv 5 \mod{25}$ . Thus, $v_5\left(S'(k)\right) = 1$ , completing our induction. Applying the same argument from the previous two cases, $4\cdot5^4$ is the least choice to ensure divisibility by $5^5$
Our answer is the number of divisors of $\text{lcm}(3^2, 7^5, 2^2\cdot5^4) = 2^2 \cdot 3^2 \cdot 5^4 \cdot 7^5$ . It is $(2 + 1)(2 + 1)(4 + 1)(5 + 1) = \boxed{270}$ | null | 270 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Points are defined as shown. It is pretty easy to show that $\triangle AFE \sim \triangle AGH$ by spiral similarity at $A$ by some short angle chasing. Now, note that $AD$ is the altitude of $\triangle AFE$ , as the altitude of $AGH$ . We need to compare these altitudes in order to compare their areas. Note that Stewart's theorem implies that $AD/2 = \frac{\sqrt{18}}{2}$ , the altitude of $\triangle AFE$ . Similarly, the altitude of $\triangle AGH$ is the altitude of $\triangle ABC$ , or $\frac{3\sqrt{7}}{2}$ . However, it's not too hard to see that $GB = HC = 1$ , and therefore $[AGH] = [ABC]$ . From here, we get that the area of $\triangle ABC$ is $\frac{15\sqrt{7}}{14} \implies \boxed{036}$ , by similarity. ~awang11 | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Let $M_A$ $M_B$ $M_C$ be the midpoints of arcs $BC$ $CA$ $AB$ . By Fact 5, we know that $M_AB = M_AC = M_AI$ , and so by Ptolmey's theorem, we deduce that \[AB\cdot M_AC + AC\cdot M_AB = BC\cdot M_AA \implies M_AA = 2M_AI.\] In particular, we have $AI = IM_A$ [asy] defaultpen(fontsize(10pt)); size(200); pair A, B, C, D, E, F, I, P, MA, MB, MC; B = (0,0); C = (5,0); A = IP(Circle(B, 4), Circle(C, 6), 0); I = incenter(A, B, C); D = extension(A, I, B, C); P = midpoint(A--D); E = extension(P, rotate(90, P)*A, B, I); F = extension(P, rotate(90, P)*A, C, I); MA = IP(Line(A, I, 20), circumcircle(A, B, C), 1); MB = IP(Line(B, I, 20), circumcircle(A, B, C), 1); MC = IP(Line(C, I, 20), circumcircle(A, B, C), 1); draw(A--B--C--cycle, orange); draw(circumcircle(A, B, C), red); draw(A--E--F--cycle, lightblue); draw(E--D--F, lightblue); draw(A--MA^^B--MB^^C--MC, heavygreen); draw(MA--MB--MC--cycle, magenta); dot("$A$", A, dir(120)); dot("$B$", B, dir(220)); dot("$C$", C, dir(320)); dot("$D$", D, dir(230)); dot("$E$", E, dir(330)); dot("$F$", F, dir(250)); dot("$I$", I, dir(80)); dot("$M_A$", MA, dir(270)); dot("$M_B$", MB, dir(60)); dot("$M_C$", MC, dir(150)); [/asy] Now the key claim is that:
Claim: $\triangle DEF$ and $\triangle M_AM_BM_C$ are homothetic at $I$ with ratio $2$
Proof. First, we show that $D$ is the midpoint of $M_AI$ . Indeed, we have \[\frac{ID}{DM_A} = \frac{BI}{BM_A}\cdot \frac{\sin\angle IBC}{\sin \angle CBM_A} = \frac{BI}{AI}\cdot\frac{\sin \angle B/2}{\sin \angle A/2} = 1\] by Ratio lemma and Law of Sines.
Now observe that:
Combining these facts gives that $\overline{EF}$ is a midline in $\triangle IM_BM_C$ , which proves the claim. $\blacksquare$
To finish, we compute $[M_AM_BM_C]$ , noting that $[AEF] = [DEF] = \tfrac{1}{4}[M_AM_BM_C]$
By Heron's, we can calculate the circumradius $R = 8/\sqrt{7}$ , and by Law of Cosines, we get \begin{align*}\cos A &= \frac{9}{16}\implies \cos A/2 = \frac{5}{\sqrt{32}} \\ \cos B &= \frac{1}{8} \implies \cos B/2 = \frac{3}{4} \\ \cos C &= \frac{3}{4} \implies \cos C/2 = \sqrt{\frac{7}{8}}.\end{align*} Then using $[XYZ] = 2R^2\sin X\sin Y\sin Z$ , we can compute \[[M_AM_BM_C] = 2\cdot \frac{64}{7}\cdot \frac{5}{\sqrt{32}}\cdot \frac{3}{4}\cdot \frac{\sqrt{7}}{\sqrt{8}} = \frac{30\sqrt{7}}{7}.\] Thus $[AEF] = 15\sqrt{7}/14$ , which gives a final answer of $\boxed{036}$ | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Let $\overline{BC}$ lie on the x-axis and $B$ be the origin. $C$ is $(5,0)$ . Use Heron's formula to compute the area of triangle $ABC$ . We have $s=\frac{15}{2}$ . and $[ABC]=\sqrt{\frac{15 \cdot 7 \cdot 5 \cdot 3}{2^4}}=\frac{15\sqrt{7}}{4}$ . We now find the altitude, which is $\frac{\frac{15\sqrt{7}}{2}}{5}=\frac{3\sqrt{7}}{2}$ , which is the y-coordinate of $A$ . We now find the x-coordinate of $A$ , which satisfies $x^2 + (\frac{3\sqrt{7}}{2})^{2}=16$ , which gives $x=\frac{1}{2}$ since the triangle is acute. Now using the Angle Bisector Theorem, we have $\frac{4}{6}=\frac{BD}{CD}$ and $BD+CD=5$ to get $BD=2$ . The coordinates of D are $(2,0)$ .
Since we want the area of triangle $AEF$ , we will find equations for perpendicular bisector of AD, and the other two angle bisectors. The perpendicular bisector is not too challenging: the midpoint of AD is $(\frac{5}{4}, \frac{3\sqrt{7}}{4})$ and the slope of AD is $-\sqrt{7}$ . The slope of the perpendicular bisector is $\frac{1}{\sqrt{7}}$ . The equation is(in point slope form) $y-\frac{3\sqrt{7}}{4}=\frac{1}{\sqrt{7}}(x-\frac{5}{4})$ .
The slope of AB, or in trig words, the tangent of $\angle ABC$ is $3\sqrt{7}$ .
Finding $\sin{\angle ABC}=\frac{\frac{3\sqrt{7}}{2}}{4}=\frac{3\sqrt{7}}{8}$ and $\cos{\angle ABC}=\frac{\frac{1}{2}}{4}=\frac{1}{8}$ . Plugging this in to half angle tangent, it gives $\frac{\frac{3\sqrt{7}}{8}}{1+\frac{1}{8}}=\frac{\sqrt{7}}{3}$ as the slope of the angle bisector, since it passes through $B$ , the equation is $y=\frac{\sqrt{7}}{3}x$ .
Similarly, the equation for the angle bisector of $C$ will be $y=-\frac{1}{\sqrt{7}}(x-5)$ .
For $E$ use the B-angle bisector and the perpendicular bisector of AD equations to intersect at $(3,\sqrt{7})$ .
For $F$ use the C-angle bisector and the perpendicular bisector of AD equations to intersect at $(\frac{1}{2}, \frac{9}{2\sqrt{7}})$ .
The area of AEF is equal to $\frac{EF \cdot \frac{AD}{2}}{2}$ since AD is the altitude of that triangle with EF as the base, with $\frac{AD}{2}$ being the height. $EF=\frac{5\sqrt{2}}{\sqrt{7}}$ and $AD=3\sqrt{2}$ , so $[AEF]=\frac{15}{2\sqrt{7}}=\frac{15\sqrt{7}}{14}$ which gives $\boxed{036}$ . NEVER overlook coordinate bash in combination with beginner synthetic techniques.~vvluo | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | [asy] size(8cm); defaultpen(fontsize(10pt)); pair A,B,C,I,D,M,T,Y,Z,EE,F; A=(0,3sqrt(7)); B=(-1,0); C=(9,0); I=incenter(A,B,C); D=extension(A,I,B,C); M=(A+D)/2; draw(B--EE,gray+dashed); draw(C--F,gray+dashed); draw(A--B--C--A); draw(A--D); draw(B--(5,sqrt(28))); draw(M--(5,sqrt(28))); draw(C--(0,9sqrt(7)/7)); draw(M--(0,9sqrt(7)/7)); dot("$A$",A,NW); dot("$B$",B,SW); dot("$C$",C,SE); dot("$D$",D,S); dot("$E$",(5,sqrt(28)),N); dot("$M$",M,dir(70)); dot("$F$",(0,9sqrt(7)/7),N); label("$2$",B--D,S); label("$3$",D--C,S); label("$6$",A--C,N); label("$4$",A--B,W); [/asy]
Let $B=(0,0)$ and $BC$ be the line $y=0$ .
We compute that $\cos{\angle{ABC}}=\frac{1}{8}$ , so $\tan{\angle{ABC}}=3\sqrt{7}$ .
Thus, $A$ lies on the line $y=3x\sqrt{7}$ . The length of $AB$ at a point $x$ is $8x$ , so $x=\frac{1}{2}$
We now have the coordinates $A=\left(\frac{1}{2},\frac{3\sqrt{7}}{2}\right)$ $B=(0,0)$ and $C=(5,0)$ .
We also have $D=(2,0)$ by the angle-bisector theorem and $M=\left(\frac{5}{4},\frac{3\sqrt{7}}{4}\right)$ by taking the midpoint.
We have that because $\cos{\angle{ABC}}=\frac{1}{8}$ $\cos{\frac{\angle{ABC}}{2}}=\frac{3}{4}$ by half angle formula.
We also compute $\cos{\angle{ACB}}=\frac{3}{4}$ , so $\cos{\frac{\angle{ACB}}{2}}=\frac{\sqrt{14}}{4}$
Now, $AD$ has slope $-\frac{\frac{3\sqrt{7}}{2}}{2-\frac{1}{2}}=-\sqrt{7}$ , so it's perpendicular bisector has slope $\frac{\sqrt{7}}{7}$ and goes through $\left(\frac{5}{4},\frac{3\sqrt{7}}{4}\right)$
We find that this line has equation $y=\frac{\sqrt{7}}{7}x+\frac{4\sqrt{7}}{7}$
As $\cos{\angle{CBI}}=\frac{3}{4}$ , we have that line $BI$ has form $y=\frac{\sqrt{7}}{3}x$ .
Solving for the intersection point of these two lines, we get $x=3$ and thus $E=\left(3, \sqrt{7}\right)$
We also have that because $\cos{\angle{ICB}}=\frac{\sqrt{14}}{4}$ $CI$ has form $y=-\frac{x\sqrt{7}}{7}+\frac{5\sqrt{7}}{7}$
Intersecting the line $CI$ and the perpendicular bisector of $AD$ yields $-\frac{x\sqrt{7}}{7}+\frac{5\sqrt{7}}{7}=\frac{x\sqrt{7}}{7}+\frac{4\sqrt{7}}{7}$
Solving this, we get $x=\frac{1}{2}$ and so $F=\left(\frac{1}{2},\frac{9\sqrt{7}}{14}\right)$
We now compute $EF=\sqrt{\left(\frac{5}{2}\right)^2+\left(\frac{5\sqrt{7}}{14}\right)^2}=\frac{5\sqrt{14}}{7}$ .
We also have $MA=\sqrt{\left(\frac{3}{4}\right)^2+\left(\frac{3\sqrt{7}}{4}\right)^2}=\frac{3\sqrt{2}}{2}$
As ${MA}\perp{EF}$ , we have $[\triangle{AEF}]=\frac{1}{2}\left(\frac{3\sqrt{2}}{2}\times\frac{5\sqrt{14}}{7}\right)=\frac{15\sqrt{7}}{14}$
The desired answer is $15+7+14=\boxed{036}$ ~Imayormaynotknowcalculus | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | [asy] size(8cm); defaultpen(fontsize(10pt)); pair A,B,C,I,D,M,T,Y,Z,EE,F; A=(0,3sqrt(7)); B=(-1,0); C=(9,0); I=incenter(A,B,C); D=extension(A,I,B,C); M=(A+D)/2; draw(B--EE,gray+dashed); draw(C--F,gray+dashed); draw(A--B--C--A); draw(A--D); draw(B--(5,sqrt(28))); draw(M--(5,sqrt(28))); draw(C--(0,9sqrt(7)/7)); draw(M--(0,9sqrt(7)/7)); dot("$A$",A,NW); dot("$B$",B,SW); dot("$C$",C,SE); dot("$D$",D,S); dot("$E$",(5,sqrt(28)),N); dot("$M$",M,dir(70)); dot("$F$",(0,9sqrt(7)/7),N); label("$2$",B--D,S); label("$3$",D--C,S); label("$6$",A--C,N); label("$4$",A--B,W); [/asy]
As usual, we will use homogenized barycentric coordinates.
We have that $AD$ will have form $3z=2y$ . Similarly, $CF$ has form $5y=6x$ and $BE$ has form $5z=4x$ .
Since $A=(1,0,0)$ and $D=\left(0,\frac{3}{5},\frac{2}{5}\right)$ , we also have $M=\left(\frac{1}{2},\frac{3}{10},\frac{1}{5}\right)$ .
It remains to determine the equation of the line formed by the perpendicular bisector of $AD$
This can be found using EFFT. Let a point $T$ on $EF$ have coordinates $(x, y, z)$ .
We then have that the displacement vector $\overrightarrow{AD}=\left(-1, \frac{3}{5}, \frac{2}{5}\right)$ and that the displacement vector $\overrightarrow{TM}$ has form $\left(x-\frac{1}{2},y-\frac{3}{10},z-\frac{1}{5}\right)$ .
Now, by EFFT, we have $5^2\left(\frac{3}{5}\times\left(z-\frac{1}{5}\right)+\frac{2}{5}\times\left(y-\frac{3}{10}\right)\right)+6^2\left(-1\times\left(z-\frac{1}{5}\right)+\frac{2}{5}\times\left(x-\frac{1}{2}\right)\right)+4^2\left(-1\times\left(y-\frac{3}{10}\right)+\frac{3}{5}\times\left(x-\frac{1}{2}\right)\right)=0$ .
This equates to $8x-2y-7z=2$
Now, intersecting this with $BE$ , we have $5z=4x$ $8x-2y-7z=2$ , and $x+y+z=1$ .
This yields $x=\frac{2}{3}$ $y=-\frac{1}{5}$ , and $z=\frac{8}{15}$ , or $E=\left(\frac{2}{3},-\frac{1}{5},\frac{8}{15}\right)$
Similarly, intersecting this with $CF$ , we have $5y=6x$ $8x-2y-7z=2$ , and $x+y+z=1$ .
Solving this, we obtain $x=\frac{3}{7}$ $y=\frac{18}{35}$ , and $z=\frac{2}{35}$ , or $F=\left(\frac{3}{7},\frac{18}{35},\frac{2}{35}\right)$
We finish by invoking the Barycentric Distance Formula twice; our first displacement vector being $\overrightarrow{FE}=\left(\frac{5}{21},-\frac{5}{7},\frac{10}{21}\right)$ .
We then have $FE^2=-25\left(-\frac{5}{7}\cdot\frac{10}{21}\right)-36\left(\frac{5}{21}\cdot\frac{10}{21}\right)-16\left(\frac{5}{21}\cdot-\frac{5}{7}\right)=\frac{50}{7}$ , thus $FE=\frac{5\sqrt{14}}{7}$
Our second displacement vector is $\overrightarrow{AM}=\left(-\frac{1}{2},\frac{3}{10},\frac{1}{5}\right)$ .
As a result, $AM^2=-25\left(\frac{3}{10}\cdot\frac{1}{5}\right)-36\left(-\frac{1}{2}\cdot\frac{1}{5}\right)-16\left(-\frac{1}{2}\cdot\frac{3}{10}\right)=\frac{9}{2}$ , so $AM=\frac{3\sqrt{2}}{2}$
As ${AM}\perp{EF}$ , the desired area is $\frac{\frac{5\sqrt{14}}{7}\times\frac{3\sqrt{2}}{2}}{2}={\frac{15\sqrt{7}}{14}}\implies{m+n+p=\boxed{036}$ . ~Imayormaynotknowcalculus | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | [asy] size(8cm); defaultpen(fontsize(10pt)); pair A,B,C,I,D,M,T,Y,Z,EE,F; A=(0,3sqrt(7)); B=(-1,0); C=(9,0); I=incenter(A,B,C); D=extension(A,I,B,C); M=(A+D)/2; draw(B--EE,gray+dashed); draw(C--F,gray+dashed); draw(A--B--C--A); draw(A--D); draw(A--(5,sqrt(28))); draw(A--(0,9sqrt(7)/7)); draw(D--(0,9sqrt(7)/7)); draw(D--(5,sqrt(28))); draw(B--(5,sqrt(28))); draw(M--(5,sqrt(28))); draw(C--(0,9sqrt(7)/7)); draw(M--(0,9sqrt(7)/7)); dot("$A$",A,NW); dot("$B$",B,SW); dot("$C$",C,SE); dot("$D$",D,S); dot("$E$",(5,sqrt(28)),N); dot("$M$",M,dir(70)); dot("$F$",(0,9sqrt(7)/7),N); label("$2$",B--D,S); label("$3$",D--C,S); label("$6$",A--C,N); label("$4$",A--B,W); [/asy]
To get the area of $\triangle AEF$ , we try to find $AM$ and $\angle EAF$
Since $AD$ is the angle bisector, we can get that $BD=2$ and $CD=3$ . By applying Stewart's Theorem, we can get that $AD=3\sqrt{2}$ . Therefore $AM=\frac{3\sqrt{2}}{2}$
Since $EF$ is the perpendicular bisector of $AD$ , we know that $AE = DE$ . Since $BE$ is the angle bisector of $\angle BAC$ ,
we know that $\angle ABE = \angle DBE$ . By applying the Law of Sines to $\triangle ABE$ and $\triangle DBE$ , we know that $\sin \angle BAE = \sin \angle BDE$ . Since $BD$ is not equal to $AB$ and therefore these two triangles are not congruent, we know that $\angle BAE$ and $\angle BDE$ are supplementary. Then we know that $\angle ABD$ and $\angle AED$ are also supplementary. Given that $AE=DE$ , we can get that $\angle DAE$ is half of $\angle ABC$ . Similarly, we have $\angle DAF$ is half of $\angle ACB$
By applying the Law of Cosines, we get $\cos \angle ABC = \frac{1}{8}$ , and then $\sin \angle ABC = \frac{3\sqrt{7}}{8}$ . Similarly, we can get $\cos \angle ACB = \frac{3}{4}$ and $\sin \angle ACB = \frac{\sqrt{7}}{4}$ . Based on some trig identities, we can compute that $\tan \angle DAE = \frac{\sin \angle ABC}{1 + \cos \angle ABC} = \frac{\sqrt{7}}{3}$ , and $\tan \angle DAF = \frac{\sqrt{7}}{7}$
Finally, the area of $\triangle AEF$ equals $\frac{1}{2}AM^2(\tan \angle DAE + \tan \angle DAF)=\frac{15\sqrt{7}}{14}$ . Therefore, the final answer is $15+7+14=\boxed{036}$ . ~xamydad | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | First and foremost $\big[\triangle{AEF}\big]=\big[\triangle{DEF}\big]$ as $EF$ is the perpendicular bisector of $AD$ . Now note that quadrilateral $ABDF$ is cyclic, because $\angle{ABF}=\angle{FBD}$ and $FA=FD$ . Similarly quadrilateral $AEDC$ is cyclic, \[\implies \angle{EDA}=\dfrac{C}{2}, \quad \angle{FDA}=\dfrac{B}{2}\] Let $A'$ $B'$ $C'$ be the $A$ $B$ , and $C$ excenters of $\triangle{ABC}$ respectively. Then it follows that $\triangle{DEF} \sim \triangle{A'C'B'}$ . By angle bisector theorem we have $BD=2 \implies \dfrac{ID}{IA}=\dfrac{BD}{BA}=\dfrac{1}{2}$ . Now let the feet of the perpendiculars from $I$ and $A'$ to $BC$ be $X$ and $Y$ resptively. Then by tangents we have \[BX=s-AC=\dfrac{3}{2} \implies XD=2-\dfrac{3}{2}=\dfrac{1}{2}\] \[CY=s-AC \implies YD=3-\dfrac{3}{2}=\dfrac{3}{2} \implies \dfrac{ID}{DA'}=\dfrac{XD}{YD}=\dfrac{1}{3} \implies \big[\triangle{DEF}\big]=\dfrac{1}{16}\big[\triangle{A'C'B'}\big]\] From the previous ratios, $AI:ID:DA'=2:1:3 \implies AD=DA' \implies \big[\triangle{ABC}\big]=\big[\triangle{A'BC}\big]$ Similarly we can find that $\big[\triangle{B'AC}\big]=2\big[\triangle{ABC}\big]$ and $\big[\triangle{C'AB}\big]=\dfrac{4}{7}\big[\triangle{ABC}\big]$ and thus \[\big[\triangle{A'B'C'}\big]=\bigg(1+1+2+\dfrac{4}{7}\bigg)\big[\triangle{ABC}\big]=\dfrac{32}{7}\big[\triangle{ABC}\big] \implies \big[\triangle{DEF}\big]=\dfrac{2}{7}\big[\triangle{ABC}\big]=\dfrac{15\sqrt{7}}{14} \implies m+n+p = \boxed{036}\] -tkhalid | null | 036 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Trig values we use here:
$\cos A = \frac{9}{16}$
$\cos \frac{A}{2} = \frac{5}{4\sqrt2}$
$\sin \frac{A}{2} = \frac{\sqrt7}{4\sqrt2}$
$\cos \frac{B}{2} = \frac{3}{4}$
$\cos \frac{C}{2} = \frac{\sqrt7}{2\sqrt2}$
First let the incenter be $I$ . Let $M$ be the midpoint of minor arc $BC$ on $(ABC)$ and let $K$ be the foot of $M$ to $BC$
We can find $AD$ using Stewart's Theorem: from Angle Bisector Theorem $BD = 2$ and $CD = 3$ . Then it is easy to find that $AD = 3\sqrt3$
Now we trig bash for $DI = MI - MD$ . Notice that $MI = MB$ from the Incenter Excenter Lemma. We obtain that $MB = \frac{BK}{\cos \frac{A}{2}} = \frac{\frac{5}{2}}{\frac{5}{4\sqrt2}}=2\sqrt2$ . To get $MD$ we angle chase to get $\angle KDM = \frac{A}{2}+C$ . Then \[\cos(\frac{A}{2}+C) = \cos\frac{A}{2}\cos C - \sin\frac{A}{2}\sin C = \frac{1}{2\sqrt2} = \frac{\frac{1}{2}}{MD}\] gives $MD = \sqrt{2}$ . This means $DI = \sqrt2$
Now let $AI \cap EF = G$ . It is easy to angle chase $\angle GIE = 90- \frac{B}{2}$ and $\angle GIF = 90- \frac{C}{2}$ . Since $GI = GD - ID = \frac{3\sqrt2}{2}-\sqrt2=\frac{\sqrt2}{2}$ , we compute that \[EF = EG + FG = \frac{\sqrt2}{2}(\cot B/2 + \cot C/2) = \frac{\sqrt2}{2}(\frac{3}{\sqrt7}+\sqrt7) = \frac{5\sqrt{14}}{7}\] which implies \[[AEF] = AG*EF/2 = \frac{3\sqrt2}{2} * \frac{5\sqrt{14}}{7} / 2 = \frac{15\sqrt7}{14}\] which gives an answer of $\boxed{36}$ . ~Leonard_my_dude~ | null | 36 |
99e7392e4bbc3a54ccf616a5fb080865 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_13 | Point $D$ lies on side $\overline{BC}$ of $\triangle ABC$ so that $\overline{AD}$ bisects $\angle BAC.$ The perpendicular bisector of $\overline{AD}$ intersects the bisectors of $\angle ABC$ and $\angle ACB$ in points $E$ and $F,$ respectively. Given that $AB=4,BC=5,$ and $CA=6,$ the area of $\triangle AEF$ can be written as $\tfrac{m\sqrt{n}}p,$ where $m$ and $p$ are relatively prime positive integers, and $n$ is a positive integer not divisible by the square of any prime. Find $m+n+p.$ | Firstly, it is easy to find $BD=2,CD=3$ with angle bisector theorem.
Using LOC and some trig formulas we get all those values: $cos\angle{B}=\frac{1}{8},sin\angle{B}=\frac{3\sqrt{7}}{8},cos\angle{\frac{B}{2}}=\frac{3}{4},cos\angle{\frac{{ACB}}{2}}=\frac{\sqrt{14}}{4}$ Now we find the coordinates of points $A,E,F$ and we apply shoelace theorem later. Point A's coordinates is $(4*\frac{1}{8},4*\frac{3\sqrt{7}}{8})=(\frac{1}{2},\frac{3\sqrt{7}}{2})$ , Let $AJ$ is perpendicular to $BC$ $tan\angle{JAD}=\frac{2-\frac{1}{2}}{\frac{3\sqrt{7}}{2}}=\frac{\sqrt{7}}{7}$ , which means the slope of $FE$ is $\frac{\sqrt{7}}{7}$ . Find the coordinate of $M$ , it is easy, $(\frac{5}{4},\frac{3\sqrt{7}}{4})$ , the function $EF$ is $y=\frac{\sqrt{7}x}{7}+\frac{4\sqrt{7}}{7}$ . Now find the intersection of $EF,EB$ $\frac{\sqrt{7}x}{7}+\frac{4\sqrt{7}}{7}=\frac{\sqrt{7}x}{3}$ , getting that $x=3,E(3,\sqrt{7})$ Now we look at line segment $CF$ , since $cos\angle{\frac{ACB}{2}}=\frac{\sqrt{14}}{4},tan\angle{\frac{ACB}{2}}=\frac{\sqrt{7}}{7}$ . Since the line passes $(5,0)$ , we can set the equation to get the $CF:y=-\frac{\sqrt{7}}{7}+\frac{5\sqrt{7}}{7}$ , find the intersection of $CF,EF$ $-\frac{\sqrt{7}x}{7}+\frac{5\sqrt{7}}{7}=\frac{\sqrt{7}x}{7}+\frac{4\sqrt{7}}{7}$ , getting that $F:(\frac{1}{2},\frac{9\sqrt{7}}{14})$ and in the end we use shoelace theorem with coordinates of $A,F,E$ getting the area $\frac{15\sqrt{7}}{14}$ leads to the final answer $\boxed{36}$ | null | 36 |
498b82d16dcf6509b083abf415d51299 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_14 | Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$ | Either $P(3) = P(4)$ or not. We first see that if $P(3) = P(4)$ it's easy to obtain by Vieta's that $(a+b)^2 = 49$ . Now, take $P(3) \neq P(4)$ and WLOG $P(3) = P(a), P(4) = P(b)$ . Now, consider the parabola formed by the graph of $P$ . It has vertex $\frac{3+a}{2}$ . Now, say that $P(x) = x^2 - (3+a)x + c$ . We note $P(3)P(4) = c = P(3)\left(4 - 4a + \frac{8a - 1}{2}\right) \implies a = \frac{7P(3) + 1}{8}$ . Now, we note $P(4) = \frac{7}{2}$ by plugging in again. Now, it's easy to find that $a = -2.5, b = -3.5$ , yielding a value of $36$ . Finally, we add $49 + 36 = \boxed{085}$ . ~awang11, charmander3333 | null | 085 |
498b82d16dcf6509b083abf415d51299 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_14 | Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$ | Let the roots of $P(x)$ be $m$ and $n$ , then we can write \[P(x)=x^2-(m+n)x+mn\] The fact that $P(P(x))=0$ has solutions $x=3,4,a,b$ implies that some combination of $2$ of these are the solution to $P(x)=m$ , and the other $2$ are the solution to $P(x)=n$ . It's fairly easy to see there are only $2$ possible such groupings: $P(3)=P(4)=m$ and $P(a)=P(b)=n$ , or $P(3)=P(a)=m$ and $P(4)=P(b)=n$ (Note that $a,b$ are interchangeable, and so are $m$ and $n$ ). We now casework:
If $P(3)=P(4)=m$ , then \[9-3(m+n)+mn=16-4(m+n)+mn=m \implies m+n=7\] \[a^2-a(m+n)+mn=b^2-b(m+n)+mn=n \implies a+b=m+n=7\] so this gives $(a+b)^2=7^2=49$ .
Next, if $P(3)=P(a)=m$ , then \[9-3(m+n)+mn=a^2-a(m+n)+mn=m \implies a+3=m+n\] \[16-4(m+n)+mn=b^2-b(m+n)+mn=n \implies b+4=m+n\] Subtracting the first part of the first equation from the first part of the second equation gives \[7-(m+n)=n-m \implies 2n=7 \implies n=\frac{7}{2} \implies m=-3\] Hence, $a+b=2(m+n)-7=2\cdot \frac{1}{2}-7=-6$ , and so $(a+b)^2=(-6)^2=36$ .
Therefore, the solution is $49+36=\boxed{085}$ ~ktong | null | 085 |
498b82d16dcf6509b083abf415d51299 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_14 | Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$ | Write $P(x) = x^2+wx+z$ . Split the problem into two cases: $P(3)\ne P(4)$ and $P(3) = P(4)$
Case 1: We have $P(3) \ne P(4)$ . We must have \[w=-P(3)-P(4) = -(9+3w+z)-(16+4w+z) = -25-7w-2z.\] Rearrange and divide through by $8$ to obtain \[w = \frac{-25-2z}{8}.\] Now, note that \[z = P(3)P(4) = (9+3w+z)(16+4w+z) = \left(9 + 3\cdot \frac{-25-2z}{8} + z\right)\left(16 + 4 \cdot \frac{-25-2z}{8} + z\right) =\] \[\left(-\frac{3}{8} + \frac{z}{4}\right)\left(\frac{7}{2}\right) = -\frac{21}{16} + \frac{7z}{8}.\] Now, rearrange to get \[\frac{z}{8} = -\frac{21}{16}\] and thus \[z = -\frac{21}{2}.\] Substituting this into our equation for $w$ yields $w = -\frac{1}{2}$ . Then, it is clear that $P$ does not have a double root at $P(3)$ , so we must have $P(a) = P(3)$ and $P(b) = P(4)$ or vice versa. This gives $3+a = \frac{1}{2}$ and $4+b = \frac{1}{2}$ or vice versa, implying that $a+b = 1-3-4 = -6$ and $(a+b)^2 = 36$
Case 2: We have $P(3) = P(4)$ . Then, we must have $w = -7$ . It is clear that $P(a) = P(b)$ (we would otherwise get $P(a)=P(3)=P(4)$ implying $a \in \{3,4\}$ or vice versa), so $a+b=-w=7$ and $(a+b)^2 = 49$
Thus, our final answer is $49+36=\boxed{085}$ . ~GeronimoStilton | null | 085 |
498b82d16dcf6509b083abf415d51299 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_14 | Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$ | Note that because $P\big(P(3)\big)=P\big(P(4)\big)= 0$ $P(3)$ and $P(4)$ are roots of $P(x)$ . There are two cases.
CASE 1: $P(3) = P(4)$ . Then $P(x)$ is symmetric about $x=\tfrac72$ ; that is to say, $P(r) = P(7-r)$ for all $r$ . Thus the remaining two roots must sum to $7$ . Indeed, the polynomials $P(x) = \left(x-\frac72\right)^2 + \frac{11}4 \pm i\sqrt3$ satisfy the conditions.
CASE 2: $P(3)\neq P(4)$ . Then $P(3)$ and $P(4)$ are the two distinct roots of $P(x)$ , so \[P(x) = \big(x-P(3)\big)\big(x-P(4)\big)\] for all $x$ . Note that any solution to $P\big(P(x)\big) = 0$ must satisfy either $P(x) = P(3)$ or $P(x) = P(4)$ . Because $P(x)$ is quadratic, the polynomials $P(x) - P(3)$ and $P(x) - P(4)$ each have the same sum of roots as the polynomial $P(x)$ , which is $P(3) + P(4)$ . Thus the answer in this case is $2\big(P(3) + P(4)\big)-7$ , and so it suffices to compute the value of $P(3)+P(4)$
Let $P(3)=u$ and $P(4) = v$ . Substituting $x=3$ and $x=4$ into the above quadratic polynomial yields the system of equations \begin{align*} u &= (3-u)(3-v) = 9 - 3u - 3v + uv\\ v &= (4-u)(4-v) = 16 - 4u - 4v + uv. \end{align*} Subtracting the first equation from the second gives $v - u = 7 - u - v$ , yielding $v = \frac72.$ Substituting this value into the second equation gives \[\dfrac72 = \left(4 - u\right)\left(4 - \dfrac72\right),\] yielding $u = -3.$ The sum of the two solutions is $2\left(\tfrac72-3\right)-7 = -6$ . In this case, $P(x)= (x+3)\left(x-\frac72\right)$
The requested sum of squares is $7^2+(-6)^2 = \boxed{085}$ | null | 085 |
498b82d16dcf6509b083abf415d51299 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_14 | Let $P(x)$ be a quadratic polynomial with complex coefficients whose $x^2$ coefficient is $1.$ Suppose the equation $P(P(x))=0$ has four distinct solutions, $x=3,4,a,b.$ Find the sum of all possible values of $(a+b)^2.$ | Let $P(x) = (x-c)^2 - d$ for some $c$ $d$
Then, we can write $P(P(x)) = ((x-c)^2 - d - c)^2 - d$ . Setting the expression equal to $0$ and solving for $x$ gives:
$x = \pm \sqrt{ \pm \sqrt{d} + d + c} + c$
Therefore, we have that $x$ takes on the four values $\sqrt{\sqrt{d} + d + c} + c$ $-\sqrt{\sqrt{d} + d + c} + c$ $\sqrt{-\sqrt{d} + d + c} + c$ , and $-\sqrt{-\sqrt{d} + d + c} + c$ . Two of these values are $3$ and $4$ , and the other two are $a$ and $b$
We can split these four values into two "groups" based on the radicand in the expression - for example, the first group consists of the first two values listed above, and the second group consists of the other two values.
$\textbf{Case 1}$ : Both the 3 and 4 values are from the same group.
In this case, the $a$ and $b$ values are both from the other group. The sum of this is just $2c$ because the radical cancels out. Because of this, we can see that $c$ is just the average of $3$ and $4$ , so we have $2c = 3 + 4 = 7$ , so $(a+b)^2 = 7^2 = 49$
$\textbf{Case 2}$ : The 3 and 4 values come from different groups.
It is easy to see that all possibilities in this case are basically symmetric and yield the same value for $(a+b)^2$ . Without loss of generality, assume that $\sqrt{\sqrt{d} + d + c} + c = 4$ and $\sqrt{-\sqrt{d} + d + c} + c = 3$ . Note that we can't switch the values of these two expressions since the first one is guaranteed to be larger.
We can write $\sqrt{\sqrt{d} + d + c} + c = 1 + \sqrt{-\sqrt{d} + d + c} + c$
Moving most terms to the left side and simplifying gives $\sqrt{\sqrt{d} + d + c} - \sqrt{-\sqrt{d} + d + c} = 1$
We can square both sides and simplify:
$\sqrt{d} + d + c - \sqrt{d} + d + c - 2\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = 1$
$2d + 2c - 2\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = 1$
$\sqrt{(d + c + \sqrt{d})(d + c - \sqrt{d})} = (d+c) - \frac{1}{2}$
$\sqrt{(d+c)^2 - (\sqrt{d})^2} = (d+c) - \frac{1}{2}$
$\sqrt{d^2 + 2dc + c^2 - d} = (d+c) - \frac{1}{2}$
Squaring both sides again gives the following:
$d^2 + 2dc + c^2 - d = d^2 + 2dc + c^2 - d - c + \frac{1}{4}$
Nearly all terms cancel out, yielding $c = \frac{1}{4}$
By substituting this back in, we obtain $\sqrt{\sqrt{d} + d + c} = \frac{15}{4}$ and $\sqrt{-\sqrt{d} + d + c} = \frac{11}{4}$
The sum of $a$ and $b$ is equal to $-\sqrt{\sqrt{d} + d + c} - \sqrt{-\sqrt{d} + d + c} + 2c = -\frac{15}{4} - \frac{11}{4} + \frac{1}{2} = -6$ , so $(a+b)^2 = 36$
Adding up both values gives $49 + 36 = \boxed{085}$ as our final answer. | null | 085 |
964d3b38dfbe0c046ed51203d56b48f4 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_15 | Let $\triangle ABC$ be an acute triangle with circumcircle $\omega,$ and let $H$ be the intersection of the altitudes of $\triangle ABC.$ Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3,HX=2,$ and $HY=6.$ The area of $\triangle ABC$ can be written in the form $m\sqrt{n},$ where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n.$ | The following is a power of a point solution to this menace of a problem:
[asy] defaultpen(fontsize(12)+0.6); size(250); pen p=fontsize(10)+gray+0.4; var phi=75.5, theta=130, r=4.8; pair A=r*dir(270-phi-57), C=r*dir(270+phi-57), B=r*dir(theta-57), H=extension(A,foot(A,B,C),B,foot(B,C,A)); path omega=circumcircle(A,B,C), c=circumcircle(H,B,C); pair O=circumcenter(H,B,C), Op=2*H-O, Z=bisectorpoint(O,Op), X=IP(omega,L(H,Z,0,50)), Y=IP(omega,L(H,Z,50,0)), D=2*H-A, K=extension(B,C,X,Y), E=extension(A,origin,X,Y), L=foot(H,B,C); draw(K--C^^omega^^c^^L(A,D,0,1)); draw(Y--K^^L(A,origin,0,1.5)^^L(X,D,0.7,3.5),fuchsia+0.4); draw(CR(H,length(H-L)),royalblue); draw(C--K,p); dot("$A$",A,dir(120)); dot("$B$",B,down); dot("$C$",C,down); dot("$H$",H,down); dot("$X$",X,up); dot("$Y$",Y,down); dot("$O$",origin,down); dot("$O'$",O,down); dot("$K$",K,up); dot("$L$",L,dir(H-X)); dot("$D$",D,down); dot("$E$",E,down); //draw(O--origin,p); //draw(origin--4*dir(57),fuchsia); //draw(Arc(H,3,160,200),royalblue); //draw(Arc(H,2,30,70),heavygreen); //draw(Arc(H,6,220,240),fuchsia); [/asy] Let points be what they appear as in the diagram below. Note that $3HX = HY$ is not insignificant; from here, we set $XH = HE = \frac{1}{2} EY = HL = 2$ by PoP and trivial construction. Now, $D$ is the reflection of $A$ over $H$ . Note $AO \perp XY$ , and therefore by Pythagorean theorem we have $AE = XD = \sqrt{5}$ . Consider $HD = 3$ . We have that $\triangle HXD \cong HLK$ , and therefore we are ready to PoP with respect to $(BHC)$ . Setting $BL = x, LC = y$ , we obtain $xy = 10$ by PoP on $(ABC)$ , and furthermore, we have $KH^2 = 9 = (KL - x)(KL + y) = (\sqrt{5} - x)(\sqrt{5} + y)$ . Now, we get $4 = \sqrt{5}(y - x) - xy$ , and from $xy = 10$ we take \[\frac{14}{\sqrt{5}} = y - x.\] However, squaring and manipulating with $xy = 10$ yields that $(x + y)^2 = \frac{396}{5}$ and from here, since $AL = 5$ we get the area to be $3\sqrt{55} \implies \boxed{058}$ . ~awang11's sol | null | 058 |
964d3b38dfbe0c046ed51203d56b48f4 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_15 | Let $\triangle ABC$ be an acute triangle with circumcircle $\omega,$ and let $H$ be the intersection of the altitudes of $\triangle ABC.$ Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3,HX=2,$ and $HY=6.$ The area of $\triangle ABC$ can be written in the form $m\sqrt{n},$ where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n.$ | [asy] size(10cm); pair A, B, C, D, H, K, O, P, L, M, X, Y; A = (-15, 27); B = (-24, 0); C = (24, 0); D = (-8.28, 18.04); O = (0, 7); P = (0, -7); H = (-15, 13); K = (-15, -13); M = (0, 0); L = (-15, 0); X = (-24.9569, 5.53234); Y = (8.39688, 30.5477); draw(circle(O, 25)); draw(circle(P, 25)); draw(A--B--C--cycle); draw(H -- K); draw(A -- O -- P -- H -- cycle); draw(X -- Y); draw(O -- X, dashed); draw(O -- Y, dashed); draw(O -- B, dashed); draw(O -- C, dashed); label("$O$", O, ENE); label("$A$", A, NW); label("$B$", B, W); label("$C$", C, E); label("$H$", H, E); label("$H'$", K, NE); label("$X$", X, W); label("$Y$", Y, NE); label("$O'$", P, E); label("$M$", M, NE); label("$L$", L, NE); label("$D$", D, NNE); label("$2$", X -- H, NW); label("$3$", H -- A, SW); label("$6$", H -- Y, NW); label("$R$", O -- Y, E); dot(O); dot(P); dot(D); dot(H); [/asy] Diagram not to scale.
We first observe that $H'$ , the image of the reflection of $H$ over line $BC$ , lies on circle $O$ . This is because $\angle HBC = 90 - \angle C = \angle H'AC = \angle H'BC$ . This is a well known lemma. The result of this observation is that circle $O'$ , the circumcircle of $\triangle BHC$ is the image of circle $O$ over line $BC$ , which in turn implies that $\overline{AH} = \overline{OO'}$ and thus $AHO'O$ is a parallelogram. That $AHO'O$ is a parallelogram implies that $AO$ is perpendicular to $\overline{XY}$ , and thus divides segment $\overline{XY}$ in two equal pieces, $\overline{XD}$ and $\overline{DY}$ , of length $4$
Using Power of a Point, \[\overline{AH} \cdot \overline{HH'} = \overline{XH} \cdot \overline{HY} \Longrightarrow 3 \cdot \overline{HH'} = 2 \cdot 6 \Longrightarrow \overline{HH'} = 4\] This means that $\overline{HL} = \frac12 \cdot 4 = 2$ and $\overline{AL} = 2 + 3 = 5$ , where $L$ is the foot of the altitude from $A$ onto $BC$ . All that remains to be found is the length of segment $\overline{BC}$
Looking at right triangle $\triangle AHD$ , we find that \[\overline{AD} = \sqrt{\overline{AH}^2 - \overline{HD}^2} = \sqrt{3^2 - 2^2} = \sqrt{5}\] Looking at right triangle $\triangle ODY$ , we get the equation \[\overline{OY}^2 - \overline{DY}^2 = \overline{OD}^2 = \left(\overline{AO} - \overline{AD}\right)^2\] Plugging in known values, and letting $R$ be the radius of the circle, we find that \[R^2 - 16 = (R - \sqrt{5})^2 = R^2 - 2\sqrt5 R + 5 \Longrightarrow R = \frac{21\sqrt5}{10}\]
Recall that $AHO'O$ is a parallelogram, so $\overline{AH} = \overline{OO'} = 3$ . So, $\overline{OM} = \frac32$ , where $M$ is the midpoint of $\overline{BC}$ . This means that \[\overline{BC} = 2\overline{BM} = 2\sqrt{R^2 - \left(\frac32\right)^2} = 2\sqrt{\frac{441}{20} - \frac{9}{4}} = \frac{6\sqrt{55}}{5}\]
Thus, the area of triangle $\triangle ABC$ is \[\frac{\overline{AL} \cdot \overline{BC}}{2} = \frac{5 \cdot \frac{6\sqrt{55}}{5}}{2} = {3\sqrt{55}}\] The answer is $3 + 55 = \boxed{058}$ | null | 058 |
964d3b38dfbe0c046ed51203d56b48f4 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_I_Problems/Problem_15 | Let $\triangle ABC$ be an acute triangle with circumcircle $\omega,$ and let $H$ be the intersection of the altitudes of $\triangle ABC.$ Suppose the tangent to the circumcircle of $\triangle HBC$ at $H$ intersects $\omega$ at points $X$ and $Y$ with $HA=3,HX=2,$ and $HY=6.$ The area of $\triangle ABC$ can be written in the form $m\sqrt{n},$ where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n.$ | Note that $\overline{BC}$ bisects $\overline{OO'}$ . Using the same method from Solution 3 we find $R = \frac{21}{2\sqrt{5}}$ . Let the midpoint of $\overline{BC}$ be $N$ , then by the Pythagorean Theorem we have $BN^2 = OB^2 - ON^2 = R^2 - \frac{3}{2}^2$ , so $BN = \frac{3\sqrt{11}}{\sqrt{5}}$ . Since $h_a = 5$ we have that the area of ABC is $3\sqrt{55}$ so the answer is $3 + 55 = \boxed{58}$ | null | 58 |
3a93845c6a329c1c404ef905e00d3727 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_1 | Find the number of ordered pairs of positive integers $(m,n)$ such that ${m^2n = 20 ^{20}}$ | In this problem, we want to find the number of ordered pairs $(m, n)$ such that $m^2n = 20^{20}$ . Let $x = m^2$ . Therefore, we want two numbers, $x$ and $n$ , such that their product is $20^{20}$ and $x$ is a perfect square. Note that there is exactly one valid $n$ for a unique $x$ , which is $\tfrac{20^{20}}{x}$ . This reduces the problem to finding the number of unique perfect square factors of $20^{20}$
$20^{20} = 2^{40} \cdot 5^{20} = \left(2^2\right)^{20}\cdot\left(5^2\right)^{10}.$ Therefore, the answer is $21 \cdot 11 = \boxed{231}.$ | null | 231 |
51420e09bcae337240518da2685af935 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_2 | Let $P$ be a point chosen uniformly at random in the interior of the unit square with vertices at $(0,0), (1,0), (1,1)$ , and $(0,1)$ . The probability that the slope of the line determined by $P$ and the point $\left(\frac58, \frac38 \right)$ is greater than or equal to $\frac12$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | The areas bounded by the unit square and alternately bounded by the lines through $\left(\frac{5}{8},\frac{3}{8}\right)$ that are vertical or have a slope of $1/2$ show where $P$ can be placed to satisfy the condition. One of the areas is a trapezoid with bases $1/16$ and $3/8$ and height $5/8$ . The other area is a trapezoid with bases $7/16$ and $5/8$ and height $3/8$ . Then, \[\frac{\frac{1}{16}+\frac{3}{8}}{2}\cdot\frac{5}{8}+\frac{\frac{7}{16}+\frac{5}{8}}{2}\cdot\frac{3}{8}=\frac{86}{256}=\frac{43}{128}\implies43+128=\boxed{171}\] ~mn28407 | null | 171 |
3ee93ab03e47a6015b429cf5df99f327 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_3 | The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Let $\log _{2^x}3^{20}=\log _{2^{x+3}}3^{2020}=n$ . Based on the equation, we get $(2^x)^n=3^{20}$ and $(2^{x+3})^n=3^{2020}$ . Expanding the second equation, we get $8^n\cdot2^{xn}=3^{2020}$ . Substituting the first equation in, we get $8^n\cdot3^{20}=3^{2020}$ , so $8^n=3^{2000}$ . Taking the 100th root, we get $8^{\frac{n}{100}}=3^{20}$ . Therefore, $(2^{\frac{3}{100}})^n=3^{20}$ , and using the our first equation( $2^{xn}=3^{20}$ ), we get $x=\frac{3}{100}$ and the answer is $\boxed{103}$ .
~rayfish | null | 103 |
3ee93ab03e47a6015b429cf5df99f327 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_3 | The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Recall the identity $\log_{a^n} b^{m} = \frac{m}{n}\log_{a} b$ (which is easily proven using exponents or change of base).
Then this problem turns into \[\frac{20}{x}\log_{2} 3 = \frac{2020}{x+3}\log_{2} 3\] Divide $\log_{2} 3$ from both sides. And we are left with $\frac{20}{x}=\frac{2020}{x+3}$ .Solving this simple equation we get \[x = \tfrac{3}{100} \Rightarrow \boxed{103}\] ~mlgjeffdoge21 | null | 103 |
3ee93ab03e47a6015b429cf5df99f327 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_3 | The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | $\log_{2^x} 3^{20} = 2^{xy} = 3^{20}$
$\log_{2^{x+3}} 3^{2020} = (2^{x+3})^y = 3^{2020}$
$3^{2020} = (3^{20})^{101}$
$(2^{xy})^{101} = (2^{x+3})^y = 3^{2020}$
$(2^{xy})^{101} = (2^{x+3})^y \Rightarrow 2^{101xy} = 2^{xy+3y} \Rightarrow 101xy = xy + 3y \Rightarrow 101xy = y(x+3)$
$101x = x + 3$
$100x = 3$
$x = \frac{3}{100}$
$100 + 3 = \boxed{103}$ ~Airplanes2007 | null | 103 |
a4db0a62114d932a2dc2aaa64fe03a51 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_4 | Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$ | After sketching, it is clear a $90^{\circ}$ rotation is done about $(x,y)$ . Looking between $A$ and $A'$ $x+y=18$ . Thus $90+18=\boxed{108}$ .
~mn28407 | null | 108 |
a4db0a62114d932a2dc2aaa64fe03a51 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_4 | Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$ | [asy] /* Geogebra to Asymptote conversion by samrocksnature, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -8.0451801958033, xmax = 47.246151591238494, ymin = -10.271454747548662, ymax = 21.426040258770957; /* image dimensions */ pen zzttqq = rgb(0.6,0.2,0); pen qqwuqq = rgb(0,0.39215686274509803,0); pen qqffff = rgb(0,1,1); draw((16,0)--(0,0)--(0,12)--cycle, linewidth(2) + zzttqq); draw((24,2)--(24,18)--(36,18)--cycle, linewidth(2) + blue); draw((16,0)--(21,-3)--(24,2)--cycle, linewidth(2) + qqwuqq); draw((21.39134584768662,-2.3477569205223032)--(20.73910276820892,-1.9564110728356852)--(20.347756920522304,-2.608654152313382)--(21,-3)--cycle, linewidth(2) + qqffff); /* draw figures */ draw((16,0)--(0,0), linewidth(2) + zzttqq); draw((0,0)--(0,12), linewidth(2) + zzttqq); draw((0,12)--(16,0), linewidth(2) + zzttqq); draw((24,2)--(24,18), linewidth(2) + blue); draw((24,18)--(36,18), linewidth(2) + blue); draw((36,18)--(24,2), linewidth(2) + blue); draw((16,0)--(24,2), linewidth(2)); draw((16,0)--(21,-3), linewidth(2) + qqwuqq); draw((21,-3)--(24,2), linewidth(2) + qqwuqq); draw((24,2)--(16,0), linewidth(2) + qqwuqq); draw((21,-3)--(20,1), linewidth(2.8) + qqffff); /* dots and labels */ dot((0,0),linewidth(4pt) + dotstyle); label("$A$", (-0.6228029714727868,0.12704474547474198), NE * labelscalefactor); dot((0,12),dotstyle); label("$B$", (0.1301918194013232,12.354245873478124), NE * labelscalefactor); dot((16,0),dotstyle); label("$C$", (16.15822379657881,0.34218611429591583), NE * labelscalefactor); dot((24,18),dotstyle); label("$A'$", (24.154311337765787,18.342347305667463), NE * labelscalefactor); dot((24,2),dotstyle); label("$C'$", (23.186175178070503,1.95574638045472), NE * labelscalefactor); dot((36,18),dotstyle); label("$B'$", (36.13051420214449,18.342347305667463), NE * labelscalefactor); dot((21,-3),dotstyle); label("$P$", (21.35747354309052,-3.458644734878156), NE * labelscalefactor); dot((20,1),linewidth(4pt) + dotstyle); label("$D$", (20.13833911977053,1.2744653791876692), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]
We first draw a diagram with the correct Cartesian coordinates and a center of rotation $P$ . Note that $PC=PC'$ because $P$ lies on the perpendicular bisector of $CC'$ (it must be equidistant from $C$ and $C'$ by properties of a rotation).
Since $AB$ is vertical while $A'B'$ is horizontal, we have that the angle of rotation must be $90^{\circ}$ , and therefore $\angle P = 90^{\circ}$ . Therefore, $CPC'$ is a 45-45-90 right triangle, and $CD=DP$
We calculate $D$ to be $(20,1)$ . Since we translate $4$ right and $1$ up to get from point $C$ to point $D$ , we must translate $1$ right and $4$ down to get to point $P$ . This gives us $P(21,-3)$ . Our answer is then $90+21-3=\boxed{108}$ . ~Lopkiloinm & samrocksnature | null | 108 |
a4db0a62114d932a2dc2aaa64fe03a51 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_4 | Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$ | For the above reasons, the transformation is simply a $90^\circ$ rotation. Proceed with complex numbers on the points $C$ and $C'$ . Let $(x, y)$ be the origin. Thus, $C \rightarrow (16-x)+(-y)i$ and $C' \rightarrow (24-x)+(2-y)i$ . The transformation from $C'$ to $C$ is a multiplication of $i$ , which yields $(16-x)+(-y)i=(y-2)+(24-x)i$ . Equating the real and complex terms results in the equations $16-x=y-2$ and $-y=24-x$ . Solving, $(x, y) : (21, -3) \rightarrow 90+21-3=\boxed{108}$ | null | 108 |
a4db0a62114d932a2dc2aaa64fe03a51 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_4 | Triangles $\triangle ABC$ and $\triangle A'B'C'$ lie in the coordinate plane with vertices $A(0,0)$ $B(0,12)$ $C(16,0)$ $A'(24,18)$ $B'(36,18)$ $C'(24,2)$ . A rotation of $m$ degrees clockwise around the point $(x,y)$ where $0<m<180$ , will transform $\triangle ABC$ to $\triangle A'B'C'$ . Find $m+x+y$ | We know that the rotation point $P$ has to be equidistant from both $A$ and $A'$ so it has to lie on the line that is on the midpoint of the segment $AA'$ and also the line has to be perpendicular to $AA'$ . Solving, we get the line is $y=\frac{-4}{3}x+25$ . Doing the same for $B$ and $B'$ , we get that $y=-6x+123$ . Since the point $P$ of rotation must lie on both of these lines, we set them equal, solve and get: $x=21$ $y=-3$ . We can also easily see that the degree of rotation is $90$ since $AB$ is initially vertical, and now it is horizontal. Also, we can just sketch this on a coordinate plane and easily realize the same. Hence, the answer is $21-3+90 = \boxed{108}$ | null | 108 |
fabee2c450d3e0053aeaa4fb8f8acae1 | https://artofproblemsolving.com/wiki/index.php/2020_AIME_II_Problems/Problem_6 | Define a sequence recursively by $t_1 = 20$ $t_2 = 21$ , and \[t_n = \frac{5t_{n-1}+1}{25t_{n-2}}\] for all $n \ge 3$ . Then $t_{2020}$ can be expressed as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$ | Let $t_n=\frac{s_n}{5}$ . Then, we have $s_n=\frac{s_{n-1}+1}{s_{n-2}}$ where $s_1 = 100$ and $s_2 = 105$ . By substitution, we find $s_3 = \frac{53}{50}$ $s_4=\frac{103}{105\cdot50}$ $s_5=\frac{101}{105}$ $s_6=100$ , and $s_7=105$ . So $s_n$ has a period of $5$ . Thus $s_{2020}=s_5=\frac{101}{105}$ . So, $\frac{101}{105\cdot 5}\implies 101+525=\boxed{626}$ .
~mn28407 | null | 626 |