link
stringlengths 75
84
| letter
stringclasses 5
values | answer
float64 0
2,935,363,332B
| problem
stringlengths 14
5.33k
| solution
sequencelengths 1
13
|
---|---|---|---|---|
https://artofproblemsolving.com/wiki/index.php/1989_AJHSME_Problems/Problem_20 | D | 14 | The figure may be folded along the lines shown to form a number cube. Three number faces come together at each corner of the cube. What is the largest sum of three numbers whose faces come together at a corner?
[asy] draw((0,0)--(0,1)--(1,1)--(1,2)--(2,2)--(2,1)--(4,1)--(4,0)--(2,0)--(2,-1)--(1,-1)--(1,0)--cycle); draw((1,0)--(1,1)--(2,1)--(2,0)--cycle); draw((3,1)--(3,0)); label("$1$",(1.5,1.25),N); label("$2$",(1.5,.25),N); label("$3$",(1.5,-.75),N); label("$4$",(2.5,.25),N); label("$5$",(3.5,.25),N); label("$6$",(.5,.25),N); [/asy]
$\text{(A)}\ 11 \qquad \text{(B)}\ 12 \qquad \text{(C)}\ 13 \qquad \text{(D)}\ 14 \qquad \text{(E)}\ 15$ | [
"It is clear that $6$ $5$ , and $4$ will not come together to get a sum of $15$\nThe faces $6$ $5$ , and $3$ come together at a common vertex, making the maximal sum $6+5+3=14\\rightarrow \\boxed{14}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_10A_Problems/Problem_15 | E | 761 | The figures $F_1$ $F_2$ $F_3$ , and $F_4$ shown are the first in a sequence of figures. For $n\ge3$ $F_n$ is constructed from $F_{n - 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $F_{n - 1}$ had on each side of its outside square. For example, figure $F_3$ has $13$ diamonds. How many diamonds are there in figure $F_{20}$
$\textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$ | [
"The sequence $\\{ d_n\\}$ goes $1, 5, 13, 25, 41,\\dots$ . The first finite differences go $4, 8, 12, 16, \\dots$ . The second finite differences go $4, 4, 4, \\dots$ , so we see that the second finite difference is constant. Thus, $d_n$ can be represented as a quadratic, $d_n = an^2 + bn + c$ . However, we already know $d_1 = 1$ $d_2 = 3$ , and $d_3 = 13$ . Thus, \\[a + b + c = d_1 = 1\\] \\[4a + 2b + c = d_2 = 3\\] \\[9a + 3b + c = d_3 = 13\\] Solving this system for $a$ $b$ , and $c$ gives $a = 2$ $b = -2$ $c = 1$ . Finally, $d_n = 2n^2 - 2n + 1\\implies d_{20} = \\boxed{761}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_10A_Problems/Problem_15 | null | 761 | The figures $F_1$ $F_2$ $F_3$ , and $F_4$ shown are the first in a sequence of figures. For $n\ge3$ $F_n$ is constructed from $F_{n - 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $F_{n - 1}$ had on each side of its outside square. For example, figure $F_3$ has $13$ diamonds. How many diamonds are there in figure $F_{20}$
$\textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$ | [
"Split $F_n$ into $4$ congruent triangles by its diagonals (like in the pictures in the problem). This shows that the number of diamonds it contains is equal to $4$ times the $(n-2)$ th triangular number (i.e. the diamonds within the triangles or between the diagonals) and $4(n-1)+1$ (the diamonds on sides of the triangles or on the diagonals). The $n$ th triangular number is $\\frac{n(n+1)}{2}$ . Putting this together for $F_{20}$ this gives:\n$\\frac{4(18)(19)}{2}+4(19)+1=\\boxed{761}$",
"Color the diamond layers alternately blue and red, starting from the outside. You'll get the following pattern:\n\nIn the figure $F_n$ , the blue diamonds form a $n\\times n$ square, and the red diamonds form a $(n-1)\\times(n-1)$ square. \nHence the total number of diamonds in $F_{20}$ is $20^2 + 19^2 = \\boxed{761}$",
"When constructing $F_n$ from $F_{n-1}$ , we add $4(n-1)$ new diamonds. Let $d_n$ be the number of diamonds in $F_n$ . We now know that $d_1=1$ and $\\forall n>1:~ d_n=d_{n-1} + 4(n-1)$\nHence we get: \\begin{align*} d_{20} & = d_{19} + 4\\cdot 19 \\\\ & = d_{18} + 4\\cdot 18 + 4\\cdot 19 \\\\ & = \\cdots \\\\ & = 1 + 4(1+2+\\cdots+18+19) \\\\ & = 1 + 4\\cdot\\frac{19\\cdot 20}2 \\\\ & = \\boxed{761}"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_12A_Problems/Problem_11 | E | 761 | The figures $F_1$ $F_2$ $F_3$ , and $F_4$ shown are the first in a sequence of figures. For $n\ge3$ $F_n$ is constructed from $F_{n - 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $F_{n - 1}$ had on each side of its outside square. For example, figure $F_3$ has $13$ diamonds. How many diamonds are there in figure $F_{20}$
$\textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$ | [
"The sequence $\\{ d_n\\}$ goes $1, 5, 13, 25, 41,\\dots$ . The first finite differences go $4, 8, 12, 16, \\dots$ . The second finite differences go $4, 4, 4, \\dots$ , so we see that the second finite difference is constant. Thus, $d_n$ can be represented as a quadratic, $d_n = an^2 + bn + c$ . However, we already know $d_1 = 1$ $d_2 = 3$ , and $d_3 = 13$ . Thus, \\[a + b + c = d_1 = 1\\] \\[4a + 2b + c = d_2 = 3\\] \\[9a + 3b + c = d_3 = 13\\] Solving this system for $a$ $b$ , and $c$ gives $a = 2$ $b = -2$ $c = 1$ . Finally, $d_n = 2n^2 - 2n + 1\\implies d_{20} = \\boxed{761}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_12A_Problems/Problem_11 | null | 761 | The figures $F_1$ $F_2$ $F_3$ , and $F_4$ shown are the first in a sequence of figures. For $n\ge3$ $F_n$ is constructed from $F_{n - 1}$ by surrounding it with a square and placing one more diamond on each side of the new square than $F_{n - 1}$ had on each side of its outside square. For example, figure $F_3$ has $13$ diamonds. How many diamonds are there in figure $F_{20}$
$\textbf{(A)}\ 401 \qquad \textbf{(B)}\ 485 \qquad \textbf{(C)}\ 585 \qquad \textbf{(D)}\ 626 \qquad \textbf{(E)}\ 761$ | [
"Split $F_n$ into $4$ congruent triangles by its diagonals (like in the pictures in the problem). This shows that the number of diamonds it contains is equal to $4$ times the $(n-2)$ th triangular number (i.e. the diamonds within the triangles or between the diagonals) and $4(n-1)+1$ (the diamonds on sides of the triangles or on the diagonals). The $n$ th triangular number is $\\frac{n(n+1)}{2}$ . Putting this together for $F_{20}$ this gives:\n$\\frac{4(18)(19)}{2}+4(19)+1=\\boxed{761}$",
"Color the diamond layers alternately blue and red, starting from the outside. You'll get the following pattern:\n\nIn the figure $F_n$ , the blue diamonds form a $n\\times n$ square, and the red diamonds form a $(n-1)\\times(n-1)$ square. \nHence the total number of diamonds in $F_{20}$ is $20^2 + 19^2 = \\boxed{761}$",
"When constructing $F_n$ from $F_{n-1}$ , we add $4(n-1)$ new diamonds. Let $d_n$ be the number of diamonds in $F_n$ . We now know that $d_1=1$ and $\\forall n>1:~ d_n=d_{n-1} + 4(n-1)$\nHence we get: \\begin{align*} d_{20} & = d_{19} + 4\\cdot 19 \\\\ & = d_{18} + 4\\cdot 18 + 4\\cdot 19 \\\\ & = \\cdots \\\\ & = 1 + 4(1+2+\\cdots+18+19) \\\\ & = 1 + 4\\cdot\\frac{19\\cdot 20}2 \\\\ & = \\boxed{761}"
] |
https://artofproblemsolving.com/wiki/index.php/2014_AMC_8_Problems/Problem_10 | A | 1,979 | The first AMC $8$ was given in $1985$ and it has been given annually since that time. Samantha turned $12$ years old the year that she took the seventh AMC $8$ . In what year was Samantha born?
$\textbf{(A) }1979\qquad\textbf{(B) }1980\qquad\textbf{(C) }1981\qquad\textbf{(D) }1982\qquad \textbf{(E) }1983$ | [
"The seventh AMC 8 would have been given in $1991$ . If Samantha was 12 then, that means she was born 12 years ago, so she was born in $1991-12=1979$\nOur answer is $\\boxed{1979}$ corrections made by DrDominic",
"Since she was 12 when she took the seventh AMC 8, she should be $12-6=6$ years old when the first AMC 8 occurred. Therefore, she was born or was 'age 0' in $1985-6=\\boxed{1979}$ ~SweetMango77\ncorrections made by DrDominic"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_12A_Problems/Problem_10 | A | 8,041 | The first four terms of an arithmetic sequence are $p$ $9$ $3p-q$ , and $3p+q$ . What is the $2010^\text{th}$ term of this sequence?
$\textbf{(A)}\ 8041 \qquad \textbf{(B)}\ 8043 \qquad \textbf{(C)}\ 8045 \qquad \textbf{(D)}\ 8047 \qquad \textbf{(E)}\ 8049$ | [
"$3p-q$ and $3p+q$ are consecutive terms, so the common difference is $(3p+q)-(3p-q) = 2q$\n\\begin{align*}p+2q &= 9\\\\ 9+2q &= 3p-q\\\\ q&=2\\\\ p&=5\\end{align*}\nThe common difference is $4$ . The first term is $5$ and the $2010^\\text{th}$ term is\n\\[5+4(2009) = \\boxed{8041}\\]",
"Since all the answer choices are around $2010 \\cdot 4 = 8040$ , the common difference must be $4$ . The first term is therefore $9 - 4 = 5$ , so the $2010^\\text{th}$ term is $5 + 4 \\cdot 2009 = \\boxed{8041}$"
] |
https://artofproblemsolving.com/wiki/index.php/2005_AMC_10B_Problems/Problem_11 | E | 250 | The first term of a sequence is $2005$ . Each succeeding term is the sum of the cubes of the digits of the previous term. What is the ${2005}^{\text{th}}$ term of the sequence?
$\textbf{(A) } 29 \qquad \textbf{(B) } 55 \qquad \textbf{(C) } 85 \qquad \textbf{(D) } 133 \qquad \textbf{(E) } 250$ | [
"Performing this operation several times yields the results of $133$ for the second term, $55$ for the third term, and $250$ for the fourth term. The sum of the cubes of the digits of $250$ equal $133$ , a complete cycle. The cycle is, excluding the first term, the $2^{\\text{nd}}$ $3^{\\text{rd}}$ , and $4^{\\text{th}}$ terms will equal $133$ $55$ , and $250$ , following the fourth term. Any term number that is equivalent to $1\\ (\\text{mod}\\ 3)$ will produce a result of $250$ . It just so happens that $2005\\equiv 1\\ (\\text{mod}\\ 3)$ , which leads us to the answer of $\\boxed{250}$"
] |
https://artofproblemsolving.com/wiki/index.php/2005_AMC_12B_Problems/Problem_10 | E | 250 | The first term of a sequence is $2005$ . Each succeeding term is the sum of the cubes of the digits of the previous term. What is the ${2005}^{\text{th}}$ term of the sequence?
$\textbf{(A) } 29 \qquad \textbf{(B) } 55 \qquad \textbf{(C) } 85 \qquad \textbf{(D) } 133 \qquad \textbf{(E) } 250$ | [
"Performing this operation several times yields the results of $133$ for the second term, $55$ for the third term, and $250$ for the fourth term. The sum of the cubes of the digits of $250$ equal $133$ , a complete cycle. The cycle is, excluding the first term, the $2^{\\text{nd}}$ $3^{\\text{rd}}$ , and $4^{\\text{th}}$ terms will equal $133$ $55$ , and $250$ , following the fourth term. Any term number that is equivalent to $1\\ (\\text{mod}\\ 3)$ will produce a result of $250$ . It just so happens that $2005\\equiv 1\\ (\\text{mod}\\ 3)$ , which leads us to the answer of $\\boxed{250}$"
] |
https://artofproblemsolving.com/wiki/index.php/1962_AHSME_Problems/Problem_3 | B | 0 | The first three terms of an arithmetic progression are $x - 1, x + 1, 2x + 3$ , in the order shown. The value of $x$ is:
$\textbf{(A)}\ -2\qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ \text{undetermined}$ | [
"Let $y$ represent the common difference between the terms. We have $(x+1)-y=(x-1)\\implies y=2$\nSubstituting gives us $(2x+3)-2=(x+1)\\implies 2x+1=x+1\\implies x=0$\nTherefore, our answer is $\\boxed{0}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_12A_Problems/Problem_7 | null | 502 | The first three terms of an arithmetic sequence are $2x - 3$ $5x - 11$ , and $3x + 1$ respectively. The $n$ th term of the sequence is $2009$ . What is $n$
$\textbf{(A)}\ 255 \qquad \textbf{(B)}\ 502 \qquad \textbf{(C)}\ 1004 \qquad \textbf{(D)}\ 1506 \qquad \textbf{(E)}\ 8037$ | [
"As this is an arithmetic sequence, the difference must be constant: $(5x-11) - (2x-3) = (3x+1) - (5x-11)$ . This solves to $x=4$ . The first three terms then are $5$ $9$ , and $13$ . In general, the $n$ th term is $1+4n$ . Solving $1+4n=2009$ , we get $n=\\boxed{502}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_12A_Problems/Problem_25 | A | 0 | The first two terms of a sequence are $a_1 = 1$ and $a_2 = \frac {1}{\sqrt3}$ . For $n\ge1$
What is $|a_{2009}|$
$\textbf{(A)}\ 0\qquad \textbf{(B)}\ 2 - \sqrt3\qquad \textbf{(C)}\ \frac {1}{\sqrt3}\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ 2 + \sqrt3$ | [
"Consider another sequence $\\{\\theta_1, \\theta_2, \\theta_3...\\}$ such that $a_n = \\tan{\\theta_n}$ , and $0 \\leq \\theta_n < 180$\nThe given recurrence becomes\nIt follows that $\\theta_{n + 2} \\equiv \\theta_{n + 1} + \\theta_{n} \\pmod{180}$ . Since $\\theta_1 = 45, \\theta_2 = 30$ , all terms in the sequence $\\{\\theta_1, \\theta_2, \\theta_3...\\}$ will be a multiple of $15$\nNow consider another sequence $\\{b_1, b_2, b_3...\\}$ such that $b_n = \\theta_n/15$ , and $0 \\leq b_n < 12$ . The sequence $b_n$ satisfies $b_1 = 3, b_2 = 2, b_{n + 2} \\equiv b_{n + 1} + b_n \\pmod{12}$\nAs the number of possible consecutive two terms is finite, we know that the sequence $b_n$ is periodic. Write out the first few terms of the sequence until it starts to repeat.\n$\\{b_n\\} = \\{3,2,5,7,0,7,7,2,9,11,8,7,3,10,1,11,0,11,11,10,9,7,4,11,3,2,5,7,...\\}$\nNote that $b_{25} = b_1 = 3$ and $b_{26} = b_2 = 2$ . Thus $\\{b_n\\}$ has a period of $24$ $b_{n + 24} = b_n$\nIt follows that $b_{2009} = b_{17} = 0$ and $\\theta_{2009} = 15 b_{2009} = 0$ . Thus $a_{2009} = \\tan{\\theta_{2009}} = \\tan{0} = 0.$\nOur answer is $|a_{2009}| = \\boxed{0}$",
"First, some intuition. The given recurrence relation: $a_{n + 2} = \\frac {a_n + a_{n + 1}}{1 - a_na_{n + 1}}$ looks much like the tangent addition formula. So, we let $a_n=\\tan{\\theta_n}$ . Then, we get: \\[\\tan{\\theta_n}=\\tan{(\\theta_{n-1}+\\theta_{n-2})}\\] This gives us: \\[\\theta_n \\equiv \\theta_{n-1}+\\theta_{n-2} \\pmod{180}\\] Now, observe that \\[\\theta_1=45\\] \\[\\theta_2=30\\] We know that this sequence of values for $\\theta_n$ will repeat eventually because it is mod $180$ .\nIt is just a matter of when, so we start bashing:\n\\[\\theta_3=75\\] \\[\\theta_4=105\\] \\[\\theta_5=0\\] \\[\\theta_6=105\\] \\[\\theta_7=105\\] \\[\\theta_8=30\\] \\[\\theta_9=135\\] \\[\\theta_{10}=165\\] \\[\\theta_{11}=120\\] \\[\\theta_{12}=105\\] \\[\\theta_{13}=45\\] \\[\\theta_{14}=150\\] \\[\\theta_{15}=15\\] \\[\\theta_{16}=165\\] \\[\\theta_{17}=0\\] \\[\\theta_{18}=165\\] \\[\\theta_{19}=165\\] \\[\\theta_{20}=150\\] \\[\\theta_{21}=135\\] \\[\\theta_{22}=105\\] \\[\\theta_{23}=60\\] \\[\\theta_{24}=165\\] \\[\\theta_{25}=45\\] \\[\\theta_{26}=30\\] And there is the repetition. So, this series has a period of 24. $2009 \\equiv 17 \\pmod{24}$ , so $|a_{2009}|=|\\tan{\\theta_{17}}|=|\\tan{0}|=|0|= \\boxed{0}$ ~Firebolt360"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_12A_Problems/Problem_9 | E | 11 | The five small shaded squares inside this unit square are congruent and have disjoint interiors. The midpoint of each side of the middle square coincides with one of the vertices of the other four small squares as shown. The common side length is $\tfrac{a-\sqrt{2}}{b}$ , where $a$ and $b$ are positive integers. What is $a+b$
[asy] real x=.369; draw((0,0)--(0,1)--(1,1)--(1,0)--cycle); filldraw((0,0)--(0,x)--(x,x)--(x,0)--cycle, gray); filldraw((0,1)--(0,1-x)--(x,1-x)--(x,1)--cycle, gray); filldraw((1,1)--(1,1-x)--(1-x,1-x)--(1-x,1)--cycle, gray); filldraw((1,0)--(1,x)--(1-x,x)--(1-x,0)--cycle, gray); filldraw((.5,.5-x*sqrt(2)/2)--(.5+x*sqrt(2)/2,.5)--(.5,.5+x*sqrt(2)/2)--(.5-x*sqrt(2)/2,.5)--cycle, gray); [/asy]
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$ | [
"Let $s$ be the side length of the small squares.\nThe diagonal of the big square can be written in two ways: $\\sqrt{2}$ and $s \\sqrt{2} + s + s \\sqrt{2}$\nSolving for $s$ , we get $s = \\frac{4 - \\sqrt{2}}{7}$ , so our answer is $4 + 7 \\Rightarrow \\boxed{11}$",
"The diagonal of the small square can be written in two ways: $s \\sqrt(2)$ and $2*(1-2s).$ Equating and simplifying gives $s = \\frac{4 - \\sqrt{2}}{7}$ . Hence our answer is $4 + 7 \\Rightarrow \\boxed{11}.$"
] |
https://artofproblemsolving.com/wiki/index.php/2021_AMC_12A_Problems/Problem_21 | A | 7 | The five solutions to the equation \[(z-1)(z^2+2z+4)(z^2+4z+6)=0\] may be written in the form $x_k+y_ki$ for $1\le k\le 5,$ where $x_k$ and $y_k$ are real. Let $\mathcal E$ be the unique ellipse that passes through the points $(x_1,y_1),(x_2,y_2),(x_3,y_3),(x_4,y_4),$ and $(x_5,y_5)$ . The eccentricity of $\mathcal E$ can be written in the form $\sqrt{\frac mn}$ , where $m$ and $n$ are relatively prime positive integers. What is $m+n$ ? (Recall that the eccentricity of an ellipse $\mathcal E$ is the ratio $\frac ca$ , where $2a$ is the length of the major axis of $\mathcal E$ and $2c$ is the is the distance between its two foci.)
$\textbf{(A) }7 \qquad \textbf{(B) }9 \qquad \textbf{(C) }11 \qquad \textbf{(D) }13\qquad \textbf{(E) }15$ | [
"The solutions to this equation are $z = 1$ $z = -1 \\pm i\\sqrt 3$ , and $z = -2\\pm i\\sqrt 2$ . Consider the five points $(1,0)$ $\\left(-1,\\pm\\sqrt 3\\right)$ , and $\\left(-2,\\pm\\sqrt 2\\right)$ ; these are the five points which lie on $\\mathcal E$ . Note that since these five points are symmetric about the $x$ -axis, so must $\\mathcal E$\nNow let $r=b/a$ denote the ratio of the length of the minor axis of $\\mathcal E$ to the length of its major axis. Remark that if we perform a transformation of the plane which scales every $x$ -coordinate by a factor of $r$ $\\mathcal E$ is sent to a circle $\\mathcal E'$ . Thus, the problem is equivalent to finding the value of $r$ such that $(r,0)$ $\\left(-r,\\pm\\sqrt 3\\right)$ , and $\\left(-2r,\\pm\\sqrt 2\\right)$ all lie on a common circle; equivalently, it suffices to determine the value of $r$ such that the circumcenter of the triangle formed by the points $P_1 = (r,0)$ $P_2 = \\left(-r,\\sqrt 3\\right)$ , and $P_3 = \\left(-2r,\\sqrt 2\\right)$ lies on the $x$ -axis.\nRecall that the circumcenter of a triangle $ABC$ is the intersection point of the perpendicular bisectors of its three sides. The equations of the perpendicular bisectors of the segments $\\overline{P_1P_2}$ and $\\overline{P_1P_3}$ are \\[y = \\tfrac{\\sqrt 3}2 + \\tfrac{2r}{\\sqrt 3}x\\qquad\\text{and}\\qquad y = \\tfrac{\\sqrt 2}2 + \\tfrac{3r}{\\sqrt 2}\\left(x + \\tfrac r2\\right)\\] respectively. These two lines have different slopes for $r\\neq 0$ , so indeed they will intersect at some point $(x_0,y_0)$ ; we want $y_0 = 0$ . Plugging $y = 0$ into the first equation yields $x = -\\tfrac{3}{4r}$ , and so plugging $y=0$ into the second equation and simplifying yields \\[-\\tfrac{1}{3r} = x + \\tfrac r2 = -\\tfrac{3}{4r} + \\tfrac{r}{2}.\\] Solving yields $r=\\sqrt{\\tfrac 56}$\nFinally, recall that the lengths $a$ $b$ , and $c$ (where $c$ is the distance between the foci of $\\mathcal E$ ) satisfy $c = \\sqrt{a^2 - b^2}$ . Thus the eccentricity of $\\mathcal E$ is $\\tfrac ca = \\sqrt{1 - \\left(\\tfrac ba\\right)^2} = \\sqrt{\\tfrac 16}$ and the requested answer is $\\boxed{7}$",
"Completing the square in the original equation, we have \\[(z-1)\\left((z+1)^2+3\\right)\\left((z+2)^2+2\\right)=0,\\] from which $z=1,-1\\pm\\sqrt{3}i,-2\\pm\\sqrt{2}i.$\nNow, we will find the equation of an ellipse $\\mathcal E$ that passes through $(1,0),\\left(-1,\\pm\\sqrt3\\right),$ and $\\left(-2,\\pm\\sqrt2\\right)$ in the $xy$ -plane. By symmetry, the center of $\\mathcal E$ must be on the $x$ -axis.\nThe formula of $\\mathcal E$ is \\[\\frac{(x-h)^2}{a^2}+\\frac{y^2}{b^2}=1, \\hspace{44.5mm} (\\bigstar)\\] with the center $(h,0)$ and the axes' lengths $2a$ and $2b.$\nPlugging the points $(1,0),\\left(-1,\\sqrt3\\right),$ and $\\left(-2,\\sqrt2\\right)$ into $(\\bigstar),$ respectively, we have the following system of equations: \\begin{align*} \\frac{(1-h)^2}{a^2}&=1, \\\\ \\frac{(-1-h)^2}{a^2}+\\frac{{\\sqrt3}^2}{b^2}&=1, \\\\ \\frac{(-2-h)^2}{a^2}+\\frac{{\\sqrt2}^2}{b^2}&=1. \\end{align*} Since $t^2=(-t)^2$ holds for all real numbers $t,$ we clear fractions and simplify: \\begin{align*} (1-h)^2&=a^2, \\hspace{30.25mm} &(1)\\\\ b^2(1+h)^2 + 3a^2 &= a^2b^2, &(2)\\\\ b^2(2+h)^2 + 2a^2 &= a^2b^2. &(3) \\end{align*} Applying the Transitive Property to $(2)$ and $(3),$ we isolate $a^2:$ \\begin{align*} b^2(1+h)^2 + 3a^2 &= b^2(2+h)^2 + 2a^2 \\\\ a^2 &= b^2\\left((2+h)^2-(1+h)^2\\right) \\\\ a^2 &= b^2(2h+3). \\hspace{26.75mm} (*) \\end{align*} Substituting $(1)$ and $(*)$ into $(2),$ we solve for $h:$ \\begin{align*} b^2(1+h)^2 + 3\\underbrace{b^2(2h+3)}_{\\text{by }(*)} &= \\underbrace{(1-h)^2}_{\\text{by }(1)}b^2 \\\\ (1+h)^2+3(2h+3)&=(1-h)^2 \\\\ 1+2h+h^2+6h+9&=1-2h+h^2 \\\\ 10h&=-9 \\\\ h&=-\\frac{9}{10}. \\end{align*} Substituting this into $(1),$ we get $a^2=\\frac{361}{100}.$\nSubstituting the current results into $(*),$ we get $b^2=\\frac{361}{120}.$\nFinally, we obtain \\[c^2 = a^2-b^2 = 361\\left(\\frac{1}{100}-\\frac{1}{120}\\right) = \\frac{361}{600},\\] from which \\[\\frac{c}{a}=\\sqrt{\\frac{c^2}{a^2}}=\\sqrt{\\frac{361/600}{361/100}}=\\sqrt{\\frac 16}.\\] The answer is $1+6=\\boxed{7}.$",
"Starting from this system of equations from Solution 2: \\begin{align*} \\frac{(1-h)^2}{a^2}&=1, \\\\ \\frac{(-1-h)^2}{a^2}+\\frac{{\\sqrt3}^2}{b^2}&=1, \\\\ \\frac{(-2-h)^2}{a^2}+\\frac{{\\sqrt2}^2}{b^2}&=1. \\end{align*} Let $A=a^{-2}$ and $B=b^{-2}$ . Therefore, the system can be rewritten as: \\begin{align*} (h^2-2h+1)A&=1, &(1)\\\\ (h^2+2h+1)A+3B&=1, &(2)\\\\ (h^2+4h+4)A+2B&=1. &(3) \\end{align*} Subtracting $(1)$ from $(2)$ and $(3)$ , we get \\[4hA+3B=0\\quad\\text{and}\\quad 3A-6hA+3B=0.\\] Plugging the former into the latter and simplifying yields $6A=5B$ . Hence $a^2:b^2=6:5$ . Since $c^2=a^2-b^2$ , we get $a^2=6c^2$ , so the eccentricity is $\\frac ca=\\sqrt{\\frac16}$\nTherefore, the answer is $1+6=\\boxed{7}$",
"The five roots are $1,-1+i\\sqrt{3},-1-i\\sqrt{3},-2+i\\sqrt{2},-2-i\\sqrt{2}.$\nSo, we express this conic in the form $ax^2+by^2+cx+z=0.$ Note that this conic cannot have the $ky$ term since the roots are symmetric about the $x$ -axis.\nNow we have equations \\begin{align*} a+c+z&=0, \\\\ a+3b-c+z&=0, \\\\ 4a+2b-2c+z&=0, \\end{align*} from which $a:b:c=5:6:9.$\nSo, the conic can be written in the form $5x^2+6y^2+9x=14.$ If it is written in the form of $\\frac{(x-m)^2}{r^2}+\\frac{y^2}{s^2}=1,$ then $r^2:s^2=6:5.$\nTherefore, the desired eccentricity is $\\sqrt{\\frac{\\sqrt{6-5}}{6}}=\\sqrt{\\frac{1}{6}},$ and the answer is $1+6=\\boxed{7}.$",
"After calculating the $5$ points that lie on $\\mathcal E$ , we try to find a transformation that sends $\\mathcal E$ to the unit circle. Scaling about $(1, 0)$ works, since $(1, 0)$ is already on the unit circle and such a transformation will preserve the ellipse's symmetry about the $x$ -axis. If $2a$ and $2b$ are the lengths of the major and minor axes, respectively, then the ellipse will be scaled by a factor of $r := \\frac1a$ in the $x$ -dimension and $s := \\frac1b$ in the $y$ -dimension.\nThe transformation then sends the points $\\left(-1,\\pm\\sqrt 3\\right)$ and $\\left(-2,\\pm\\sqrt 2\\right)$ to the points $\\left(1-2r, \\pm s\\sqrt 3\\right)$ and $\\left(1-3r, \\pm s\\sqrt 2\\right)$ , respectively. These points are on the unit circle, so \\[(1-2r)^2 + 3s^2 = 1 \\quad \\text{and} \\quad (1-3r)^2 + 2s^2 = 1.\\] This yields \\[4r^2 + 3s^2 = 4r \\quad \\text{and} \\quad 9r^2 + 2s^2 = 6r,\\] from which \\begin{align*} 12r^2 + 9s^2 &= 18r^2 + 4s^2 \\\\ \\frac{r^2}{s^2} &= \\frac56. \\end{align*} Recalling that $r = \\frac1a$ and $s = \\frac1b$ , this implies $\\frac{b^2}{a^2} = \\frac56$ . From this, we get \\[\\frac{c^2}{a^2} = \\frac{a^2-b^2}{a^2} = 1 - \\frac{b^2}{a^2} = \\frac{1}{6},\\] so $\\frac ca = \\sqrt{\\frac16}$ , giving an answer of $1 + 6 = \\boxed{7}$"
] |
https://artofproblemsolving.com/wiki/index.php/1992_AJHSME_Problems/Problem_12 | C | 24,000 | The five tires of a car (four road tires and a full-sized spare) were rotated so that each tire was used the same number of miles during the first $30,000$ miles the car traveled. For how many miles was each tire used?
$\text{(A)}\ 6000 \qquad \text{(B)}\ 7500 \qquad \text{(C)}\ 24,000 \qquad \text{(D)}\ 30,000 \qquad \text{(E)}\ 37,500$ | [
"In the $30,000$ miles, four tires were always used at one time, so the amount of miles the five tires were used in total is $30,000 \\times 4=120,000$ . Five tires were used and each was used equally, so each tire was used for $\\frac{120,000}{5}=\\boxed{24,000}$"
] |
https://artofproblemsolving.com/wiki/index.php/2023_AIME_I_Problems/Problem_14 | null | 608 | The following analog clock has two hands that can move independently of each other. [asy] unitsize(2cm); draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) { draw(0.9*dir(30*i)--dir(30*i)); } for (int i = 0; i < 4; ++i) { draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2)); } for (int i = 1; i < 13; ++i) { label("\small" + (string) i, dir(90 - i * 30) * 0.75); } draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); [/asy] Initially, both hands point to the number $12$ . The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock face while the other hand does not move.
Let $N$ be the number of sequences of $144$ hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the $144$ movements, the hands have returned to their initial position. Find the remainder when $N$ is divided by $1000$ | [
"This problem is, in essence, the following: A $12\\times12$ coordinate grid is placed on a (flat) torus; how many loops are there that pass through each point while only moving up or right? In other words, Felix the frog starts his journey at $(0,0)$ in the coordinate plane. Every second, he jumps either to the right or up, until he reaches an $x$ - or $y$ -coordinate of $12$ . At this point, if he tries to jump to a coordinate outside the square from $(0,0)$ to $(11,11)$ , he \"wraps around\" and ends up at an $x$ - or $y$ - coordinate of $0$ . How many ways are there for Felix to jump on every grid point in this square, so that he ends at $(0,0)$ ? This is consistent with the construction of the flat torus as $\\mathbb Z^2/12\\mathbb Z^2$ (2-dimensional modular arithmetic. $(\\mathbb{Z}_{12})^2$\nMoving on, define a $\\textit{path}$ from point $A$ to point $B$ to be a sequence of \"up\"s and \"right\"s that takes Felix from $A$ to $B$ . The $\\textit{distance}$ from $A$ to $B$ is the length of the shortest path from $A$ to $B$ . At the crux of this problem is the following consideration: The points $A_i=(i,12-i), i\\in{0,...,11}$ are pairwise equidistant, each pair having distance of $12$ in both directions.\n\nA valid complete path then joins two $A_i$ 's, say $A_i$ and $A_j$ . In fact, a link between some $A_i$ and $A_j$ fully determines the rest of the cycle, as the path from $A_{i+1}$ must \"hug\" the path from $A_i$ , to ensure that there are no gaps. We therefore see that if $A_0$ leads to $A_k$ , then $A_i$ leads to $A_{i+k}$ . Only the values of $k$ relatively prime to $12$ result in solutions, though, because otherwise $A_0$ would only lead to $\\{A_i:\\exists n\\in \\mathbb Z:i\\equiv kn\\quad\\text{mod 12}\\}$ . The number of paths from $A_0$ to $A_k$ is ${12\\choose k}$ , and so the answer is\n\\[{12\\choose1}+{12\\choose5}+{12\\choose7}+{12\\choose11}=1\\boxed{608}.\\]",
"This is more of a solution sketch and lacks rigorous proof for interim steps, but illustrates some key observations that lead to a simple solution.\nNote that one can visualize this problem as walking on a $N \\times N$ grid where the edges warp. Your goal is to have a single path across all nodes on the grid leading back to $(0,\\ 0)$ . For convenience, any grid position are presumed to be in $\\mod N$\nNote that there are exactly two ways to reach node $(i,\\ j)$ , namely $(i - 1,\\ j)$ and $(i,\\ j - 1)$\nAs a result, if a path includes a step from $(i,\\ j)$ to $(i + 1,\\ j)$ , there cannot be a step from $(i,\\ j)$ to $(i,\\ j + 1)$ . However, a valid solution must reach $(i,\\ j + 1)$ , and the only valid step is from $(i - 1,\\ j + 1)$\nSo a solution that includes a step from $(i,\\ j)$ to $(i + 1,\\ j)$ dictates a step from $(i - 1,\\ j + 1)$ to $(i,\\ j + 1)$ and by extension steps from $(i - a,\\ j + a)$ to $(i - a + 1,\\ j + a)$ . We observe the equivalent result for steps in the orthogonal direction.\nThis means that in constructing a valid solution, taking one step in fact dictates N steps, thus it's sufficient to count valid solutions with $N = a + b$ moves of going right $a$ times and $b$ times up the grid. The number of distinct solutions can be computed by permuting 2 kinds of indistinguishable objects $\\binom{N}{a}$\nHere we observe, without proof, that if $\\gcd(a, b) \\neq 1$ , then we will return to the origin prematurely. For $N = 12$ , we only want to count the number of solutions associated with $12 = 1 + 11 = 5 + 7 = 7 + 5 = 11 + 1$\n(For those attempting a rigorous proof, note that $\\gcd(a, b) = \\gcd(a + b, b) = \\gcd(N, b) = \\gcd(N, a)$ ).\nThe total number of solutions, noting symmetry, is thus\n\\[2\\cdot\\left(\\binom{12}{1} + \\binom{12}{5}\\right) = 1608\\]\nThis yields $\\boxed{608}$ as our desired answer.",
"Define a $12 \\times 12$ matrix $X$ .\nEach entry $x_{i, j}$ denotes the number of movements the longer hand moves, given that two hands jointly make $12 \\left( i - 1 \\right) + \\left( j - 1 \\right)$ movements.\nThus, the number of movements the shorter hand moves is $12 \\left( i - 1 \\right) + \\left( j - 1 \\right) - x_{i, j}$\nDenote by $r_{i, j}$ the remainder of $x_{i, j}$ divided by 12.\nDenote by $R$ this remainder matrix.\nIf two hands can return to their initial positions after 144 movements, then $r_{12, 12} = 0$ or 11.\nDenote by $S_0$ (resp. $S_{11}$ ) the collection of feasible sequences of movements, such that $r_{12, 12} = 0$ (resp. $r_{12, 12} = 11$ ).\nDefine a function $f : S_0 \\rightarrow S_{11}$ , such that for any $\\left\\{ x_{i,j} , \\ \\forall \\ i, j \\in \\left\\{ 1, 2, \\cdots , 12 \\right\\} \\right\\} \\in S_0$ , the functional value of the entry indexed as $\\left( i, j \\right)$ is $12 \\left( i - 1 \\right) + \\left( j - 1 \\right) - x_{i, j}$ .\nThus, function $f$ is bijective. This implies $| S_0 | = | S_{11} |$\nIn the rest of analysis, we count $| S_0 |$\nWe make the following observations:\n\\begin{enumerate}\n\\item $x_{1, 1} = 0$ and $12 | x_{12, 12}$\nThese follow from the definition of $S_0$\n\\item Each column of $R$ is a permutation of $\\left\\{ 0, 1, \\cdots , 11 \\right\\}$\nThe reasoning is as follows. Suppose there exist $i < i'$ $j$ , such that $r_{i, j} = r_{i', j}$ . Then this entails that the positions of two hands after the $\\left( 12 \\left( i' - 1 \\right) + \\left( j - 1 \\right) \\right)$ th movement coincide with their positions after the $\\left( 12 \\left( i - 1 \\right) + \\left( j - 1 \\right) \\right)$ th movement.\n\\item For any $j \\in \\left\\{ 1, 2 ,\\cdots , 11 \\right\\}$ $x_{i, j+1} - x_{i, j}$ is equal to either 0 for all $i$ or 1 for all $i$\nThe reasoning is as follows. If this does not hold and the $j$ th column in $R$ is a permutation of $\\left\\{ 0, 1, \\cdots , 12 \\right\\}$ , then the $j+1$ th column is no longer a permutation of $\\left\\{ 0, 1, \\cdots , 12 \\right\\}$ . This leads to the infeasibility of the movements.\n\\item $x_{i+1, 1} = x_{i, 12}$ for any $i \\in \\left\\{ 1, 2, \\cdots , 11 \\right\\}$\nThis follows from the conditions that the $12$ th column in $R$ excluding $r_{12, 12}$ and the first column in $R$ excluding $x_{1, 1}$ are both permutations of $\\left\\{ 1, 2, \\cdots , 11 \\right\\}$\n\\end{enumerate}\nAll observations jointly imply that $x_{i, 12} = i \\cdot x_{1, 12}$ .\nThus, $\\left\\{ r_{1, 12}, r_{2, 12} , \\cdots , r_{11, 12} \\right\\}$ is a permutation of $\\left\\{ 1, 2, \\cdots , 11 \\right\\}$ .\nThus, $x_{1, 12}$ is relatively prime to 12.\nBecause $x_{1, 1} = 0$ and $x_{1, 12} - x_{1, 1} \\leq 11$ , we have $x_{1, 12} = 1$ , 5, 7, or 11.\nRecall that when we move from $x_{1, 1}$ to $x_{1, 12}$ , there are 11 steps of movements. Each movement has $x_{1, j+1} - x_{i, j} = 0$ or 1.\nThus, for each given $x_{1, 12}$ , the number of feasible movements from $x_{1, 1}$ to $x_{1, 12}$ is $\\binom{11}{x_{1, 12}}$\nTherefore, the total number of feasible movement sequences in this problem is \\begin{align*} | S_0 | + | S_{11} | & = 2 | S_0 | \\\\ & = 2 \\cdot \\sum_{x_{1, 12} = 1, 5, 7, 11} \\binom{11}{x_{1, 12}} \\\\ & = 2 \\left( 11 + 462 + 330 + 1 \\right) \\\\ & = 1608 . \\end{align*}\nTherefore, the answer is $\\boxed{608}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_8_Problems/Problem_6 | B | 4 | The following bar graph represents the length (in letters) of the names of 19 people. What is the median length of these names? [asy] unitsize(0.9cm); draw((-0.5,0)--(10,0), linewidth(1.5)); draw((-0.5,1)--(10,1)); draw((-0.5,2)--(10,2)); draw((-0.5,3)--(10,3)); draw((-0.5,4)--(10,4)); draw((-0.5,5)--(10,5)); draw((-0.5,6)--(10,6)); draw((-0.5,7)--(10,7)); label("frequency",(-0.5,8)); label("0", (-1, 0)); label("1", (-1, 1)); label("2", (-1, 2)); label("3", (-1, 3)); label("4", (-1, 4)); label("5", (-1, 5)); label("6", (-1, 6)); label("7", (-1, 7)); filldraw((0,0)--(0,7)--(1,7)--(1,0)--cycle, black); filldraw((2,0)--(2,3)--(3,3)--(3,0)--cycle, black); filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle, black); filldraw((6,0)--(6,4)--(7,4)--(7,0)--cycle, black); filldraw((8,0)--(8,4)--(9,4)--(9,0)--cycle, black); label("3", (0.5, -0.5)); label("4", (2.5, -0.5)); label("5", (4.5, -0.5)); label("6", (6.5, -0.5)); label("7", (8.5, -0.5)); label("name length", (4.5, -1)); [/asy]
$\textbf{(A) }3\qquad\textbf{(B) }4\qquad\textbf{(C) }5\qquad\textbf{(D) }6\qquad \textbf{(E) }7$ | [
"We first notice that the median name will be the $(19+1)/2=10^{\\mbox{th}}$ name. The $10^{\\mbox{th}}$ name is $\\boxed{4}$",
"To find the median length of a name from a bar graph, we must add up the number of names. Doing so gives us $7 + 3 + 1 + 4 + 4 = 19$ . Thus the index of the median length would be the 10th name. Since there are $7$ names with length $3$ , and $3$ names with length $4$ , the $10$ th name would have $4$ letters. Thus our answer is $\\boxed{4}$"
] |
https://artofproblemsolving.com/wiki/index.php/1978_AHSME_Problems/Problem_22 | D | 3 | The following four statements, and only these are found on a card: [asy] pair A,B,C,D,E,F,G; A=(0,1); B=(0,5); C=(11,5); D=(11,1); E=(0,4); F=(0,3); G=(0,2); draw(A--B--C--D--cycle); label("On this card exactly one statement is false.", B, SE); label("On this card exactly two statements are false.", E, SE); label("On this card exactly three statements are false.", F, SE); label("On this card exactly four statements are false.", G, SE); [/asy]
(Assume each statement is either true or false.) Among them the number of false statements is exactly
$\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$ | [
"There can be at most one true statement on the card, eliminating $\\textbf{(A)}, \\textbf{(B)},$ and $\\textbf{(C)}$ . If there are $0$ true on the card, statement $4$ (\"On this card exactly four statements are false\") will be correct, causing a contradiction. Therefore, the answer is $\\boxed{3}$ , since $3$ are false and only the third statement (\"On this card exactly three statements are false\") is correct.",
"If all of them are false, that would mean that the $4$ th one is false too. Therefore, $E$ is not the correct answer. If exactly $3$ of them are false, that would mean that only $1$ statement is true. This is correct since if only $1$ statement is true, the card that is true is the one that has $3$ of these statements are false. If we have $1$ or $2$ false statements, that would mean that there is more than $1$ true statement. Therefore, our answer is $\\boxed{3}$"
] |
https://artofproblemsolving.com/wiki/index.php/2007_AIME_I_Problems/Problem_5 | null | 539 | The formula for converting a Fahrenheit temperature $F$ to the corresponding Celsius temperature $C$ is $C = \frac{5}{9}(F-32).$ An integer Fahrenheit temperature is converted to Celsius, rounded to the nearest integer, converted back to Fahrenheit, and again rounded to the nearest integer
For how many integer Fahrenheit temperatures between 32 and 1000 inclusive does the original temperature equal the final temperature? | [
"Examine $F - 32$ modulo 9.\nGeneralizing this, we define that $9x + k = F - 32$ . Thus, $F = \\left[\\frac{9}{5}\\left[\\frac{5}{9}(9x + k)\\right] + 32\\right] \\Longrightarrow F = \\left[\\frac{9}{5}(5x + \\left[\\frac{5}{9}k\\right]) + 32\\right] \\Longrightarrow F = \\left[\\frac{9}{5} \\left[\\frac{5}{9}k \\right] \\right] + 9x + 32$ . We need to find all values $0 \\le k \\le 8$ that $\\left[ \\frac{9}{5} \\left[ \\frac{5}{9} k \\right] \\right] = k$ . Testing every value of $k$ shows that $k = 0, 2, 4, 5, 7$ , so $5$ of every $9$ values of $k$ work.\nThere are $\\lfloor \\frac{1000 - 32}{9} \\rfloor = 107$ cycles of $9$ , giving $5 \\cdot 107 = 535$ numbers that work. Of the remaining $6$ numbers from $995$ onwards, $995,\\ 997,\\ 999,\\ 1000$ work, giving us $535 + 4 = \\boxed{539}$ as the solution.",
"Notice that $\\left[ \\frac{9}{5} \\left[ \\frac{5}{9} k \\right] \\right] = k$ holds if $k=\\left[ \\frac{9}{5}x\\right]$ for some integer $x$ .\nThus, after translating from $F\\to F-32$ we want count how many values of $x$ there are such that $k=\\left[ \\frac{9}{5}x\\right]$ is an integer from $0$ to $968$ . This value is computed as $\\left[968*\\frac{5}{9}\\right]+1 = \\boxed{539}$ , adding in the extra solution corresponding to $0$",
"Notice that every $C$ value corresponds to exactly one $F$ value but multiple $F$ values can correspond to a $C$ value. Thus, the smallest $C$ value is $0$ and the largest $C$ value is $538$ yielding $\\boxed{539}$ solutions."
] |
https://artofproblemsolving.com/wiki/index.php/2014_AMC_12A_Problems/Problem_23 | B | 883 | The fraction
\[\dfrac1{99^2}=0.\overline{b_{n-1}b_{n-2}\ldots b_2b_1b_0},\]
where $n$ is the length of the period of the repeating decimal expansion. What is the sum $b_0+b_1+\cdots+b_{n-1}$
$\textbf{(A) }874\qquad \textbf{(B) }883\qquad \textbf{(C) }887\qquad \textbf{(D) }891\qquad \textbf{(E) }892\qquad$ | [
"$\\frac{1}{99^2}\\\\\\\\ =\\frac{1}{99} \\cdot \\frac{1}{99}\\\\\\\\ =\\frac{0.\\overline{01}}{99}\\\\\\\\ =0.\\overline{00010203...9799}$\nSo, the answer is $0+0+0+1+0+2+0+3+...+9+7+9+9=2\\cdot10\\cdot\\frac{9\\cdot10}{2}-(9+8)$ or $\\boxed{883}$"
] |
https://artofproblemsolving.com/wiki/index.php/2008_AMC_10A_Problems/Problem_7 | E | 9 | The fraction
\[\frac{\left(3^{2008}\right)^2-\left(3^{2006}\right)^2}{\left(3^{2007}\right)^2-\left(3^{2005}\right)^2}\] simplifies to which of the following?
$\mathrm{(A)}\ 1\qquad\mathrm{(B)}\ \frac{9}{4}\qquad\mathrm{(C)}\ 3\qquad\mathrm{(D)}\ \frac{9}{2}\qquad\mathrm{(E)}\ 9$ | [
"Using Difference of Squares, $\\frac{(3^{2008})^{2}-(3^{2006})^{2}}{(3^{2007})^{2}-(3^{2005}){^2}}$ becomes\n$\\frac{(3^{2008}+3^{2006})(3^{2008}-3^{2006})}{(3^{2007}+3^{2005})(3^{2007}-3^{2005})}$\n$= \\frac{3^{2006}(9+1) \\cdot 3^{2006}(9-1)}{3^{2005}(9+1) \\cdot 3^{2005}(9-1)}$\n$= \\boxed{9}$"
] |
https://artofproblemsolving.com/wiki/index.php/1988_AIME_Problems/Problem_8 | null | 364 | The function $f$ , defined on the set of ordered pairs of positive integers, satisfies the following properties: \[f(x, x) = x,\; f(x, y) = f(y, x), {\rm \ and\ } (x+y)f(x, y) = yf(x, x+y).\] Calculate $f(14,52)$ | [
"Let $z = x+y$ . By the substitution $z=x+y,$ we rewrite the third property in terms of $x$ and $z,$ then solve for $f(x,z):$ \\begin{align*} zf(x,z-x) &= (z-x)f(x,z) \\\\ f(x,z) &= \\frac{z}{z-x} \\cdot f(x,z-x). \\end{align*} Using the properties of $f,$ we have \\begin{align*} f(14,52) &= \\frac{52}{38} \\cdot f(14,38) \\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot f(14,24) \\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot f(14,10)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot f(10,14)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot f(10,4)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot f(4,10)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot \\frac{10}{6} \\cdot f(4,6)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot \\frac{10}{6} \\cdot \\frac{6}{2} \\cdot f(4,2)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot \\frac{10}{6} \\cdot \\frac{6}{2} \\cdot f(2,4)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot \\frac{10}{6} \\cdot \\frac{6}{2} \\cdot \\frac{4}{2} \\cdot f(2,2)\\\\ &= \\frac{52}{38} \\cdot \\frac{38}{24} \\cdot \\frac{24}{10} \\cdot \\frac{14}{4} \\cdot \\frac{10}{6} \\cdot \\frac{6}{2} \\cdot \\frac{4}{2} \\cdot 2\\\\ &=\\boxed{364} ~MRENTHUSIASM (credit given to AoPS)",
"Since all of the function's properties contain a recursive definition except for the first one, we know that $f(x,x) = x$ in order to obtain an integer answer. So, we have to transform $f(14,52)$ to this form by exploiting the other properties. The second one doesn't help us immediately, so we will use the third one.\nNote that \\[f(14,52) = f(14,14 + 38) = \\frac{52}{38}\\cdot f(14,38).\\]\nRepeating the process several times, \\begin{align*} f(14,52) & = f(14,14 + 38) \\\\ & = \\frac{52}{38}\\cdot f(14,38) \\\\ & = \\frac{52}{38}\\cdot \\frac{38}{24}\\cdot f(14,14 + 24) \\\\ & = \\frac{52}{24}\\cdot f(14,24) \\\\ & = \\frac{52}{10}\\cdot f(10,14) \\\\ & = \\frac{52}{10}\\cdot \\frac{14}{4}\\cdot f(10,4) \\\\ & = \\frac{91}{5}\\cdot f(4,10) \\\\ & = \\frac{91}{3}\\cdot f(4,6) \\\\ & = 91\\cdot f(2,4) \\\\ & = 91\\cdot 2 \\cdot f(2,2) \\\\ & = \\boxed{364}",
"Notice that $f(x,y) = \\mathrm{lcm}(x,y)$ satisfies all three properties:\nFor the first two properties, it is clear that $\\mathrm{lcm}(x,x) = x$ and $\\mathrm{lcm}(x,y) = \\mathrm{lcm}(y,x)$\nFor the third property, using the identities $\\gcd(x,y) \\cdot \\mathrm{lcm}(x,y) = x\\cdot y$ and $\\gcd(x,x+y) = \\gcd(x,y)$ gives \\begin{align*} y \\cdot \\mathrm{lcm}(x,x+y) &= \\dfrac{y \\cdot x(x+y)}{\\gcd(x,x+y)} \\\\ &= \\dfrac{(x+y) \\cdot xy}{\\gcd(x,y)} \\\\ &= (x+y) \\cdot \\mathrm{lcm}(x,y). \\end{align*} Hence, $f(x,y) = \\mathrm{lcm}(x,y)$ is a solution to the functional equation.\nSince this is an AIME problem, there is exactly one correct answer, and thus, exactly one possible value of $f(14,52)$\nTherefore, we have \\begin{align*} f(14,52) &= \\mathrm{lcm}(14,52) \\\\ &= \\mathrm{lcm}(2 \\cdot 7,2^2 \\cdot 13) \\\\ &= 2^2 \\cdot 7 \\cdot 13 \\\\ &= \\boxed{364}"
] |
https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_12 | null | 58 | The function $f$ defined by $f(x)= \frac{ax+b}{cx+d}$ , where $a$ $b$ $c$ and $d$ are nonzero real numbers, has the properties $f(19)=19$ $f(97)=97$ and $f(f(x))=x$ for all values except $\frac{-d}{c}$ . Find the unique number that is not in the range of $f$ | [
"From $f(f(x))=x$ , it is obvious that $\\frac{-d}{c}$ is the value not in the range. First notice that since $f(0)=\\frac{b}{d}$ $f(\\frac{b}{d})=0$ which means $a(\\frac{b}{d})+b=0$ so $a=-d$ . Using $f(19)=19$ , we have that $b=361c+38d$ ; on $f(97)=97$ we obtain $b=9409c+194d$ . Solving for $d$ in terms of $c$ leads us to $d=-58c$ , so the answer is $\\boxed{058}$",
"Begin by finding the inverse function of $f(x)$ , which turns out to be $f^{-1}(x)=\\frac{19d-b}{a-19c}$ . Since $f(f(x))=x$ $f(x)=f^{-1}(x)$ , so substituting 19 and 97 yields the system, $\\begin{array}{lcl} \\frac{19a+b}{19c+d} & = & \\frac{19d-b}{a-19c} \\\\ \\frac{97a+b}{97c+d} & = & \\frac{97d-b}{a-97c} \\end{array}$ , and after multiplying each equation out and subtracting equation 1 from 2, and after simplifying, you will get $116c=a-d$ . Coincidentally, then $116c+d=a$ , which is familiar because $f(116)=\\frac{116a+b}{116c+d}$ , and since $116c+d=a$ $f(116)=\\frac{116a+b}{a}$ . Also, $f(f(116))=\\frac{a(\\frac{116a+b}{a})+b}{c(\\frac{116a+b}{a})+d}=116$ , due to $f(f(x))=x$ . This simplifies to $\\frac{116a+2b}{c(\\frac{116a+b}{a})+d}=116$ $116a+2b=116(c(\\frac{116a+b}{a})+d)$ $116a+2b=116(c(116+\\frac{b}{a})+d)$ $116a+2b=116c(116+\\frac{b}{a})+116d$ , and substituting $116c+d=a$ and simplifying, you get $2b=116c(\\frac{b}{a})$ , then $\\frac{a}{c}=58$ . Looking at $116c=a-d$ one more time, we get $116=\\frac{a}{c}+\\frac{-d}{c}$ , and substituting, we get $\\frac{-d}{c}=\\boxed{58}$ , and we are done.",
"Because there are no other special numbers other than $19$ and $97$ , take the average to get $\\boxed{58}$ . (Note I solved this problem the solution one way but noticed this and this probably generalizes to all $f(x)=x, f(y)=y$ questions like these)",
"By the function definition, $f(f(x))$ $f$ is its own inverse, so the only value not in the range of $f$ is the value not in the domain of $f$ (which is $-d/c$ ).\nSince $f(f(x))$ $f(f(0)=0$ (0 is a convenient value to use). $f(f(0))=f(f(\\tfrac{b}{d})=\\dfrac{a\\cdot\\tfrac{b}{d}+b}{c\\cdot\\tfrac{b}{d}+d}=\\dfrac{ab+bd}{bc+d^2}=0 \\Rightarrow ab+bd=0$\nThen $ab+bd=b(a+d)=0$ and since $b$ is nonzero, $a=-d$\nThe answer we are searching for, $\\dfrac{-d}{c}$ (the only value not in the range of $f$ ), can now be expressed as $\\dfrac{a}{c}$\nWe are given $f(19)=19$ and $f(97)$ , and they satisfy the equation $f(x)=x$ , which simplifies to $\\dfrac{ax+b}{cx+d}=x\\Rightarrow x(cx+d)=ax+b\\Rightarrow cx^2+(d-a)x+b=0$ . We have written this quadratic with roots $19$ and $97$\nBy Vieta, $\\dfrac{-(d-a)}{c}=\\dfrac{-(-a-a)}{c}=\\dfrac{2a}{c}=19+97$\nSo our answer is $\\dfrac{116}{2}=\\boxed{058}$",
"Notice that the function is just an involution on the real number line. Since the involution has two fixed points, namely $19$ and $97$ , we know that the involution is an inversion with respect to a circle with a diameter from $19$ to $97$ . The only point that is undefined under an inversion is the center of the circle, which we know is $\\frac{19+97}{2}=\\boxed{58}$ in both $x$ and $y$ dimensions."
] |
https://artofproblemsolving.com/wiki/index.php/2006_AMC_12A_Problems/Problem_18 | E | 11 | The function $f$ has the property that for each real number $x$ in its domain, $1/x$ is also in its domain and
$f(x)+f\left(\frac{1}{x}\right)=x$
What is the largest set of real numbers that can be in the domain of $f$
$\mathrm{(A) \ } \{x|x\ne 0\}\qquad \mathrm{(B) \ } \{x|x<0\}$
$\mathrm{(C) \ } \{x|x>0\}$ $\mathrm{(D) \ } \{x|x\ne -1\;\rm{and}\; x\ne 0\;\rm{and}\; x\ne 1\}$
$\mathrm{(E) \ } \{-1,1\}$ | [
"We know that $f(x) + f \\left(\\frac{1}{x}\\right) = x.$ Plugging in $x = \\frac{1}{x}$ we get \\[f \\left(\\frac{1}{x}\\right) + f \\left(\\frac{1}{\\frac{1}{x}}\\right) = \\frac{1}{x}\\] \\[f \\left(\\frac{1}{x}\\right) + f(x) = \\frac{1}{x}.\\]\nAlso notice \\[f \\left(\\frac{1}{x}\\right) + f(x) = x\\] by the commutative property(this is the same as the equation given in the problem. We are just rearranging). So we can set $\\frac{1}{x} = x$ which gives us $x = \\pm 1$ which is answer option $\\boxed{1,1}.$"
] |
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_2 | B | 2 | The function $f$ is given by the table
\[\begin{tabular}{|c||c|c|c|c|c|} \hline x & 1 & 2 & 3 & 4 & 5 \\ \hline f(x) & 4 & 1 & 3 & 5 & 2 \\ \hline \end{tabular}\]
If $u_0=4$ and $u_{n+1} = f(u_n)$ for $n \ge 0$ , find $u_{2002}$
$\text{(A) }1 \qquad \text{(B) }2 \qquad \text{(C) }3 \qquad \text{(D) }4 \qquad \text{(E) }5$ | [
"We can guess that the series given by the problem is periodic in some way. Starting off, $u_0=4$ is given. $u_1=u_{0+1}=f(u_0)=f(4)=5,$ so $u_1=5.$ $u_2=u_{1+1}=f(u_1)=f(5)=2,$ so $u_2=2.$ $u_3=u_{2+1}=f(u_2)=f(2)=1,$ so $u_3=1.$ $u_4=u_{3+1}=f(u_3)=f(1)=4,$ so $u_4=4.$ Plugging in $4$ will give us $5$ as found before, and plugging in $5$ will give $2$ and so on. This means that our original guess of the series being periodic was correct. Summing up our findings in a nice table,\n\\[\\begin{tabular}{|c||c|c|c|c|c|c|} \\hline n & 0 & 1 & 2 & 3 & 4 & ...\\\\ \\hline un & 4 & 5 & 2 & 1 & 4 & ...\\\\ \\hline \\end{tabular}\\]\nin which the next $u_n$ is found by simply plugging in the number from the last box into $f(x).$ The function is periodic every $4$ terms. $2002 \\equiv 2\\pmod{4}$ , and counting $4$ starting from $u_1$ will give us our answer of $\\boxed{2}$"
] |
https://artofproblemsolving.com/wiki/index.php/1984_AHSME_Problems/Problem_16 | E | 8 | The function $f(x)$ satisfies $f(2+x)=f(2-x)$ for all real numbers $x$ . If the equation $f(x)=0$ has exactly four distinct real roots , then the sum of these roots is
$\mathrm{(A) \ }0 \qquad \mathrm{(B) \ }2 \qquad \mathrm{(C) \ } 4 \qquad \mathrm{(D) \ }6 \qquad \mathrm{(E) \ } 8$ | [
"Let one of the roots be $r_1$ . Also, define $x$ such that $2+x=r_1$ . Thus, we have $f(2+x)=f(r_1)=0$ and $f(2+x)=f(2-x)$ . Therefore, we have $f(2-x)=0$ , and $2-x$ is also a root. Let this root be $r_2$ . The sum $r_1+r_2=2+x+2-x=4$ . Similarly, we can let $r_3$ be a root and define $y$ such that $2+y=r_3$ , and we will find $2-y$ is also a root, say, $r_4$ , so $r_3+r_4=2+y+2-y=4$ . Therefore, $r_1+r_2+r_3+r_4=4+4=8, \\boxed{8}$"
] |
https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_3 | null | 561 | The function $f_{}^{}$ has the property that, for each real number $x,\,$
If $f(19)=94,\,$ what is the remainder when $f(94)\,$ is divided by $1000$ | [
"\\begin{align*}f(94)&=94^2-f(93)=94^2-93^2+f(92)=94^2-93^2+92^2-f(91)=\\cdots \\\\ &= (94^2-93^2) + (92^2-91^2) +\\cdots+ (22^2-21^2)+ 20^2-f(19) \\\\ &= 94+93+\\cdots+21+400-94 \\\\ &= 4561 \\end{align*}\nSo, the remainder is $\\boxed{561}$",
"Those familiar with triangular numbers and some of their properties will quickly recognize the equation given in the problem. It is well-known (and easy to show) that the sum of two consecutive triangular numbers is a perfect square; that is, \\[T_{n-1} + T_n = n^2,\\] where $T_n = 1+2+...+n = \\frac{n(n+1)}{2}$ is the $n$ th triangular number.\nUsing this, as well as using the fact that the value of $f(x)$ directly determines the value of $f(x+1)$ and $f(x-1),$ we conclude that $f(n) = T_n + K$ for all odd $n$ and $f(n) = T_n - K$ for all even $n,$ where $K$ is a constant real number.\nSince $f(19) = 94$ and $T_{19} = 190,$ we see that $K = -96.$ It follows that $f(94) = T_{94} - (-96) = \\frac{94\\cdot 95}{2} + 96 = 4561,$ so the answer is $\\boxed{561}$"
] |
https://artofproblemsolving.com/wiki/index.php/1952_AHSME_Problems/Problem_13 | E | 2 | The function $x^2+px+q$ with $p$ and $q$ greater than zero has its minimum value when:
$\textbf{(A) \ }x=-p \qquad \textbf{(B) \ }x=\frac{p}{2} \qquad \textbf{(C) \ }x=-2p \qquad \textbf{(D) \ }x=\frac{p^2}{4q} \qquad$
$\textbf{(E) \ }x=\frac{-p}{2}$ | [
"The minimum value of this parabola is found at its turning point, on the line $\\boxed{2}$ .\nIndeed, the turning point of any function of the form $ax^2+bx+c$ has an x-coordinate of $\\frac{-b}{2a}$ . This can be seen at the average of the quadratic's two roots (whose sum is $\\frac{-b}{a}$ ) or (using calculus) as the value of its derivative set equal to $0$"
] |
https://artofproblemsolving.com/wiki/index.php/1984_AIME_Problems/Problem_7 | null | 997 | The function f is defined on the set of integers and satisfies $f(n)=\begin{cases} n-3&\mbox{if}\ n\ge 1000\\ f(f(n+5))&\mbox{if}\ n<1000\end{cases}$
Find $f(84)$ | [
"Define $f^{h} = f(f(\\cdots f(f(x))\\cdots))$ , where the function $f$ is performed $h$ times. We find that $f(84) = f(f(89)) = f^2(89) = f^3(94) = \\ldots f^{y}(1004)$ $1004 = 84 + 5(y - 1) \\Longrightarrow y = 185$ . So we now need to reduce $f^{185}(1004)$\nLet’s write out a couple more iterations of this function: \\begin{align*}f^{185}(1004)&=f^{184}(1001)=f^{183}(998)=f^{184}(1003)=f^{183}(1000)\\\\ &=f^{182}(997)=f^{183}(1002)=f^{182}(999)=f^{183}(1004)\\end{align*} So this function reiterates with a period of 2 for $x$ . It might be tempting at first to assume that $f(1004) = 1001$ is the answer; however, that is not true since the solution occurs slightly before that. Start at $f^3(1004)$ \\[f^{3}(1004)=f^{2}(1001)=f(998)=f^{2}(1003)=f(1000)=\\boxed{997}\\]",
"Assume that $f(84)$ is to be performed $n+1$ times. Then we have \\[f(84)=f^{n+1}(84)=f(f^n(84+5))\\] In order to find $f(84)$ , we want to know the smallest value of \\[f^n(84+5)\\ge1000\\] Because then \\[f(84)=f(f^n(84+5))=(f^n(84+5))-3\\] From which we'll get a numerical value for $f(84)$\nNotice that the value of $n$ we expect to find is basically the smallest $n$ such that after $f(x)=f(f(x+5))$ is performed $\\frac{n}{2}$ times and then $f(x)=x-3$ is performed back $\\frac{n}{2}$ times, the result is greater than or equal to $1000$\nIn this case, the value of $n$ for $f(84)$ is $916$ , because \\[84+\\frac{916}{2}\\cdot5-\\frac{916}{2}\\cdot3=1000\\Longrightarrow f^{916}(84+5))=1000\\] Thus \\[f(84)=f(f^{916}(84+5))=f(1000)=1000-3=\\boxed{997}\\]"
] |
https://artofproblemsolving.com/wiki/index.php/1988_AJHSME_Problems/Problem_20 | C | 125 | The glass gauge on a cylindrical coffee maker shows that there are $45$ cups left when the coffee maker is $36\%$ full. How many cups of coffee does it hold when it is full?
$\text{(A)}\ 80 \qquad \text{(B)}\ 100 \qquad \text{(C)}\ 125 \qquad \text{(D)}\ 130 \qquad \text{(E)}\ 262$
[asy] draw((5,0)..(0,-1.3)..(-5,0)); draw((5,0)--(5,10)); draw((-5,0)--(-5,10)); draw(ellipse((0,10),5,1.3)); draw(circle((.3,1.3),.4)); draw((-.1,1.7)--(-.1,7.9)--(.7,7.9)--(.7,1.7)--cycle); fill((-.1,1.7)--(-.1,4)--(.7,4)--(.7,1.7)--cycle,black); draw((-2,11.3)--(2,11.3)..(2.6,11.9)..(2,12.2)--(-2,12.2)..(-2.6,11.9)..cycle); [/asy] | [
"Let the amount of coffee the maker will hold when full be $x$ . Then, \\[.36x=45 \\Rightarrow x=125 \\rightarrow \\boxed{125}\\]"
] |
https://artofproblemsolving.com/wiki/index.php/1989_AJHSME_Problems/Problem_19 | B | 2.5 | The graph below shows the total accumulated dollars (in millions) spent by the Surf City government during $1988$ . For example, about $.5$ million had been spent by the beginning of February and approximately $2$ million by the end of April. Approximately how many millions of dollars were spent during the summer months of June, July, and August?
[asy] unitsize(18); for (int a=1; a<13; ++a) { draw((a,0)--(a,.5)); } for (int b=1; b<6; ++b) { draw((-.5,2b)--(0,2b)); } draw((0,0)--(0,12)); draw((0,0)--(14,0)); draw((0,0)--(1,.9)--(2,1.9)--(3,2.6)--(4,4.3)--(5,4.5)--(6,5.7)--(7,8.2)--(8,9.4)--(9,9.8)--(10,10.1)--(11,10.2)--(12,10.5)); label("J",(.5,0),S); label("F",(1.5,0),S); label("M",(2.5,0),S); label("A",(3.5,0),S); label("M",(4.5,0),S); label("J",(5.5,0),S); label("J",(6.5,0),S); label("A",(7.5,0),S); label("S",(8.5,0),S); label("O",(9.5,0),S); label("N",(10.5,0),S); label("D",(11.5,0),S); label("month F=February",(16,0),S); label("$1$",(-.6,2),W); label("$2$",(-.6,4),W); label("$3$",(-.6,6),W); label("$4$",(-.6,8),W); label("$5$",(-.6,10),W); label("dollars in millions",(0,11.9),N); [/asy]
$\text{(A)}\ 1.5 \qquad \text{(B)}\ 2.5 \qquad \text{(C)}\ 3.5 \qquad \text{(D)}\ 4.5 \qquad \text{(E)}\ 5.5$ | [
"Since we want to know how much money is spent in June, July and August, we need the difference between the amount of money spent by the beginning of June and the amount of money spent by the end of August.\nWe estimate these to be about $2.2$ million and $4.8$ million, respectively. The difference is \\[4.8-2.2=2.6\\approx 2.5 \\rightarrow \\boxed{2.5}\\]"
] |
https://artofproblemsolving.com/wiki/index.php/1957_AHSME_Problems/Problem_23 | C | 2 | The graph of $x^2 + y = 10$ and the graph of $x + y = 10$ meet in two points. The distance between these two points is:
$\textbf{(A)}\ \text{less than 1} \qquad \textbf{(B)}\ 1\qquad \textbf{(C)}\ \sqrt{2}\qquad \textbf{(D)}\ 2\qquad\textbf{(E)}\ \text{more than 2}$ | [
"We can merge the two equations to create $x^2+y=x+y$ . Using either the quadratic equation or factoring, we get two solutions with $x$ -coordinates $0$ and $1$\nPlugging this into either of the original equations, we get $(0,10)$ and $(1,9)$ . The distance between those two points is $\\boxed{2}$"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_12A_Problems/Problem_21 | A | 4 | The graph of $y=x^6-10x^5+29x^4-4x^3+ax^2$ lies above the line $y=bx+c$ except at three values of $x$ , where the graph and the line intersect. What is the largest of these values?
$\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 7 \qquad \textbf{(E)}\ 8$ | [
"The $x$ values in which $y=x^6-10x^5+29x^4-4x^3+ax^2$ intersect at $y=bx+c$ are the same as the zeros of $y=x^6-10x^5+29x^4-4x^3+ax^2-bx-c$\nSince there are $3$ zeros and the function is never negative, all $3$ zeros must be double roots because the function's degree is $6$\nSuppose we let $p$ $q$ , and $r$ be the roots of this function, and let $x^3-ux^2+vx-w$ be the cubic polynomial with roots $p$ $q$ , and $r$\n\\begin{align*}(x-p)(x-q)(x-r) &= x^3-ux^2+vx-w\\\\ (x-p)^2(x-q)^2(x-r)^2 &= x^6-10x^5+29x^4-4x^3+ax^2-bx-c = 0\\\\ \\sqrt{x^6-10x^5+29x^4-4x^3+ax^2-bx-c} &= x^3-ux^2+vx-w = 0\\end{align*}\nIn order to find $\\sqrt{x^6-10x^5+29x^4-4x^3+ax^2-bx-c}$ we must first expand out the terms of $(x^3-ux^2+vx-w)^2$\n\\[(x^3-ux^2+vx-w)^2\\] \\[= x^6-2ux^5+(u^2+2v)x^4-(2uv+2w)x^3+(2uw+v^2)x^2-2vwx+w^2\\]\n[Quick note: Since we don't know $a$ $b$ , and $c$ , we really don't even need the last 3 terms of the expansion.]\n\\begin{align*}&2u = 10\\\\ u^2+2v &= 29\\\\ 2uv+2w &= 4\\\\ u &= 5\\\\ v &= 2\\\\ w &= -8\\\\ &\\sqrt{x^6-10x^5+29x^4-4x^3+ax^2-bx-c} = x^3-5x^2+2x+8\\end{align*}\nAll that's left is to find the largest root of $x^3-5x^2+2x+8$\n\\begin{align*}&x^3-5x^2+2x+8 = (x-4)(x-2)(x+1)\\\\ &\\boxed{4}",
"The $x$ values in which $y=x^6-10x^5+29x^4-4x^3+ax^2$ intersect at $y=bx+c$ are the same as the zeros of $y=x^6-10x^5+29x^4-4x^3+ax^2-bx-c$ .\nWe also know that this graph has 3 places tangent to the x-axis, which means that each root has to have a multiplicity of 2.\nLet the function be $(x-p)^2(x-q)^2(x-r)^2$\nApplying Vieta's formulas, we get $2p+2q+2r = 10$ or $p+q+r = 5$ .\nApplying it again, we get, after simplification, $p^2+q^2+r^2+4pq+4pr+4qr = 29$\nNotice that squaring the first equation yields $p^2+q^2+r^2+2pq+2qr+2pr= 25$ , which is similar to the second equation.\nSubtracting this from the second equation, we get $2pq+2pr+2qr = 4$ . Now that we have the $pq+pr+qr$ term, we can manpulate the equations to \nyield the sum of squares. $2(p^2+q^2+r^2+2pq+2qr+2pr)-2pq-2pr-2qr= 25*2-4$ or $2p^2+2q^2+2r^2+2pq+2qr+2pr = 46$ . We finally reach $(p+q)^2+(q+r)^2+(p+r)^2 = 46$\nSince the answer choices are integers, we can guess and check squares to get $\\{(p+q)^2, (q+r)^2, (p+r)^2\\} = \\{1, 9, 36\\}$ in some order. We can check that this works by adding then and seeing $2p+2q+2r = 10$ . We just need to take the lowest value in the set, square root it, and subtract the resulting value from 5 to get $\\boxed{4}$",
"First, $y=x^6-10x^5+29x^4-4x^3+ax^2-bx-c = 0$ has exactly $3$ roots. Therefore, $y = (kx^3+lx^2+mx+n)^2 = 0$\nSo, $k^2x^6+2klx^5+(2km+l^2)x^4+2(kn+lm)x^3+ax^2-bx-c = 0$\nBy matching the coefficients of the first $4$ terms, we have $k^2 = 1, 2kl = -10, 2km+l^2 = 29, 2kn+2lm = -4$\nSolving the equations above, we have $2$ sets of solutions; first set of which is $k = 1, l = -5, m = 2, n = 8$ . Second set of which is $k = -1, l = 5, m = -2, n = -8$ . After squaring both sets, they are the same i.e. $x^3-5x^2+2x+8 = 0$\nThis is equal to $(x-4)(x-2)(x+1) = 0$ . The largest root is $\\boxed{4}$"
] |
https://artofproblemsolving.com/wiki/index.php/1998_AIME_Problems/Problem_3 | null | 800 | The graph of $y^2 + 2xy + 40|x|= 400$ partitions the plane into several regions. What is the area of the bounded region? | [
"The equation given can be rewritten as:\nWe can split the equation into a piecewise equation by breaking up the absolute value\nFactoring the first one: (alternatively, it is also possible to complete the square\nHence, either $y = -20$ , or $2x = 20 - y \\Longrightarrow y = -2x + 20$\nSimilarily, for the second one, we get $y = 20$ or $y = -2x - 20$ . If we graph these four equations, we see that we get a parallelogram with base 20 and height 40. Hence the answer is $\\boxed{800}$"
] |
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12A_Problems/Problem_19 | D | 6 | The graph of the function $f$ is shown below. How many solutions does the equation $f(f(x))=6$ have?
[asy] size(200); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=4; pair P1=(-7,-4), P2=(-2,6), P3=(0,0), P4=(1,6), P5=(5,-6); real[] xticks={-7,-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; real[] yticks={-6,-5,-4,-3,-2,-1,1,2,3,4,5,6}; draw(P1--P2--P3--P4--P5); dot("(-7, -4)",P1); dot("(-2, 6)",P2,LeftSide); dot("(1, 6)",P4); dot("(5, -6)",P5); xaxis("$x$",-7.5,7,Ticks(xticks),EndArrow(6)); yaxis("$y$",-6.5,7,Ticks(yticks),EndArrow(6)); [/asy]
$\text{(A) }2 \qquad \text{(B) }4 \qquad \text{(C) }5 \qquad \text{(D) }6 \qquad \text{(E) }7$ | [
"First of all, note that the equation $f(t)=6$ has two solutions: $t=-2$ and $t=1$\nGiven an $x$ , let $f(x)=t$ . Obviously, to have $f(f(x))=6$ , we need to have $f(t)=6$ , and we already know when that happens. In other words, the solutions to $f(f(x))=6$ are precisely the solutions to ( $f(x)=-2$ or $f(x)=1$ ).\nWithout actually computing the exact values, it is obvious from the graph that the equation $f(x)=-2$ has two and $f(x)=1$ has four different solutions, giving us a total of $2+4=\\boxed{6}$ solutions."
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_8_Problems/Problem_3 | C | 6 | The graph shows the constant rate at which Suzanna rides her bike. If she rides a total of a half an hour at the same speed, how many miles would she have ridden?
[asy] import graph; /* this is a label */ Label f; f.p=fontsize(0); xaxis(-0.9,20,Ticks(f, 5.0, 5.0)); yaxis(-0.9,20, Ticks(f, 22.0,5.0)); // real f(real x) { return x; } draw(graph(f,-1,22),black+linewidth(1)); label("1", (-1,5), black); label("2", (-1, 10), black); label("3", (-1, 15), black); label("4", (-1, 20), black); dot((5,5), black+linewidth(5)); dot((10,10), black+linewidth(5)); dot((15, 15), black+linewidth(5)); dot((20,20), black+linewidth(5)); label("MINUTES", (11,-5), S); label(rotate(90)*"MILES", (-5,11), W);[/asy]
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ 5.5\qquad\textbf{(C)}\ 6\qquad\textbf{(D)}\ 6.5\qquad\textbf{(E)}\ 7$ | [
"Suzanna's speed is $\\frac{1}{5}$ . This means she runs $\\frac{1}{5} \\cdot 30 = \\boxed{6}$",
"From the graph, we can see that every $5$ minutes Suzanna goes, her distance increases by $1$ . Since half an hour is $10$ minutes away, she would go $2$ more miles. $4+2$ is $6$ , so the answer is $\\boxed{6}$"
] |
https://artofproblemsolving.com/wiki/index.php/2011_AMC_8_Problems/Problem_11 | A | 6 | The graph shows the number of minutes studied by both Asha (black bar) and Sasha (grey bar) in one week. On the average, how many more minutes per day did Sasha study than Asha?
[asy] size(300); real i; defaultpen(linewidth(0.8)); draw((0,140)--origin--(220,0)); for(i=1;i<13;i=i+1) { draw((0,10*i)--(220,10*i)); } label("$0$",origin,W); label("$20$",(0,20),W); label("$40$",(0,40),W); label("$60$",(0,60),W); label("$80$",(0,80),W); label("$100$",(0,100),W); label("$120$",(0,120),W); path MonD=(20,0)--(20,60)--(30,60)--(30,0)--cycle,MonL=(30,0)--(30,70)--(40,70)--(40,0)--cycle,TuesD=(60,0)--(60,90)--(70,90)--(70,0)--cycle,TuesL=(70,0)--(70,80)--(80,80)--(80,0)--cycle,WedD=(100,0)--(100,100)--(110,100)--(110,0)--cycle,WedL=(110,0)--(110,120)--(120,120)--(120,0)--cycle,ThurD=(140,0)--(140,80)--(150,80)--(150,0)--cycle,ThurL=(150,0)--(150,110)--(160,110)--(160,0)--cycle,FriD=(180,0)--(180,70)--(190,70)--(190,0)--cycle,FriL=(190,0)--(190,50)--(200,50)--(200,0)--cycle; fill(MonD,grey); fill(MonL,lightgrey); fill(TuesD,grey); fill(TuesL,lightgrey); fill(WedD,grey); fill(WedL,lightgrey); fill(ThurD,grey); fill(ThurL,lightgrey); fill(FriD,grey); fill(FriL,lightgrey); draw(MonD^^MonL^^TuesD^^TuesL^^WedD^^WedL^^ThurD^^ThurL^^FriD^^FriL); label("M",(30,-5),S); label("Tu",(70,-5),S); label("W",(110,-5),S); label("Th",(150,-5),S); label("F",(190,-5),S); label("M",(-25,85),W); label("I",(-27,75),W); label("N",(-25,65),W); label("U",(-25,55),W); label("T",(-25,45),W); label("E",(-25,35),W); label("S",(-26,25),W);[/asy]
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12$ | [
"Average the differences between each day. We get $10, -10,\\text{ } 20,\\text{ } 30,-20$ . We find the average of this list to get $\\boxed{6}$",
"This solution may take longer to do than the first solution. In total, Asha studied for 400 minutes a week (80 minutes per day) and Sasha studied for 430 minutes a week (86 minutes per day). 86 - 80 = 6. Therefore, the answer is $\\boxed{6}$"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_8_Problems/Problem_3 | C | 70 | The graph shows the price of five gallons of gasoline during the first ten months of the year. By what percent is the highest price more than the lowest price?
[asy] import graph; size(16.38cm); real lsf=2; pathpen=linewidth(0.7); pointpen=black; pen fp = fontsize(10); pointfontpen=fp; real xmin=-1.33,xmax=11.05,ymin=-9.01,ymax=-0.44; pen ycycyc=rgb(0.55,0.55,0.55); pair A=(1,-6), B=(1,-2), D=(1,-5.8), E=(1,-5.6), F=(1,-5.4), G=(1,-5.2), H=(1,-5), J=(1,-4.8), K=(1,-4.6), L=(1,-4.4), M=(1,-4.2), N=(1,-4), P=(1,-3.8), Q=(1,-3.6), R=(1,-3.4), S=(1,-3.2), T=(1,-3), U=(1,-2.8), V=(1,-2.6), W=(1,-2.4), Z=(1,-2.2), E_1=(1.4,-2.6), F_1=(1.8,-2.6), O_1=(14,-6), P_1=(14,-5), Q_1=(14,-4), R_1=(14,-3), S_1=(14,-2), C_1=(1.4,-6), D_1=(1.8,-6), G_1=(2.4,-6), H_1=(2.8,-6), I_1=(3.4,-6), J_1=(3.8,-6), K_1=(4.4,-6), L_1=(4.8,-6), M_1=(5.4,-6), N_1=(5.8,-6), T_1=(6.4,-6), U_1=(6.8,-6), V_1=(7.4,-6), W_1=(7.8,-6), Z_1=(8.4,-6), A_2=(8.8,-6), B_2=(9.4,-6), C_2=(9.8,-6), D_2=(10.4,-6), E_2=(10.8,-6), L_2=(2.4,-3.2), M_2=(2.8,-3.2), N_2=(3.4,-4), O_2=(3.8,-4), P_2=(4.4,-3.6), Q_2=(4.8,-3.6), R_2=(5.4,-3.6), S_2=(5.8,-3.6), T_2=(6.4,-3.4), U_2=(6.8,-3.4), V_2=(7.4,-3.8), W_2=(7.8,-3.8), Z_2=(8.4,-2.8), A_3=(8.8,-2.8), B_3=(9.4,-3.2), C_3=(9.8,-3.2), D_3=(10.4,-3.8), E_3=(10.8,-3.8); filldraw(C_1--E_1--F_1--D_1--cycle,ycycyc); filldraw(G_1--L_2--M_2--H_1--cycle,ycycyc); filldraw(I_1--N_2--O_2--J_1--cycle,ycycyc); filldraw(K_1--P_2--Q_2--L_1--cycle,ycycyc); filldraw(M_1--R_2--S_2--N_1--cycle,ycycyc); filldraw(T_1--T_2--U_2--U_1--cycle,ycycyc); filldraw(V_1--V_2--W_2--W_1--cycle,ycycyc); filldraw(Z_1--Z_2--A_3--A_2--cycle,ycycyc); filldraw(B_2--B_3--C_3--C_2--cycle,ycycyc); filldraw(D_2--D_3--E_3--E_2--cycle,ycycyc); D(B--A,linewidth(0.4)); D(H--(8,-5),linewidth(0.4)); D(N--(8,-4),linewidth(0.4)); D(T--(8,-3),linewidth(0.4)); D(B--(8,-2),linewidth(0.4)); D(B--S_1); D(T--R_1); D(N--Q_1); D(H--P_1); D(A--O_1); D(C_1--E_1); D(E_1--F_1); D(F_1--D_1); D(D_1--C_1); D(G_1--L_2); D(L_2--M_2); D(M_2--H_1); D(H_1--G_1); D(I_1--N_2); D(N_2--O_2); D(O_2--J_1); D(J_1--I_1); D(K_1--P_2); D(P_2--Q_2); D(Q_2--L_1); D(L_1--K_1); D(M_1--R_2); D(R_2--S_2); D(S_2--N_1); D(N_1--M_1); D(T_1--T_2); D(T_2--U_2); D(U_2--U_1); D(U_1--T_1); D(V_1--V_2); D(V_2--W_2); D(W_2--W_1); D(W_1--V_1); D(Z_1--Z_2); D(Z_2--A_3); D(A_3--A_2); D(A_2--Z_1); D(B_2--B_3); D(B_3--C_3); D(C_3--C_2); D(C_2--B_2); D(D_2--D_3); D(D_3--E_3); D(E_3--E_2); D(E_2--D_2); label("0",(0.88,-5.91),SE*lsf,fp); label(" 5",(0.3,-4.84),SE*lsf,fp); label(" 10",(0.2,-3.84),SE*lsf,fp); label(" 15",(0.2,-2.85),SE*lsf,fp); label(" 20",(0.2,-1.85),SE*lsf,fp); label("$\mathrm{Price}$",(0.16,-3.45),SE*lsf,fp); label("$1$",(1.54,-5.97),SE*lsf,fp); label("$2$",(2.53,-5.95),SE*lsf,fp); label("$3$",(3.53,-5.94),SE*lsf,fp); label("$4$",(4.55,-5.94),SE*lsf,fp); label("$5$",(5.49,-5.95),SE*lsf,fp); label("$6$",(6.53,-5.95),SE*lsf,fp); label("$7$",(7.55,-5.95),SE*lsf,fp); label("$8$",(8.52,-5.95),SE*lsf,fp); label("$9$",(9.57,-5.97),SE*lsf,fp); label("$10$",(10.56,-5.94),SE*lsf,fp); label("Month",(7.14,-6.43),SE*lsf,fp); D(A,linewidth(1pt)); D(B,linewidth(1pt)); D(D,linewidth(1pt)); D(E,linewidth(1pt)); D(F,linewidth(1pt)); D(G,linewidth(1pt)); D(H,linewidth(1pt)); D(J,linewidth(1pt)); D(K,linewidth(1pt)); D(L,linewidth(1pt)); D(M,linewidth(1pt)); D(N,linewidth(1pt)); D(P,linewidth(1pt)); D(Q,linewidth(1pt)); D(R,linewidth(1pt)); D(S,linewidth(1pt)); D(T,linewidth(1pt)); D(U,linewidth(1pt)); D(V,linewidth(1pt)); D(W,linewidth(1pt)); D(Z,linewidth(1pt)); D(E_1,linewidth(1pt)); D(F_1,linewidth(1pt)); D(O_1,linewidth(1pt)); D(P_1,linewidth(1pt)); D(Q_1,linewidth(1pt)); D(R_1,linewidth(1pt)); D(S_1,linewidth(1pt)); D(C_1,linewidth(1pt)); D(D_1,linewidth(1pt)); D(G_1,linewidth(1pt)); D(H_1,linewidth(1pt)); D(I_1,linewidth(1pt)); D(J_1,linewidth(1pt)); D(K_1,linewidth(1pt)); D(L_1,linewidth(1pt)); D(M_1,linewidth(1pt)); D(N_1,linewidth(1pt)); D(T_1,linewidth(1pt)); D(U_1,linewidth(1pt)); D(V_1,linewidth(1pt)); D(W_1,linewidth(1pt)); D(Z_1,linewidth(1pt)); D(A_2,linewidth(1pt)); D(B_2,linewidth(1pt)); D(C_2,linewidth(1pt)); D(D_2,linewidth(1pt)); D(E_2,linewidth(1pt)); D(L_2,linewidth(1pt)); D(M_2,linewidth(1pt)); D(N_2,linewidth(1pt)); D(O_2,linewidth(1pt)); D(P_2,linewidth(1pt)); D(Q_2,linewidth(1pt)); D(R_2,linewidth(1pt)); D(S_2,linewidth(1pt)); D(T_2,linewidth(1pt)); D(U_2,linewidth(1pt)); D(V_2,linewidth(1pt)); D(W_2,linewidth(1pt)); D(Z_2,linewidth(1pt)); D(A_3,linewidth(1pt)); D(B_3,linewidth(1pt)); D(C_3,linewidth(1pt)); D(D_3,linewidth(1pt)); D(E_3,linewidth(1pt)); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy]
$\textbf{(A)}\ 50 \qquad \textbf{(B)}\ 62 \qquad \textbf{(C)}\ 70 \qquad \textbf{(D)}\ 89 \qquad \textbf{(E)}\ 100$ | [
"The highest price was in Month 1, which was $17. The lowest price was in Month 3, which was $10. 17 is $\\frac{17}{10}\\cdot100=170\\%$ of 10, and is $170-100=70\\%$ more than 10.\nTherefore, the answer is $\\boxed{70}$"
] |
https://artofproblemsolving.com/wiki/index.php/2014_AIME_I_Problems/Problem_6 | null | 36 | The graphs $y=3(x-h)^2+j$ and $y=2(x-h)^2+k$ have y-intercepts of $2013$ and $2014$ , respectively, and each graph has two positive integer x-intercepts. Find $h$ | [
"Begin by setting $x$ to 0, then set both equations to $h^2=\\frac{2013-j}{3}$ and $h^2=\\frac{2014-k}{2}$ , respectively. Notice that because the two parabolas have to have positive x-intercepts, $h\\ge32$\nWe see that $h^2=\\frac{2014-k}{2}$ , so we now need to find a positive integer $h$ which has positive integer x-intercepts for both equations.\nNotice that if $k=2014-2h^2$ is -2 times a square number, then you have found a value of $h$ for which the second equation has positive x-intercepts. We guess and check $h=36$ to obtain $k=-578=-2(17^2)$\nFollowing this, we check to make sure the first equation also has positive x-intercepts (which it does), so we can conclude the answer is $\\boxed{036}$",
"Let $x=0$ and $y=2013$ for the first equation, resulting in $j=2013-3h^2$ . Substituting back in to the original equation, we get $y=3(x-h)^2+2013-3h^2$\nNow we set $y$ equal to zero, since there are two distinct positive integer roots. Rearranging, we get $2013=3h^2-3(x-h)^2$ , which simplifies to $671=h^2-(x-h)^2$ . Applying difference of squares, we get $671=(2h-x)(x)$\nNow, we know that $x$ and $h$ are both integers, so we can use the fact that $671=61\\times11$ , and set $2h-x=11$ and $x=61$ (note that letting $x=11$ gets the same result). Therefore, $h=\\boxed{036}$",
"Similar to the first two solutions, we deduce that $\\text{(-)}j$ and $\\text{(-)}k$ are of the form $3a^2$ and $2b^2$ , respectively, because the roots are integers and so is the $y$ -intercept of both equations. So the $x$ -intercepts should be integers also.\nThe first parabola gives \\[3h^2+j=3\\left(h^2-a^2\\right)=2013\\] \\[h^2-a^2=671\\] And the second parabola gives \\[2h^2+k=2\\left(h^2-b^2\\right)=2014\\] \\[h^2-b^2=1007\\]\nWe know that $671=11\\cdot 61$ and that $1007=19\\cdot 53$ . It is just a fitting coincidence that the average of $11$ and $61$ is the same as the average of $19$ and $53$ . That is $\\boxed{036}$",
"First, we expand both equations to get $y=3x^2-6hx+3h^2+j$ and $y=2x^2-4hx+2h^2+k$ . The $y$ -intercept for the first equation can be expressed as $3h^2+j$ . From this, the x-intercepts for the first equation can be written as\n\\[x=h \\pm \\sqrt{(-6h)^2-4*3(3h^2+j)}=h \\pm \\sqrt{36h^2-12(2013)}=h \\pm \\sqrt{36h^2-24156}\\]\nSince the $x$ -intercepts must be integers, $\\sqrt{36h^2-24156}$ must also be an integer. From solution 1, we know $h$ must be greater than or equal to 32. We can substitute increasing integer values for $h$ starting from 32; we find that $h=36$\nWe can test this result using the second equation, whose $x$ -intercepts are \\[x=h \\pm \\sqrt{(-4h)^2-4*2(2h^2+k)}=h \\pm \\sqrt{16h^2-8(2014)}=h \\pm \\sqrt{16h^2-16112}\\] Substituting 36 in for $h$ , we get $h=36 \\pm 68$ , which satisfies the requirement that all x-intercepts must be (positive) integers.\nThus, $h=\\boxed{036}$",
"We have the equation $y=3(x-h)^2 + j.$\nWe know: $(x,y):(0,2013)$ , so $h^2=2013/3 - j/3$ after plugging in the values and isolating $h^2$ . Therefore, $h^2=671-j/3$\nLets call the x-intercepts $x_1$ $x_2$ . Since both $x_1$ and $x_2$ are positive there is a relationship between $x_1$ $x_2$ and $h$ . Namely, $x_1+x_2=2h$ . The is because: $x_1-h=-(x_2-h)$\nSimilarly, we know: $(x,y):(x_1,0)$ , so $j=-3(x_1-h)^2$ . Combining the two equations gives us \\[h^2=671+(x_1-h)^2\\] \\[h^2=671+x_1^2-2x_1h+h^2\\] \\[h=(671+x_1^2)/2x_1.\\]\nNow since we have this relationship, $2h=x_1+x_2$ , we can just multiply the last equation by 2(so that we get $2h$ on the left side) which gives us \\[2h=671/x_1+x_1^2/x^1\\] \\[2h=671/x_1+x_1\\] \\[x_1+x_2=671/x_1+x_1\\] \\[x_2=671/x_1\\] \\[x_1x_2=671.\\] Prime factorization of 671 gives 11 and 61. So now we know $x_1=11$ and $x_2=61$ . Lastly, we plug in the numbers,11 and 61, into $x_1+x_2=2h$ , so $\\boxed{36}$",
"First, we start of exactly like solutions above and we find out that $j=2013-3h^2$ and $k=2014-2h^2$ We then plug j and k into $3(x-h)^2+j$ and $y=2(x-h)^2+k$ respectively. After that, we get two equations, $y=3x^2-6xh+2013$ and $y=2x^2-4xh+2014$ . We can apply Vieta's. Let the roots of the first equation be $a, b$ and the roots of the second equation be $c, d$ . Thus, we have that $a\\cdot b=1007$ $a+b=2h$ and $c\\cdot d=671$ $c+d=2h$ . Simple evaluations finds that $\\boxed{36}$"
] |
https://artofproblemsolving.com/wiki/index.php/1955_AHSME_Problems/Problem_46 | B | 1 | The graphs of $2x+3y-6=0, 4x-3y-6=0, x=2$ , and $y=\frac{2}{3}$ intersect in:
$\textbf{(A)}\ \text{6 points}\qquad\textbf{(B)}\ \text{1 point}\qquad\textbf{(C)}\ \text{2 points}\qquad\textbf{(D)}\ \text{no points}\\ \textbf{(E)}\ \text{an unlimited number of points}$ | [
"We first convert each of the lines into slope-intercept form ( $y = mx + b$ ):\n$2x+3y-6=0 ==> 3y = -2x + 6 ==> y = -\\frac{2}{3}x + 2$\n$4x - 3y - 6 = 0 ==> 4x - 6 = 3y ==> y = \\frac{4}{3}x - 2$\n$x = 2$ stays as is.\n$y = \\frac{2}{3}$ stays as is\nWe can graph the four lines here: [1]\nWhen we do that, the answer turns out to be $\\boxed{1}$"
] |
https://artofproblemsolving.com/wiki/index.php/1998_AHSME_Problems/Problem_23 | null | 140 | The graphs of $x^2 + y^2 = 4 + 12x + 6y$ and $x^2 + y^2 = k + 4x + 12y$ intersect when $k$ satisfies $a \le k \le b$ , and for no other values of $k$ . Find $b-a$
$\mathrm{(A) \ }5 \qquad \mathrm{(B) \ }68 \qquad \mathrm{(C) \ }104 \qquad \mathrm{(D) \ }140 \qquad \mathrm{(E) \ }144$ | [
"Both sets of points are quite obviously circles. To show this, we can rewrite each of them in the form $(x-x_0)^2 + (y-y_0)^2 = r^2$\nThe first curve becomes $(x-6)^2 + (y-3)^2 = 7^2$ , which is a circle centered at $(6,3)$ with radius $7$\nThe second curve becomes $(x-2)^2 + (y-6)^2 = 40+k$ , which is a circle centered at $(2,6)$ with radius $r=\\sqrt{40+k}$\nThe distance between the two centers is $5$ , and therefore the two circles intersect if $2\\leq r \\leq 12$\nFrom $\\sqrt{40+k} \\geq 2$ we get that $k\\geq -36$ . From $\\sqrt{40+k}\\leq 12$ we get $k\\leq 104$\nTherefore $b-a = 104 - (-36) = \\boxed{140}$"
] |
https://artofproblemsolving.com/wiki/index.php/1999_AHSME_Problems/Problem_22 | null | 10 | The graphs of $y = -|x-a| + b$ and $y = |x-c| + d$ intersect at points $(2,5)$ and $(8,3)$ . Find $a+c$
$\mathrm{(A) \ } 7 \qquad \mathrm{(B) \ } 8 \qquad \mathrm{(C) \ } 10 \qquad \mathrm{(D) \ } 13\qquad \mathrm{(E) \ } 18$ | [
"Each of the graphs consists of two orthogonal half-lines. In the first graph both point downwards at a $45^\\circ$ angle, in the second graph they point upwards. One can easily find out that the only way how to get these graphs to intersect in two points is the one depicted below:\nObviously, the maximum of the first graph is achieved when $x=a$ , and its value is $-0+b=b$ . Similarly, the minimum of the other graph is $(c,d)$ . Therefore the two remaining vertices of the area between the graphs are $(a,b)$ and $(c,d)$\nAs the area has four right angles, it is a rectangle. Without actually computing $a$ and $c$ we can therefore conclude that $a+c=2+8=\\boxed{10}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_12A_Problems/Problem_16 | D | 5 | The graphs of $y=\log_3 x, y=\log_x 3, y=\log_\frac{1}{3} x,$ and $y=\log_x \dfrac{1}{3}$ are plotted on the same set of axes. How many points in the plane with positive $x$ -coordinates lie on two or more of the graphs?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$ | [
"Setting the first two equations equal to each other, $\\log_3 x = \\log_x 3$\nSolving this, we get $\\left(3, 1\\right)$ and $\\left(\\frac{1}{3}, -1\\right)$\nSimilarly with the last two equations, we get $\\left(3, -1\\right)$ and $\\left(\\frac{1}{3}, 1\\right)$\nNow, by setting the first and third equations equal to each other, we get $\\left(1, 0\\right)$\nPairing the first and fourth or second and third equations won't work because then $\\log x \\leq 0$\nPairing the second and fourth equations will yield $x = 1$ , but since you can't divide by $\\log 1 = 0$ , it doesn't work.\nAfter trying all pairs, we have a total of $5$ solutions $\\rightarrow \\boxed{5}$",
"Note that $\\log_b a =\\log_c a / \\log_c b$\nThen $\\log_b a = \\log_a a / \\log_a b = 1/ \\log_a b$\n$\\log_\\frac{1}{a} b = \\log_a \\frac{1}{a} / \\log_a b = -1/ \\log_a b$\n$\\log_\\frac{1}{b} a = -\\log_a b$\nTherefore, the system of equations can be simplified to:\n$y = t$\n$y = -t$\n$y = \\frac{1}{t}$\n$y = -\\frac{1}{t}$\nwhere $t = \\log_3 x$ . Note that all values of $t$ correspond to exactly one positive $x$ value, so all $(t,y)$ intersections will correspond to exactly one $(x,y)$ intersection in the positive-x area.\nGraphing this system of functions will generate a total of $5$ solutions $\\rightarrow \\boxed{5}$"
] |
https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_6 | null | 660 | The graphs of the equations
are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.\,$ These 63 lines cut part of the plane into equilateral triangles of side length $\tfrac{2}{\sqrt{3}}.\,$ How many such triangles are formed? | [
"We note that the lines partition the hexagon of the six extremal lines into disjoint unit regular triangles, and forms a series of unit regular triangles along the edge of the hexagon.\n\nSolving the above equations for $k=\\pm 10$ , we see that the hexagon in question is regular, with side length $\\frac{20}{\\sqrt{3}}$ . Then, the number of triangles within the hexagon is simply the ratio of the area of the hexagon to the area of a regular triangle. Since the ratio of the area of two similar figures is the square of the ratio of their side lengths, we see that the ratio of the area of one of the six equilateral triangles composing the regular hexagon to the area of a unit regular triangle is just $\\left(\\frac{20/\\sqrt{3}}{2/\\sqrt{3}}\\right)^2 = 100$ . Thus, the total number of unit triangles is $6 \\times 100 = 600$\nThere are $6 \\cdot 10$ equilateral triangles formed by lines on the edges of the hexagon. Thus, our answer is $600+60 = \\boxed{660}$",
"There are three types of lines: horizontal, upward-slanting diagonal, and downward-slanting diagonal. There are $21$ of each type of line, and a unit equilateral triangle is determined by exactly one of each type of line. Given an upward-slanting diagonal and a downward-slanting diagonal, they determine exactly two unit equilateral triangles as shown below. Therefore, if all horizontal lines are drawn, there will be a total of $2\\cdot 21^2=882$ unit equilateral triangles. Of course, we only draw $21$ horizontal lines, so we are overcounting the triangles that are caused by the undrawn horizontal lines. In the below diagram, we draw the diagonal lines and the highest and lowest horizontal lines. \nWe see that the lines $y=-21,-20,\\dots, -11$ and $y=11,12,\\dots,21$ would complete several of the $882$ unit equilateral triangles. In fact, we can see that the lines $y=-21,-20,\\dots,-11$ complete $1,2,(1+3),(2+4),(3+5),(4+6),\\dots,(9+11)$ triangles, or $111$ triangles. The positive horizontal lines complete the same number of triangles, hence the answer is $882-2\\cdot 111=\\boxed{660}$",
"Picturing the diagram in your head should give you an illustration similar to the one above. The distance from parallel sides of the center hexagon is 20 units, and by extending horizontal lines to the sides of the hexagon. This shows that for every side of the hexagon there are 10 spaces. Therefore the side length of the biggest triangle (imagine one of the overlapping triangles in the Star of David) is 30. The total number of triangles in the hexagon can be found by finding the number of triangles in the extended triangle and subtracting the 3 corner triangles. This gives us $30^2 - 10^2 - 10^2- 10^2 = 600$ . That is the number of triangles in the hexagon. The remaining triangles form in groups of 10 on the exterior of each side. $600 + 6 * 10 = \\boxed{660}$"
] |
https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10B_Problems/Problem_8 | C | 10 | The greatest prime number that is a divisor of $16384$ is $2$ because $16384 = 2^{14}$ . What is the sum of the digits of the greatest prime number that is a divisor of $16383$
$\textbf{(A)} \: 3\qquad\textbf{(B)} \: 7\qquad\textbf{(C)} \: 10\qquad\textbf{(D)} \: 16\qquad\textbf{(E)} \: 22$ | [
"We have \\begin{align*} 16383 & = 2^{14} - 1 \\\\ & = \\left( 2^7 + 1 \\right) \\left( 2^7 - 1 \\right) \\\\ & = 129 \\cdot 127 \\\\ \\end{align*}\nSince $129$ is composite, $127$ is the largest prime which can divide $16383$ . The sum of $127$ 's digits is $1+2+7=\\boxed{10}$"
] |
https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_12B_Problems/Problem_6 | C | 10 | The greatest prime number that is a divisor of $16384$ is $2$ because $16384 = 2^{14}$ . What is the sum of the digits of the greatest prime number that is a divisor of $16383$
$\textbf{(A)} \: 3\qquad\textbf{(B)} \: 7\qquad\textbf{(C)} \: 10\qquad\textbf{(D)} \: 16\qquad\textbf{(E)} \: 22$ | [
"We have \\begin{align*} 16383 & = 2^{14} - 1 \\\\ & = \\left( 2^7 + 1 \\right) \\left( 2^7 - 1 \\right) \\\\ & = 129 \\cdot 127 \\\\ \\end{align*}\nSince $129$ is composite, $127$ is the largest prime which can divide $16383$ . The sum of $127$ 's digits is $1+2+7=\\boxed{10}$"
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_8_Problems/Problem_20 | D | 8 | The grid below is to be filled with integers in such a way that the sum of the numbers in each row and the sum of the numbers in each column are the same. Four numbers are missing. The number $x$ in the lower left corner is larger than the other three missing numbers. What is the smallest possible value of $x$ [asy] unitsize(0.5cm); draw((3,3)--(-3,3)); draw((3,1)--(-3,1)); draw((3,-3)--(-3,-3)); draw((3,-1)--(-3,-1)); draw((3,3)--(3,-3)); draw((1,3)--(1,-3)); draw((-3,3)--(-3,-3)); draw((-1,3)--(-1,-3)); label((-2,2),"$-2$"); label((0,2),"$9$"); label((2,2),"$5$"); label((2,0),"$-1$"); label((2,-2),"$8$"); label((-2,-2),"$x$"); [/asy] $\textbf{(A) } -1 \qquad \textbf{(B) } 5 \qquad \textbf{(C) } 6 \qquad \textbf{(D) } 8 \qquad \textbf{(E) } 9 \qquad$ | [
"The sum of the numbers in each row is $12$ . Consider the second row. In order for the sum of the numbers in this row to equal $12$ , the two shaded numbers must add up to $13$ If two numbers add up to $13$ , one of them must be at least $7$ : If both shaded numbers are no more than $6$ , their sum can be at most $12$ . Therefore, for $x$ to be larger than the three missing numbers, $x$ must be at least $8$ . We can construct a working scenario where $x=8$ So, our answer is $\\boxed{8}$",
"The sum of the numbers in each row is $-2+9+5=12,$ and the sum of the numbers in each column is $5+(-1)+8=12.$\nLet $y$ be the number in the lower middle. It follows that $x+y+8=12,$ or $x+y=4.$\nWe express the other two missing numbers in terms of $x$ and $y,$ as shown below: We have $x>x-1, x>y+10,$ and $x>y.$ Note that the first inequality is true for all values of $x.$ We only need to solve the second inequality so that the third inequality is true for all values of $x.$ By substitution, we get $x>(4-x)+10,$ from which $x>7.$\nTherefore, the smallest possible value of $x$ is $\\boxed{8}.$",
"This is based on the Solution 2 above and it is perhaps a little simpler than that.\nLet $y$ be the number in the lower middle. Applying summation to first two columns yields the following.\n\nSince $x$ is greater than the other three, we have $x>14-x,$ or $x>7.$\nTherefore, the smallest possible value of $x$ is $\\boxed{8}.$",
"Note that the sum of the rows and columns must be $8+5-1=12$ . We proceed to test the answer choices.\nTesting $\\textbf{(A)}$ , when $x = -1$ , the number above $x$ must be $15$ , which contradicts the precondition that the numbers surrounding $x$ is less than $x$\nTesting $\\textbf{(B)}$ , the number above $x$ is $9$ , which does not work.\nTesting $\\textbf{(C)}$ , the number above $x$ is $8$ , which does not work.\nTesting $\\textbf{(D)}$ , the number above $x$ is $6$ , which does work. Hence, the answer is $\\boxed{8}$",
"The sum of the numbers in each column and row should be $5+(-1)+8=12$ . If we look at the $1^{\\text{st}}$ column, the gray squares (shown below) sum to $12-(-2)=14$\n\nIf square $x$ has to be greater than or equal to the three blank squares, then the least $x$ can be is half the sum of the value of the gray squares, which is $14\\div2=7$ . But square $x$ has to be greater than and not greater than or equal to the three blank squares, so the least $x$ can be is $7+1=8$ . Testing for the other rows and columns (it might be smaller than the other two squares!), we find that the smallest $x$ can be is indeed $8$ ; the other two squares are less than $8$ . Therefore, the answer is $\\boxed{8}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_12B_Problems/Problem_2 | A | 2 | The harmonic mean of two numbers can be calculated as twice their product divided by their sum. The harmonic mean of $1$ and $2016$ is closest to which integer?
$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 45 \qquad \textbf{(C)}\ 504 \qquad \textbf{(D)}\ 1008 \qquad \textbf{(E)}\ 2015$ | [
"Since the harmonic mean is $2$ times their product divided by their sum, we get the equation\n$\\frac{2\\times1\\times2016}{1+2016}$\nwhich is then\n$\\frac{4032}{2017}$\nwhich is finally closest to $\\boxed{2}$ .\n-dragonfly"
] |
https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_8 | null | 799 | The harmonic mean of two positive integers is the reciprocal of the arithmetic mean of their reciprocals. For how many ordered pairs of positive integers $(x,y)$ with $x<y$ is the harmonic mean of $x$ and $y$ equal to $6^{20}$ | [
"The harmonic mean of $x$ and $y$ is equal to $\\frac{1}{\\frac{\\frac{1}{x}+\\frac{1}{y}}2} = \\frac{2xy}{x+y}$ , so we have $xy=(x+y)(3^{20}\\cdot2^{19})$ , and by SFFT $(x-3^{20}\\cdot2^{19})(y-3^{20}\\cdot2^{19})=3^{40}\\cdot2^{38}$ . Now, $3^{40}\\cdot2^{38}$ has $41\\cdot39=1599$ factors, one of which is the square root ( $3^{20}2^{19}$ ). Since $x<y$ , the answer is half of the remaining number of factors, which is $\\frac{1599-1}{2}= \\boxed{799}$"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_8_Problems/Problem_22 | E | 8 | The hundreds digit of a three-digit number is $2$ more than the units digit. The digits of the three-digit number are reversed, and the result is subtracted from the original three-digit number. What is the units digit of the result?
$\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 6\qquad\textbf{(E)}\ 8$ | [
"Let the hundreds, tens, and units digits of the original three-digit number be $a$ $b$ , and $c$ , respectively. We are given that $a=c+2$ . The original three-digit number is equal to $100a+10b+c = 100(c+2)+10b+c = 101c+10b+200$ . The hundreds, tens, and units digits of the reversed three-digit number are $c$ $b$ , and $a$ , respectively. This number is equal to $100c+10b+a = 100c+10b+(c+2) = 101c+10b+2$ . Subtracting this expression from the expression for the original number, we get $(101c+10b+200) - (101c+10b+2) = 198$ . Thus, the units digit in the final result is $\\boxed{8}$",
"The result must hold for any three-digit number with hundreds digit being $2$ more than the units digit. $301$ is such a number. Evaluating, we get $301-103=198$ . Thus, the units digit in the final result is $\\boxed{8}$",
"Set the units digit of the original number as $x$ . Thus, its hundreds digit is $x+2$ . After the digits are reversed, the hundreds digit of the original number will be the units digit of the new number. Since $x-(x+2) = -2$ , we can do regrouping and \"borrow\" $1$ from the tens digit and bring it to the units digit as a $10$ . Therefore, the units digit will end up as $-2 + 10 = \\boxed{8}$"
] |
https://artofproblemsolving.com/wiki/index.php/1954_AHSME_Problems/Problem_43 | B | 22 | The hypotenuse of a right triangle is $10$ inches and the radius of the inscribed circle is $1$ inch. The perimeter of the triangle in inches is:
$\textbf{(A)}\ 15 \qquad \textbf{(B)}\ 22 \qquad \textbf{(C)}\ 24 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 30$ | [
"To begin, let's notice that the inscribed circle of the right triangle is its incircle , and that the radius of the incircle is the right triangle's inradius . In this case, the hypotenuse is 10, and the inradius is 1. The formula for the inradius of a right triangle is $r = (a+b-c)/2$ , where $r$ is the length of the inradius of the triangle, $c$ is the length hyptotenuse the the right triangle, and $a$ and $b$ are the lengths of the legs of the right triangle. From this, we can plug in values to notice that:\n\\begin{align*} r & = \\frac{a+b-c}{2}\\\\\\\\ 1 & = \\frac{a+b-10}{2}\\\\\\\\ 2 & = a+b-10\\\\\\\\ 12 &= a+b\\\\\\\\ \\end{align*}\nFrom this, we arrive at $a+b+c = 12+10 = 22$ . The answer is clearly $\\boxed{22}$"
] |
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_14 | null | 227 | The incircle $\omega$ of triangle $ABC$ is tangent to $\overline{BC}$ at $X$ . Let $Y \neq X$ be the other intersection of $\overline{AX}$ with $\omega$ . Points $P$ and $Q$ lie on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $\overline{PQ}$ is tangent to $\omega$ at $Y$ . Assume that $AP = 3$ $PB = 4$ $AC = 8$ , and $AQ = \dfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | [
"Let the sides $\\overline{AB}$ and $\\overline{AC}$ be tangent to $\\omega$ at $Z$ and $W$ , respectively. Let $\\alpha = \\angle BAX$ and $\\beta = \\angle AXC$ . Because $\\overline{PQ}$ and $\\overline{BC}$ are both tangent to $\\omega$ and $\\angle YXC$ and $\\angle QYX$ subtend the same arc of $\\omega$ , it follows that $\\angle AYP = \\angle QYX = \\angle YXC = \\beta$ . By equal tangents, $PZ = PY$ . Applying the Law of Sines to $\\triangle APY$ yields \\[\\frac{AZ}{AP} = 1 + \\frac{ZP}{AP} = 1 + \\frac{PY}{AP} = 1 + \\frac{\\sin\\alpha}{\\sin\\beta}.\\] Similarly, applying the Law of Sines to $\\triangle ABX$ gives \\[\\frac{AZ}{AB} = 1 - \\frac{BZ}{AB} = 1 - \\frac{BX}{AB} = 1 - \\frac{\\sin\\alpha}{\\sin\\beta}.\\] It follows that \\[2 = \\frac{AZ}{AP} + \\frac{AZ}{AB} = \\frac{AZ}3 + \\frac{AZ}7,\\] implying $AZ = \\tfrac{21}5$ . Applying the same argument to $\\triangle AQY$ yields \\[2 = \\frac{AW}{AQ} + \\frac{AW}{AC} = \\frac{AZ}{AQ} + \\frac{AZ}{AC} = \\frac{21}5\\left(\\frac{1}{AQ} + \\frac 18\\right),\\] from which $AQ = \\tfrac{168}{59}$ . The requested sum is $168 + 59 = \\boxed{227}$",
"Let the incircle of $ABC$ be tangent to $AB$ and $AC$ at $Z$ and $W$ . By Brianchon's theorem on tangential hexagons $QWCBZP$ and $PYQCXB$ , we know that $ZW,CP,BQ$ and $XY$ are concurrent at a point $O$ . Let $PQ \\cap BC = M$ . Then by La Hire's $A$ lies on the polar of $M$ so $M$ lies on the polar of $A$ . Therefore, $ZW$ also passes through $M$ . Then projecting through $M$ , we have \\[-1 = (A,O;Y,X) \\stackrel{M}{=} (A,Z;P,B) \\stackrel{M}{=} (A,W;Q,C).\\] Therefore, $\\frac{AP \\cdot ZB}{MP \\cdot AB} = 1 \\implies \\frac{3 \\cdot ZB}{ZP \\cdot 7} = 1$ . Since $ZB+ZP=4$ we know that $ZP = \\frac{6}{5}$ and $ZB = \\frac{14}{5}$ . Therefore, $AW = AZ = \\frac{21}{5}$ and $WC = 8 - \\frac{21}{5} = \\frac{19}{5}$ . Since $(A,W;Q,C) = -1$ , we also have $\\frac{AQ \\cdot WC}{NQ \\cdot AC} = 1 \\implies \\frac{AQ \\cdot \\tfrac{19}{5}}{(\\tfrac{21}{5} - AQ) \\cdot 8} = 1$ . Solving for $AQ$ , we obtain $AQ = \\frac{168}{59} \\implies m+n = \\boxed{227}$ .\n😃\n-Vfire",
"Let the center of the incircle of $\\triangle ABC$ be $O$ . Link $OY$ and $OX$ . Then we have $\\angle OYP=\\angle OXB=90^{\\circ}$\n$\\because$ $OY=OX$\n$\\therefore$ $\\angle OYX=\\angle OXY$\n$\\therefore$ $\\angle PYX=\\angle YXB$\n$\\therefore$ $\\sin \\angle PYX=\\sin \\angle YXB=\\sin \\angle YXC=\\sin \\angle PYA$\nLet the incircle of $ABC$ be tangent to $AB$ and $AC$ at $M$ and $N$ , let $MP=YP=x$ and $NQ=YQ=y$\nUse Law of Sine in $\\triangle APY$ and $\\triangle AXB$ , we have\n$\\frac{\\sin \\angle PAY}{PY}=\\frac{\\sin \\angle PYA}{PA}$\n$\\frac{\\sin \\angle BAX}{BX}=\\frac{\\sin \\angle AXB}{AB}$\ntherefore we have\n$\\frac{3}{x}=\\frac{7}{4-x}$\nSolve this equation, we have $x=\\frac{6}{5}$\nAs a result, $MB=4-x=\\frac{14}{5}=BX$ $AM=x+3=\\frac{21}{5}=AN$ $NC=8-AN=\\frac{19}{5}=XC$ $AQ=\\frac{21}{5}-y$ $PQ=\\frac{6}{5}+y$\nSo, $BC=\\frac{14}{5}+\\frac{19}{5}=\\frac{33}{5}$\nUse Law of Cosine in $\\triangle BAC$ and $\\triangle PAQ$ , we have\n$\\cos \\angle BAC=\\frac{AB^2+AC^2-BC^2}{2\\cdot AB\\cdot AC}=\\frac{7^2+8^2-{(\\frac{33}{5})}^2}{2\\cdot 7\\cdot 8}$\n$\\cos \\angle PAQ=\\frac{AP^2+AQ^2-PQ^2}{2\\cdot AP\\cdot AQ}=\\frac{3^2+{(\\frac{21}{5}-y)}^2-{(\\frac{6}{5}+y)}^2}{2\\cdot {(\\frac{21}{5}-y)}\\cdot 3}$\nAnd we have\n$\\cos \\angle BAC=\\cos \\angle PAQ$\nSo\n$\\frac{7^2+8^2-{(\\frac{33}{5})}^2}{2\\cdot 7\\cdot 8}=\\frac{3^2+{(\\frac{21}{5}-y)}^2-{(\\frac{6}{5}+y)}^2}{2\\cdot {(\\frac{21}{5}-y)}\\cdot 3}$\nSolve this equation, we have $y=\\frac{399}{295}=QN$\nAs a result, $AQ=AN-QN=\\frac{21}{5}-\\frac{399}{295}=\\frac{168}{59}$\nSo, the final answer of this question is $168+59=\\boxed{227}$"
] |
https://artofproblemsolving.com/wiki/index.php/2007_AIME_II_Problems/Problem_12 | null | 91 | The increasing geometric sequence $x_{0},x_{1},x_{2},\ldots$ consists entirely of integral powers of $3.$ Given that
$\sum_{n=0}^{7}\log_{3}(x_{n}) = 308$ and $56 \leq \log_{3}\left ( \sum_{n=0}^{7}x_{n}\right ) \leq 57,$
find $\log_{3}(x_{14}).$ | [
"Suppose that $x_0 = a$ , and that the common ratio between the terms is $r$\nThe first conditions tells us that $\\log_3 a + \\log_3 ar + \\ldots + \\log_3 ar^7 = 308$ . Using the rules of logarithms , we can simplify that to $\\log_3 a^8r^{1 + 2 + \\ldots + 7} = 308$ . Thus, $a^8r^{28} = 3^{308}$ . Since all of the terms of the geometric sequence are integral powers of $3$ , we know that both $a$ and $r$ must be powers of 3. Denote $3^x = a$ and $3^y = r$ . We find that $8x + 28y = 308$ . The possible positive integral pairs of $(x,y)$ are $(35,1),\\ (28,3),\\ (21,5),\\ (14,7),\\ (7,9),\\ (0,11)$\nThe second condition tells us that $56 \\le \\log_3 (a + ar + \\ldots ar^7) \\le 57$ . Using the sum formula for a geometric series and substituting $x$ and $y$ , this simplifies to $3^{56} \\le 3^x \\frac{3^{8y} - 1}{3^y-1} \\le 3^{57}$ . The fractional part $\\approx \\frac{3^{8y}}{3^y} = 3^{7y}$ . Thus, we need $\\approx 56 \\le x + 7y \\le 57$ . Checking the pairs above, only $(21,5)$ is close.\nOur solution is therefore $\\log_3 (ar^{14}) = \\log_3 3^x + \\log_3 3^{14y} = x + 14y = \\boxed{091}$",
"All these integral powers of $3$ are all different, thus in base $3$ the sum of these powers would consist of $1$ s and $0$ s. Thus the largest value $x_7$ must be $3^{56}$ in order to preserve the givens. Then we find by the given that $x_7x_6x_5\\dots x_0 = 3^{308}$ , and we know that the exponents of $x_i$ are in an arithmetic sequence. Thus $56+(56-r)+(56-2r)+\\dots +(56-7r) = 308$ , and $r = 5$ . Thus $\\log_3 (x_{14}) = \\boxed{091}$",
"Like above, we use logarithmic identities to convert the problem into workable equations. We begin by labelling the powers of 3. Call $x_0$ $x_1$ $x_2$ ..., as $3^n$ $3^{n+m}$ , and $3^{n+2m}$ ... respectively. With this format we can rewrite the first given equation as $n + n + m + n+2m + n+3m+...+n+7m = 308$ . Simplify to get $2n+7m=77$ . (1)\nNow, rewrite the second given equation as $3^{56} \\leq \\left( \\sum_{n=0}^{7}x_{n} \\right) \\leq 3^{57}$ . Obviously, $x_7$ , aka $3^{n+7m}$ $<3^{57}$ because there are some small fractional change that is left over. This means $n+7m$ is $\\leq56$ . Thinking about the geometric sequence, it's clear each consecutive value of $x_i$ will be either a power of three times smaller or larger. In other words, the earliest values of $x_i$ will be negligible compared to the last values of $x_i$ . Even in the best case scenario, where the common ratio is 3, the values left of $x_7$ are not enough to sum to a value greater than 2 times $x_7$ (amount needed to raise the power of 3 by 1). This confirms that $3^{n+7m} = 3^{56}$ . (2)\nUse equations 1 and 2 to get $m=5$ and $n=21$ $\\log_{3}{x_{14}} = \\log_{3}{3^{21+14*5}} = 21+14*5 = \\boxed{091}$",
"Proceed as in Solution 3 for the first few steps. We have the sequence $3^{a},3^{a+n},3^{a+2n}...$ . As stated above, we then get that $a+a+n+...+a+7n=308$ , from which we simplify to $2a+7n=77$ . From here, we just go brute force using the second statement (that $3^{56}\\leq 3^{a}+...+3^{a+7n}\\leq 3^{57}$ ). Rearranging the equation from earlier, we get \\[n=11-\\frac{2a}{7}\\] from which it is clear that $a$ is a multiple of $7$ . Testing the first few values of $a$ , we get:\nCase 1 ( $a=7,n=9$ )\nThe sequence is then $3^{7}+...+3^{70}$ , which breaks the upper bound.\nCase 2 ( $a=14,n=7$ )\nThe sequence is then $3^{14}+...+3^{63}$ , which also breaks the upper bound.\nCase 3 ( $a=21,n=5$ )\nThis is the first reasonable one, giving $3^{21}+...+3^{56}$ . It seems like this would break the upper bound, but from some testing we get: \\[3^{21}+...+3^{56}<3^{57}\\] \\[1+...+3^{35}<3^{36}\\] \\[1+...+3^{30}<2*3^{35}\\] \\[3^{5}+...+3^{30}<2*3^{35}-1\\] \\[1+...+3^{25}<2*3^{30}-3^{-5}\\] Repeating this process over and over, we eventually get (while ignoring the extremely small fractions left over) \\[1<2*3^{5}\\] which confirms that this satisfies our upper bound. Thus $a=21,n=5$ , so $x_14=3^{a+14n}\\rightarrow3^{91}$ . We then get the requested answer, $\\log_3(3^{91})=\\boxed{091}$ ~ amcrunner"
] |
https://artofproblemsolving.com/wiki/index.php/1986_AIME_Problems/Problem_7 | null | 981 | The increasing sequence $1,3,4,9,10,12,13\cdots$ consists of all those positive integers which are powers of 3 or sums of distinct powers of 3. Find the $100^{\mbox{th}}$ term of this sequence. | [
"Rewrite all of the terms in base 3. Since the numbers are sums of distinct powers of 3, in base 3 each number is a sequence of 1s and 0s (if there is a 2, then it is no longer the sum of distinct powers of 3). Therefore, we can recast this into base 2 (binary) in order to determine the 100th number. $100$ is equal to $64 + 32 + 4$ , so in binary form we get $1100100$ . However, we must change it back to base 10 for the answer, which is $3^6 + 3^5 + 3^2 = 729 + 243 + 9 = \\boxed{981}$",
"Notice that the first term of the sequence is $1$ , the second is $3$ , the fourth is $9$ , and so on. Thus the $64th$ term of the sequence is $729$ . Now out of $64$ terms which are of the form $729$ $'''S'''$ $32$ of them include $243$ and $32$ do not. The smallest term that includes $243$ , i.e. $972$ , is greater than the largest term which does not, or $854$ . So the $96$ th term will be $972$ , then $973$ , then $975$ , then $976$ , and finally $\\boxed{981}$",
"After the $n$ th power of 3 in the sequence, the number of terms after that power but before the $(n+1)$ th power of 3 is equal to the number of terms before the $n$ th power, because those terms after the $n$ th power are just the $n$ th power plus all the distinct combinations of powers of 3 before it, which is just all the terms before it. Adding the powers of $3$ and the terms that come after them, we see that the $100$ th term is after $729$ , which is the $64$ th term. Also, note that the $k$ th term after the $n$ th power of 3 is equal to the power plus the $k$ th term in the entire sequence. Thus, the $100$ th term is $729$ plus the $36$ th term. Using the same logic, the $36$ th term is $243$ plus the $4$ th term, $9$ . We now have $729+243+9=\\boxed{981}$",
"Writing out a few terms of the sequence until we reach the next power of 3 (27), we see that the $2^{nth}$ term is equal to $3^n$ . From here, we can ballpark the range of the 100th term. The 64th term is $3^6$ $729$ and the 128th term is $3^7$ $2187$ . Writing out more terms of the sequence until the next power of 3 again (81) we can see that the ( $2^n$ $2^{n+1}$ )/2 term is equal to $3^n$ $3^{n-1}$ . From here, we know that the 96th term is $3^6$ $3^5$ $972$ . From here, we can construct the 100th term by following the sequence in increasing order. The 97th term is $972 + 1 = 973$ , the 98th term is $972 + 3 = 975$ , the 99th term is $972 + 3 + 1 = 976$ , and finally the 100th term is $972 + 9 = \\boxed{981}$",
"The number of terms $3^n$ produces includes each power of 3 ( $1, 3^1, ..., 3^n$ ), the sums of two power of 3s(ex. $3^1 + 1$ ), three power of 3s (ex. $3^1 + 1 + 3^n$ ), all the way to the sum of them all. Since there are $n+1$ powers of 3, the one number sum gives us ${n+1\\choose 1}$ terms, the two number ${n+1\\choose 2}$ terms, all the way to the sum of all the powers which gives us ${n+1\\choose n+1}$ terms. Summing all these up gives us $2^{n+1} - 1 ^ {*}$ according to the theorem\nSince $2^6$ is the greatest power $<100$ , then $n=5$ and the sequence would look like { $3^0, ..., 3^5$ }, where $3^5$ or $243$ would be the $2^5 - 1 = 63$ rd number. The next largest power $729$ would be the 64th number. However, its terms contributed extends beyond 100, so we break it to smaller pieces. \nNoting that $729$ plus any combination of lower powers ${1, 3^1 . . .3^4}$ is < $729 + 243$ , so we can add all those terms( $2^5 - 1 = 31$ ) into our sequence:\nOur sequence now has $63 + 1 + 31 = 95$ terms. The remaining $5$ would just be the smallest sums starting with $729 + 243$ or $972$\nHence the 100th term would be $972 + 9 = \\boxed{981}$ . ~SoilMilk"
] |
https://artofproblemsolving.com/wiki/index.php/1990_AIME_Problems/Problem_1 | null | 528 | The increasing sequence $2,3,5,6,7,10,11,\ldots$ consists of all positive integers that are neither the square nor the cube of a positive integer. Find the 500th term of this sequence. | [
"Because there aren't that many perfect squares or cubes, let's look for the smallest perfect square greater than $500$ . This happens to be $23^2=529$ . Notice that there are $23$ squares and $8$ cubes less than or equal to $529$ , but $1$ and $2^6$ are both squares and cubes. Thus, there are $529-23-8+2=500$ numbers in our sequence less than $529$ . Magically, we want the $500th$ term, so our answer is the biggest non-square and non-cube less than $529$ , which is $\\boxed{528}$",
"This solution is similar as Solution 1, but to get the intuition why we chose to consider $23^2 = 529$ , consider this:\nWe need $n - T = 500$ , where $n$ is an integer greater than 500 and $T$ is the set of numbers which contains all $k^2,k^3\\le 500$\nFirstly, we clearly need $n > 500$ , so we substitute n for the smallest square or cube greater than $500$ . However, if we use $n=8^3=512$ , the number of terms in $T$ will exceed $n-500$ . Therefore, $n=23^2=529$ , and the number of terms in $T$ is $23+8-2=29$ by the Principle of Inclusion-Exclusion , fulfilling our original requirement of $n-T=500$ .\nAs a result, our answer is $529-1 = \\boxed{528}$"
] |
https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_1 | null | 63 | The increasing sequence $3, 15, 24, 48, \ldots\,$ consists of those positive multiples of 3 that are one less than a perfect square . What is the remainder when the 1994th term of the sequence is divided by 1000? | [
"One less than a perfect square can be represented by $n^2 - 1 = (n+1)(n-1)$ . Either $n+1$ or $n-1$ must be divisible by 3. This is true when $n \\equiv -1,\\ 1 \\equiv 2,\\ 1 \\pmod{3}$ . Since 1994 is even, $n$ must be congruent to $1 \\pmod{3}$ . It will be the $\\frac{1994}{2} = 997$ th such term, so $n = 4 + (997-1) \\cdot 3 = 2992$ . The value of $n^2 - 1 = 2992^2 - 1 \\pmod{1000}$ is $\\boxed{063}$"
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_8 | A | 10 | The infinite product \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots\] evaluates to a real number. What is that number?
$\textbf{(A) }\sqrt{10}\qquad\textbf{(B) }\sqrt[3]{100}\qquad\textbf{(C) }\sqrt[4]{1000}\qquad\textbf{(D) }10\qquad\textbf{(E) }10\sqrt[3]{10}$ | [
"We can write $\\sqrt[3]{10}$ as $10 ^ \\frac{1}{3}$ . Similarly, $\\sqrt[3]{\\sqrt[3]{10}} = (10 ^ \\frac{1}{3}) ^ \\frac{1}{3} = 10 ^ \\frac{1}{3^2}$\nBy continuing this, we get the form \\[10 ^ \\frac{1}{3} \\cdot 10 ^ \\frac{1}{3^2} \\cdot 10 ^ \\frac{1}{3^3} \\cdots,\\] which is \\[10 ^ {\\frac{1}{3} + \\frac{1}{3^2} + \\frac{1}{3^3} + \\cdots}.\\] Using the formula for an infinite geometric series $S = \\frac{a}{1-r}$ , we get \\[\\frac{1}{3} + \\frac{1}{3^2} + \\frac{1}{3^3} + \\cdots = \\frac{\\frac{1}{3}}{1-\\frac{1}{3}} = \\frac{1}{2}.\\] Thus, our answer is $10 ^ \\frac{1}{2} = \\boxed{10}$",
"We can write this infinite product as $L$ (we know from the answer choices that the product must converge): \\[L = \\sqrt[3]{10} \\cdot \\sqrt[3]{\\sqrt[3]{10}} \\cdot \\sqrt[3]{\\sqrt[3]{\\sqrt[3]{10}}} \\cdots.\\] If we raise everything to the third power, we get: \\[L^3 = 10 \\, \\cdot \\, \\sqrt[3]{10} \\, \\cdot \\, \\sqrt[3]{\\sqrt[3]{10}} \\cdots = 10L \\implies L^3 - 10L = 0 \\implies L \\in \\left\\{0, \\pm \\sqrt{10}\\right\\}.\\] Since $L$ is positive (as it is an infinite product of positive numbers), it must be that $L = \\boxed{10}.$"
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_8 | null | 10 | The infinite product \[\sqrt[3]{10} \cdot \sqrt[3]{\sqrt[3]{10}} \cdot \sqrt[3]{\sqrt[3]{\sqrt[3]{10}}} \cdots\] evaluates to a real number. What is that number?
$\textbf{(A) }\sqrt{10}\qquad\textbf{(B) }\sqrt[3]{100}\qquad\textbf{(C) }\sqrt[4]{1000}\qquad\textbf{(D) }10\qquad\textbf{(E) }10\sqrt[3]{10}$ | [
"Move the first term inside the second radical. We get \\[\\sqrt[3]{10} \\cdot \\sqrt[3]{\\sqrt[3]{10}} \\cdot \\sqrt[3]{\\sqrt[3]{\\sqrt[3]{10}}} \\cdots = \\sqrt[3]{10\\sqrt[3]{10}} \\cdot \\sqrt[3]{\\sqrt[3]{\\sqrt[3]{10}}} \\cdots.\\] Do this for the third radical as well: \\[\\sqrt[3]{10\\sqrt[3]{10}} \\cdot \\sqrt[3]{\\sqrt[3]{\\sqrt[3]{10}}} \\cdots = \\sqrt[3]{10\\sqrt[3]{10}\\sqrt[3]{\\sqrt[3]{10}}} \\cdots = \\sqrt[3]{10\\sqrt[3]{10\\sqrt[3]{10\\cdots}}}.\\] It is clear what the pattern is. Setting the answer as $P,$ we have \\[P = \\sqrt[3]{10P},\\] from which $P = \\boxed{10}.$"
] |
https://artofproblemsolving.com/wiki/index.php/1999_AIME_Problems/Problem_12 | null | 345 | The inscribed circle of triangle $ABC$ is tangent to $\overline{AB}$ at $P_{},$ and its radius is $21$ . Given that $AP=23$ and $PB=27,$ find the perimeter of the triangle. | [
"Let $Q$ be the tangency point on $\\overline{AC}$ , and $R$ on $\\overline{BC}$ . By the Two Tangent Theorem $AP = AQ = 23$ $BP = BR = 27$ , and $CQ = CR = x$ . Using $rs = A$ , where $s = \\frac{27 \\cdot 2 + 23 \\cdot 2 + x \\cdot 2}{2} = 50 + x$ , we get $(21)(50 + x) = A$ . By Heron's formula $A = \\sqrt{s(s-a)(s-b)(s-c)} = \\sqrt{(50+x)(x)(23)(27)}$ . Equating and squaring both sides,\n\\begin{eqnarray*} [21(50+x)]^2 &=& (50+x)(x)(621)\\\\ 441(50+x) &=& 621x\\\\ 180x = 441 \\cdot 50 &\\Longrightarrow & x = \\frac{245}{2} \\end{eqnarray*}\nWe want the perimeter, which is $2s = 2\\left(50 + \\frac{245}{2}\\right) = \\boxed{345}$",
"Let the incenter be denoted $I$ . It is commonly known that the incenter is the intersection of the angle bisectors of a triangle. So let $\\angle ABI = \\angle CBI = \\alpha, \\angle BAI = \\angle CAI = \\beta,$ and $\\angle BCI = \\angle ACI = \\gamma.$\nWe have that \\begin{eqnarray*} \\tan \\alpha & = & \\frac {21}{27} \\\\ \\tan \\beta & = & \\frac {21}{23} \\\\ \\tan \\gamma & = & \\frac {21}x. \\end{eqnarray*} So naturally we look at $\\tan \\gamma.$ But since $\\gamma = \\frac \\pi2 - (\\beta + \\alpha)$ we have \\begin{eqnarray*} \\tan \\gamma & = & \\tan\\left(\\frac \\pi2 - (\\beta + \\alpha)\\right) \\\\ & = & \\frac 1{\\tan(\\alpha + \\beta)} \\\\ \\Rightarrow \\frac {21}x & = & \\frac {1 - \\frac {21\\cdot 21}{23\\cdot 27}}{\\frac {21}{27} + \\frac {21}{23}} \\end{eqnarray*} Doing the algebra, we get $x = \\frac {245}2.$\nThe perimeter is therefore $2\\cdot\\frac {245}2 + 2\\cdot 23 + 2\\cdot 27 = \\boxed{345}.$"
] |
https://artofproblemsolving.com/wiki/index.php/1984_AIME_Problems/Problem_2 | null | 592 | The integer $n$ is the smallest positive multiple of $15$ such that every digit of $n$ is either $8$ or $0$ . Compute $\frac{n}{15}$ | [
"Any multiple of 15 is a multiple of 5 and a multiple of 3.\nAny multiple of 5 ends in 0 or 5; since $n$ only contains the digits 0 and 8, the units digit of $n$ must be 0.\nThe sum of the digits of any multiple of 3 must be divisible by 3. If $n$ has $a$ digits equal to 8, the sum of the digits of $n$ is $8a$ . For this number to be divisible by 3, $a$ must be divisible by 3. We also know that $a>0$ since $n$ is positive. Thus $n$ must have at least three copies of the digit 8.\nThe smallest number which meets these two requirements is 8880. Thus the answer is $\\frac{8880}{15} = \\boxed{592}$"
] |
https://artofproblemsolving.com/wiki/index.php/2013_AMC_12B_Problems/Problem_13 | D | 240 | The internal angles of quadrilateral $ABCD$ form an arithmetic progression. Triangles $ABD$ and $DCB$ are similar with $\angle DBA = \angle DCB$ and $\angle ADB = \angle CBD$ . Moreover, the angles in each of these two triangles also form an arithmetic progression. In degrees, what is the largest possible sum of the two largest angles of $ABCD$
$\textbf{(A)}\ 210 \qquad \textbf{(B)}\ 220 \qquad \textbf{(C)}\ 230 \qquad \textbf{(D)}\ 240 \qquad \textbf{(E)}\ 250$ | [
"Since the angles of Quadrilateral $ABCD$ form an arithmetic sequence, we can assign each angle with the value $a$ $a+d$ $a+2d$ , and $a+3d$ . Also, since these angles form an arithmetic progression, we can reason out that $(a)+(a+3d)=(a+d)+(a+2d)=180$\nFor the sake of simplicity, lets rename the angles of each similar triangle. Let $\\angle ADB = \\angle CBD = \\alpha$ $\\angle DBA = \\angle DCB = \\beta$ $\\angle CDB = \\angle BAD = \\gamma$\nNow the four angles of $ABCD$ are $\\beta$ $\\alpha + \\beta$ $\\gamma$ , and $\\alpha + \\gamma$\nAs for the similar triangles, we can name their angles $y$ $y+b$ , and $y+2b$ . Therefore $y+y+b+y+2b=180$ and $y+b=60$ . Because these 3 angles are each equal to one of $\\alpha, \\beta, \\gamma$ , we know that one of these three angles is equal to 60 degrees.\nNow we we use trial and error. Let $\\alpha = 60^{\\circ}$ . Then the angles of ABCD are $\\beta$ $60^{\\circ} + \\beta$ $\\gamma$ , and $60^{\\circ} + \\gamma$ . Since these four angles add up to 360, then $\\beta + \\gamma= 120$ . If we list them in increasing value, we get $\\beta$ $\\gamma$ $60^{\\circ} + \\beta$ $60^{\\circ} + \\gamma$ . Note that this is the only sequence that works because the common difference is less than 45. So, this would give us the four angles 45, 75, 105, and 135. In this case, $\\alpha, \\beta, \\gamma$ also form an arithmetic sequence with 45, 60, and 75, and the largest two angles of the quadrilateral add up to 240 which is an answer choice.\nIf we apply the same reasoning to $\\beta$ and $\\gamma$ , we would get the sum of the highest two angles as 220, which works but is lower than 240. Therefore, $\\boxed{240}$ is the correct answer."
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_10B_Problems/Problem_24 | A | 100 | The keystone arch is an ancient architectural feature. It is composed of congruent isosceles trapezoids fitted together along the non-parallel sides, as shown. The bottom sides of the two end trapezoids are horizontal. In an arch made with $9$ trapezoids, let $x$ be the angle measure in degrees of the larger interior angle of the trapezoid. What is $x$
[asy] unitsize(4mm); defaultpen(linewidth(.8pt)); int i; real r=5, R=6; path t=r*dir(0)--r*dir(20)--R*dir(20)--R*dir(0); for(i=0; i<9; ++i) { draw(rotate(20*i)*t); } draw((-r,0)--(R+1,0)); draw((-R,0)--(-R-1,0)); [/asy]
$\text{(A) } 100 \qquad \text{(B) } 102 \qquad \text{(C) } 104 \qquad \text{(D) } 106 \qquad \text{(E) } 108$ | [
"Extend all the legs of the trapezoids. They will all intersect in the middle of the bottom side of the picture, forming the situation shown below.\n\nEach of the angles at $X$ is $\\frac{180^\\circ}9 = 20^\\circ$ . From $\\triangle XYZ$ , the degree measure of the smaller interior angle of the trapezoid is $\\frac{180^\\circ - 20^\\circ}2 = 80^\\circ$ , hence the degree measure of the larger interior angle is $180^\\circ - 80^\\circ = \\boxed{100}$",
"A decagon can be formed from the trapezoids and the base. The sum of the decagon's angles is $180(10-2)=1440^\\circ$ . Letting the larger angle in each trapezoid be $x$ , the two angles formed by the line each measures $(180-x)^\\circ$ . There are $8$ congruent angles left. Each of those angles measures $(360-2x)^\\circ$ . Putting it all together: $8(360-2x)+2(180-x)=1440\\implies x=\\boxed{100}$",
"If we reflect the arch across the line, we form an 18-gon. $\\frac{180*(18-2)}{18} = 160^\\circ$ so each interior angle of the 18-gon is $160^\\circ$ . Let $x$ be the degree measure of the larger interior angle of a trapezoid. From the diagram, we see that $2x + 160 = 360$ , so $2x = 200$ and $x = 100$ , or $\\boxed{100}$"
] |
https://artofproblemsolving.com/wiki/index.php/1986_AJHSME_Problems/Problem_23 | B | 1 | The large circle has diameter $\text{AC}$ . The two small circles have their centers on $\text{AC}$ and just touch at $\text{O}$ , the center of the large circle. If each small circle has radius $1$ , what is the value of the ratio of the area of the shaded region to the area of one of the small circles?
[asy] pair A=(-2,0), O=origin, C=(2,0); path X=Arc(O,2,0,180), Y=Arc((-1,0),1,180,0), Z=Arc((1,0),1,180,0), M=X..Y..Z..cycle; filldraw(M, black, black); draw(reflect(A,C)*M); draw(A--C, dashed); label("A",A,W); label("C",C,E); label("O",O,SE); dot((-1,0)); dot(O); dot((1,0)); label("$1$",(-.5,0),N); label("$1$",(1.5,0),N); [/asy]
$\text{(A)}\ \text{between }\frac{1}{2}\text{ and 1} \qquad \text{(B)}\ 1 \qquad \text{(C)}\ \text{between 1 and }\frac{3}{2}$
$\text{(D)}\ \text{between }\frac{3}{2}\text{ and 2} \qquad \text{(E)}\ \text{cannot be determined from the information given}$ | [
"The small circle has radius $1$ , thus its area is $\\pi$\nThe large circle has radius $2$ , thus its area is $4\\pi$\nThe area of the semicircle above $AC$ is then $2\\pi$\nThe part that is not shaded are two small semicircles. Together, these form one small circle, hence their total area is $\\pi$ . This means that the area of the shaded part is $2\\pi-\\pi=\\pi$ . \nThis is equal to the area of a small circle, hence the correct answer is $\\boxed{1}$"
] |
https://artofproblemsolving.com/wiki/index.php/1987_AJHSME_Problems/Problem_7 | C | 20 | The large cube shown is made up of $27$ identical sized smaller cubes. For each face of the large cube, the opposite face is shaded the same way. The total number of smaller cubes that must have at least one face shaded is
$\text{(A)}\ 10 \qquad \text{(B)}\ 16 \qquad \text{(C)}\ 20 \qquad \text{(D)}\ 22 \qquad \text{(E)}\ 24$
[asy] unitsize(36); draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((3,0)--(5.2,1.4)--(5.2,4.4)--(3,3)); draw((0,3)--(2.2,4.4)--(5.2,4.4)); fill((0,0)--(0,1)--(1,1)--(1,0)--cycle,black); fill((0,2)--(0,3)--(1,3)--(1,2)--cycle,black); fill((1,1)--(1,2)--(2,2)--(2,1)--cycle,black); fill((2,0)--(3,0)--(3,1)--(2,1)--cycle,black); fill((2,2)--(3,2)--(3,3)--(2,3)--cycle,black); draw((1,3)--(3.2,4.4)); draw((2,3)--(4.2,4.4)); draw((.733333333,3.4666666666)--(3.73333333333,3.466666666666)); draw((1.466666666,3.9333333333)--(4.466666666,3.9333333333)); fill((1.73333333,3.46666666666)--(2.7333333333,3.46666666666)--(3.46666666666,3.93333333333)--(2.46666666666,3.93333333333)--cycle,black); fill((3,1)--(3.733333333333,1.466666666666)--(3.73333333333,2.46666666666)--(3,2)--cycle,black); fill((3.73333333333,.466666666666)--(4.466666666666,.93333333333)--(4.46666666666,1.93333333333)--(3.733333333333,1.46666666666)--cycle,black); fill((3.73333333333,2.466666666666)--(4.466666666666,2.93333333333)--(4.46666666666,3.93333333333)--(3.733333333333,3.46666666666)--cycle,black); fill((4.466666666666,1.9333333333333)--(5.2,2.4)--(5.2,3.4)--(4.4666666666666,2.9333333333333)--cycle,black); [/asy] | [
"Clearly, no unit cube has more than one face painted, so the number of unit cubes with at least one face painted is equal to the number of painted unit squares.\nThere are $10$ painted unit squares on the half of the cube shown, so there are $10\\cdot 2=20$ unit cubes with at least one face painted, thus our answer is $\\boxed{20}$",
"Since it says at least one, we can count the number of unpainted cubes, and subtract from 27. There is 1 inner cube, 2 center cubes (see the face with 4 blacks) and 4 edge cubes (see the top two in the center top face), so 7 unpainted. Thus $27 - 7 = 20$ our answer is $\\boxed{20}$"
] |
https://artofproblemsolving.com/wiki/index.php/1984_AHSME_Problems/Problem_5 | D | 11 | The largest integer $n$ for which $n^{200}<5^{300}$ is
$\mathrm{(A) \ }8 \qquad \mathrm{(B) \ }9 \qquad \mathrm{(C) \ } 10 \qquad \mathrm{(D) \ }11 \qquad \mathrm{(E) \ } 12$ | [
"Since both sides are positive, we can take the $100th$ root of both sides to find the largest integer $n$ such that $n^2<5^3$ . Fortunately, this is simple to evaluate: $5^3=125$ , and the largest square less than $125$ is $11^2=121$ , so the largest $n$ is $11, \\boxed{11}$"
] |
https://artofproblemsolving.com/wiki/index.php/1951_AHSME_Problems/Problem_15 | E | 6 | The largest number by which the expression $n^3 - n$ is divisible for all possible integral values of $n$ , is:
$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 6$ | [
"Factoring the polynomial gives $(n+1)(n)(n-1)$ According to the factorization, one of those factors must be a multiple of two because there are more than 2 consecutive integers. In addition, because there are three consecutive integers, one of the integers must be a multiple of 3. Therefore $6$ must divide the given expression.\nPlugging in $n=2$ yields $6$ . So the largest possibility is $6$\nClearly the answer is $\\boxed{6}$",
"In general, $r!$ $n(n+1)(n+2)...(n+r-1)$ were $r$ and $n$ are integers. So here $3!$ $n^3$ $n$ always for any integer $n$ .Hence,the correct answer is $6$ $\\boxed{6}$"
] |
https://artofproblemsolving.com/wiki/index.php/1980_AHSME_Problems/Problem_1 | C | 14 | The largest whole number such that seven times the number is less than 100 is
$\text{(A)} \ 12 \qquad \text{(B)} \ 13 \qquad \text{(C)} \ 14 \qquad \text{(D)} \ 15 \qquad \text{(E)} \ 16$ | [
"We want to find the smallest integer $x$ so that $7x < 100$ . Dividing by 7 gets $x < 14\\dfrac{2}{7}$ , so the answer is 14. $\\boxed{14}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_8_Problems/Problem_20 | A | 20 | The least common multiple of $a$ and $b$ is $12$ , and the least common multiple of $b$ and $c$ is $15$ . What is the least possible value of the least common multiple of $a$ and $c$
$\textbf{(A) }20\qquad\textbf{(B) }30\qquad\textbf{(C) }60\qquad\textbf{(D) }120\qquad \textbf{(E) }180$ | [
"We wish to find possible values of $a$ $b$ , and $c$ . By finding the greatest common factor of $12$ and $15$ , we can find that $b$ is 3. Moving on to $a$ and $c$ , in order to minimize them, we wish to find the least such that the least common multiple of $a$ and $3$ is $12$ $\\rightarrow 4$ . Similarly, with $3$ and $c$ , we obtain $5$ . The least common multiple of $4$ and $5$ is $20 \\rightarrow \\boxed{20}$"
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_10A_Problems/Problem_7 | B | 6 | The least common multiple of a positive integer $n$ and $18$ is $180$ , and the greatest common divisor of $n$ and $45$ is $15$ . What is the sum of the digits of $n$
$\textbf{(A) } 3 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 12$ | [
"Note that \\begin{align*} 18 &= 2\\cdot3^2, \\\\ 180 &= 2^2\\cdot3^2\\cdot5, \\\\ 45 &= 3^2\\cdot5 \\\\ 15 &= 3\\cdot5. \\end{align*} Let $n = 2^a\\cdot3^b\\cdot5^c.$ It follows that:\nTogether, we conclude that $n=2^2\\cdot3\\cdot5=60.$ The sum of its digits is $6+0=\\boxed{6}.$",
"The options for $\\text{lcm}(x, 18)=180$ are $20$ $60$ , and $180$ . The options for $\\text{gcd}(y, 45)=15$ are $15$ $30$ $60$ $75$ , etc. We see that $60$ appears in both lists; therefore, $6+0=\\boxed{6}$"
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_12A_Problems/Problem_4 | B | 6 | The least common multiple of a positive integer $n$ and $18$ is $180$ , and the greatest common divisor of $n$ and $45$ is $15$ . What is the sum of the digits of $n$
$\textbf{(A) } 3 \qquad \textbf{(B) } 6 \qquad \textbf{(C) } 8 \qquad \textbf{(D) } 9 \qquad \textbf{(E) } 12$ | [
"Note that \\begin{align*} 18 &= 2\\cdot3^2, \\\\ 180 &= 2^2\\cdot3^2\\cdot5, \\\\ 45 &= 3^2\\cdot5 \\\\ 15 &= 3\\cdot5. \\end{align*} Let $n = 2^a\\cdot3^b\\cdot5^c.$ It follows that:\nTogether, we conclude that $n=2^2\\cdot3\\cdot5=60.$ The sum of its digits is $6+0=\\boxed{6}.$",
"The options for $\\text{lcm}(x, 18)=180$ are $20$ $60$ , and $180$ . The options for $\\text{gcd}(y, 45)=15$ are $15$ $30$ $60$ $75$ , etc. We see that $60$ appears in both lists; therefore, $6+0=\\boxed{6}$"
] |
https://artofproblemsolving.com/wiki/index.php/2021_Fall_AMC_10B_Problems/Problem_6 | B | 58 | The least positive integer with exactly $2021$ distinct positive divisors can be written in the form $m \cdot 6^k$ , where $m$ and $k$ are integers and $6$ is not a divisor of $m$ . What is $m+k?$
$(\textbf{A})\: 47\qquad(\textbf{B}) \: 58\qquad(\textbf{C}) \: 59\qquad(\textbf{D}) \: 88\qquad(\textbf{E}) \: 90$ | [
"Let this positive integer be written as $p_1^{e_1}\\cdot p_2^{e_2}$ . The number of factors of this number is therefore $(e_1+1) \\cdot (e_2+1)$ , and this must equal 2021. The prime factorization of 2021 is $43 \\cdot 47$ , so $e_1+1 = 43 \\implies e_1=42$ and $e_2+1=47\\implies e_2=46$ . To minimize this integer, we set $p_1 = 3$ and $p_2 = 2$ . Then this integer is $3^{42} \\cdot 2^{46} = 2^4 \\cdot 2^{42} \\cdot 3^{42} = 16 \\cdot 6^{42}$ .\nNow $m=16$ and $k=42$ so $m+k = 16 + 42 = \\boxed{58}$",
"Recall that $6^k$ can be written as $2^k \\cdot 3^k$ . Since we want the integer to have $2021$ divisors, we must have it in the form $p_1^{42} \\cdot p_2^{46}$ , where $p_1$ and $p_2$ are prime numbers. Therefore, we want $p_1$ to be $3$ and $p_2$ to be $2$ . To make up the remaining $2^4$ , we multiply $2^{42} \\cdot 3^{42}$ by $m$ , which is $2^4$ which is $16$ . Therefore, we have $42 + 16 = \\boxed{58}$",
"If a number has prime factorization $p_1^{k_1} p_2^{k_2} \\cdots p_m^{k_m}$ , then the number of distinct positive divisors of this number is $\\left( k_1 + 1 \\right) \\left( k_2 + 1 \\right) \\cdots \\left( k_m + 1 \\right)$\nWe have $2021 = 43 \\cdot 47$ .\nHence, if a number $N$ has 2021 distinct positive divisors, then $N$ takes one of the following forms: $p_1^{2020}$ $p_1^{42} p_2^{46}$\nTherefore, the smallest $N$ is $3^{42} 2^{46} = 2^4 \\cdot 6^{42} = 16 \\cdot 6^{42}$\nTherefore, the answer is $\\boxed{58}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_8_Problems/Problem_8 | B | 99 | The length of a rectangle is increased by $10\%$ percent and the width is decreased by $10\%$ percent. What percent of the old area is the new area?
$\textbf{(A)}\ 90 \qquad \textbf{(B)}\ 99 \qquad \textbf{(C)}\ 100 \qquad \textbf{(D)}\ 101 \qquad \textbf{(E)}\ 110$ | [
"In a rectangle with dimensions $10 \\times 10$ , the new rectangle would have dimensions $11 \\times 9$ . The ratio of the new area to the old area is $99/100 = \\boxed{99}$"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_10A_Problems/Problem_11 | D | 20 | The length of the interval of solutions of the inequality $a \le 2x + 3 \le b$ is $10$ . What is $b - a$
$\mathrm{(A)}\ 6 \qquad \mathrm{(B)}\ 10 \qquad \mathrm{(C)}\ 15 \qquad \mathrm{(D)}\ 20 \qquad \mathrm{(E)}\ 30$ | [
"Since we are given the range of the solutions, we must re-write the inequalities so that we have $x$ in terms of $a$ and $b$\n$a\\le 2x+3\\le b$\nSubtract $3$ from all of the quantities:\n$a-3\\le 2x\\le b-3$\nDivide all of the quantities by $2$\n$\\frac{a-3}{2}\\le x\\le \\frac{b-3}{2}$\nSince we have the range of the solutions, we can make it equal to $10$\n$\\frac{b-3}{2}-\\frac{a-3}{2} = 10$\nMultiply both sides by 2.\n$(b-3) - (a-3) = 20$\nRe-write without using parentheses.\n$b-3-a+3 = 20$\nSimplify.\n$b-a = 20$\nWe need to find $b - a$ for the problem, so the answer is $\\boxed{20}$",
"Without loss of generality , let the interval of solutions be $[0, 10]$ (or any real values $[p, 10+p]$ ). Then, substitute $0$ and $10$ to $x$ . This gives $b=23$ and $a=3$ . So, the answer is $23-3=\\boxed{20}$ .\n~ bearjere"
] |
https://artofproblemsolving.com/wiki/index.php/1963_AHSME_Problems/Problem_35 | B | 10 | The lengths of the sides of a triangle are integers, and its area is also an integer.
One side is $21$ and the perimeter is $48$ . The shortest side is:
$\textbf{(A)}\ 8 \qquad \textbf{(B)}\ 10\qquad \textbf{(C)}\ 12 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 16$ | [
"Let $b$ and $c$ be the other two sides of the triangle. The perimeter of the triangle is $48$ units, so $c = 27-b$ and the semiperimeter equals $24$ units.\nBy Heron's Formula , the area of the triangle is $\\sqrt{24 \\cdot 3(24-b)(b-3)}$ . Plug in the answer choices for $b$ and write the prime factorization of the product to make sure it is a perfect square.\nTesting $b = 8$ results in the area being $\\sqrt{6 \\cdot 4 \\cdot 3 \\cdot 16 \\cdot 5} = \\sqrt{2^7 \\cdot 3^2 \\cdot 5}$ , so $8$ does not work. However, testing $b = 10$ results in the area being $\\sqrt{6 \\cdot 4 \\cdot 3 \\cdot 14 \\cdot 7} = \\sqrt{2^4 \\cdot 3^2 \\cdot 7^2}$ , so $10$ works. The third side is $17$ , and the sides satisfy the Triangle Inequality , so the answer is $\\boxed{10}$"
] |
https://artofproblemsolving.com/wiki/index.php/2010_AMC_8_Problems/Problem_13 | E | 11 | The lengths of the sides of a triangle in inches are three consecutive integers. The length of the shortest side is $30\%$ of the perimeter. What is the length of the longest side?
$\textbf{(A)}\ 7 \qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$ | [
"Let $n$ $n+1$ , and $n+2$ be the lengths of the sides of the triangle. Then the perimeter of the triangle is $n + (n+1) + (n+2) = 3n+3$ . Using the fact that the length of the smallest side is $30\\%$ of the perimeter, it follows that:\n$n = 0.3(3n+3) \\Rightarrow n = 0.9n+0.9 \\Rightarrow 0.1n = 0.9 \\Rightarrow n=9$ . The longest side is then $n+2 = 11$ . Thus, answer choice $\\boxed{11}$ is correct.",
"Since the length of the shortest side is a whole number and is equal to $\\frac{3}{10}$ of the perimeter, it follows that the perimeter must be a multiple of $10$ . Adding the two previous integers to each answer choice, we see that $11+10+9=30$ . Thus, answer choice $\\boxed{11}$ is correct."
] |
https://artofproblemsolving.com/wiki/index.php/2006_AIME_II_Problems/Problem_2 | null | 893 | The lengths of the sides of a triangle with positive area are $\log_{10} 12$ $\log_{10} 75$ , and $\log_{10} n$ , where $n$ is a positive integer. Find the number of possible values for $n$ | [
"By the Triangle Inequality and applying the well-known logarithmic property $\\log_{c} a + \\log_{c} b = \\log_{c} ab$ , we have that\nAlso,\nCombining these two inequalities:\n\\[6.25 < n < 900\\]\nThus $n$ is in the set $(6.25 , 900)$ ; the number of positive integer $n$ which satisfies this requirement is $\\boxed{893}$"
] |
https://artofproblemsolving.com/wiki/index.php/1953_AHSME_Problems/Problem_45 | E | 2 | The lengths of two line segments are $a$ units and $b$ units respectively. Then the correct relation between them is:
$\textbf{(A)}\ \frac{a+b}{2} > \sqrt{ab} \qquad \textbf{(B)}\ \frac{a+b}{2} < \sqrt{ab} \qquad \textbf{(C)}\ \frac{a+b}{2}=\sqrt{ab}\\ \textbf{(D)}\ \frac{a+b}{2}\leq\sqrt{ab}\qquad \textbf{(E)}\ \frac{a+b}{2}\geq\sqrt{ab}$ | [
"Since both lengths are positive, the AM-GM Inequality is satisfied. The correct relationship between $a$ and $b$ is $\\boxed{2}$"
] |
https://artofproblemsolving.com/wiki/index.php/2006_AMC_8_Problems/Problem_6 | C | 20 | The letter T is formed by placing two $2 \times 4$ inch rectangles next to each other, as shown. What is the perimeter of the T, in inches?
[asy] size(150); draw((0,6)--(4,6)--(4,4)--(3,4)--(3,0)--(1,0)--(1,4)--(0,4)--cycle, linewidth(1));[/asy]
$\textbf{(A)}\ 12\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 24$ | [
"If the two rectangles were seperate, the perimeter would be $2(2(2+4)=24$ . It easy to see that their connection erases 2 from each of the rectangles, so the final perimeter is $24-2 \\times 2 = \\boxed{20}$"
] |
https://artofproblemsolving.com/wiki/index.php/2009_AMC_8_Problems/Problem_24 | E | 9 | The letters $A$ $B$ $C$ and $D$ represent digits. If $\begin{tabular}{ccc}&A&B\\ +&C&A\\ \hline &D&A\end{tabular}$ and $\begin{tabular}{ccc}&A&B\\ -&C&A\\ \hline &&A\end{tabular}$ ,what digit does $D$ represent?
$\textbf{(A)}\ 5\qquad\textbf{(B)}\ 6\qquad\textbf{(C)}\ 7\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 9$ | [
"Because $B+A=A$ $B$ must be $0$ .\nNext, because $B-A=A\\implies0-A=A,$ we get $A=5$ as the \"0\" mentioned above is actually 10 in this case.\nNow we can rewrite $\\begin{tabular}{ccc}&A&0\\\\ +&C&A\\\\ \\hline &D&A\\end{tabular}$ as $\\begin{tabular}{ccc}&5&0\\\\ +&C&5\\\\ \\hline &D&5\\end{tabular}$ . Therefore, $D=5+C$\nFinally, $A-1-C=0\\implies{A=C+1}\\implies{C=4}$ , So we have $D=5+C\\implies{D=5+4}=\\boxed{9}$"
] |
https://artofproblemsolving.com/wiki/index.php/1989_AJHSME_Problems/Problem_22 | C | 12 | The letters $\text{A}$ $\text{J}$ $\text{H}$ $\text{S}$ $\text{M}$ $\text{E}$ and the digits $1$ $9$ $8$ $9$ are "cycled" separately as follows and put together in a numbered list:
\[\begin{tabular}[t]{lccc} & & AJHSME & 1989 \\ & & & \\ 1. & & JHSMEA & 9891 \\ 2. & & HSMEAJ & 8919 \\ 3. & & SMEAJH & 9198 \\ & & ........ & \end{tabular}\]
What is the number of the line on which $\text{AJHSME 1989}$ will appear for the first time?
$\text{(A)}\ 6 \qquad \text{(B)}\ 10 \qquad \text{(C)}\ 12 \qquad \text{(D)}\ 18 \qquad \text{(E)}\ 24$ | [
"Every $4\\text{th}$ line has $1989$ as part of it and every $6\\text{th}$ line has $\\text{AJHSME}$ as part of it. In order for both to be part of line $n$ $n$ must be a multiple of $4$ and $6$ , the least of which is $\\text{lcm}(4,6)=12\\rightarrow \\boxed{12}$"
] |
https://artofproblemsolving.com/wiki/index.php/1950_AHSME_Problems/Problem_40 | D | 2 | The limit of $\frac {x^2-1}{x-1}$ as $x$ approaches $1$ as a limit is:
$\textbf{(A)}\ 0 \qquad \textbf{(B)}\ \text{Indeterminate} \qquad \textbf{(C)}\ x-1 \qquad \textbf{(D)}\ 2 \qquad \textbf{(E)}\ 1$ | [
"Both $x^2-1$ and $x-1$ approach 0 as $x$ approaches $1$ , using the L'Hôpital's rule, we have $\\lim \\limits_{x\\to 1}\\frac{x^2-1}{x-1} = \\lim \\limits_{x\\to 1}\\frac{2x}{1} = 2$ .\nThus, the answer is $\\boxed{2}$",
"The numerator of $\\frac {x^2-1}{x-1}$ can be factored as $(x+1)(x-1)$ . The $x-1$ terms in the numerator and denominator cancel, so the expression is equal to $x+1$ so long as $x$ does not equal $1$ . Looking at the function's behavior near 1, we see that as $x$ approaches one, the expression approaches $\\boxed{2}$"
] |
https://artofproblemsolving.com/wiki/index.php/2023_AMC_10A_Problems/Problem_19 | E | 1 | The line segment formed by $A(1, 2)$ and $B(3, 3)$ is rotated to the line segment formed by $A'(3, 1)$ and $B'(4, 3)$ about the point $P(r, s)$ . What is $|r-s|$
$\textbf{(A) } \frac{1}{4} \qquad \textbf{(B) } \frac{1}{2} \qquad \textbf{(C) } \frac{3}{4} \qquad \textbf{(D) } \frac{2}{3} \qquad \textbf{(E) } 1$ | [
"Due to rotations preserving an equal distance, we can bash the answer with the distance formula. $D(A, P) = D(A', P)$ , and $D(B, P) = D(B',P)$ .\nThus we will square our equations to yield: $(1-r)^2+(2-s)^2=(3-r)^2+(1-s)^2$ , and $(3-r)^2+(3-s)^2=(4-r)^2+(3-s)^2$ .\nCanceling $(3-s)^2$ from the second equation makes it clear that $r$ equals $3.5$\nSubstituting will yield\n\\begin{align*}(2.5)^2+(2-s)^2 &= (-0.5)^2+(1-s)^2 \\\\ 6.25+4-4s+s^2 &= 0.25+1-2s+s^2 \\\\ 2s &= 9 \\\\ s &=4.5 \\\\ \\end{align*}\nNow $|r-s| = |3.5-4.5| = \\boxed{1}$",
"Due to rotations preserving distance, we have that $BP = B^\\prime P$ , as well as $AP = A^\\prime P$ . From here, we can see that P must be on the perpendicular bisector of $\\overline{BB^\\prime}$ due to the property of perpendicular bisectors keeping the distance to two points constant.\nFrom here, we proceed to find the perpendicular bisector of $\\overline{BB^\\prime}$ . We can see that this is just a horizontal line segment with midpoint at $(3.5, 3)$ . This means that the equation of the perpendicular bisector is $x = 3.5$\nSimilarly, we find the perpendicular bisector of $\\overline{AA^\\prime}$ . We find the slope to be $\\frac{1-2}{3-1} = -\\frac12$ , so our new slope will be $2$ . The midpoint of $A$ and $A^\\prime$ is $(2, \\frac32)$ , which we can use with our slope to get another equation of $y = 2x - \\frac52$\nNow, point P has to lie on both of these perpendicular bisectors, meaning that it has to satisfy both equations. Plugging in the value of $x$ we found earlier, we find that $y=4.5$ . This means that $|r - s| = |3.5 - 4.5| = \\boxed{1}$",
"To find the center of rotation, we find the intersection point of the perpendicular bisectors of $\\overline{AA^\\prime}$ and $\\overline{BB^\\prime}$\nWe can find that the equation of the line $\\overline{AA^\\prime}$ is $y = -\\frac{1}{2}x + \\frac{5}{2}$ , and that the equation of the line $\\overline{BB^\\prime}$ is $y = 3$\nWhen we solve for the perpendicular bisector of $y = -\\frac{1}{2}x + \\frac{5}{2}$ , we determine that it has a slope of 2, and it runs through $(2, 1.5)$ . Plugging in $1.5 = 2(2)-n$ , we get than $n = \\frac{5}{2}$ . Therefore our perpendicular bisector is $y=2x-\\frac{5}{2}$ . Next, we solve for the perpendicular of $y = 3$ . We know that it has an undefined slope, and it runs through $(3.5, 3)$ . We can determine that our second perpendicular bisector is $x = 3.5$\nSetting the equations equal to each other, we get $2x-\\frac{5}{2} = 3.5$ . Solving for x, we get that $x = \\frac{9}{2}$ . Therefore, $|r - s| = |3.5 - 4.5| = \\boxed{1}$",
"We use the complex numbers approach to solve this problem.\nDenote by $\\theta$ the angle that $AB$ rotates about $P$ in the counterclockwise direction.\nThus, $A' - P = e^{i \\theta} \\left( A - P \\right)$ and $B' - P = e^{i \\theta} \\left( B - P \\right)$\nTaking ratio of these two equations, we get \\[ \\frac{A' - P}{A - P} = \\frac{B' - P}{B - P} . \\]\nBy solving this equation, we get $P = \\frac{7}{2} + i \\frac{9}{2}$ .\nTherefore, $|s-t| = \\left| \\frac{7}{2} - \\frac{9}{2} \\right| = \\boxed{1}$"
] |
https://artofproblemsolving.com/wiki/index.php/2017_AMC_10B_Problems/Problem_10 | E | 13 | The lines with equations $ax-2y=c$ and $2x+by=-c$ are perpendicular and intersect at $(1, -5)$ . What is $c$
$\textbf{(A)}\ -13\qquad\textbf{(B)}\ -8\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ 8\qquad\textbf{(E)}\ 13$ | [
"Writing each equation in slope-intercept form, we get $y=\\frac{a}{2}x-\\frac{1}{2}c$ and $y=-\\frac{2}{b}x-\\frac{c}{b}$ . We observe the slope of each equation is $\\frac{a}{2}$ and $-\\frac{2}{b}$ , respectively. Because the slope of a line perpendicular to a line with slope $m$ is $-\\frac{1}{m}$ , we see that $\\frac{a}{2}=-\\frac{1}{-\\frac{2}{b}}$ because it is given that the two lines are perpendicular. This equation simplifies to $a=b$\nBecause $(1, -5)$ is a solution of both equations, we deduce $a \\times 1-2 \\times -5=c$ and $2 \\times 1+b \\times -5=-c$ . Because we know that $a=b$ , the equations reduce to $a+10=c$ and $2-5a=-c$ . Solving this system of equations, we get $c=\\boxed{13}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_8_Problems/Problem_1 | C | 665 | The longest professional tennis match ever played lasted a total of $11$ hours and $5$ minutes. How many minutes was this?
$\textbf{(A) }605\qquad\textbf{(B) }655\qquad\textbf{(C) }665\qquad\textbf{(D) }1005\qquad \textbf{(E) }1105$ | [
"It is best to split 11 hours and 5 minutes into 2 parts, one of 11 hours and another of 5 minutes. We know that there is $60$ minutes in a hour. Therefore, there are $11 \\cdot 60 = 660$ minutes in 11 hours. Adding the second part(the 5 minutes) we get $660 + 5 = \\boxed{665}$",
"The best method comes when you remember your multiplication tables. Thus trivial, we get our answer of $\\boxed{665}$",
"11 hours 5 min = $(11 \\cdot 60) + 5 \\text{min} = 665 \\text{min}$ , therefore $\\boxed{665}$"
] |
https://artofproblemsolving.com/wiki/index.php/1996_AJHSME_Problems/Problem_23 | E | 995 | The manager of a company planned to distribute a $$50$ bonus to each employee from the company fund, but the fund contained $$5$ less than what was needed. Instead the manager gave each employee a $$45$ bonus and kept the remaining $$95$ in the company fund. The amount of money in the company fund before any bonuses were paid was
$\text{(A)}\ 945\text{ dollars} \qquad \text{(B)}\ 950\text{ dollars} \qquad \text{(C)}\ 955\text{ dollars} \qquad \text{(D)}\ 990\text{ dollars} \qquad \text{(E)}\ 995\text{ dollars}$ | [
"Let $p$ be the number of people in the company, and $f$ be the amount of money in the fund.\nThe first sentence states that $50p = f + 5$\nThe second sentence states that $45p = f - 95$\nSubtracing the second equation from the first, we get $5p = 100$ , leading to $p = 20$\nPlugging that number into the first equation gives $50\\cdot 20 = f + 5$ , leading to $f = 995$ , which is answer $\\boxed{995}$",
"Since the company must employ a whole number of employees, the amount of money in the fund must be $5$ dollars less than a multiple of $50$ . Only options $A$ and $E$ satisfy that requirement.\nAdditionally, the number must be $95$ more than a multiple of $45$ . Since $45 \\cdot 20 = 900$ , the only number that is $95$ more than a multiple of $45$ out of options $A$ and $E$ is option $\\boxed{995}$"
] |
https://artofproblemsolving.com/wiki/index.php/1999_AHSME_Problems/Problem_5 | C | 35 | The marked price of a book was 30% less than the suggested retail price. Alice purchased the book for half the marked price at a Fiftieth Anniversary sale. What percent of the suggested retail price did Alice pay?
$\mathrm{(A)\ }25\%\qquad\mathrm{(B)\ }30\%\qquad\mathrm{(C)\ }35\%\qquad\mathrm{(D)\ }60\%\qquad\mathrm{(E)\ }65\%$ | [
"Without loss of generality, let's assume that the retail price was $100$ USD.\nThe marked price of the book is $30 \\%$ off of $100$ which is equal to $100-100(0.3)=70.$\nHalf of that marked price is $0.5(70)=35.$\nTherefore the percent Alice payed of the suggested retail price is $35/100=\\boxed{35}.$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_10B_Problems/Problem_5 | null | 22 | The mean age of Amanda's $4$ cousins is $8$ , and their median age is $5$ . What is the sum of the ages of Amanda's youngest and oldest cousins?
$\textbf{(A)}\ 13\qquad\textbf{(B)}\ 16\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 25$ | [
"The sum of the ages of the cousins is $4$ times the mean, or $32$ .\nThere are an even number of cousins, so there is no single median, so $5$ must be the mean of the two in the middle.\nTherefore the sum of the ages of the two in the middle is $10$ . Subtracting $10$ from $32$ produces $\\textbf{(D)}\\ \\boxed{22}$"
] |
https://artofproblemsolving.com/wiki/index.php/2001_AMC_8_Problems/Problem_21 | D | 35 | The mean of a set of five different positive integers is 15. The median is 18. The maximum possible value of the largest of these five integers is
$\text{(A)}\ 19 \qquad \text{(B)}\ 24 \qquad \text{(C)}\ 32 \qquad \text{(D)}\ 35 \qquad \text{(E)}\ 40$ | [
"Since there is an odd number of terms, the median is the number in the middle, specifically, the third largest number is $18$ , and there are $2$ numbers less than $18$ and $2$ numbers greater than $18$ . The sum of these integers is $5(15)=75$ , since the mean is $15$ . To make the largest possible number with a given sum, the other numbers must be as small as possible. The two numbers less than $18$ must be positive and distinct, so the smallest possible numbers for these are $1$ and $2$ . The number right after $18$ also needs to be as small as possible, so it must be $19$ . This means that the remaining number, the maximum possible value for a number in the set, is $75-1-2-18-19=35, \\boxed{35}$"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_10A_Problems/Problem_7 | D | 90 | The mean, median, and mode of the $7$ data values $60, 100, x, 40, 50, 200, 90$ are all equal to $x$ . What is the value of $x$
$\textbf{(A)}\ 50 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 75 \qquad\textbf{(D)}\ 90 \qquad\textbf{(E)}\ 100$ | [
"Since $x$ is the mean, \\begin{align*} x&=\\frac{60+100+x+40+50+200+90}{7}\\\\ &=\\frac{540+x}{7}. \\end{align*}\nTherefore, $7x=540+x$ , so $x=\\boxed{90}.$",
"Note that $x$ must be the median so it must equal either $60$ or $90$ . You can see that the mean is also $x$ , and by intuition $x$ should be the greater one. $x=\\boxed{90}.$ ~bjc"
] |
https://artofproblemsolving.com/wiki/index.php/2016_AMC_12A_Problems/Problem_4 | D | 90 | The mean, median, and mode of the $7$ data values $60, 100, x, 40, 50, 200, 90$ are all equal to $x$ . What is the value of $x$
$\textbf{(A)}\ 50 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 75 \qquad\textbf{(D)}\ 90 \qquad\textbf{(E)}\ 100$ | [
"Since $x$ is the mean, \\begin{align*} x&=\\frac{60+100+x+40+50+200+90}{7}\\\\ &=\\frac{540+x}{7}. \\end{align*}\nTherefore, $7x=540+x$ , so $x=\\boxed{90}.$",
"Note that $x$ must be the median so it must equal either $60$ or $90$ . You can see that the mean is also $x$ , and by intuition $x$ should be the greater one. $x=\\boxed{90}.$ ~bjc"
] |
https://artofproblemsolving.com/wiki/index.php/2012_AMC_8_Problems/Problem_11 | D | 11 | The mean, median, and unique mode of the positive integers 3, 4, 5, 6, 6, 7, and $x$ are all equal. What is the value of $x$
$\textbf{(A)}\hspace{.05in}5\qquad\textbf{(B)}\hspace{.05in}6\qquad\textbf{(C)}\hspace{.05in}7\qquad\textbf{(D)}\hspace{.05in}11\qquad\textbf{(E)}\hspace{.05in}12$ | [
"We can eliminate answer choices ${\\textbf{(A)}\\ 5}$ and ${\\textbf{(C)}\\ 7}$ , because of the above statement. Now we need to test the remaining answer choices.\nCase 1: $x = 6$\nMode: $6$\nMedian: $6$\nMean: $\\frac{37}{7}$\nSince the mean does not equal the median or mode, ${\\textbf{(B)}\\ 6}$ can also be eliminated.\nCase 2: $x = 11$\nMode: $6$\nMedian: $6$\nMean: $6$\nWe are done with this problem, because we have found when $x = 11$ , the condition is satisfied. Therefore, the answer is $\\boxed{11}$",
"Notice that the mean of this set of numbers, in terms of $x$ , is:\n$\\frac{3+4+5+6+6+7+x}{7} = \\frac{31+x}{7}$\nBecause we know that the mode must be $6$ (it can't be any of the numbers already listed, as shown above, and no matter what $x$ is, either $6$ or a new number, it will not affect $6$ being the mode), and we know that the mode must equal the mean, we can set the expression for the mean and $6$ equal:\n\\[\\dfrac{31+x}{7}=6\\] \\[31+x=42\\] \\[x=\\boxed{11}\\]",
"We know the unique mode must be $6$ , so the mean must be the same number $6$ . Let's imagine a scale. $6$ exactly stands the mid-point of the scale. Numbers of $3,4,5$ represent the left side \"weights\" of the scale. Numbers of $6,7, x$ represent the right side \"weights\" of the scale. On the left side, the difference of the three \"weights\" between $6$ are $-3, -2, -1$ , respectively. It gives us the total difference is $-6$ . In order to allow the scale to keep balance, on the right side, the total difference must be $+6$ . Because we have already known the difference of the right side \"weights\" between $6$ is $0+1=1$ , partially, so the difference between $6$ and unknown $x$ must be $+6-1=+5$ . It exactly gives us the answer: $x=6+5= \\boxed{11}$ . ---LarryFlora"
] |
https://artofproblemsolving.com/wiki/index.php/2002_AMC_10A_Problems/Problem_21 | D | 14 | The mean, median, unique mode, and range of a collection of eight integers are all equal to 8. The largest integer that can be an element of this collection is
$\text{(A) }11 \qquad \text{(B) }12 \qquad \text{(C) }13 \qquad \text{(D) }14 \qquad \text{(E) }15$ | [
"As the unique mode is $8$ , there are at least two $8$ s.\nAs the range is $8$ and one of the numbers is $8$ , the largest one can be at most $16$\nIf the largest one is $16$ , then the smallest one is $8$ , and thus the mean is strictly larger than $8$ , which is a contradiction.\nIf we have 2 8's we can add find the numbers 4, 6, 7, 8, 8, 9, 10, 12.\nThis is a possible solution but has not reached the maximum.\nIf we have 4 8's we can find the numbers 6, 6, 6, 8, 8, 8, 8, 14.\nWe can also see that they satisfy the need for the mode, median, and range to be 8. This means that the answer will be $\\boxed{14}$ . ~By QWERTYUIOPASDFGHJKLZXCVBNM",
"We could express this collection as integers $a\\textsubscript{1}$ through $a\\textsubscript{8}$ , with $a\\textsubscript{1}$ being the smallest and $a\\textsubscript{8}$ being the largest.\nSince the mean is $8$ , we know that $a\\textsubscript{4}$ and $a\\textsubscript{5}$ must also be $8$ . If they were not, the other numbers, which are lesser and greater than $a\\textsubscript{4}$ and $a\\textsubscript{5}$ respectively, would not be able to satisfy the condition that $8$ is the mode.\nThere are $8$ terms and the mean is $8$ . This tells us that the sum of all the numbers is $64$\nWe want to maximize the value of $a\\textsubscript{8}$ , so we set $a\\textsubscript{6}$ and $a\\textsubscript{7}$ to $8$ as well.\nKnowing that we want to minimize numbers and that the range is $8$ , we set $a\\textsubscript{1}$ $a\\textsubscript{2}$ , and $a\\textsubscript{3}$ equal to $a\\textsubscript{8} - 8$\n$a\\textsubscript{1}$ $a\\textsubscript{2}$ $a\\textsubscript{3}$ $a\\textsubscript{4}$ $a\\textsubscript{5}$ $a\\textsubscript{6}$ $a\\textsubscript{7}$ $a\\textsubscript{8}$ $=$ $a\\textsubscript{8} - 8$ $a\\textsubscript{8} - 8$ $a\\textsubscript{8} - 8$ $8$ $8$ $8$ $8$ $a\\textsubscript{8}$\nLetting the sum of all the numbers be $64$ , we find that $32 + 4a_8 - 24 = 64$ , which simplifies to $4a_8 = 56$ . Solving, we get $\\boxed{14}$ . ~By SK80, mod_x for minor edits"
] |
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12A_Problems/Problem_15 | D | 14 | The mean, median, unique mode, and range of a collection of eight integers are all equal to 8. The largest integer that can be an element of this collection is
$\text{(A) }11 \qquad \text{(B) }12 \qquad \text{(C) }13 \qquad \text{(D) }14 \qquad \text{(E) }15$ | [
"As the unique mode is $8$ , there are at least two $8$ s.\nAs the range is $8$ and one of the numbers is $8$ , the largest one can be at most $16$\nIf the largest one is $16$ , then the smallest one is $8$ , and thus the mean is strictly larger than $8$ , which is a contradiction.\nIf we have 2 8's we can add find the numbers 4, 6, 7, 8, 8, 9, 10, 12.\nThis is a possible solution but has not reached the maximum.\nIf we have 4 8's we can find the numbers 6, 6, 6, 8, 8, 8, 8, 14.\nWe can also see that they satisfy the need for the mode, median, and range to be 8. This means that the answer will be $\\boxed{14}$ . ~By QWERTYUIOPASDFGHJKLZXCVBNM",
"We could express this collection as integers $a\\textsubscript{1}$ through $a\\textsubscript{8}$ , with $a\\textsubscript{1}$ being the smallest and $a\\textsubscript{8}$ being the largest.\nSince the mean is $8$ , we know that $a\\textsubscript{4}$ and $a\\textsubscript{5}$ must also be $8$ . If they were not, the other numbers, which are lesser and greater than $a\\textsubscript{4}$ and $a\\textsubscript{5}$ respectively, would not be able to satisfy the condition that $8$ is the mode.\nThere are $8$ terms and the mean is $8$ . This tells us that the sum of all the numbers is $64$\nWe want to maximize the value of $a\\textsubscript{8}$ , so we set $a\\textsubscript{6}$ and $a\\textsubscript{7}$ to $8$ as well.\nKnowing that we want to minimize numbers and that the range is $8$ , we set $a\\textsubscript{1}$ $a\\textsubscript{2}$ , and $a\\textsubscript{3}$ equal to $a\\textsubscript{8} - 8$\n$a\\textsubscript{1}$ $a\\textsubscript{2}$ $a\\textsubscript{3}$ $a\\textsubscript{4}$ $a\\textsubscript{5}$ $a\\textsubscript{6}$ $a\\textsubscript{7}$ $a\\textsubscript{8}$ $=$ $a\\textsubscript{8} - 8$ $a\\textsubscript{8} - 8$ $a\\textsubscript{8} - 8$ $8$ $8$ $8$ $8$ $a\\textsubscript{8}$\nLetting the sum of all the numbers be $64$ , we find that $32 + 4a_8 - 24 = 64$ , which simplifies to $4a_8 = 56$ . Solving, we get $\\boxed{14}$ . ~By SK80, mod_x for minor edits"
] |
https://artofproblemsolving.com/wiki/index.php/1996_AJHSME_Problems/Problem_24 | C | 115 | The measure of angle $ABC$ is $50^\circ$ $\overline{AD}$ bisects angle $BAC$ , and $\overline{DC}$ bisects angle $BCA$ . The measure of angle $ADC$ is
[asy] pair A,B,C,D; A = (0,0); B = (9,10); C = (10,0); D = (6.66,3); dot(A); dot(B); dot(C); dot(D); draw(A--B--C--cycle); draw(A--D--C); label("$A$",A,SW); label("$B$",B,N); label("$C$",C,SE); label("$D$",D,N); label("$50^\circ $",(9.4,8.8),SW); [/asy]
$\text{(A)}\ 90^\circ \qquad \text{(B)}\ 100^\circ \qquad \text{(C)}\ 115^\circ \qquad \text{(D)}\ 122.5^\circ \qquad \text{(E)}\ 125^\circ$ | [
"Let $\\angle CAD = \\angle BAD = x$ , and let $\\angle ACD = \\angle BCD = y$\nFrom $\\triangle ABC$ , we know that $50 + 2x + 2y = 180$ , leading to $x + y = 65$\nFrom $\\triangle ADC$ , we know that $x + y + \\angle D = 180$ . Plugging in $x + y = 65$ , we get $\\angle D = 180 - 65 = 115$ , which is answer $\\boxed{115}$"
] |
https://artofproblemsolving.com/wiki/index.php/1976_AHSME_Problems/Problem_14 | A | 6 | The measures of the interior angles of a convex polygon are in arithmetic progression.
If the smallest angle is $100^\circ$ , and the largest is $140^\circ$ , then the number of sides the polygon has is
$\textbf{(A) }6\qquad \textbf{(B) }8\qquad \textbf{(C) }10\qquad \textbf{(D) }11\qquad \textbf{(E) }12$ | [
"Let $n$ equal the number of sides the polygon has. The sum of all the interior angles of a polygon is: $180(n-2)$\nThe formula for an arithmetic series is $\\frac{n(a_1 + a_n)}{2}$ . Set this equal to $180(n-2)$ and solve. In this case, $a_1=100$ and $a_n=140$\nOur equation becomes $\\frac{n(100+140)}{2} = 180(n-2) \\Rightarrow 240n = 360(n-2) \\Rightarrow 120n = 720$\nSimplifying, we get $n = \\boxed{6}$ jiang147369"
] |
https://artofproblemsolving.com/wiki/index.php/1968_AHSME_Problems/Problem_20 | null | 9 | The measures of the interior angles of a convex polygon of $n$ sides are in arithmetic progression. If the common difference is $5^{\circ}$ and the largest angle is $160^{\circ}$ , then $n$ equals:
$\text{(A) } 9\quad \text{(B) } 10\quad \text{(C) } 12\quad \text{(D) } 16\quad \text{(E) } 32$ | [
"The formula for the sum of the angles in any polygon is $180(n-2)$ . Because this particular polygon is convex and has its angles in an arithmetic sequence with its largest angle being $160$ , we can find the sum of the angles.\n$a_{n}=160$\n$a_{1}=160-5(n-1)$\nPlugging this into the formula for finding the sum of an arithmetic sequence...\n$n(\\frac{160+160-5(n-1)}{2})=180(n-2)$\nSimplifying, we get $n^2+7n-144$\nSince we want the positive solution to the quadratic, we can easily factor and find the answer is $n=\\boxed{9}$"
] |
https://artofproblemsolving.com/wiki/index.php/2001_AMC_10_Problems/Problem_1 | E | 11 | The median of the list $n, n + 3, n + 4, n + 5, n + 6, n + 8, n + 10, n + 12, n + 15$ is $10$ . What is the mean?
$\textbf{(A) }4\qquad\textbf{(B) }6\qquad\textbf{(C) }7\qquad\textbf{(D) }10\qquad\textbf{(E) }11$ | [
"The median of the list is $10$ , and there are $9$ numbers in the list, so the median must be the 5th number from the left, which is $n+6$\nWe substitute the median for $10$ and the equation becomes $n+6=10$\nSubtract both sides by 6 and we get $n=4$\n$n+n+3+n+4+n+5+n+6+n+8+n+10+n+12+n+15=9n+63$\nThe mean of those numbers is $\\frac{9n+63}{9}$ which is $n+7$\nSubstitute $n$ for $4$ and $4+7=\\boxed{11}$"
] |
https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_12 | null | 134 | The members of a distinguished committee were choosing a president, and each member gave one vote to one of the 27 candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least 1 than the number of votes for that candidate. What was the smallest possible number of members of the committee? | [
"Let $v_i$ be the number of votes candidate $i$ received, and let $s=v_1+\\cdots+v_{27}$ be the total number of votes cast. Our goal is to determine the smallest possible $s$\nCandidate $i$ got $\\frac{v_i}s$ of the votes, hence the percentage of votes they received is $\\frac{100v_i}s$ . The condition in the problem statement says that $\\forall i: \\frac{100v_i}s + 1 \\leq v_i$ . ( $\\forall$ means \"for all\", so this means \"For all $i$ $\\frac{100v_i}s + 1 \\leq v_i$ is true\")\nObviously, if some $v_i$ would be $0$ or $1$ , the condition would be false. Thus $\\forall i: v_i\\geq 2$ . We can then rewrite the above inequality as $\\forall i: s\\geq\\frac{100v_i}{v_i-1}$\nIf for some $i$ we have $v_i=2$ , then from the inequality we just derived we would have $s\\geq 200$\nIf for some $i$ we have $v_i=3$ , then $s\\geq 150$\nAnd if for some $i$ we have $v_i=4$ , then $s\\geq \\frac{400}3 = 133\\frac13$ , and hence $s\\geq 134$\nIs it possible to have $s<134$ ? We just proved that to have such $s$ , all $v_i$ have to be at least $5$ . But then $s=v_1+\\cdots+v_{27}\\geq 27\\cdot 5 = 135$ , which is a contradiction. Hence the smallest possible $s$ is at least $134$\nNow consider a situation where $26$ candidates got $5$ votes each, and one candidate got $4$ votes. In this situation, the total number of votes is exactly $134$ , and for each candidate the above inequality is satisfied. Hence the minimum number of committee members is $s=\\boxed{134}$",
"Let there be $N$ members of the committee.\nSuppose candidate $n$ gets $a_n$ votes.\nThen $a_n$ as a percentage out of $N$ is $100\\frac{a_n}{N}$ . Setting up the inequality $a_n \\geq 1 + 100\\frac{a_n}{N}$ and simplifying, $a_n \\geq \\lceil(\\frac{N}{N - 100})\\rceil$ (the ceiling function is there because $a_n$ is an integer.\nNote that if we set all $a_i$ equal to $\\lceil(\\frac{N}{100 - N})\\rceil$ we have $N \\geq 27\\lceil(\\frac{N}{100 - N})\\rceil$ . Clearly $N = 134$ is the least such number that satisfies this inequality. Now we must show that we can find suitable $a_i$ . We can let 26 of them equal to $5$ and one of them equal to $4$ . Therefore, $N = \\boxed{134}$ is the answer.\n- whatRthose",
"Let $n$ be the total number of people in the committee, and $a_i$ be the number of votes candidate $i$ gets where $1 \\leq i \\leq 27$ . The problem tells us that \\[\\frac{100a_i}{n} \\leq a_i - 1 \\implies 100a_i \\leq na_i - n \\implies a_i \\geq \\frac{n}{n-100}.\\] Therefore, \\[\\sum^{27}_{i=1} a_i = n \\geq \\sum^{27}_{i=1} \\frac{n}{n-100} = \\frac{27n}{n-100},\\] and so $n(n-127) \\geq 0 \\implies n \\geq 127$ . Trying $n = 127$ , we get that \\[a_i \\geq \\frac{127}{27} \\approx 4.7 \\implies a_i \\geq 5 \\implies \\sum^{27}_{a_i} a_i \\geq 5 \\cdot 27 = 135 \\geq 127,\\] a contradiction. Bashing out a few more, we find that $\\boxed{134}$ works perfectly fine."
] |
https://artofproblemsolving.com/wiki/index.php/2022_AMC_8_Problems/Problem_18 | C | 40 | The midpoints of the four sides of a rectangle are $(-3,0), (2,0), (5,4),$ and $(0,4).$ What is the
area of the rectangle?
$\textbf{(A) } 20 \qquad \textbf{(B) } 25 \qquad \textbf{(C) } 40 \qquad \textbf{(D) } 50 \qquad \textbf{(E) } 80$ | [
"The midpoints of the four sides of every rectangle are the vertices of a rhombus whose area is half the area of the rectangle: Note that the diagonals of the rhombus have the same lengths as the sides of the rectangle.\nLet $A=(-3,0), B=(2,0), C=(5,4),$ and $D=(0,4).$ Note that $A,B,C,$ and $D$ are the vertices of a rhombus whose diagonals have lengths $AC=4\\sqrt{5}$ and $BD=2\\sqrt{5}.$ It follows that the dimensions of the rectangle are $4\\sqrt{5}$ and $2\\sqrt{5},$ so the area of the rectangle is $4\\sqrt{5}\\cdot2\\sqrt{5}=\\boxed{40}.$",
"If a rectangle has area $K,$ then the area of the quadrilateral formed by its midpoints is $\\frac{K}{2}.$\nDefine points $A,B,C,$ and $D$ as Solution 1 does. Since $A,B,C,$ and $D$ are the midpoints of the rectangle, the rectangle's area is $2[ABCD].$ Now, note that $ABCD$ is a parallelogram since $AB=CD$ and $\\overline{AB}\\parallel\\overline{CD}.$ As the parallelogram's height from $D$ to $\\overline{AB}$ is $4$ and $AB=5,$ its area is $4\\cdot5=20.$ Therefore, the area of the rectangle is $20\\cdot2=\\boxed{40}.$ ~Fruitz"
] |
https://artofproblemsolving.com/wiki/index.php/1972_AHSME_Problems/Problem_33 | C | 10.5 | The minimum value of the quotient of a (base ten) number of three different non-zero digits divided by the sum of its digits is
$\textbf{(A) }9.7\qquad \textbf{(B) }10.1\qquad \textbf{(C) }10.5\qquad \textbf{(D) }10.9\qquad \textbf{(E) }20.5$ | [
"The answer we are looking for can be expressed as $\\dfrac{100a+10b+c}{a+b+c}$ . This is equivalent to $1 + \\dfrac{99a+9b}{a+b+c}$ . Because we are trying to minimize our solution, we set $c$ $9$ , so we have $1 + \\dfrac{99a+9b}{a+b+9}$ . This is equal to $1 + \\dfrac{9a+9b+81}{a+b+9} + \\dfrac{90a-81}{a+b+9}$ , which simplifies to $10+ \\dfrac{90a-81}{a+b+9}$ . Since each digit is unique, we set $b$ to $8$ , leaving us with $10 + \\dfrac{90a-81}{a+17}$ . Clearly, $a$ should be minimized, so $a = 1$ and our answer is \\[\\boxed{10.5}.\\]"
] |