id
int64 1
7.14k
| link
stringlengths 75
84
| no
int64 1
14
| problem
stringlengths 14
5.33k
| solution
stringlengths 21
6.43k
| answer
int64 0
999
|
|---|---|---|---|---|---|
5,101
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_12
| 4
|
For how many integers $n$ is $\dfrac n{20-n}$ the square of an integer?
$\mathrm{(A)}\ 1 \qquad\mathrm{(B)}\ 2 \qquad\mathrm{(C)}\ 3 \qquad\mathrm{(D)}\ 4 \qquad\mathrm{(E)}\ 10$
|
For all integers x, $x^2$ is always a positive integer. So solve for $\frac{n}{20-n} = 0$ , getting $n=0$ and $\frac{n}{20-n} = 1$ , getting $n =10$ . For all values n less than 0 and greater than 20, the value $\frac{n}{20-n}$ is negative, so now try values of n between 10 and 20. Quick substitution finds $0$ $10$ $16$ , and $18$ which yields $x=0$ $x=1$ $x=2$ , and $x=3$ respectively. 4 values, or $\boxed{4}$
| 4
|
5,102
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_14
| 1
|
Four distinct circles are drawn in a plane . What is the maximum number of points where at least two of the circles intersect?
$\mathrm{(A)}\ 8 \qquad\mathrm{(B)}\ 9 \qquad\mathrm{(C)}\ 10 \qquad\mathrm{(D)}\ 12 \qquad\mathrm{(E)}\ 16$
|
For any given pair of circles, they can intersect at most $2$ times. Since there are ${4\choose 2} = 6$ pairs of circles, the maximum number of possible intersections is $6 \cdot 2 = 12$ . We can construct such a situation as below, so the answer is $\boxed{12}$
| 12
|
5,103
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_14
| 2
|
Four distinct circles are drawn in a plane . What is the maximum number of points where at least two of the circles intersect?
$\mathrm{(A)}\ 8 \qquad\mathrm{(B)}\ 9 \qquad\mathrm{(C)}\ 10 \qquad\mathrm{(D)}\ 12 \qquad\mathrm{(E)}\ 16$
|
Because a pair or circles can intersect at most $2$ times, the first circle can intersect the second at $2$ points, the third can intersect the first two at $4$ points, and the fourth can intersect the first three at $6$ points. This means that our answer is $2+4+6=\boxed{12}.$
| 12
|
5,104
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_14
| 3
|
Four distinct circles are drawn in a plane . What is the maximum number of points where at least two of the circles intersect?
$\mathrm{(A)}\ 8 \qquad\mathrm{(B)}\ 9 \qquad\mathrm{(C)}\ 10 \qquad\mathrm{(D)}\ 12 \qquad\mathrm{(E)}\ 16$
|
Pick a circle any circle- $4$ ways. Then, pick any other circle- $3$ ways. For each of these circles, there will be $2$ intersections for a total of $4*3*2$ $24$ intersections. However, we have counted each intersection twice, so we divide for overcounting. Therefore, we reach a total of $\frac{24}{2}=\boxed{12}$
| 12
|
5,105
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_15
| 1
|
How many four-digit numbers $N$ have the property that the three-digit number obtained by removing the leftmost digit is one ninth of $N$
$\mathrm{(A)}\ 4 \qquad\mathrm{(B)}\ 5 \qquad\mathrm{(C)}\ 6 \qquad\mathrm{(D)}\ 7 \qquad\mathrm{(E)}\ 8$
|
Since N is a four digit number, assume WLOG that $N = 1000a + 100b + 10c + d$ , where a is the thousands digit, b is the hundreds digit, c is the tens digit, and d is the ones digit.
Then, $\frac{1}{9}N = 100b + 10c + d$ , so $N = 900b + 90c + 9d$ Set these equal to each other: \[1000a + 100b + 10c + d = 900b + 90c + 9d\] \[1000a = 800b + 80c + 8d\] \[1000a = 8(100b + 10c + d)\] Notice that $100b + 10c + d = N - 1000a$ , thus: \[1000a = 8(N - 1000a)\] \[1000a = 8N - 8000a\] \[9000a = 8N\] \[N = 1125a\]
Go back to our first equation, in which we set $N = 1000a + 100b + 10c + d$ ,
Then: \[1125a = 1000a + 100b + 10c + d\] \[125a = 100b + 10c + d\] The upper limit for the right hand side (RHS) is $999$ (when $b = 9$ $c = 9$ , and $d = 9$ ).
It's easy to prove that for an $a$ there is only one combination of $b, c,$ and $d$ that can make the equation equal. Just think about the RHS as a three digit number $bcd$ . There's one and only one way to create every three digit number with a certain combination of digits.
Thus, we test for how many as are in the domain set by the RHS. Since $125\cdot7 = 875$ which is the largest $a$ value, then $a$ can be $1$ through $7$ , giving us the answer of $\boxed{7}$
| 7
|
5,106
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_19
| 1
|
If $a,b,$ and $c$ are positive real numbers such that $a(b+c) = 152, b(c+a) = 162,$ and $c(a+b) = 170$ , then $abc$ is
$\mathrm{(A)}\ 672 \qquad\mathrm{(B)}\ 688 \qquad\mathrm{(C)}\ 704 \qquad\mathrm{(D)}\ 720 \qquad\mathrm{(E)}\ 750$
|
Adding up the three equations gives $2(ab + bc + ca) = 152 + 162 + 170 = 484 \Longrightarrow ab + bc + ca = 242$ . Subtracting each of the above equations from this yields, respectively, $bc = 90, ca = 80, ab = 72$ . Taking their product, $ab \cdot bc \cdot ca = a^2b^2c^2 = 90 \cdot 80 \cdot 72 = 720^2 \Longrightarrow abc = \boxed{720}$
| 720
|
5,107
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_20
| 1
|
Let $\triangle XOY$ be a right-angled triangle with $m\angle XOY = 90^{\circ}$ . Let $M$ and $N$ be the midpoints of legs $OX$ and $OY$ , respectively. Given that $XN = 19$ and $YM = 22$ , find $XY$
$\mathrm{(A)}\ 24 \qquad\mathrm{(B)}\ 26 \qquad\mathrm{(C)}\ 28 \qquad\mathrm{(D)}\ 30 \qquad\mathrm{(E)}\ 32$
|
2002 12B AMC-20.png
Let $OM = x$ $ON = y$ . By the Pythagorean Theorem on $\triangle XON, MOY$ respectively, \begin{align*} (2x)^2 + y^2 &= 19^2\\ x^2 + (2y)^2 &= 22^2\end{align*}
Summing these gives $5x^2 + 5y^2 = 845 \Longrightarrow x^2 + y^2 = 169$
By the Pythagorean Theorem again, we have
\[(2x)^2 + (2y)^2 = XY^2 \Longrightarrow XY = \sqrt{4(x^2 + y^2)} = \sqrt{4(169)} = \sqrt{676} = \boxed{26}\]
| 26
|
5,108
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_20
| 2
|
Let $\triangle XOY$ be a right-angled triangle with $m\angle XOY = 90^{\circ}$ . Let $M$ and $N$ be the midpoints of legs $OX$ and $OY$ , respectively. Given that $XN = 19$ and $YM = 22$ , find $XY$
$\mathrm{(A)}\ 24 \qquad\mathrm{(B)}\ 26 \qquad\mathrm{(C)}\ 28 \qquad\mathrm{(D)}\ 30 \qquad\mathrm{(E)}\ 32$
|
Let $XO=x$ and $YO=y.$ Then, $XY=\sqrt{x^2+y^2}.$
Since $XN=19$ and $YM=22,$ \[XN^2=19^2=x^2+(\dfrac{y}{2})^2)=\dfrac{x^2}{4}+y^2\] \[YM^2=22^2=(\dfrac{x}{2})^2+y^2=\dfrac{x^2}{4}+y^2.\]
Adding these up: \[19^2+22^2=\dfrac{4x^2+y^2}{4}+\dfrac{x^2+4y^2}{4}\] \[845=\dfrac{5x^2+5y^2}{4}\] \[3380=5x^2+5y^2\] \[676=x^2+y^2.\]
Then, we substitute: $XY=\sqrt{x^2+y^2}=\sqrt{676}=\boxed{26}.$
| 26
|
5,109
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_21
| 1
|
For all positive integers $n$ less than $2002$ , let
\begin{eqnarray*} a_n =\left\{ \begin{array}{lr} 11, & \text{if\ }n\ \text{is\ divisible\ by\ }13\ \text{and\ }14;\\ 13, & \text{if\ }n\ \text{is\ divisible\ by\ }14\ \text{and\ }11;\\ 14, & \text{if\ }n\ \text{is\ divisible\ by\ }11\ \text{and\ }13;\\ 0, & \text{otherwise}. \end{array} \right. \end{eqnarray*}
Calculate $\sum_{n=1}^{2001} a_n$
$\mathrm{(A)}\ 448 \qquad\mathrm{(B)}\ 486 \qquad\mathrm{(C)}\ 1560 \qquad\mathrm{(D)}\ 2001 \qquad\mathrm{(E)}\ 2002$
|
Find the LCMs of the groups of the numbers.
Notice that the groups are relatively prime.
So $a_n=$
11 if $n$ is a multiple of 182.
13 if $n$ is a multiple of 154.
14 if $n$ is a multiple of 143.
When do we see ambiguities (for example: $n$ is a multiple of 11, 13, and 14)? This is only done when $n$ is a multiple of $\operatorname{lcm}(11,13,14)=2002$ . However, since $n<2002$ , this can never happen.
So we have 10 multiples of 182 we have to count (1 to 10 $*182$ ), and similarly, 12 multiples of 154, and 13 multiples of 143. The sum is $10*11+12*13+13*14=448$ . Select $\boxed{448}$
| 448
|
5,110
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_22
| 1
|
For all integers $n$ greater than $1$ , define $a_n = \frac{1}{\log_n 2002}$ . Let $b = a_2 + a_3 + a_4 + a_5$ and $c = a_{10} + a_{11} + a_{12} + a_{13} + a_{14}$ . Then $b- c$ equals
$\mathrm{(A)}\ -2 \qquad\mathrm{(B)}\ -1 \qquad\mathrm{(C)}\ \frac{1}{2002} \qquad\mathrm{(D)}\ \frac{1}{1001} \qquad\mathrm{(E)}\ \frac 12$
|
Note that $\frac{1}{\log_a b}=\log_b a$ . Thus $a_n=\log_{2002} n$ . Also notice that if we have a log sum, we multiply, and if we have a log product, we divide. Using these properties, we get that the result is the following:
\[\log_{2002}\left(\frac{2*3*4*5}{10*11*12*13*14}=\frac{1}{11*13*14}=\frac{1}{2002}\right)=\boxed{1}\]
| 1
|
5,111
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_22
| 2
|
For all integers $n$ greater than $1$ , define $a_n = \frac{1}{\log_n 2002}$ . Let $b = a_2 + a_3 + a_4 + a_5$ and $c = a_{10} + a_{11} + a_{12} + a_{13} + a_{14}$ . Then $b- c$ equals
$\mathrm{(A)}\ -2 \qquad\mathrm{(B)}\ -1 \qquad\mathrm{(C)}\ \frac{1}{2002} \qquad\mathrm{(D)}\ \frac{1}{1001} \qquad\mathrm{(E)}\ \frac 12$
|
Note that $a_2 = \frac{1}{\log_2 2002}$ $1$ is also equal to $\log_2 2$ . So $a_2 = \frac{\log_2 2}{\log_2 2002}$ . By the change of bases formula, $a_2 = \log_{2002} 2$ . Following the same reasoning, $a_3 = \log_{2002} 3$ $a_4 = \log_{2002} 4$ and so on.
\[b = \log_{2002} 2 + \log_{2002} 3 + .....+ \log_{2002} 5 = \log_{2002} 5! = \log_{2002} 120\] Now solving for $c$ , we see that it equals $\log_{2002} (10\cdot 11 \cdot 12 \cdot 13 \cdot 14)$ \[b-c = \log_{2002} 120 - \log_{2002} 240240 \rightarrow \log_{2002} \frac{1}{2002} = \boxed{1}\]
| 1
|
5,112
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_23
| 2
|
In $\triangle ABC$ , we have $AB = 1$ and $AC = 2$ . Side $\overline{BC}$ and the median from $A$ to $\overline{BC}$ have the same length. What is $BC$
$\mathrm{(A)}\ \frac{1+\sqrt{2}}{2} \qquad\mathrm{(B)}\ \frac{1+\sqrt{3}}2 \qquad\mathrm{(C)}\ \sqrt{2} \qquad\mathrm{(D)}\ \frac 32 \qquad\mathrm{(E)}\ \sqrt{3}$
|
There is a theorem in geometry known as Pappus's Median Theorem. It states that if you have $\triangle{ABC}$ , and you draw a median from point $A$ to side $BC$ (label this as $M$ ), then: $(AM)^2 = \dfrac{2(b^2) + 2(c^2) - (a^2)}{4}$ . Note that $b$ is the length of side $\overline{AC}$ $c$ is the length of side $\overline{AB}$ , and $a$ is length of side $\overline{BC}$ . Let $MB = MC = x$ . Then $AM = 2x$ . Now, we can plug into the formula given above: $AM = 2x$ $b = 2$ $c = 1$ , and $a = 2x$ . After some simple algebra, we find $x = \dfrac{\sqrt{2}}{2}$ . Then, $BC = \boxed{2}$
| 2
|
5,113
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12B_Problems/Problem_25
| 1
|
Let $f(x) = x^2 + 6x + 1$ , and let $R$ denote the set of points $(x,y)$ in the coordinate plane such that \[f(x) + f(y) \le 0 \qquad \text{and} \qquad f(x)-f(y) \le 0\] The area of $R$ is closest to
$\textbf{(A) } 21 \qquad\textbf{(B)}\ 22 \qquad\textbf{(C)}\ 23 \qquad\textbf{(D)}\ 24 \qquad\textbf{(E)}\ 25$
|
The first condition gives us that \[x^2 + 6x + 1 + y^2 + 6y + 1 \le 0 \Longrightarrow (x+3)^2 + (y+3)^2 \le 16\]
which is a circle centered at $(-3,-3)$ with radius $4$ . The second condition gives us that
\[x^2 + 6x + 1 - y^2 - 6y - 1 \le 0 \Longrightarrow (x^2 - y^2) + 6(x-y) \le 0 \Longrightarrow (x-y)(x+y+6) \le 0\]
Thus either
\[x - y \ge 0,\quad x+y+6 \le 0\]
or
\[x - y \le 0,\quad x+y+6 \ge 0\]
Each of those lines passes through $(-3,-3)$ and has slope $\pm 1$ , as shown above. Therefore, the area of $R$ is half of the area of the circle, which is $\frac{1}{2} (\pi \cdot 4^2) = 8\pi \approx \boxed{25}$
| 25
|
5,114
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_2
| 1
|
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,
\[\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}\]
in 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}$
| 2
|
5,115
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_3
| 1
|
The dimensions of a rectangular box in inches are all positive integers and the volume of the box is $2002$ in $^3$ . Find the minimum possible sum of the three dimensions.
$\text{(A) }36 \qquad \text{(B) }38 \qquad \text{(C) }42 \qquad \text{(D) }44 \qquad \text{(E) }92$
|
Given an arbitrary product and an arbitrary amount of terms to multiply to get that product, to maximize the sum, make all of the terms $1$ with the last one being the number. To minimize the sum, make all of the terms equal to each other. (This is a corollary that follows from the $AM-GM$ proof.) Since $2002$ is not a perfect cube, we have to make the terms as close to each other as possible. A good rule of thumb is the memorize the prime factorization of the AMC year that you are doing, which is $2002= 2 \cdot 7 \cdot 11 \cdot 13$ . The three terms that are closest to each other that multiply to $2002$ are $11, 13,$ and $14$ , so our answer is $11+13+14=\boxed{38}$
| 38
|
5,116
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_7
| 1
|
How many three-digit numbers have at least one $2$ and at least one $3$
$\text{(A) }52 \qquad \text{(B) }54 \qquad \text{(C) }56 \qquad \text{(D) }58 \qquad \text{(E) }60$
|
We can do this problem with some simple case work.
Case 1: The hundreds place is not $2$ or $3.$ This means that the tens place and ones place must be $2$ and $3$ respectively or $3$ and $2$ respectively. This case covers $1, 4, 5, 6, 7, 8,$ and $9,$ so it gives us $2 \cdot 7 = 14$ cases.
Case 2: The hundreds place is $2.$ This means that $3$ must be in the tens place or ones place. Starting with cases in which the tens place is not $3$ , we get $203, 213, 223, 243, 253, 263, 273, 283,$ and $293.$ With cases in which the tens place is $3$ , we have $230-239$ , or $10$ more cases. This gives us $9 + 10=19$ cases.
Case 3: The hundreds place is $3.$ This case is almost identical to the second case, just swap the $2$ s with $3$ s and $3$ s with $2$ s in the reasoning and its the same, giving us an additional $19$ cases.
Addition up all of these cases gives $14+19+19=52$ cases, or $\boxed{52}.$
| 52
|
5,117
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_9
| 1
|
Two walls and the ceiling of a room meet at right angles at point $P.$ A fly is in the air one meter from one wall, eight meters from the other wall, and nine meters from point $P$ . How many meters is the fly from the ceiling?
$\text{(A) }\sqrt{13} \qquad \text{(B) }\sqrt{14} \qquad \text{(C) }\sqrt{15} \qquad \text{(D) }4 \qquad \text{(E) }\sqrt{17}$
|
We can use the formula for the diagonal of the rectangle, or $d=\sqrt{a^2+b^2+c^2}$ The problem gives us $a=1, b=8,$ and $c=9.$ Solving gives us $9=\sqrt{1^2 + 8^2 + c^2} \implies c^2=9^2-8^2-1^2 \implies c^2=16 \implies c=\boxed{4}.$
| 4
|
5,118
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_10
| 1
|
Let $f_n (x) = \text{sin}^n x + \text{cos}^n x.$ For how many $x$ in $[0,\pi]$ is it true that
\[6f_{4}(x)-4f_{6}(x)=2f_{2}(x)?\]
$\text{(A) }2 \qquad \text{(B) }4 \qquad \text{(C) }6 \qquad \text{(D) }8 \qquad \text{(E) more than }8$
|
Divide by 2 on both sides to get \[3f_{4}(x)-2f_{6}(x)=f_{2}(x)\] Substituting the definitions of $f_{2}(x)$ $f_{4}(x)$ , and $f_{6}(x)$ , we may rewrite the expression as \[3(\text{sin}^4{x} + \text{cos}^4{x}) - 2(\text{sin}^6{x} + \text{cos}^6{x}) = 1\] We now simplify each term separately using some algebraic manipulation and the Pythagorean identity.
We can rewrite $3(\text{sin}^4 x + \text{cos}^4 x)$ as $3(\text{sin}^2 x + \text{cos}^2 x)^2 - 6\text{sin}^2 x \text{cos}^2 x$ , which is equivalent to $3 - 6\text{sin}^2 x \text{cos}^2 x$
As for $2(\text{sin}^6 x + \text{cos}^6 x)$ , we may factor it as $2(\text{sin}^2 x + \text{cos}^2 x)(\text{sin}^4 x + \text{cos}^4 x - \text{sin}^2 x \text{cos}^2 x)$ which can be rewritten as $2(\text{sin}^4 x + \text{cos}^4 x - \text{sin}^2 x \text{cos}^2 x)$ , and then as $2(\text{sin}^2 x + \text{cos}^2)^2) - 6\text{sin}^2 x \text{cos}^2 x$ , which is equivalent to $2 - 6\text{sin}^2 x \text{cos}^2 x$
Putting everything together, we have $(3 - 6\text{sin}^2 {x} \text{cos}^2 {x}) - (2 - 6\text{sin}^2 {x} \text{cos}^2 {x}) = 1$ or $1 = 1$ . Therefore, the given equation $3f_{4}(x)-2f_{6}(x)=f_{2}(x)$ is true for all real $x$ , meaning that there are more than 8 values of $x$ that satisfy the given equation and so the answer is $\boxed{8}$
| 8
|
5,119
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_12
| 1
|
For how many positive integers $n$ is $n^3 - 8n^2 + 20n - 13$ a prime number?
$\text{(A) 1} \qquad \text{(B) 2} \qquad \text{(C) 3} \qquad \text{(D) 4} \qquad \text{(E) more than 4}$
|
Since this is a number theory question, it is clear that the main challenge here is factoring the given cubic. In general, the rational root theorem will be very useful for these situations.
The rational root theorem states that all rational roots of $n^3 - 8n^2 + 20n - 13$ will be among $1, 13, -1$ , and $-13$ . Evaluating the cubic at these values will give $n = 1$ as a root. Doing some synthetic division gives \[n^3 - 8n^2 + 20n - 13 = (n-1)(n^2 - 7n + 13)\]
Since $n > 0$ $n-1$ must be nonnegative. Since $(n-1)(n^2 - 7n + 13)$ evaluates to a prime, it is clear that exactly one of $n-1$ and $n^2 - 7n - 13$ is $1$ . We proceed by splitting the problem into 2 cases.
Case 1: $n-1 = 1$ It is clear that $n = 2$ . We have $2^2 - 7(2) + 13 = 3$ , so this case yields $n = 2$ as a solution.
Case 2: $n^2 - 7n + 13 = 1$ Solving for $n$ gives $n^2 - 7n + 12 = 0$ or $(n-3)(n-4) = 0$ . Therefore, $n = 3$ or $n = 4$ .
Since both $3-1 = 2$ and $4-1 = 3$ are prime, both $n = 3$ and $n = 4$ work, yielding 2 solutions.
Putting everything together, the answer is $1 + 2 = \boxed{3}$
| 3
|
5,120
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_13
| 1
|
What is the maximum value of $n$ for which there is a set of distinct positive integers $k_1, k_2, ... k_n$ for which
\[k^2_1 + k^2_2 + ... + k^2_n = 2002?\]
$\text{(A) }14 \qquad \text{(B) }15 \qquad \text{(C) }16 \qquad \text{(D) }17 \qquad \text{(E) }18$
|
Note that $k^2_1 + k^2_2 + ... + k^2_n = 2002 \leq \frac{n(n+1)(2n+1)}{6}$
When $n = 17$ $\frac{n(n+1)(2n+1)}{6} = \frac{(17)(18)(35)}{6} = 1785 < 2002$
When $n = 18$ $\frac{n(n+1)(2n+1)}{6} = 1785 + 18^2 = 2109 > 2002$
Therefore, we know $n \leq 17$
Now we must show that $n = 17$ works. We replace one of $1, 2, ... 17$ with an integer $a > 17$ to account for the amount under $2002$ , which is $2002-1785 = 217$
Essentially, this boils down to writing $217$ as a difference of squares. We know $217 = (7)(31)$ , so we assume there exist positive integers $a$ and $b$ where $a > 17$ and $b \leq 17$ such that $a^2 - b^2 = 217$
We can rewrite this as $(a+b)(a-b) = 217$ , so either $a+b = 217$ and $a-b = 1$ or $a+b = 31$ and $a-b = 7$ . We analyze each case separately.
Case 1: $a+b = 217$ and $a-b = 1$
Solving this system of equations gives $a = 109$ and $b = 108$ . However, $108 > 17$ , so this case does not yield a solution.
Case 2: $a+b = 31$ and $a-b = 7$
Solving this system of equations gives $a = 19$ and $b = 12$ . This satisfies all the requirements of the problem.
The list $1, 2 ... 11, 13, 14 ... 17, 19$ has $17$ terms whose sum of squares equals $2002$ . Therefore, the answer is $\boxed{17}$
| 17
|
5,121
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_16
| 1
|
The altitudes of a triangle are $12, 15,$ and $20.$ The largest angle in this triangle is
$\text{(A) }72^\circ \qquad \text{(B) }75^\circ \qquad \text{(C) }90^\circ \qquad \text{(D) }108^\circ \qquad \text{(E) }120^\circ$
|
Let $a, b,$ and $c$ denote the bases of altitudes $12, 15,$ and $20,$ respectively. Since they are all altitudes and bases of the same triangle, they have the same area, so $\frac{12a}{2}=\frac{15b}{2}=\frac{20c}{2}.$ Multiplying by $2$ , we get $12a=15b=20c.$ Notice that a simple solution to the equation is if all of them equal $12 \cdot 15 \cdot 20.$ That means $a=15 \cdot 20, b=12 \cdot 20,$ and $c=12 \cdot 15.$ Simplifying our solution to check for Pythagorean triples we see that this is just a Pythagorean triple, namely a $3-4-5$ triangle. Since the other two angles of a right triangle must be acute, the right angle must be the greatest angle. Therefore, our answer is $\boxed{90}.$
| 90
|
5,122
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_17
| 1
|
Let $f(x) = \sqrt{\sin^4{x} + 4 \cos^2{x}} - \sqrt{\cos^4{x} + 4 \sin^2{x}}.$ An equivalent form of $f(x)$ is
$\text{(A) }1-\sqrt{2}\sin{x} \qquad \text{(B) }-1+\sqrt{2}\cos{x} \qquad \text{(C) }\cos{\frac{x}{2}} - \sin{\frac{x}{2}} \qquad \text{(D) }\cos{x} - \sin{x} \qquad \text{(E) }\cos{2x}$
Solution
|
By the Pythagorean identity we can rewrite the given expression as follows. \[\sqrt{\sin^4{x} + 4 \cos^2{x}} - \sqrt{\cos^4{x} + 4 \sin^2{x}} = \sqrt{\sin^4{x} + 4(1 - \sin^2{x})} - \sqrt{\cos^4{x} + 4(1 - \cos^2{x})}\]
Expanding each bracket gives \[\sqrt{\sin^4{x} - 4\sin^2{x} + 4} - \sqrt{\cos^4{x} - 4\cos^2{x} + 4}\]
The expressions under the square roots can be factored to get \[\sqrt{(\sin^2{x} - 2)^2} - \sqrt{(\cos^2{x} - 2)^2}\]
Since $\sin^2{x} < 2$ and $\cos^2{x} < 2$ for all real $x$ , the expression must evaluate to $(2 - \sin^2{x}) - (2 - \cos^2{x})$ , which simplifies to $\cos^2{x} - \sin^2{x} = \boxed{2}$
| 2
|
5,123
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_17
| 2
|
Let $f(x) = \sqrt{\sin^4{x} + 4 \cos^2{x}} - \sqrt{\cos^4{x} + 4 \sin^2{x}}.$ An equivalent form of $f(x)$ is
$\text{(A) }1-\sqrt{2}\sin{x} \qquad \text{(B) }-1+\sqrt{2}\cos{x} \qquad \text{(C) }\cos{\frac{x}{2}} - \sin{\frac{x}{2}} \qquad \text{(D) }\cos{x} - \sin{x} \qquad \text{(E) }\cos{2x}$
Solution
|
We don't actually have to solve the question. Just let $x$ equal some easy value to calculate $\cos {x}, \cos {2x}, \sin {x}, \sin {\frac{x}{2}},$ and $\cos {\frac{x}{2}}.$ For this solution, let $x=60^\circ.$ This means that the expression in the problem will give $\sqrt{\sin^4{60^\circ} + 4 \cos^2{60^\circ}} - \sqrt{\cos^4{60^\circ} + 4 \sin^2{60^\circ}}=\sqrt{(\frac{\sqrt{3}}{2})^4 + 4(\frac{1}{2})^2} - \sqrt{(\frac{1}{2})^4 + 4(\frac{\sqrt{3}}{2})^2}=\sqrt{\frac{9}{16} +1} - \sqrt{\frac{1}{16} + 3} = \frac{-1}{2}.$ Plugging in $x=60^\circ$ for the rest of the expressions, we get
$\text{(A) }1-\sqrt{2}\sin{60^\circ}=1-\frac{\sqrt{6}}{2} \neq \frac{-1}{2}.$
$\text{(B) }1+\sqrt{2}\cos{60^\circ}=1+\frac{\sqrt{2}}{2} \neq \frac{-1}{2}.$
$\text{(C) }\cos{\frac{60^\circ}{2}} - \sin{\frac{60^\circ}{2}}=\frac{\sqrt{3}}{2}-1 \neq \frac{-1}{2}.$
$\text{(D) }\cos{60^\circ} - \sin{60^\circ}=\frac{1-\sqrt{3}}{2} \neq \frac{-1}{2}.$
$\text{(E) }\cos {120^\circ}=\frac{-1}{2}.$
Therefore, our answer is $\boxed{2}$
| 2
|
5,124
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_18
| 1
|
If $a,b,c$ are real numbers such that $a^2 + 2b =7$ $b^2 + 4c= -7,$ and $c^2 + 6a= -14$ , find $a^2 + b^2 + c^2.$
$\text{(A) }14 \qquad \text{(B) }21 \qquad \text{(C) }28 \qquad \text{(D) }35 \qquad \text{(E) }49$
|
Adding all of the equations gives $a^2 + b^2 +c^2 + 6a + 2b + 4c=-14.$ Adding 14 on both sides gives $a^2 + b^2 +c^2 + 6a + 2b + 4c+14=0.$ Notice that 14 can split into $9, 1,$ and $4,$ which coincidentally makes $a^2 +6a, b^2+2b,$ and $c^2+4c$ into perfect squares. Therefore, $(a+3)^2 + (b+1)^2 + (c+2) ^2 =0.$ An easy solution to this equation is $a=-3, b=-1,$ and $c=-2.$ Plugging in that solution, we get $a^2+b^2+c^2=-3^2+-1^2+-2^2=\boxed{14}.$
| 14
|
5,125
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_20
| 1
|
Let $f$ be a real-valued function such that
\[f(x) + 2f(\frac{2002}{x}) = 3x\]
for all $x>0.$ Find $f(2).$
$\text{(A) }1000 \qquad \text{(B) }2000 \qquad \text{(C) }3000 \qquad \text{(D) }4000 \qquad \text{(E) }6000$
|
Setting $x = 2$ gives $f(2) + 2f(1001) = 6$ .
Setting $x = 1001$ gives $2f(2) + f(1001) = 3003$
Adding these 2 equations and dividing by 3 gives $f(2) + f(1001) = \frac{6+3003}{3} = 1003$
Subtracting these 2 equations gives $f(2) - f(1001) = 2997$
Therefore, $f(2) = \frac{1003+2997}{2} = \boxed{2000}$
| 0
|
5,126
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_21
| 1
|
Let $a$ and $b$ be real numbers greater than $1$ for which there exists a positive real number $c,$ different from $1$ , such that
\[2(\log_a{c} + \log_b{c}) = 9\log_{ab}{c}.\]
Find the largest possible value of $\log_a b.$
$\text{(A) }\sqrt{2} \qquad \text{(B) }\sqrt{3} \qquad \text{(C) }2 \qquad \text{(D) }\sqrt{6} \qquad \text{(E) }3$
|
We may rewrite the given equation as \[2(\frac {\log c}{\log a} + \frac {\log c}{\log b}) = \frac {9\log c}{\log a + \log b}\] Since $c \neq 1$ , we have $\log c \neq 0$ , so we may divide by $\log c$ on both sides. After making the substitutions $x = \log a$ and $y = \log b$ , our equation becomes \[\frac {2}{x} + \frac {2}{y} = \frac {9}{x+y}\]
Rewriting the left-hand side gives \[\frac {2(x+y)}{xy} = \frac {9}{x+y}\]
Cross-multiplying gives $2(x+y)^2 = 9xy$ or \[2x^2 - 5xy + 2y^2 = 0\]
Factoring gives $(2x-y)(x-2y) = 0$ or $\frac {x}{y} = 2, \frac {1}{2}$
Recall that $\frac {x}{y} = \frac {\log a}{\log b} = \log_{a} b$ . Therefore, the maximum value of $\log_{a} b$ is $\boxed{2}$
| 2
|
5,127
|
https://artofproblemsolving.com/wiki/index.php/2002_AMC_12P_Problems/Problem_23
| 1
|
The equation $z(z+i)(z+3i)=2002i$ has a zero of the form $a+bi$ , where $a$ and $b$ are positive real numbers. Find $a.$
$\text{(A) }\sqrt{118} \qquad \text{(B) }\sqrt{210} \qquad \text{(C) }2 \sqrt{210} \qquad \text{(D) }\sqrt{2002} \qquad \text{(E) }100 \sqrt{2}$
|
According to Wolfram-Alpha, the answer is $\boxed{118}$
| 118
|
5,128
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_2
| 1
|
Let $P(n)$ and $S(n)$ denote the product and the sum, respectively, of the digits
of the integer $n$ . For example, $P(23) = 6$ and $S(23) = 5$ . Suppose $N$ is a
two-digit number such that $N = P(N)+S(N)$ . What is the units digit of $N$
$\text{(A)}\ 2\qquad \text{(B)}\ 3\qquad \text{(C)}\ 6\qquad \text{(D)}\ 8\qquad \text{(E)}\ 9$
|
Denote $a$ and $b$ as the tens and units digit of $N$ , respectively. Then $N = 10a+b$ . It follows that $10a+b=ab+a+b$ , which implies that $9a=ab$ . Since $a\neq0$ $b=9$ . So the units digit of $N$ is $\boxed{9}$
| 9
|
5,129
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_3
| 2
|
problem_id
227cbd9a094a48b5f95a026123843b8c The state income tax where Kristin lives is le...
227cbd9a094a48b5f95a026123843b8c The state income tax where Kristin lives is le...
Name: Text, dtype: object
|
Let $A$ $T$ be Kristin's annual income and the income tax total, respectively. Notice that \begin{align*} T &= p\%\cdot28000 + (p + 2)\%\cdot(A - 28000) \\ &= [p\%\cdot28000 + p\%\cdot(A - 28000)] + 2\%\cdot(A - 28000) \\ &= p\%\cdot A + 2\%\cdot(A - 28000) \end{align*} We are also given that \[T = (p + 0.25)\%\cdot A = p\%\cdot A + 0.25\%\cdot A\] Thus, \[p\%\cdot A + 2\%\cdot(A - 28000) = p\%\cdot A + 0.25\%\cdot A\] \[2\%\cdot(A - 28000) = 0.25\%\cdot A\] Solve for $A$ to obtain $A = \boxed{32000}$
| 0
|
5,130
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_4
| 3
|
problem_id
ae79010feec50f73241383732e6c476e The mean of three numbers is $10$ more than th...
ae79010feec50f73241383732e6c476e The mean of three numbers is $10$ more than th...
Name: Text, dtype: object
|
Let $m$ be the mean of the three numbers. Then the least of the numbers is $m-10$ and the greatest is $m + 15$ . The middle of the three numbers is the median, $5$ . So $\dfrac{1}{3}[(m-10) + 5 + (m + 15)] = m$ , which can be solved to get $m=10$ .
Hence, the sum of the three numbers is $3\cdot 10 = \boxed{30}$
| 30
|
5,131
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_4
| 4
|
problem_id
ae79010feec50f73241383732e6c476e The mean of three numbers is $10$ more than th...
ae79010feec50f73241383732e6c476e The mean of three numbers is $10$ more than th...
Name: Text, dtype: object
|
Say the three numbers are $x$ $y$ and $z$ . When we arrange them in ascending order then we can assume $y$ is in the middle therefore $y = 5$
We can also assume that the smallest number is $x$ and the largest number of the three is $y$ .
Therefore,
\[\frac{x+y+z}{3} = x + 10 = z - 15\] \[\frac{x+5+z}{3} = x + 10 = z - 15\]
Taking up the first equation $\frac{x+5+z}{3} = x + 10$ and simplifying we obtain $z - 2x - 25 = 0$ doing so for the equation $\frac{x+5+z}{3} = z - 15$ we obtain the equation $x - 2z + 50 = 0$
\[x - 2z + 50 = 2x - 4z + 100\]
when solve the above obtained equation and $z - 2x - 25 = 0$ we obtain the values of $z = 25$ and $x = 0$
Therefore the sum of the three numbers is $25 + 5 + 0 = \boxed{30}$
| 30
|
5,132
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_6
| 2
|
problem_id
74b973e4f94621e9337c1a9c0077ccfc A telephone number has the form $\text{ABC-DEF...
74b973e4f94621e9337c1a9c0077ccfc A telephone number has the form $\text{ABC-DEF...
Name: Text, dtype: object
|
We start by noting that there are $10$ letters, meaning there are $10$ digits in total. Listing them all out, we have $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$ . Clearly, the most restrictive condition is the consecutive odd digits, so we create casework based on that.
Case 1: $G$ $H$ $I$ , and $J$ are $7$ $5$ $3$ , and $1$ respectively.
A cursory glance allows us to deduce that the smallest possible sum of $A + B + C$ is $11$ when $D$ $E$ , and $F$ are $8$ $6$ , and $4$ respectively, so this is out of the question.
Case 2: $G$ $H$ $I$ , and $J$ are $3$ $5$ $7$ , and $9$ respectively.
A cursory glance allows us to deduce the answer. Clearly, when $D$ $E$ , and $F$ are $6$ $4$ , and $2$ respectively, $A + B + C$ is $9$ when $A$ $B$ , and $C$ are $8$ $1$ , and $0$ respectively, giving us a final answer of $\boxed{8}$
| 8
|
5,133
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_7
| 4
|
problem_id
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
Name: Text, dtype: object
|
Let's multiply ticket costs by $2$ , then the half price becomes an integer, and the charity sold $140$ tickets worth a total of $4002$ dollars.
Let $h$ be the number of half price tickets, we then have $140-h$ full price tickets. The cost of $140-h$ full price tickets is equal to the cost of $280-2h$ half price tickets.
Hence we know that $h+(280-2h) = 280-h$ half price tickets cost $4002$ dollars. Then a single full price ticket costs $\frac{4002}{280-h}$ dollars, and this must be an integer. Thus $280-h$ must be a divisor of $4002$ . Keeping in mind that $0\leq h\leq 140$ , we are looking for a divisor between $140$ and $280$ , inclusive.
The prime factorization of $4002$ is $4002=2\cdot 3\cdot 23\cdot 29$ . We can easily find out that the only divisor of $4002$ within the given range is $2\cdot 3\cdot 29 = 174$
This gives us $280-h=174$ , hence there were $h=106$ half price tickets and $140-h = 34$ full price tickets.
In our modified setting (with prices multiplied by $2$ ) the price of a half price ticket is $\frac{4002}{174} = 23$ . In the original setting this is the price of a full price ticket. Hence $23\cdot 34 = \boxed{782}$ dollars are raised by the full price tickets.
| 782
|
5,134
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_7
| 5
|
problem_id
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
Name: Text, dtype: object
|
Let the cost of the full price ticket be $x$ , the number of full-price tickets be $A$ , and the number of half-price tickets be $B$
Let's multiply both sides of the equation that naturally follows by 2. We have
\[2Ax+Bx=4002\]
And we have $A+B=140\implies B=140-A$
Plugging in, we get $\implies 2Ax+(140-A)(x)=4002$
Simplifying, we get $Ax+140x=4002$
Factoring out the $x$ , we get $x(A+140)=4002\implies x=\frac{4002}{A+140}$
We see that the fraction has to simplify to an integer (the full price is a whole dollar amount)
Thus, $A+140$ must be a factor of 4002.
Consider the prime factorization of $4002$ $2\times3\times23\times29$
$A$ must be a positive integer. So, we seek a factor of $4002$ to set equal to $A+140$ so that we get an integer solution for $A$ that is less than $140$ . By guess-and-check OR inspection, the appropriate factor is $174$ $2\times3\times29$ ), meaning that $A$ has a value of $34$ . Plug this into the above equation for $x$ to get $x = 23$
Therefore, the price of full tickets out of $2001$ is $23\times34=\boxed{782}$
| 782
|
5,135
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_7
| 6
|
problem_id
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
afa106734f55c02711ecd5e8bbf4e8d3 A charity sells $140$ benefit tickets for a to...
Name: Text, dtype: object
|
Let $f$ equal the number of full-price tickets, and let $h$ equal the number of half-price tickets. Additionally, suppose that the price of $f$ is $p$ . We are trying to solve for $f \cdot p$
Since the total number of tickets sold is $140$ , we know that \[f+h=140.\] The sales from full-price tickets ( $f \cdot p$ ) plus the sales from half-price tickets $\Big(\frac{h \cdot p}{2}$ , because each hall-price ticket costs $\frac{p}{2}$ dollars $\Big)$ equals $2001.$ Then we can write \[fx + \frac{hx}{2}=2001.\]
Substituting $h=140-f$ into the second equation, we get \[f \cdot p +\frac{(140-f)p}{2}=f \cdot p+\frac{140p-f\cdot p}{2}=\frac{f\cdot p+140p}{2}=2001.\]
Multiplying by $2$ and subtracting $140p$ gives us \[f\cdot p=4002-140p.\]
Since the problem states that $x$ is a whole number, $140p$ will be some integer multiple of $140$ that ends in a $0$ . Thus, $4002-140p$ will end in a $2$ . Looking at the answer choices, only $\boxed{782}$ satisfies that condition.
| 782
|
5,136
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_9
| 1
|
Let $f$ be a function satisfying $f(xy) = \frac{f(x)}y$ for all positive real numbers $x$ and $y$ . If $f(500) =3$ , what is the value of $f(600)$
$(\mathrm{A})\ 1 \qquad (\mathrm{B})\ 2 \qquad (\mathrm{C})\ \frac52 \qquad (\mathrm{D})\ 3 \qquad (\mathrm{E})\ \frac{18}5$
|
Letting $x = 500$ and $y = \dfrac65$ in the given equation, we get $f(500\cdot\frac65) = \frac3{\frac65} = \frac52$ , or $f(600) = \boxed{52}$
| 52
|
5,137
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_9
| 2
|
Let $f$ be a function satisfying $f(xy) = \frac{f(x)}y$ for all positive real numbers $x$ and $y$ . If $f(500) =3$ , what is the value of $f(600)$
$(\mathrm{A})\ 1 \qquad (\mathrm{B})\ 2 \qquad (\mathrm{C})\ \frac52 \qquad (\mathrm{D})\ 3 \qquad (\mathrm{E})\ \frac{18}5$
|
The only function that satisfies the given condition is $y = \frac{k}{x}$ , for some constant $k$ . Thus, the answer is $\frac{500 \cdot 3}{600} = \boxed{52}$
| 52
|
5,138
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_9
| 3
|
Let $f$ be a function satisfying $f(xy) = \frac{f(x)}y$ for all positive real numbers $x$ and $y$ . If $f(500) =3$ , what is the value of $f(600)$
$(\mathrm{A})\ 1 \qquad (\mathrm{B})\ 2 \qquad (\mathrm{C})\ \frac52 \qquad (\mathrm{D})\ 3 \qquad (\mathrm{E})\ \frac{18}5$
|
Note that the equation given above is symmetric, so we have $x \cdot f(x)=y \cdot f(y)$ . Plugging in $x=500$ and $y=600$ gives $f(y)=\boxed{52}$
| 52
|
5,139
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_10
| 2
|
problem_id
c1c2900151c908ac390988a490c7e35c The plane is tiled by congruent squares and co...
c1c2900151c908ac390988a490c7e35c The plane is tiled by congruent squares and co...
Name: Text, dtype: object
|
Consider any single tile:
[asy] unitsize(1cm); defaultpen(linewidth(0.8pt)); path p1=(0,0)--(3,0)--(3,3)--(0,3)--(0,0); path p2=(0,1)--(1,1)--(1,0); path p3=(2,0)--(2,1)--(3,1); path p4=(3,2)--(2,2)--(2,3); path p5=(1,3)--(1,2)--(0,2); path p6=(1,1)--(2,2); path p7=(2,1)--(1,2); path[] p=p1^^p2^^p3^^p4^^p5^^p6^^p7; draw(p); [/asy]
If the side of the small square is $a$ , then the area of the tile is $9a^2$ , with $4a^2$ covered by squares and $5a^2$ by pentagons.
Hence exactly $5/9$ of any tile are covered by pentagons, and therefore pentagons cover $5/9$ of the plane. When expressed as a percentage, this is $55.\overline{5}\%$ , and the closest integer to this value is $\boxed{56}$
| 56
|
5,140
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_11
| 3
|
problem_id
44dac98b900fb2d03612e3e20d26762f A box contains exactly five chips, three red a...
44dac98b900fb2d03612e3e20d26762f A box contains exactly five chips, three red a...
Name: Text, dtype: object
|
Let's assume we don't stop picking until all of the chips are picked. To satisfy this condition, we have to arrange the letters: $W, W, R, R, R$ such that both $W$ 's appear in the first $4$ . We find the number of ways to arrange the white chips in the first $4$ and divide that by the total ways to choose all the chips. The probability of this occurring is $\dfrac{\dbinom{4}{2}}{\dbinom{5}{2}} = \boxed{35}$
| 35
|
5,141
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_11
| 4
|
problem_id
44dac98b900fb2d03612e3e20d26762f A box contains exactly five chips, three red a...
44dac98b900fb2d03612e3e20d26762f A box contains exactly five chips, three red a...
Name: Text, dtype: object
|
The amount of ways to end with a white chip is by having $RRWW, RWW,$ and $WW$ . The amount of arrangements for $RRWW$ with $W$ at the end is $3$ , the number of arrangements of $RWW$ with $W$ at the end is $2$ , and the number of arrangements with $WW$ is just $1$ . This gives us $6$ total ways to end with white. Next, the cases to end with a red are $RWRR$ , and $RRR$ $RWRR$ gives us $3$ ways and $RRR$ gives us $1$ way. So the number of ways to end with a red is $4$ . Thus, our answer is simply $\frac{6}{4+6}$ $\boxed{35}$
| 35
|
5,142
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 7
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
We can solve this problem by finding the cases where the number is divisible by $3$ or $4$ , then subtract from the cases where none of those cases divide $5$ . To solve the ways the numbers divide $3$ or $4$ we find the cases where a number is divisible by $3$ and $4$ as separate cases. We apply the floor function to every case to get $\left\lfloor \frac{2001}{3} \right\rfloor$ $\left\lfloor \frac{2001}{4} \right\rfloor$ , and $\left\lfloor \frac{2001}{12} \right\rfloor$ . The first two floor functions were for calculating the number of individual cases for $3$ and $4$ . The third case was to find any overlapping numbers. The numbers were $667$ $500$ , and $166$ , respectively. We add the first two terms and subtract the third to get $1001$ . The first case is finished.
The second case is more or less the same, except we are applying $3$ and $4$ to $5$ . We must find the cases where the first case over counts multiples of five. Utilizing the floor function again on the fractions $\left\lfloor \frac{2001}{3\cdot5} \right\rfloor$ $\left\lfloor \frac{2001}{4\cdot5} \right\rfloor$ , and $\left\lfloor \frac{2001}{3\cdot4\cdot5} \right\rfloor$ yields the numbers $133$ $100$ , and $33$ . The first two numbers counted all the numbers that were multiples of either four with five or three with five less than $2001$ . The third counted the overlapping cases, which we must subtract from the sum of the first two. We do this to reach $200$ . Subtracting this number from the original $1001$ numbers procures $\boxed{801}$
| 801
|
5,143
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 8
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
First find the number of such integers between 1 and 2000 (inclusive) and then add one to this result because 2001 is a multiple of $3$
There are $\frac45\cdot2000=1600$ numbers that are not multiples of $5$ $\frac23\cdot\frac34\cdot1600=800$ are not multiples of $3$ or $4$ , so $800$ numbers are. $800+1=\boxed{801}$
| 801
|
5,144
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 9
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
Take a good-sized sample of consecutive integers; for example, the first $25$ positive integers. Determine that the numbers $3, 4, 6, 8, 9, 12, 16, 18, 21,$ and $24$ exhibit the properties given in the question. $25$ is a divisor of $2000$ , so there are $\frac{10}{25}\cdot2000=800$ numbers satisfying the given conditions between $1$ and $2000$ . Since $2001$ is a multiple of $3$ , add $1$ to $800$ to get $800+1=\boxed{801}$
| 801
|
5,145
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 10
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
By PIE, there are $1001$ numbers that are multiples of $3$ or $4$ and less than or equal to $2001$ $80\%$ of them will not be divisible by $5$ , and by far the closest number to $80\%$ of $1001$ is $\boxed{801}$
| 801
|
5,146
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 11
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
Similar to some of the above solutions.
We can divide $2001$ by $3$ and $4$ to find the number of integers divisible by $3$ and $4$ . Hence, we find that there are $667$ numbers less than $2001$ that are divisible by $3$ , and $500$ numbers that are divisible by $4$ . However, we will need to subtract the number of multiples of $15$ from 667 and that of $20$ from $500$ , since they're also divisible by 5 which we don't want. There are $133$ $100$ $233$ such numbers. Note that during this process, we've subtracted the multiples of $60$ twice because they're divisible by both $15$ and $20$ , so we have to add $33$ back to the tally (there are $33$ multiples of $60$ that does not exceed $2001$ ). Lastly, we have to subtract multiples of both $3$ AND $4$ since we only want multiples of either $3$ or $4$ . This is tantamount to subtracting the number of multiples of $12$ . And there are $166$ such numbers. Let's now collect our numbers and compute the total: $667$ $500$ $133$ $100$ $33$ $166$ $\boxed{801}$
| 801
|
5,147
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_12
| 12
|
problem_id
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
21b33a597f802b0a4ad56201b9aeba1e How many positive integers not exceeding $2001...
Name: Text, dtype: object
|
Similar to @above:
Let the function $M_{2001}(n)$ return how many multiples of $n$ are there not exceeding $2001$ . Then we have that the desired number is: \[M_{2001}(3)+M_{2001}(4)-M_{2001}(3\cdot 4)-M_{2001}(3 \cdot 5) - M_{2001}(4 \cdot 5)+M_{2001}(3 \cdot 4 \cdot 5)\]
Evaluating each of these we get: \[667+500-166-133-100+33 = 1100-299 = 801.\]
Thus, the answer is $\boxed{801}.$
| 801
|
5,148
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_14
| 1
|
Given the nine-sided regular polygon $A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8 A_9$ , how many distinct equilateral triangles in the plane of the polygon have at least two vertices in the set $\{A_1,A_2,\dots,A_9\}$
$\text{(A) }30 \qquad \text{(B) }36 \qquad \text{(C) }63 \qquad \text{(D) }66 \qquad \text{(E) }72$
|
Each of the $\binom{9}{2} = 36$ pairs of vertices determines two equilateral triangles, for a total of 72 triangles. However, the three triangles $A_1A_4A_7$ $A_2A_5A_8$ , and $A_3A_6A_9$ are each counted 3 times, resulting in an overcount of 6. Thus, there are $\boxed{66}$ distinct equilateral triangles.
| 66
|
5,149
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_15
| 1
|
An insect lives on the surface of a regular tetrahedron with edges of length 1. It wishes to travel on the surface of the tetrahedron from the midpoint of one edge to the midpoint of the opposite edge. What is the length of the shortest such trip? (Note: Two edges of a tetrahedron are opposite if they have no common endpoint.)
$\text{(A) }\frac {1}{2} \sqrt {3} \qquad \text{(B) }1 \qquad \text{(C) }\sqrt {2} \qquad \text{(D) }\frac {3}{2} \qquad \text{(E) }2$
|
Given any path on the surface, we can unfold the surface into a plane to get a path of the same length in the plane. Consider the net of a tetrahedron in the picture below. A pair of opposite points is marked by dots. It is obvious that in the plane the shortest path is just a segment that connects these two points. Its length is the same as the length of the tetrahedron's edge, i.e. $\boxed{1}$
| 1
|
5,150
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_18
| 1
|
A circle centered at $A$ with a radius of 1 and a circle centered at $B$ with a radius of 4 are externally tangent. A third circle is tangent to the first two and to one of their common external tangents as shown. What is the radius of the third circle?
[asy] unitsize(0.75cm); pair A=(0,1), B=(4,4); dot(A); dot(B); draw( circle(A,1) ); draw( circle(B,4) ); draw( (-1.5,0)--(8.5,0) ); draw( A -- (A+(-1,0)) ); label("$1$", A -- (A+(-1,0)), N ); draw( B -- (B+(4,0)) ); label("$4$", B -- (B+(4,0)), N ); label("$A$",A,E); label("$B$",B,W); filldraw( circle( (12/9,4/9), 4/9 ), lightgray, black ); dot( (12/9,4/9) ); [/asy]
$\text{(A) }\frac {1}{3} \qquad \text{(B) }\frac {2}{5} \qquad \text{(C) }\frac {5}{12} \qquad \text{(D) }\frac {4}{9} \qquad \text{(E) }\frac {1}{2}$
|
[asy] unitsize(1cm); pair A=(0,1), B=(4,4), C=(4,1), S=(12/9,4/9); dot(A); dot(B); draw( circle(A,1) ); draw( circle(B,4) ); draw( (-1.5,0)--(8.5,0) ); draw( (A+(4,0)) -- A -- (A+(0,-1)) ); draw( A -- B -- (B+(0,-4)) ); label("$A$",A,N); label("$B$",B,N); label("$C$",C,E); label("$S$",S,N); filldraw( circle(S,4/9), lightgray, black ); dot(S); draw( rightanglemark(A,C,B) ); draw( S -- A ); draw( S -- B ); [/asy]
In the triangle $ABC$ we have $AB = 1+4 = 5$ and $BC=4-1 = 3$ , thus by the Pythagorean theorem we have $AC=4$
Let $r$ be the radius of the small circle, and let $s$ be the perpendicular distance from $S$ to $\overline{AC}$ . Moreover, the small circle is tangent to both other circles, hence we have $SA=1+r$ and $SB=4+r$
We have $SA = \sqrt{s^2 + (1-r)^2}$ and $SB=\sqrt{(4-s)^2 + (4-r)^2}$ . Hence we get the following two equations:
\begin{align*} s^2 + (1-r)^2 & = (1+r)^2 \\ (4-s)^2 + (4-r)^2 & = (4+r)^2 \end{align*}
Simplifying both, we get
\begin{align*} s^2 & = 4r \\ (4-s)^2 & = 16r \end{align*}
As in our case both $r$ and $s$ are positive, we can divide the second one by the first one to get $\left( \frac{4-s}s \right)^2 = 4$
Now there are two possibilities: either $\frac{4-s}s=-2$ , or $\frac{4-s}s=2$
In the first case clearly $s<0$ , which puts the center on the wrong side of $A$ , so this is not the correct case.
(Note: This case corresponds to the other circle that is tangent to both given circles and the common tangent line. By coincidence, due to the $4:1$ ratio between radii of $A$ and $B$ , this circle turns out to have the same radius as circle $B$ , with center directly left of center $B$ , and tangent to $B$ directly above center $A$ .)
The second case solves to $s=\frac 43$ . We then have $4r = s^2 = \frac {16}9$ , hence $r = \boxed{49}$
| 49
|
5,151
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_18
| 2
|
A circle centered at $A$ with a radius of 1 and a circle centered at $B$ with a radius of 4 are externally tangent. A third circle is tangent to the first two and to one of their common external tangents as shown. What is the radius of the third circle?
[asy] unitsize(0.75cm); pair A=(0,1), B=(4,4); dot(A); dot(B); draw( circle(A,1) ); draw( circle(B,4) ); draw( (-1.5,0)--(8.5,0) ); draw( A -- (A+(-1,0)) ); label("$1$", A -- (A+(-1,0)), N ); draw( B -- (B+(4,0)) ); label("$4$", B -- (B+(4,0)), N ); label("$A$",A,E); label("$B$",B,W); filldraw( circle( (12/9,4/9), 4/9 ), lightgray, black ); dot( (12/9,4/9) ); [/asy]
$\text{(A) }\frac {1}{3} \qquad \text{(B) }\frac {2}{5} \qquad \text{(C) }\frac {5}{12} \qquad \text{(D) }\frac {4}{9} \qquad \text{(E) }\frac {1}{2}$
|
The horizontal line is the equivalent of a circle of curvature $0$ , thus we can apply Descartes' Circle Formula
The four circles have curvatures $0, 1, \frac 14$ , and $\frac 1r$
We have $2\left(0^2+1^2+\frac {1}{4^2}+\frac{1}{r^2}\right)=\left(0+1+\frac 14+\frac 1r\right)^2$
Simplifying, we get $\frac{34}{16}+\frac{2}{r^2}=\frac{25}{16}+\frac{5}{2r}+\frac{1}{r^2}$
\[\frac{1}{r^2}-\frac{5}{2r}+\frac{9}{16}=0\] \[\frac{16}{r^2}-\frac{40}{r}+9=0\] \[\left(\frac{4}{r}-9\right)\left(\frac{4}{r}-1\right)=0\]
Obviously $r$ cannot equal $4$ , therefore $r = \boxed{49}$
| 49
|
5,152
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_20
| 1
|
Points $A = (3,9)$ $B = (1,1)$ $C = (5,3)$ , and $D=(a,b)$ lie in the first quadrant and are the vertices of quadrilateral $ABCD$ . The quadrilateral formed by joining the midpoints of $\overline{AB}$ $\overline{BC}$ $\overline{CD}$ , and $\overline{DA}$ is a square. What is the sum of the coordinates of point $D$
$\text{(A) }7 \qquad \text{(B) }9 \qquad \text{(C) }10 \qquad \text{(D) }12 \qquad \text{(E) }16$
|
[asy] pair A=(3,9), B=(1,1), C=(5,3), D=(7,3); draw(A--B--C--D--cycle); label("$A$",A,N); label("$B$",B,SW); label("$C$",C,N); label("$D$",D,E); pair AB = (A + B)/2, BC = (B + C)/2, CD = (C + D)/2, DA = (D + A)/2; draw(AB--BC--CD--DA--cycle); [/asy]
We already know two vertices of the square: $(A+B)/2 = (2,5)$ and $(B+C)/2 = (3,2)$
There are only two possibilities for the other vertices of the square: either they are $(6,3)$ and $(5,6)$ , or they are $(0,1)$ and $(-1,4)$ . The second case would give us $D$ outside the first quadrant, hence the first case is the correct one. As $(6,3)$ is the midpoint of $CD$ , we can compute $D=(7,3)$ , and $7+3=\boxed{10}$
| 10
|
5,153
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_21
| 1
|
Four positive integers $a$ $b$ $c$ , and $d$ have a product of $8!$ and satisfy:
\[\begin{array}{rl} ab + a + b & = 524 \\ bc + b + c & = 146 \\ cd + c + d & = 104 \end{array}\]
What is $a-d$
$\text{(A) }4 \qquad \text{(B) }6 \qquad \text{(C) }8 \qquad \text{(D) }10 \qquad \text{(E) }12$
|
Using Simon's Favorite Factoring Trick, we can rewrite the three equations as follows:
\begin{align*} (a+1)(b+1) & = 525 \\ (b+1)(c+1) & = 147 \\ (c+1)(d+1) & = 105 \end{align*}
Let $(e,f,g,h)=(a+1,b+1,c+1,d+1)$ . We get:
\begin{align*} ef & = 3\cdot 5\cdot 5\cdot 7 \\ fg & = 3\cdot 7\cdot 7 \\ gh & = 3\cdot 5\cdot 7 \end{align*}
Clearly $7^2$ divides $fg$ . On the other hand, $7^2$ can not divide $f$ , as it then would divide $ef$ . Similarly, $7^2$ can not divide $g$ . Hence $7$ divides both $f$ and $g$ . This leaves us with only two cases: $(f,g)=(7,21)$ and $(f,g)=(21,7)$
The first case solves to $(e,f,g,h)=(75,7,21,5)$ , which gives us $(a,b,c,d)=(74,6,20,4)$ , but then $abcd \not= 8!$ . We do not need to multiply, it is enough to note e.g. that the left hand side is not divisible by $7$ . (Also, a - d equals $70$ in this case, which is way too large to fit the answer choices.)
The second case solves to $(e,f,g,h)=(25,21,7,15)$ , which gives us a valid quadruple $(a,b,c,d)=(24,20,6,14)$ , and we have $a-d=24-14 =\boxed{10}$
| 10
|
5,154
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 1
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
[asy] unitsize(0.5cm); defaultpen(0.8); pair A=(0,0), B=(10,0), C=(10,7), D=(0,7), E=(C+D)/2, F=(2*A+B)/3, G=(A+2*B)/3; pair H = intersectionpoint(A--C,E--F); pair J = intersectionpoint(A--C,E--G); draw(A--B--C--D--cycle); draw(G--E--F); draw(A--C); label("$A$",A,SW); label("$B$",B,SE); label("$C$",C,NE); label("$D$",D,NW); label("$E$",E,N); label("$F$",F,S); label("$G$",G,S); label("$H$",H,SE); label("$J$",J,ESE); filldraw(E--H--J--cycle,lightgray,black); draw(H--D, dashed); [/asy] Note that the triangles $AFH$ and $CEH$ are similar, as they have the same angles. Hence $\frac {AH}{HC} = \frac{AF}{EC} = \frac 23$
Also, triangles $AGJ$ and $CEJ$ are similar, hence $\frac {AJ}{JC} = \frac {AG}{EC} = \frac 43$
We can now compute $[EHJ]$ as $[ACD]-[AHD]-[DEH]-[EJC]$ . We have:
Therefore $[EHJ]=[ACD]-[AHD]-[DEH]-[EJC]=35-14-\frac {21}2-\frac{15}2 = \boxed{3}$
| 3
|
5,155
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 2
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
As in the previous solution, we note the similar triangles and prove that $H$ is in $2/5$ and $J$ in $4/7$ of $AC$
We can then compute that $HJ = AC \cdot \left( \frac 47 - \frac 25 \right) = AC \cdot \frac{6}{35}$
As $E$ is the midpoint of $CD$ , the height from $E$ onto $AC$ is $1/2$ of the height from $D$ onto $AC$ . Therefore we have $[EHJ] = \frac{6}{35} \cdot \frac 12 \cdot [ACD] = \frac 3{35} \cdot 35 = \boxed{3}$
| 3
|
5,156
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 3
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
Because we see that there are only lines and there is a rectangle, we can coordbash (place this figure on coordinates). Because this is a general figure, we can assume the sides are $7$ and $10$ (or any other two positive real numbers that multiply to 70). We can find $H$ and $J$ by intersecting lines, and then we calculate the area of $EHJ$ using shoelace formula. This yields $\boxed{3}$
| 3
|
5,157
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 4
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
Note that triangle $AFH$ is similar to triangle $CEH$ with ratio $\frac{2}{3}$ . Similarly, triangle $AGJ$ is similar to triangle $ECJ$ with ratio $\frac{4}{3}$ . Thus, if $AC = a$ then we know that $AH = \frac{2}{5}a$ and $JC = \frac{3}{7}a$ meaning $HJ = \frac{6}{35}a$ and thus the ratio of $HJ$ to $JC$ is $\frac{\frac{6}{35}}{\frac{3}{7}} = \frac{2}{5}$ which equals the ratio of the areas of $HJE$ to $JEC$ . If $y = AD, x = DC$ , then we know that $JEC = \text{(altitude from J to EC)} \cdot EC = \frac{3}{7}y \cdot \frac{1}{2}x \cdot \frac{1}{2}$ and since $xy = 70$ and we want to find $\frac{2}{5}$ of this, we get our answer is $\frac{2}{5} \cdot \frac{3}{7} \cdot \frac{1}{2} \cdot 70 \cdot \frac{1}{2} = \boxed{3}$ . -SuperJJ
| 3
|
5,158
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 5
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
$[CEF] = \frac{[ABCD]}{4} = \frac{35}{2}$
$\triangle CEH \sim \triangle AFH$ $\frac{HE}{HF} = \frac{CE}{AF} = \frac{3}{2}$ $\frac{HE}{EF} = \frac{3}{5}$
$[CEH] = \frac{HE}{EF} \cdot [CEF] = \frac{3}{5} \cdot \frac{35}{2} = \frac{21}{2}$
$\triangle CEH \sim \triangle AFH$ $\frac{AH}{HC} = \frac{AF}{CE} = \frac{2}{3}$ $\frac{AH}{AC} = \frac{2}{5}$ $\frac{CH}{AC} = \frac{3}{5}$
$\triangle CEJ \sim \triangle AGJ$ $\frac{AJ}{JC} = \frac{AG}{CE} = \frac{4}{3}$ $\frac{AJ}{AC} = \frac{4}{7}$
$\frac{HJ}{AC} = \frac{AJ}{AC} - \frac{AH}{AC} = \frac{4}{7} - \frac{2}{5} = \frac{6}{35}$
$\frac{HJ}{CH} = \frac{HJ}{AC} \cdot \frac{AC}{CH} = \frac{6}{35} \cdot \frac{5}{3} = \frac{2}{7}$
$[EHJ] = \frac{HJ}{CH} \cdot [CEH] = \frac{2}{7} \cdot \frac{21}{2} = \boxed{3}$
| 3
|
5,159
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_22
| 6
|
In rectangle $ABCD$ , points $F$ and $G$ lie on $AB$ so that $AF=FG=GB$ and $E$ is the midpoint of $\overline{DC}$ . Also, $\overline{AC}$ intersects $\overline{EF}$ at $H$ and $\overline{EG}$ at $J$ . The area of the rectangle $ABCD$ is $70$ . Find the area of triangle $EHJ$
$\text{(A) }\frac {5}{2} \qquad \text{(B) }\frac {35}{12} \qquad \text{(C) }3 \qquad \text{(D) }\frac {7}{2} \qquad \text{(E) }\frac {35}{8}$
|
We need one more pair of ratios to fully define our mass point system. Let's use $\triangle AFH \sim \triangle CEH\implies EH:HF = 3:2$ and now do mass points on $\triangle AEG$
[asy] size(250); pair A = (0,0), B = (10,0), C = (10,7), D = (0,7); pair F = (10/3,0), G = (20/3,0), E = (5,7); pair H = intersectionpoint(A--C, E--F); pair J = intersectionpoint(A--C, E--G); filldraw(A--E--G--cycle, rgb(1,1,1)+opacity(0.3), red+2bp); draw(A--B--C--D--cycle); draw(A--C); draw(E--F); draw(E--G); draw(A--E, dashed); draw(E--B, dashed); dot("$A$", A, SW); dot("$B$", B, SE); dot("$C$", C, NE); dot("$D$", D, NW); dot("$E$", E, N); dot("$F$", F, S); dot("$G$", G, S); dot("$H$", H, ESE); dot("$J$", J, W); // mass point labels pair mass = A + SW; label(scale(0.8)*"$3$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); pair mass = F + S; label(scale(0.8)*"$6$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); pair mass = G + SE; label(scale(0.8)*"$3$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); pair mass = J + .7*ESE; label(scale(0.8)*"$7$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); pair mass = E + N; label(scale(0.8)*"$4$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); pair mass = H + .7*WNW; label(scale(0.8)*"$10$", mass, UnFill); draw(circle(mass, .4), linewidth(1)); [/asy]
Now it's just a standard "Area Reduction by Ratios"™ problem going from:
\[[ABCD]\xrightarrow[]{\frac{1}{2}}[AEB]\xrightarrow[]{\frac{2}{3}}[AEG]\xrightarrow[]{\frac{3}{7}}[AEJ]\xrightarrow[]{\frac{3}{10}}[HEJ]\]
or,
\[70 \cdot \frac{1}{2}\cdot \frac{2}{3}\cdot \frac{3}{7}\cdot \frac{3}{10} = \boxed{3}\]
| 3
|
5,160
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_24
| 1
|
In $\triangle ABC$ $\angle ABC=45^\circ$ . Point $D$ is on $\overline{BC}$ so that $2\cdot BD=CD$ and $\angle DAB=15^\circ$ . Find $\angle ACB.$
$\text{(A) }54^\circ \qquad \text{(B) }60^\circ \qquad \text{(C) }72^\circ \qquad \text{(D) }75^\circ \qquad \text{(E) }90^\circ$
|
Draw a good diagram! Now, let's call $BD=t$ , so $DC=2t$ . Given the rather nice angles of $\angle ABD = 45^\circ$ and $\angle ADC = 60^\circ$ as you can see, let's do trig. Drop an altitude from $A$ to $BC$ ; call this point $H$ . We realize that there is no specific factor of $t$ we can call this just yet, so let $AH=kt$ . Notice that in $\triangle{ABH}$ we get $BH=kt$ . Using the 60-degree angle in $\triangle{ADH}$ , we obtain $DH=\frac{\sqrt{3}}{3}kt$ . The comparable ratio is that $BH-DH=t$ . If we involve our $k$ , we get:
$kt(\frac{3}{3}-\frac{\sqrt{3}}{3})=t$ . Eliminating $t$ and removing radicals from the denominator, we get $k=\frac{3+\sqrt{3}}{2}$ . From there, one can easily obtain $HC=3t-kt=\frac{3-\sqrt{3}}{2}t$ . Now we finally have a desired ratio. Since $\tan\angle ACH = 2+\sqrt{3}$ upon calculation, we know that $\angle ACH$ can be simplified. Indeed, if you know that $\tan(75)=2+\sqrt{3}$ or even take a minute or two to work out the sine and cosine using $\sin(x)^2+\cos(x)^2=1$ , and perhaps the half- or double-angle formulas, you get $\boxed{75}$
| 75
|
5,161
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_24
| 2
|
In $\triangle ABC$ $\angle ABC=45^\circ$ . Point $D$ is on $\overline{BC}$ so that $2\cdot BD=CD$ and $\angle DAB=15^\circ$ . Find $\angle ACB.$
$\text{(A) }54^\circ \qquad \text{(B) }60^\circ \qquad \text{(C) }72^\circ \qquad \text{(D) }75^\circ \qquad \text{(E) }90^\circ$
|
Without loss of generality, we can assume that $BD = 1$ and $CD = 2$ . As above, we are able to find that $\angle ADC = 60^\circ$ and $\angle ADB = 120^\circ$
Using Law of Sines on triangle $ADB$ , we find that \[\frac{1}{\sin15^\circ} = \frac{AD}{\sin 45^\circ} = \frac{AB}{\sin 120^\circ}.\] Since we know that \[\sin 15^\circ = \frac{\sqrt{6}-\sqrt{2}}{4},\] \[\sin 45^\circ = \frac{\sqrt{2}}{2},\] \[\sin 120^\circ = \frac{\sqrt{3}}{2},\] we can compute $AD$ to equal $1+\sqrt{3}$ and $AB$ to be $\frac{3\sqrt{2}+\sqrt{6}}{2}$
Next, we apply Law of Cosines to triangle $ADC$ to see that \[AC^2 = (1+\sqrt{3})^2 + 2^2 - (2)(1+\sqrt{3})(2)(\cos 60^\circ).\] Simplifying the right side, we get $AC^2 = 6$ , so $AC = \sqrt{6}$
Now, we apply Law of Sines to triangle $ABC$ to see that \[\frac{\sqrt{6}}{\sin 45^\circ} = \frac{\frac{3\sqrt{2}+\sqrt{6}}{2}}{\sin ACB}.\] After rearranging and noting that $\sin 45^\circ = \frac{\sqrt{2}}{2}$ , we get \[\sin ACB = \frac{\sqrt{6}+3\sqrt{2}}{4\sqrt{3}}.\]
Dividing the right side by $\sqrt{3}$ , we see that \[\sin ACB = \frac{\sqrt{6}+\sqrt{2}}{4},\] so $\angle ACB$ is either $75^\circ$ or $105^\circ$ . Since $105^\circ$ is not a choice, we know $\angle ACB = \boxed{75}$
| 75
|
5,162
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_24
| 3
|
In $\triangle ABC$ $\angle ABC=45^\circ$ . Point $D$ is on $\overline{BC}$ so that $2\cdot BD=CD$ and $\angle DAB=15^\circ$ . Find $\angle ACB.$
$\text{(A) }54^\circ \qquad \text{(B) }60^\circ \qquad \text{(C) }72^\circ \qquad \text{(D) }75^\circ \qquad \text{(E) }90^\circ$
|
$\angle ADB = 120^\circ$ $\angle ADC = 60^\circ$ $\angle DAB = 15^\circ$ , let $\angle ACB = \theta$ $\angle DAC = 120^\circ - \theta$
By the Law of Sines , we have $\frac{CD}{\sin(120^\circ - \theta)} = \frac{AD}{\sin \theta}$
$\space$ $\frac{BD}{\sin15^\circ} = \frac{AD}{\sin45^\circ}$
$\frac{BD}{CD} \cdot \frac{\sin(120^\circ - \theta)}{\sin15^\circ} = \frac{\sin \theta}{\sin45^\circ}$
$\frac{1}{2} \cdot \frac{\sin(120^\circ - \theta)}{\sin15^\circ} = \frac{\sin \theta}{\sin45^\circ}$
By the Triple-angle Identities $\sin 45^\circ = 3\sin15^\circ -4\sin^3 15^\circ$
$\frac{\sin(120^\circ - \theta)}{2} = \frac{\sin \theta}{3\ -4\sin^2 15^\circ}$
$\sin^2 15^\circ = \frac{1 - \cos 30^\circ}{2} = \frac{1 - \frac{\sqrt{3}}{2}}{2} = \frac{2 - \sqrt{3}}{4}$
$\frac{\sin(120^\circ - \theta)}{2} = \frac{\sin \theta}{3 - 4 \cdot \frac{2 - \sqrt{3}}{4}} = \frac{\sin \theta}{1+\sqrt{3}}$
$\frac{\sin \theta}{\sin(120^\circ - \theta)} = \frac{1+\sqrt{3}}{2}$
$\sin(120^\circ - \theta) = \sin120^\circ \cos\theta - \sin\theta \cos120^\circ = \frac{\sqrt{3}}{2} \cdot \cos\theta + \frac{1}{2} \cdot \sin\theta$ ，so
$\frac{\sin \theta}{\frac{\sqrt{3}}{2} \cdot \cos\theta + \frac{1}{2} \cdot \sin\theta} = \frac{1+\sqrt{3}}{2}$
$\frac{\sqrt{3} \cdot \cos\theta + \sin\theta}{2 \sin \theta} = \frac{2}{1+\sqrt{3}}$
$\frac{\sqrt{3}}{2} \cdot \cot \theta = \frac{2}{1+\sqrt{3}} - \frac{1}{2} = \frac{3 - \sqrt{3}}{2 + 2 \sqrt{3}}$
$\cot \theta = \frac{\cos \theta}{\sin \theta} = \frac{\sqrt{3} - 1}{\sqrt{3} + 1}$
Suppose $\cos \theta = k(\sqrt{3} - 1)$ , and $\sin \theta = k(\sqrt{3} + 1)$
$\sin^2 \theta + \cos^2 \theta = 1$ $k^2(\sqrt{3} + 1)^2 + k^2(\sqrt{3} - 1)^2 = 8k^2 = 1$ $k = \frac{1}{2 \sqrt{2}}$
$\sin \theta = \frac{\sqrt{3} + 1}{2 \sqrt{2}}$ $\cos \theta = \frac{\sqrt{3} - 1}{2 \sqrt{2}}$
$\sin 2 \theta = 2 \cdot \frac{\sqrt{3} + 1}{2 \sqrt{2}} \cdot \frac{\sqrt{3} - 1}{2 \sqrt{2}} = \frac{1}{2}$
Two possible values of $2 \theta$ are $150^\circ$ and $30^\circ$ . However we can rule out $30^\circ$ because $\cos 15^\circ$ is positive, while $\cos \theta$ is negative.
Therefore $2 \theta = 150^\circ$ $\angle ACB = \boxed{75}$
| 75
|
5,163
|
https://artofproblemsolving.com/wiki/index.php/2001_AMC_12_Problems/Problem_24
| 4
|
In $\triangle ABC$ $\angle ABC=45^\circ$ . Point $D$ is on $\overline{BC}$ so that $2\cdot BD=CD$ and $\angle DAB=15^\circ$ . Find $\angle ACB.$
$\text{(A) }54^\circ \qquad \text{(B) }60^\circ \qquad \text{(C) }72^\circ \qquad \text{(D) }75^\circ \qquad \text{(E) }90^\circ$
|
For starters, we have $\angle ABD=120^\circ.$ Dropping perpendiculars $\overline{DX}$ and $\overline{CY}$ from $D$ and $C$ to $\overline{AB}$ gives $\angle ADX=120^\circ-45^\circ=75^\circ,$ since $\angle BDX=45^\circ.$
Without loss of generality, let $BD=1$ and $CD=2.$ This tells us that $BX=DX=\sqrt{2}/2.$ Using trigonometric identities, we find that
\[\tan \angle ADX=\tan 75^\circ=\dfrac{\sqrt 6+\sqrt 2}{\sqrt 6-\sqrt 2}.\] Thus, $AX/DX=\dfrac{\sqrt 6+\sqrt 2}{\sqrt 6-\sqrt 2},$ which gives $AX=\dfrac{2\sqrt 2+\sqrt 6}{2}.$ Thus, $AB=AX+BX=\dfrac{3\sqrt 2+\sqrt 6}{2}.$
Now, note that $BCY$ is a $45-45-90$ triangle, so $CY=BY=\dfrac{3\sqrt 2}{2}.$ Thus, we have
\[[ABC]=\dfrac{1}{2}\cdot AB\cdot CY=\dfrac{1}{2}\cdot \dfrac{3\sqrt 2+\sqrt 6}{2}\cdot \dfrac{3\sqrt 2}{2}=\dfrac{9+3\sqrt 3}{4}.\] Additionally, note that $AY=AB-BY=\sqrt{6}/2.$ Applying the Pythagorean Theorem to triangle $AYC$ then tells us that $AC=\sqrt{6}.$ By the trigonometric formula for area,
\[[ABC]=\dfrac{1}{2}\cdot BC\cdot AC\cdot \sin \angle ACB=\dfrac{3\sqrt 6}{2}\sin \angle ACB.\] Setting this equal to our other area and solving gives $\sin \angle ACB=\dfrac{\sqrt 6+\sqrt 2}{4},$ so $\angle ACB=\boxed{75}.$ ~vaporwave
| 75
|
5,164
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_1
| 1
|
In the year $2001$ , the United States will host the International Mathematical Olympiad . Let $I,M,$ and $O$ be distinct positive integers such that the product $I \cdot M \cdot O = 2001$ . What is the largest possible value of the sum $I + M + O$
$\textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\ 111 \qquad \textbf{(E)}\ 671$
|
First, we need to recognize that a number is going to be lowest only if, of the $3$ factors , two of them are small. If we want to make sure that this is correct, we could test with a smaller number, like $30$ . It becomes much more clear that this is true, and in this situation, the value of $I + M + O$ would be $18$ . Now, we use this process on $2001$ to get $667 * 3 * 1$ as our $3$ factors.
Hence, we have $667 + 3 + 1 = \boxed{671}$
| 671
|
5,165
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_1
| 2
|
In the year $2001$ , the United States will host the International Mathematical Olympiad . Let $I,M,$ and $O$ be distinct positive integers such that the product $I \cdot M \cdot O = 2001$ . What is the largest possible value of the sum $I + M + O$
$\textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\ 111 \qquad \textbf{(E)}\ 671$
|
The sum is the highest if two factors are the lowest.
So, $1 \cdot 3 \cdot 667 = 2001$ and $1+3+667=671 \Longrightarrow \boxed{671}$
| 671
|
5,166
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_1
| 3
|
In the year $2001$ , the United States will host the International Mathematical Olympiad . Let $I,M,$ and $O$ be distinct positive integers such that the product $I \cdot M \cdot O = 2001$ . What is the largest possible value of the sum $I + M + O$
$\textbf{(A)}\ 23 \qquad \textbf{(B)}\ 55 \qquad \textbf{(C)}\ 99 \qquad \textbf{(D)}\ 111 \qquad \textbf{(E)}\ 671$
|
We see since $2 + 0 + 0 + 1$ is divisible by $3$ , we can eliminate all of the first $4$ answer choices because they are way too small and get $\boxed{671}$ as our final answer.
| 671
|
5,167
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_3
| 1
|
Each day, Jenny ate $20\%$ of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, $32$ remained. How many jellybeans were in the jar originally?
$\textbf{(A)} \ 40 \qquad \textbf{(B)} \ 50 \qquad \textbf{(C)} \ 55 \qquad \textbf{(D)} \ 60 \qquad \textbf{(E)} \ 75$
|
We can begin by labeling the number of initial jellybeans $x$ . If she ate $20\%$ of the jellybeans, then $80\%$ is remaining. Hence, after day 1, there are: $0.8 * x$
After day 2, there are: $0.8 * 0.8 * x$ or $0.64x$ jellybeans. $0.64x = 32$ , so $x = \boxed{50}$
| 50
|
5,168
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_3
| 2
|
Each day, Jenny ate $20\%$ of the jellybeans that were in her jar at the beginning of that day. At the end of the second day, $32$ remained. How many jellybeans were in the jar originally?
$\textbf{(A)} \ 40 \qquad \textbf{(B)} \ 50 \qquad \textbf{(C)} \ 55 \qquad \textbf{(D)} \ 60 \qquad \textbf{(E)} \ 75$
|
Testing the answers choices out, we see that the answer is $\boxed{50}$
| 50
|
5,169
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_4
| 1
|
The Fibonacci sequence $1,1,2,3,5,8,13,21,\ldots$ starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci sequence?
$\textbf{(A)} \ 0 \qquad \textbf{(B)} \ 4 \qquad \textbf{(C)} \ 6 \qquad \textbf{(D)} \ 7 \qquad \textbf{(E)} \ 9$
|
Note that any digits other than the units digit will not affect the answer. So to make computation quicker, we can just look at the Fibonacci sequence in $\bmod{10}$
$1,1,2,3,5,8,3,1,4,5,9,4,3,7,0,7,7,4,1,5,6,....$
The last digit to appear in the units position of a number in the Fibonacci sequence is $6 \Longrightarrow \boxed{6}$
| 6
|
5,170
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_6
| 1
|
Two different prime numbers between $4$ and $18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
$\textbf{(A)}\ 22 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 119 \qquad\textbf{(D)}\ 180 \qquad\textbf{(E)}\ 231$
|
Any two prime numbers between 4 and 18 have an odd product and an even sum. Any odd number minus an even number is an odd number, so we can eliminate A, B, and D. Since the highest two prime numbers we can pick are 13 and 17, the highest number we can make is $(13)(17)-(13+17) = 221 - 30 = 191$ . Thus, we can eliminate E. So, the answer must be $\boxed{119}$
| 119
|
5,171
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_6
| 2
|
Two different prime numbers between $4$ and $18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
$\textbf{(A)}\ 22 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 119 \qquad\textbf{(D)}\ 180 \qquad\textbf{(E)}\ 231$
|
Let the two primes be $p$ and $q$ . We wish to obtain the value of $pq-(p+q)$ , or $pq-p-q$ . Using Simon's Favorite Factoring Trick , we can rewrite this expression as $(1-p)(1-q) -1$ or $(p-1)(q-1) -1$ . Noticing that $(13-1)(11-1) - 1 = 120-1 = 119$ , we see that the answer is $\boxed{119}$
| 119
|
5,172
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_7
| 1
|
How many positive integers $b$ have the property that $\log_{b} 729$ is a positive integer?
$\mathrm{(A) \ 0 } \qquad \mathrm{(B) \ 1 } \qquad \mathrm{(C) \ 2 } \qquad \mathrm{(D) \ 3 } \qquad \mathrm{(E) \ 4 }$
|
If $\log_{b} 729 = n$ , then $b^n = 729$ . Since $729 = 3^6$ $b$ must be $3$ to some factor of 6. Thus, there are four (3, 9, 27, 729) possible values of $b \Longrightarrow \boxed{4}$
| 4
|
5,173
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8
| 1
|
Figures $0$ $1$ $2$ , and $3$ consist of $1$ $5$ $13$ , and $25$ nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?
[asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S); [/asy]
$\textbf{(A)}\ 10401 \qquad\textbf{(B)}\ 19801 \qquad\textbf{(C)}\ 20201 \qquad\textbf{(D)}\ 39801 \qquad\textbf{(E)}\ 40801$
|
Using the recursion from solution 1, we see that the first differences of $4, 8, 12, ...$ form an arithmetic progression, and consequently that the second differences are constant and all equal to $4$ . Thus, the original sequence can be generated from a quadratic function.
If $f(n) = an^2 + bn + c$ , and $f(0) = 1$ $f(1) = 5$ , and $f(2) = 13$ , we get a system of three equations in three variables:
$f(0) = 1$ gives $c = 1$
$f(1) = 5$ gives $a + b + c = 5$
$f(2) = 13$ gives $4a + 2b + c = 13$
Plugging in $c=1$ into the last two equations gives
$a + b = 4$
$4a + 2b = 12$
Dividing the second equation by 2 gives the system:
$a + b = 4$
$2a + b = 6$
Subtracting the first equation from the second gives $a = 2$ , and hence $b = 2$ . Thus, our quadratic function is:
$f(n) = 2n^2 + 2n + 1$
Calculating the answer to our problem, $f(100) = 20000 + 200 + 1 = 20201$ , which is choice $\boxed{20201}$
| 201
|
5,174
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8
| 2
|
Figures $0$ $1$ $2$ , and $3$ consist of $1$ $5$ $13$ , and $25$ nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?
[asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S); [/asy]
$\textbf{(A)}\ 10401 \qquad\textbf{(B)}\ 19801 \qquad\textbf{(C)}\ 20201 \qquad\textbf{(D)}\ 39801 \qquad\textbf{(E)}\ 40801$
|
We can see that each figure $n$ has a central box and 4 columns of $n$ boxes on each side of each square. Therefore, at figure 100, there is a central box with 100 boxes on the top, right, left, and bottom. Knowing that each quarter of each figure has a pyramid structure, we know that for each quarter there are $\sum_{n=1}^{100} n = 5050$ squares. $4 \cdot 5050 = 20200$ . Adding in the original center box we have $20200 + 1 = \boxed{20201}$
| 201
|
5,175
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8
| 4
|
Figures $0$ $1$ $2$ , and $3$ consist of $1$ $5$ $13$ , and $25$ nonoverlapping unit squares, respectively. If the pattern were continued, how many nonoverlapping unit squares would there be in figure 100?
[asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S); [/asy]
$\textbf{(A)}\ 10401 \qquad\textbf{(B)}\ 19801 \qquad\textbf{(C)}\ 20201 \qquad\textbf{(D)}\ 39801 \qquad\textbf{(E)}\ 40801$
|
Let $f_n$ denote the number of unit cubes in a figure. We have \[f_0=1\] \[f_1=5\] \[f_2=13\] \[f_3=25\] \[f_4=41\] \[...\]
Computing the difference between the number of cubes in each figure yields \[4,8,12,16,...\] It is easy to notice that this is an arithmetic sequence, with the first term being $4$ and the difference being $4$ . Let this sequence be $a_n$
From $f_0$ to $f_{100}$ , the sequence will have $100$ terms. Using the arithmetic sum formula yields
\[S_{100}=\frac{100[2\cdot 4+(100-1)4]}{2}\] \[=50(2\cdot 4+99\cdot 4)\] \[=50(101\cdot 4)\] \[=200\cdot 101\] \[=20200\]
So $f_{100}=1+20200=\boxed{20201}$ unit cubes.
| 201
|
5,176
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12
| 1
|
Let [mathjax]A, M,[/mathjax] and [mathjax]C[/mathjax] be nonnegative integers such that [mathjax]A + M + C=12[/mathjax]. What is the maximum value of [mathjax]A \cdot M \cdot C + A \cdot M + M \cdot C + A \cdot C[/mathjax]?
[katex] \mathrm{(A) \ 62 } \qquad \mathrm{(B) \ 72 } \qquad \mathrm{(C) \ 92 } \qquad \mathrm{(D) \ 102 } \qquad \mathrm{(E) \ 112 } [/katex]
|
It is not hard to see that \[(A+1)(M+1)(C+1)=\] \[AMC+AM+AC+MC+A+M+C+1\] Since $A+M+C=12$ , we can rewrite this as \[(A+1)(M+1)(C+1)=\] \[AMC+AM+AC+MC+13\] So we wish to maximize \[(A+1)(M+1)(C+1)-13\] Which is largest when all the factors are equal (consequence of AM-GM). Since $A+M+C=12$ , we set $A=M=C=4$ Which gives us \[(4+1)(4+1)(4+1)-13=112\] so the answer is $\boxed{112}.$
| 112
|
5,177
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12
| 2
|
Let [mathjax]A, M,[/mathjax] and [mathjax]C[/mathjax] be nonnegative integers such that [mathjax]A + M + C=12[/mathjax]. What is the maximum value of [mathjax]A \cdot M \cdot C + A \cdot M + M \cdot C + A \cdot C[/mathjax]?
[katex] \mathrm{(A) \ 62 } \qquad \mathrm{(B) \ 72 } \qquad \mathrm{(C) \ 92 } \qquad \mathrm{(D) \ 102 } \qquad \mathrm{(E) \ 112 } [/katex]
|
Assume $A$ $M$ , and $C$ are equal to $4$ . Since the resulting value of $AMC+AM+AC+MC$ will be $112$ and this is the largest answer choice, our answer is $\boxed{112}$
| 112
|
5,178
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12
| 3
|
Let [mathjax]A, M,[/mathjax] and [mathjax]C[/mathjax] be nonnegative integers such that [mathjax]A + M + C=12[/mathjax]. What is the maximum value of [mathjax]A \cdot M \cdot C + A \cdot M + M \cdot C + A \cdot C[/mathjax]?
[katex] \mathrm{(A) \ 62 } \qquad \mathrm{(B) \ 72 } \qquad \mathrm{(C) \ 92 } \qquad \mathrm{(D) \ 102 } \qquad \mathrm{(E) \ 112 } [/katex]
|
We start off the same way as Solution 4, using AM-GM to observe that $AMC \leq 64$ . We then observe that
$(A + M + C)^2 = A^2 + M^2 + C^2 + 2(AM + MC + AC) = 144$ , since $A + M + C = 12$
We can use the AM-GM inequality again, this time observing that $\frac{A^2 + M^2 + C^2}{3} \geq \sqrt[3]{{(AMC)}^2}$
Since $AMC \leq 64$ $3 \sqrt[3]{{(AMC)}^2} \leq 48$ . We then plug this in to yield
$A^2 + M^2 + C^2 + 2(AM + MC + AC) = 144 \geq 48 + 2(AM + MC + AC)$
Thus, $AM + MC + AC \leq 48$ . We now revisit the original equation that we wish to maximize. Since we know $AMC \leq 64$ , we now have upper bounds on both of our unruly terms. Plugging both in results in $48 + 64 = \boxed{112}$
| 112
|
5,179
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12
| 4
|
Let [mathjax]A, M,[/mathjax] and [mathjax]C[/mathjax] be nonnegative integers such that [mathjax]A + M + C=12[/mathjax]. What is the maximum value of [mathjax]A \cdot M \cdot C + A \cdot M + M \cdot C + A \cdot C[/mathjax]?
[katex] \mathrm{(A) \ 62 } \qquad \mathrm{(B) \ 72 } \qquad \mathrm{(C) \ 92 } \qquad \mathrm{(D) \ 102 } \qquad \mathrm{(E) \ 112 } [/katex]
|
The largest number for our value would be $A = M = C.$ So $3A = 12$ and $A = M = C = 4.$ $4\times4\times4 + 4\times4 + 4\times4 = 112$ or $\boxed{112}$
| 112
|
5,180
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_13
| 1
|
One morning each member of Angela's family drank an 8-ounce mixture of coffee with milk. The amounts of coffee and milk varied from cup to cup, but were never zero. Angela drank a quarter of the total amount of milk and a sixth of the total amount of coffee. How many people are in the family?
$\text {(A)}\ 3 \qquad \text {(B)}\ 4 \qquad \text {(C)}\ 5 \qquad \text {(D)}\ 6 \qquad \text {(E)}\ 7$
|
If there were 4 people in the family, and each of them drank exactly the same amount of coffee and milk as Angela, there would be too much coffee. If there were 6 people in the family, and each of them drank exactly the same amount of coffee and milk as Angela, there would be not enough milk. Thus, it has to be $\boxed{5}$
| 5
|
5,181
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15
| 1
|
Let $f$ be a function for which $f\left(\dfrac{x}{3}\right) = x^2 + x + 1$ . Find the sum of all values of $z$ for which $f(3z) = 7$
\[\text {(A)}\ -1/3 \qquad \text {(B)}\ -1/9 \qquad \text {(C)}\ 0 \qquad \text {(D)}\ 5/9 \qquad \text {(E)}\ 5/3\]
|
Let $y = \frac{x}{3}$ ; then $f(y) = (3y)^2 + 3y + 1 = 9y^2 + 3y+1$ . Thus $f(3z)-7=81z^2+9z-6=3(9z-2)(3z+1)=0$ , and $z = -\frac{1}{3}, \frac{2}{9}$ . These sum up to $\boxed{19}$
| 19
|
5,182
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15
| 2
|
Let $f$ be a function for which $f\left(\dfrac{x}{3}\right) = x^2 + x + 1$ . Find the sum of all values of $z$ for which $f(3z) = 7$
\[\text {(A)}\ -1/3 \qquad \text {(B)}\ -1/9 \qquad \text {(C)}\ 0 \qquad \text {(D)}\ 5/9 \qquad \text {(E)}\ 5/3\]
|
This is quite trivially solved, as $3x = \dfrac{9x}{3}$ , so $P(3x) = P(9x/3) = 81x^2 + 9x + 1 = 7$ $81x^2+9x-6 = 0$ has solutions $-\frac{1}{3}$ and $\frac{2}{9}$ . Adding these yields a solution of $\boxed{19}$
| 19
|
5,183
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15
| 3
|
Let $f$ be a function for which $f\left(\dfrac{x}{3}\right) = x^2 + x + 1$ . Find the sum of all values of $z$ for which $f(3z) = 7$
\[\text {(A)}\ -1/3 \qquad \text {(B)}\ -1/9 \qquad \text {(C)}\ 0 \qquad \text {(D)}\ 5/9 \qquad \text {(E)}\ 5/3\]
|
Similar to Solution 1, we have $=81z^2+9z-6=0.$ The answer is the sum of the roots, which by Vieta's Formulas is $-\frac{b}{a}=-\frac{9}{81}=\boxed{19}$
| 19
|
5,184
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15
| 4
|
Let $f$ be a function for which $f\left(\dfrac{x}{3}\right) = x^2 + x + 1$ . Find the sum of all values of $z$ for which $f(3z) = 7$
\[\text {(A)}\ -1/3 \qquad \text {(B)}\ -1/9 \qquad \text {(C)}\ 0 \qquad \text {(D)}\ 5/9 \qquad \text {(E)}\ 5/3\]
|
Set $f\left(\frac{x}{3} \right) = x^2+x+1=7$ to get $x^2+x-6=0.$ From either finding the roots (-3 and 2), or using Vieta's formulas, we find the sum of these roots to be $-1.$ Each root of this equation is $9$ times greater than a corresponding root of $f(3z) = 7$ (because $\frac{x}{3} = 3z$ gives $x = 9z$ ), thus the sum of the roots in the equation $f(3z)=7$ is $-\frac{1}{9}$ or $\boxed{19}$
| 19
|
5,185
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15
| 5
|
Let $f$ be a function for which $f\left(\dfrac{x}{3}\right) = x^2 + x + 1$ . Find the sum of all values of $z$ for which $f(3z) = 7$
\[\text {(A)}\ -1/3 \qquad \text {(B)}\ -1/9 \qquad \text {(C)}\ 0 \qquad \text {(D)}\ 5/9 \qquad \text {(E)}\ 5/3\]
|
Since we have $f(x/3)$ $f(3z)$ occurs at $x=9z.$ Thus, $f(9z/3) = f(3z) = (9z)^2 + 9z + 1$ . We set this equal to 7:
$81z^2 + 9z +1 = 7 \Longrightarrow 81z^2 + 9z - 6 = 0$ . For any quadratic $ax^2 + bx +c = 0$ , the sum of the roots is $-\frac{b}{a}$ . Thus, the sum of the roots of this equation is $-\frac{9}{81} = \boxed{19}$
| 19
|
5,186
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_16
| 1
|
A checkerboard of $13$ rows and $17$ columns has a number written in each square, beginning in the upper left corner, so that the first row is numbered $1,2,\ldots,17$ , the second row $18,19,\ldots,34$ , and so on down the board. If the board is renumbered so that the left column, top to bottom, is $1,2,\ldots,13,$ , the second column $14,15,\ldots,26$ and so on across the board, some squares have the same numbers in both numbering systems. Find the sum of the numbers in these squares (under either system).
$\text {(A)}\ 222 \qquad \text {(B)}\ 333\qquad \text {(C)}\ 444 \qquad \text {(D)}\ 555 \qquad \text {(E)}\ 666$
|
Index the rows with $i = 1, 2, 3, ..., 13$ Index the columns with $j = 1, 2, 3, ..., 17$
For the first row number the cells $1, 2, 3, ..., 17$ For the second, $18, 19, ..., 34$ and so on
So the number in row = $i$ and column = $j$ is $f(i, j) = 17(i-1) + j = 17i + j - 17$
Similarly, numbering the same cells columnwise we
find the number in row = $i$ and column = $j$ is $g(i, j) = i + 13j - 13$
So we need to solve
$f(i, j) = g(i, j)$
$17i + j - 17 = i + 13j - 13$
$16i = 4 + 12j$
$4i = 1 + 3j$
$i = (1 + 3j)/4$
We get $(i, j) = (1, 1), f(i, j) = g(i, j) = 1$
$(i, j) = (4, 5), f(i, j) = g(i, j) = 56$
$(i, j) = (7, 9), f(i, j) = g(i, j) = 111$
$(i, j) = (10, 13), f(i, j) = g(i, j) = 166$
$(i, j) = (13, 17), f(i, j) = g(i, j) = 221$
$\boxed{555}$ $555$
| 555
|
5,187
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_19
| 1
|
In triangle $ABC$ $AB = 13$ $BC = 14$ $AC = 15$ . Let $D$ denote the midpoint of $\overline{BC}$ and let $E$ denote the intersection of $\overline{BC}$ with the bisector of angle $BAC$ . Which of the following is closest to the area of the triangle $ADE$
$\text {(A)}\ 2 \qquad \text {(B)}\ 2.5 \qquad \text {(C)}\ 3 \qquad \text {(D)}\ 3.5 \qquad \text {(E)}\ 4$
|
[asy] pair A,B,C,D,E; B=(0,0); C=(14,0); A=intersectionpoint(arc(B,13,0,90),arc(C,15,90,180)); draw(A--B--C--cycle); D=(7,0); E=(6.5,0); draw(A--E); draw(A--D); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); label("$E$",E,NW); label("$D$",D,NE); label("$13$",A--B,NW); label("$15$",A--C,NE); label("$14$",B--C,S); label("$6.5$",B--E,N); label("$7$",C--D,N); [/asy]
Let's find the area of $\Delta ABC$ by Heron,
$s=\frac{a+b+c}{2}\\\\s=\frac{14+15+13}{2}\to\boxed{21}$
| 21
|
5,188
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_24
| 1
|
If circular arcs $AC$ and $BC$ have centers at $B$ and $A$ , respectively, then there exists a circle tangent to both $\overarc {AC}$ and $\overarc{BC}$ , and to $\overline{AB}$ . If the length of $\overarc{BC}$ is $12$ , then the circumference of the circle is
[asy] label("A", (0,0), W); label("B", (64,0), E); label("C", (32, 32*sqrt(3)), N); draw(arc((0,0),64,0,60)); draw(arc((64,0),64,120,180)); draw((0,0)--(64,0)); draw(circle((32, 24), 24)); [/asy]
$\textbf {(A)}\ 24 \qquad \textbf {(B)}\ 25 \qquad \textbf {(C)}\ 26 \qquad \textbf {(D)}\ 27 \qquad \textbf {(E)}\ 28$
|
First, note the triangle $ABC$ is equilateral. Next, notice that since the arc $BC$ has length 12, it follows that we can find the radius of the sector centered at $A$ $\frac {1}{6}({2}{\pi})AB=12 \implies AB=36/{\pi}$ . Next, connect the center of the circle to side $AB$ , and call this length $r$ , and call the foot $M$ . Since $ABC$ is equilateral, it follows that $MB=18/{\pi}$ , and $OA$ (where O is the center of the circle) is $36/{\pi}-r$ . By the Pythagorean Theorem, you get $r^2+(18/{\pi})^2=(36/{\pi}-r)^2 \implies r=27/2{\pi}$ . Finally, we see that the circumference is $2{\pi}\cdot 27/2{\pi}=\boxed{27}$
| 27
|
5,189
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_25
| 1
|
Eight congruent equilateral triangles , each of a different color, are used to construct a regular octahedron . How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.)
$\textbf {(A)}\ 210 \qquad \textbf {(B)}\ 560 \qquad \textbf {(C)}\ 840 \qquad \textbf {(D)}\ 1260 \qquad \textbf {(E)}\ 1680$
|
This problem can be approached by Graph Theory . Note that each face of the octahedron is connected to 3 other faces. We use the above graph to represent the problem. Each vertex represents a face of the octahedron, each edge represent the octahedron's edge.
Now the problem becomes how many distinguishable ways to color the $8$ vertices such that two colored graphs are distinguishable if neither can be rotated and reflected to become the other.
Notice that once the outer 4 vertices are colored, no matter how the inner 4 vertices are colored, the resulting graphs are distinguishable graphs.
There are $8$ colors and $4$ outer vertices, therefore there are $\binom{8}{4}$ ways to color outer 4 vertices. Combination is used because the coloring has to be distinguishable when rotated and reflected. There are $4$ colors left, therefore there are $4!$ ways to color inner 4 vertices. Permutation is used because the coloring of the inner vertices have no restrictions. In total that is $\binom{8}{4} \cdot 4! = \boxed{1680}$
| 680
|
5,190
|
https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_25
| 2
|
Eight congruent equilateral triangles , each of a different color, are used to construct a regular octahedron . How many distinguishable ways are there to construct the octahedron? (Two colored octahedrons are distinguishable if neither can be rotated to look just like the other.)
$\textbf {(A)}\ 210 \qquad \textbf {(B)}\ 560 \qquad \textbf {(C)}\ 840 \qquad \textbf {(D)}\ 1260 \qquad \textbf {(E)}\ 1680$
|
Let the colors be $1$ to $8$ inclusive, then rotate the octahedron such that color $1$ is on top. You have $7$ choices of what color is on the bottom, WLOG $2$ . Then, there's two rings of each $3$ colors on the top and bottom. For the top ring, you can choose any $3$ out of the $6$ remaining colors, and there's two ways to orient them. The octahedron is now fixed in place, so you can have $3!$ ways to put the three remaining colors in three spaces.
In total this is $7 \cdot \binom{6}{3} \cdot 2 \cdot 3!=\boxed{1680}$
| 680
|
5,191
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_3
| 1
|
Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.
|
Let's first try some experimentation. Alice obviously wins if there is one coin. She will just take it and win. If there are 2 remaining, then Alice will take one and then Bob will take one, so Bob wins. If there are $3$ , Alice will take $1$ , Bob will take one, and Alice will take the final one. If there are $4$ , Alice will just remove all $4$ at once. If there are $5$ , no matter what Alice does, Bob can take the final coins in one try. Notice that Alice wins if there are $1$ $3$ , or $4$ coins left. Bob wins if there are $2$ or $5$ coins left.
After some thought, you may realize that there is a strategy for Bob. If there is n is a multiple of $5$ , then Bob will win. The reason for this is the following: Let's say there are a multiple of $5$ coins remaining in the stack. If Alice takes $1$ , Bob will take $4$ , and there will still be a multiple of $5$ . If Alice takes $4$ , Bob will take $1$ , and there will still be a multiple of $5$ . This process will continue until you get $0$ coins left. For example, let's say there are $205$ coins. No matter what Alice does, Bob can simply just do the complement. After each of them make a turn, there will always be a multiple of $5$ left. This will continue until there are $5$ coins left, and Bob will end up winning.
After some more experimentation, you'll realize that any number that is congruent to $2$ mod $5$ will also work. This is because Bob can do the same strategy, and when there are $2$ coins left, Alice is forced to take $1$ and Bob takes the final coin. For example, let's say there are $72$ coins. If Alice takes $1$ , Bob will take $4$ . If Alice takes $4$ , Bob will take $1$ . So after they each make a turn, the number will always be equal to $2$ mod $5$ . Eventually, there will be only $2$ coins remaining, and we've established that Alice will simply take $1$ and Bob will take the final coin.
So we have to find the number of numbers less than or equal to $2024$ that are either congruent to $0$ mod $5$ or $2$ mod $5$ . There are $404$ numbers in the first category: $5, 10, 15, \dots, 2020$ . For the second category, there are $405$ numbers. $2, 7, 12, 17, \dots, 2022$ . So the answer is $404 + 405 = \boxed{809}$
| 809
|
5,192
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_3
| 2
|
Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.
|
We will use winning and losing positions, where a $W$ marks when Alice wins and an $L$ marks when Bob wins.
$1$ coin: $W$
$2$ coins: $L$
$3$ coins: $W$
$4$ coins: $W$
$5$ coins: $L$
$6$ coin: $W$
$7$ coins: $L$
$8$ coins: $W$
$9$ coins: $W$
$10$ coins: $L$
$11$ coin: $W$
$12$ coins: $L$
$13$ coins: $W$
$14$ coins: $W$
$15$ coins: $L$
We can see that losing positions occur when $n$ is congruent to $0, 2 \mod{5}$ and winning positions occur otherwise. In other words, there will be $2$ losing positions out of every $5$ consecutive values of n. As $n$ ranges from $1$ to $2020$ $\frac{2}{5}$ of these values are losing positions where Bob will win. As $n$ ranges from $2021$ to $2024$ $2022$ is the only value where Bob will win. Thus, the answer is $2020\times\frac{2}{5}+1=\boxed{809}$
| 809
|
5,193
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_3
| 3
|
Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.
|
Denote by $A_i$ and $B_i$ Alice's or Bob's $i$ th moves, respectively.
Case 1: $n \equiv 0 \pmod{5}$
Bob can always take the strategy that $B_i = 5 - A_i$ .
This guarantees him to win.
In this case, the number of $n$ is $\left\lfloor \frac{2024}{5} \right\rfloor = 404$
Case 2: $n \equiv 1 \pmod{5}$
In this case, consider Alice's following strategy: $A_1 = 1$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
Thus, under Alice's this strategy, Bob has no way to win.
Case 3: $n \equiv 4 \pmod{5}$
In this case, consider Alice's following strategy: $A_1 = 4$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
Thus, under Alice's this strategy, Bob has no way to win.
Case 4: $n \equiv 2 \pmod{5}$
Bob can always take the strategy that $B_i = 5 - A_i$ .
Therefore, after the $\left\lfloor \frac{n}{5} \right\rfloor$ th turn, there are two tokens leftover.
Therefore, Alice must take 1 in the next turn that leaves the last token on the table.
Therefore, Bob can take the last token to win the game.
This guarantees him to win.
In this case, the number of $n$ is $\left\lfloor \frac{2024 - 2}{5} \right\rfloor +1 = 405$
Case 5: $n \equiv 3 \pmod{5}$
Consider Alice's following strategy: $A_1 = 1$ and $A_i = 5 - B_{i-1}$ for $i \geq 2$ .
By doing so, there will finally be 2 tokens on the table and Bob moves first. Because Bob has the only choice of taking 1 token, Alice can take the last token and win the game.
Therefore, in this case, under Alice's this strategy, Bob has no way to win.
Putting all cases together, the answer is $404 + 405 = \boxed{809}$
| 809
|
5,194
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_3
| 4
|
Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for which there exists a strategy for Bob that guarantees that Bob will win the game regardless of Alice's play.
|
Since the game Alice and Bob play is impartial (the only difference between player 1 and player 2 is that player 1 goes first (note that games like chess are not impartial because each player can only move their own pieces)), we can use the Sprague-Grundy Theorem to solve this problem. We will use induction to calculate the Grundy Values for this game.
We claim that heaps of size congruent to $0,2 \bmod{5}$ will be in outcome class $\mathcal{P}$ (win for player 2 = Bob), and heaps of size equivalent to $1,3,4 \bmod{5}$ will be in outcome class $\mathcal{N}$ (win for player 1 = Alice). Note that the mex (minimal excludant) of a set of nonnegative integers is the least nonnegative integer not in the set. e.g. mex $(1, 2, 3) = 0$ and mex $(0, 1, 2, 4) = 3$
$\text{heap}(0) = \{\} = *\text{mex}(\emptyset) = 0$
$\text{heap}(1) = \{0\} = *\text{mex}(0) = *$
$\text{heap}(2) = \{*\} = *\text{mex}(1) = 0$
$\text{heap}(3) = \{0\} = *\text{mex}(0) = *$
$\text{heap}(4) = \{0, *\} = *\text{mex}(0, 1) = *2$
$\text{heap}(5) = \{*, *2\} = *\text{mex}(1, 2) = 0$
$\text{heap}(6) = \{0, 0\} = *\text{mex}(0, 0) = *$
$\text{heap}(7) = \{*, *\} = *\text{mex}(1, 1) = 0$
$\text{heap}(8) = \{*2, 0\} = *\text{mex}(0, 2) = *$
$\text{heap}(9) = \{0, *\} = *\text{mex}(0, 1) = *2$
$\text{heap}(10) = \{*, *2\} = *\text{mex}(1, 2) = 0$
We have proven the base case. We will now prove the inductive hypothesis: If $n \equiv 0 \bmod{5}$ $\text{heap}(n) = 0$ $\text{heap}(n+1) = *$ $\text{heap}(n+2) = 0$ $\text{heap}(n+3) = *$ , and $\text{heap}(n+4) = *2$ , then $\text{heap}(n+5) = 0$ $\text{heap}(n+6) = *$ $\text{heap}(n+7) = 0$ $\text{heap}(n+8) = *$ , and $\text{heap}(n+9) = *2$
$\text{heap}(n+5) = \{\text{heap}(n+1), \text{heap}(n+4)\} = \{*, *2\} = *\text{mex}(1, 2) = 0$
$\text{heap}(n+6) = \{\text{heap}(n+2), \text{heap}(n+5)\} = \{0, 0\} = *\text{mex}(0, 0) = *$
$\text{heap}(n+7) = \{\text{heap}(n+3), \text{heap}(n+6)\} = \{*, *\} = *\text{mex}(1, 1) = 0$
$\text{heap}(n+8) = \{\text{heap}(n+4), \text{heap}(n+7)\} = \{*2, 0\} = *\text{mex}(2, 1) = *$
$\text{heap}(n+9) = \{\text{heap}(n+5), \text{heap}(n+8)\} = \{0, *\} = *\text{mex}(0, 1) = *2$
We have proven the inductive hypothesis. QED.
There are $2020*\frac{2}{5}=808$ positive integers congruent to $0,2 \bmod{5}$ between 1 and 2020, and 1 such integer between 2021 and 2024. $808 + 1 = \boxed{809}$
| 809
|
5,195
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_4
| 1
|
Jen enters a lottery by picking $4$ distinct numbers from $S=\{1,2,3,\cdots,9,10\}.$ $4$ numbers are randomly chosen from $S.$ She wins a prize if at least two of her numbers were $2$ of the randomly chosen numbers, and wins the grand prize if all four of her numbers were the randomly chosen numbers. The probability of her winning the grand prize given that she won a prize is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
This is a conditional probability problem. Bayes' Theorem states that \[P(A|B)=\dfrac{P(B|A)\cdot P(A)}{P(B)}\]
Let us calculate the probability of winning a prize. We do this through casework: how many of Jen's drawn numbers match the lottery's drawn numbers?
To win a prize, Jen must draw at least $2$ numbers identical to the lottery. Thus, our cases are drawing $2$ $3$ , or $4$ numbers identical.
Let us first calculate the number of ways to draw exactly $2$ identical numbers to the lottery. Let Jen choose the numbers $a$ $b$ $c$ , and $d$ ; we have $\dbinom42$ ways to choose which $2$ of these $4$ numbers are identical to the lottery. We have now determined $2$ of the $4$ numbers drawn in the lottery; since the other $2$ numbers Jen chose can not be chosen by the lottery, the lottery now has $10-2-2=6$ numbers to choose the last $2$ numbers from. Thus, this case is $\dbinom62$ , so this case yields $\dbinom42\dbinom62=6\cdot15=90$ possibilities.
Next, let us calculate the number of ways to draw exactly $3$ identical numbers to the lottery. Again, let Jen choose $a$ $b$ $c$ , and $d$ . This time, we have $\dbinom43$ ways to choose the identical numbers and again $6$ numbers left for the lottery to choose from; however, since $3$ of the lottery's numbers have already been determined, the lottery only needs to choose $1$ more number, so this is $\dbinom61$ . This case yields $\dbinom43\dbinom61=4\cdot6=24$
Finally, let us calculate the number of ways to all $4$ numbers matching. There is actually just one way for this to happen.
In total, we have $90+24+1=115$ ways to win a prize. The lottery has $\dbinom{10}4=210$ possible combinations to draw, so the probability of winning a prize is $\dfrac{115}{210}$ . There is actually no need to simplify it or even evaluate $\dbinom{10}4$ or actually even know that it has to be $\dbinom{10}4$ ; it suffices to call it $a$ or some other variable, as it will cancel out later. However, let us just go through with this. The probability of winning a prize is $\dfrac{115}{210}$ . Note that the probability of winning a grand prize is just matching all $4$ numbers, which we already calculated to have $1$ possibility and thus have probability $\dfrac1{210}$ . Thus, our answer is $\dfrac{\frac1{210}}{\frac{115}{210}}=\dfrac1{115}$ . Therefore, our answer is $1+115=\boxed{116}$
| 116
|
5,196
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_4
| 2
|
Jen enters a lottery by picking $4$ distinct numbers from $S=\{1,2,3,\cdots,9,10\}.$ $4$ numbers are randomly chosen from $S.$ She wins a prize if at least two of her numbers were $2$ of the randomly chosen numbers, and wins the grand prize if all four of her numbers were the randomly chosen numbers. The probability of her winning the grand prize given that she won a prize is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
For getting all $4$ right, there is only $1$ way.
For getting $3$ right, there is $\dbinom43$ multiplied by $\dbinom61$ $24$ ways.
For getting $2$ right, there is $\dbinom42$ multiplied by $\dbinom62$ $90$ ways.
$\frac{1}{1+24+90}$ $\frac{1}{115}$
Therefore, the answer is $1+115 = \boxed{116}$
| 116
|
5,197
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6
| 1
|
Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
[asy] size(10cm); usepackage("tikz");label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(2,0)--(2,3)--(5,3)--(5,8)--(8,8);\end{tikzpicture}",origin); label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(0,3)--(3,3)--(3,5)--(8,5)--(8,8);\end{tikzpicture}",E); [/asy]
|
We divide the path into eight “ $R$ ” movements and eight “ $U$ ” movements. Five sections of alternative $RURUR$ or $URURU$ are necessary in order to make four “turns.” We use the first case and multiply by $2$
For $U$ , we have seven ordered pairs of positive integers $(a,b)$ such that $a+b=8$
For $R$ , we subtract $1$ from each section (to make the minimum stars of each section $0$ ) and we use Stars and Bars to get ${7 \choose 5}=21$
Thus our answer is $7\cdot21\cdot2=\boxed{294}$
| 294
|
5,198
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6
| 2
|
Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
[asy] size(10cm); usepackage("tikz");label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(2,0)--(2,3)--(5,3)--(5,8)--(8,8);\end{tikzpicture}",origin); label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(0,3)--(3,3)--(3,5)--(8,5)--(8,8);\end{tikzpicture}",E); [/asy]
|
Notice that the $RURUR$ case and the $URURU$ case is symmetrical. WLOG, let's consider the RURUR case.
Now notice that there is a one-to-one correspondence between this problem and the number of ways to distribute 8 balls into 3 boxes and also 8 other balls into 2 other boxes, such that each box has a nonzero amount of balls.
There are ${8+2-3 \choose 2}$ ways for the first part, and ${8+1-2 \choose 1}$ ways for the second part, by stars and bars.
The answer is $2\cdot {7 \choose 2} \cdot {7 \choose 1} = \boxed{294}$
| 294
|
5,199
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6
| 3
|
Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
[asy] size(10cm); usepackage("tikz");label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(2,0)--(2,3)--(5,3)--(5,8)--(8,8);\end{tikzpicture}",origin); label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(0,3)--(3,3)--(3,5)--(8,5)--(8,8);\end{tikzpicture}",E); [/asy]
|
Starting at the origin, you can either first go up or to the right. If you go up first, you will end on the side opposite to it (the right side) and if you go right first, you will end up on the top. It can then be observed that if you choose the turning points in the middle $7 \times 7$ grid, that will automatically determine your start and ending points. For example, in the diagram if you choose the point $(3,2)$ and $(5,3)$ , you must first move three up or two right, determining your first point, and move 5 up or 3 right, determining your final point. Knowing this is helpful because if we first move anywhere horizontally, we have $7$ points on each column to choose from and starting from left to right, we have $6,5,4,3,2,1$ points on that row to choose from. This gives us $7(6)+7(5)+7(4)+7(3)+7(2)+7(1)$ which simplifies to $7\cdot21$ . The vertical case is symmetrical so we have $7\cdot21\cdot2 = \boxed{294}$
| 294
|
5,200
|
https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6
| 4
|
Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below.
[asy] size(10cm); usepackage("tikz");label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(2,0)--(2,3)--(5,3)--(5,8)--(8,8);\end{tikzpicture}",origin); label("\begin{tikzpicture}[scale=.5]\draw(0,0)grid(8,8);\draw[line width=2,red](0,0)--(0,3)--(3,3)--(3,5)--(8,5)--(8,8);\end{tikzpicture}",E); [/asy]
|
As in Solution 1, there are two cases: $RURUR$ or $URURU$ . We will work with the first case and multiply by $2$ at the end. We use stars and bars; we can treat the $R$ s as the stars and the $U$ s as the bars. However, we must also use stars and bars on the $U$ s to see how many different patterns of bars we can create for the reds. We must have $1$ bar in $8$ blacks, so we use stars and bars on the equation \[x + y = 8\] . However, each divider must have at least one black in it, so we do the change of variable $x' = x-1$ and $y' = x-1$ . Our equation becomes \[x' + y' = 6\] . By stars and bars, this equation has $\binom{6 + 2 - 1}{1} = 7$ valid solutions. Now, we use stars and bars on the reds. We must distribute two bars amongst the reds, so we apply stars and bars to \[x + y + z = 8\] . Since each group must have one red, we again do a change of variables with $x' = x-1$ $y' = y-1$ , and $z' = z-1$ . We are now working on the equation \[x' + y' + z' = 5\] . By stars and bars, this has $\binom{5 + 3 - 1}{2} = 21$ solutions. The number of valid paths in this case is the number of ways to create the bars times the number of valid arrangements of the stars given fixed bars, which equals $21 \cdot 7 = 147$ . We must multiply by two to account for both cases, so our final answer is $147 \cdot 2 = \boxed{294}$
| 294
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.