problem_id
stringlengths 32
32
| link
stringlengths 75
84
| problem
stringlengths 14
5.33k
| solution
stringlengths 15
6.63k
| letter
stringclasses 5
values | answer
stringclasses 957
values |
|---|---|---|---|---|---|
7299a3fc4bde7d84a041e3588be6234c | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_3 | 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}$ | B | 50 |
7299a3fc4bde7d84a041e3588be6234c | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_3 | 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}$ | B | 50 |
c28769e2404d38804480e95aebe85628 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_4 | 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}$ | C | 6 |
32600f4bad475f62dbb117277e3b8a51 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_6 | 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}$ | C | 119 |
32600f4bad475f62dbb117277e3b8a51 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_6 | 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}$ | C | 119 |
b485da322aa7bd54886dce07291c3590 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_7 | 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}$ | E | 4 |
aae6a7a1672f591372fe555ecaaa6118 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8 | 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}$ | C | 20201 |
aae6a7a1672f591372fe555ecaaa6118 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8 | 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}$ | C | 20201 |
aae6a7a1672f591372fe555ecaaa6118 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8 | 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 $a_n$ be the number of squares in figure $n$ . We can easily see that \[a_0=4\cdot 0+1\] \[a_1=4\cdot 1+1\] \[a_2=4\cdot 3+1\] \[a_3=4\cdot 6+1.\] See that we multiply the number we are on to the next consecutive number.
Note that in $a_n$ , the number multiplied by the 4 is the $n$ th triangular number. Hence, $a_{100}=4\cdot \frac{100\cdot 101}{2}+1=\boxed{20201}$ .
~ edited by mathlover66 | C | 20201 |
aae6a7a1672f591372fe555ecaaa6118 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8 | 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. | C | 20201 |
aae6a7a1672f591372fe555ecaaa6118 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_8 | 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$ | Newton’s little formula states that $a_n = A \binom{n-1}{0} + B \binom{n-1}{1} + C \binom{n-1}{2} + \cdots + K \binom{n-1}{m}$ if first term is $a_1$ and $A =$ first difference, $B =$ second difference, and so on. Hence we apply the formula (because we start at term 0, term 100 is $a_{101}$ ): $a_{101} = 5 \binom{100}{0} + 8 \binom{100}{1} + 4 \binom{100}{2} = \boxed{20201}.$ ~Peelybonehead
~clarification by LeonidasTheConquerer | C | 20201 |
697507cced394f75001503f6d548e77f | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12 | 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}.$ | E | 112 |
697507cced394f75001503f6d548e77f | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12 | 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}$ | E | 112 |
697507cced394f75001503f6d548e77f | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12 | 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}$ | E | 112 |
697507cced394f75001503f6d548e77f | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_12 | 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}$ | E | 112 |
f04d2c1d729377f8d4fc33fb05a8dc42 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_13 | 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}$ | null | 5 |
f04d2c1d729377f8d4fc33fb05a8dc42 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_13 | 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$ | The number of ounces that Angela's family drank has to be a multiple of 8, so we can find the right answer by guessing random values for the number of ounces of coffee and milk Angela drank. With Angela drinking 4 ounces of milk and 4 ounces of coffee, we get 40 total ounces Angela's family drank. Dividing that by 8(each person drank 8 ounces) we get 5 members who drank the coffee with milk, or $\boxed{5}$ ~ Mathyguy88 | C | 5 |
6b1b8bcc728f3722d08e233c1a6189b9 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15 | 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}$ | B | 19 |
6b1b8bcc728f3722d08e233c1a6189b9 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15 | 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}$ | B | 19 |
6b1b8bcc728f3722d08e233c1a6189b9 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15 | 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}$ | B | 19 |
6b1b8bcc728f3722d08e233c1a6189b9 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15 | 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}$ | B | 19 |
6b1b8bcc728f3722d08e233c1a6189b9 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_15 | 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}$ | B | 19 |
3453426a41189f7388bdc988b92db79a | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_16 | 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$ | D | 555 |
9563c07c519d1f91859ceaca0ba30a08 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_19 | 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}$ | null | 21 |
27d1e4e024c6dcc8508a71e8f00d4f68 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_20 | If $x,y,$ and $z$ are positive numbers satisfying
\[x + \frac{1}{y} = 4,\qquad y + \frac{1}{z} = 1, \qquad \text{and} \qquad z + \frac{1}{x} = \frac{7}{3}\]
Then what is the value of $xyz$
$\text {(A)}\ \frac{2}{3} \qquad \text {(B)}\ 1 \qquad \text {(C)}\ \frac{4}{3} \qquad \text {(D)}\ 2 \qquad \text {(E)}\ \frac{7}{3}$ | We multiply all given expressions to get: \[(1)xyz + x + y + z + \frac{1}{x} + \frac{1}{y} + \frac{1}{z} + \frac{1}{xyz} = \frac{28}{3}\] Adding all the given expressions gives that \[(2) x + y + z + \frac{1}{x} + \frac{1}{y} + \frac{1}{z} = 4 + \frac{7}{3} + 1 = \frac{22}{3}\] We subtract $(2)$ from $(1)$ to get that $xyz + \frac{1}{xyz} = 2$ . Hence, by inspection, $\boxed{1}$ \[\] ~AopsUser101 | B | 1 |
4294a448bf24236c16d8b94ce48ef0ae | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_24 | 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}$ | D | 27 |
c8c6f471cef8031eff1a9e09f9ac03a6 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_25 | 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}$ | E | 1680 |
c8c6f471cef8031eff1a9e09f9ac03a6 | https://artofproblemsolving.com/wiki/index.php/2000_AMC_12_Problems/Problem_25 | 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}$ | E | 1680 |
f098258808bd480c688d1a313d743992 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_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. | 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}$ | null | 809 |
f098258808bd480c688d1a313d743992 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_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. | 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}$ | null | 809 |
f098258808bd480c688d1a313d743992 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_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}$ | null | 809 |
f098258808bd480c688d1a313d743992 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_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. | 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}$ | null | 809 |
5904b04edbf108983768e333540d5fa1 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_4 | 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}$ | null | 116 |
5904b04edbf108983768e333540d5fa1 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_4 | 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}$ | null | 116 |
ad232a56e69a30745a0adf89ee0345aa | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6 | 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}$ | null | 294 |
ad232a56e69a30745a0adf89ee0345aa | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6 | 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}$ | null | 294 |
ad232a56e69a30745a0adf89ee0345aa | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6 | 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}$ | null | 294 |
ad232a56e69a30745a0adf89ee0345aa | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_6 | 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}$ | null | 294 |
8a01ecce19e9b77036e7e9ebd7597a58 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_8 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] pair A = (2,1); pair B = (0,0); pair C = (3,0); dot(A^^B^^C); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); draw(A--B--C--cycle); for(real i=0.62; i<2.7; i+=0.29){ draw(circle((i,0.145), 0.145)); } [/asy] | Draw an altitude from both end circles of the diagram with the circles of radius one, and call the lengths you get drawing the altitudes of the circles down to $BC$ $a$ and $b$ . Now we have the length of side $BC$ of being $(2)(2022)+1+1+a+b$ . However, the side $BC$ can also be written as $(6)(68)+34+34+34a+34b$ , due to similar triangles from the second diagram. If we set the equations equal, we have $\frac{1190}{11} = a+b$ . Call the radius of the incircle $r$ , then we have the side BC to be $r(a+b)$ . We find $r$ as $\frac{4046+\frac{1190}{11}}{\frac{1190}{11}}$ , which simplifies to $\frac{10+((34)(11))}{10}$ ,so we have $\frac{192}{5}$ , which sums to $\boxed{197}$ | null | 197 |
8a01ecce19e9b77036e7e9ebd7597a58 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_8 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] pair A = (2,1); pair B = (0,0); pair C = (3,0); dot(A^^B^^C); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); draw(A--B--C--cycle); for(real i=0.62; i<2.7; i+=0.29){ draw(circle((i,0.145), 0.145)); } [/asy] | Assume that $ABC$ is isosceles with $AB=AC$
If we let $P_1$ be the intersection of $BC$ and the leftmost of the eight circles of radius $34$ $N_1$ the center of the leftmost circle, and $M_1$ the intersection of the leftmost circle and $AB$ , and we do the same for the $2024$ circles of radius $1$ , naming the points $P_2$ $N_2$ , and $M_2$ , respectively, then we see that $BP_1N_1M_1\sim BP_2N_2M_2$ . The same goes for vertex $C$ , and the corresponding quadrilaterals are congruent.
Let $x=BP_2$ . We see that $BP_1=34x$ by similarity ratios (due to the radii). The corresponding figures on vertex $C$ are also these values. If we combine the distances of the figures, we see that $BC=2x+4046$ and $BC=68x+476$ , and solving this system, we find that $x=\frac{595}{11}$
If we consider that the incircle of $\triangle ABC$ is essentially the case of $1$ circle with $r$ radius (the inradius of $\triangle ABC$ , we can find that $BC=2rx$ . From $BC=2x+4046$ , we have:
$r=1+\frac{2023}{x}$
$=1+\frac{11\cdot2023}{595}$
$=1+\frac{187}{5}$
$=\frac{192}{5}$
Thus the answer is $192+5=\boxed{197}$ | null | 197 |
8a01ecce19e9b77036e7e9ebd7597a58 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_8 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] pair A = (2,1); pair B = (0,0); pair C = (3,0); dot(A^^B^^C); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); draw(A--B--C--cycle); for(real i=0.62; i<2.7; i+=0.29){ draw(circle((i,0.145), 0.145)); } [/asy] | Let $x = \cot{\frac{B}{2}} + \cot{\frac{C}{2}}$ . By representing $BC$ in two ways, we have the following: \[34x + 7\cdot 34\cdot 2 = BC\] \[x + 2023 \cdot 2 = BC\]
Solving we find $x = \frac{1190}{11}$ .
Now draw the inradius, let it be $r$ . We find that $rx =BC$ , hence \[xr = x + 4046 \implies r-1 = \frac{11}{1190}\cdot 4046 = \frac{187}{5}.\] Thus \[r = \frac{192}{5} \implies \boxed{197}.\] ~AtharvNaphade | null | 197 |
8a01ecce19e9b77036e7e9ebd7597a58 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_8 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] pair A = (2,1); pair B = (0,0); pair C = (3,0); dot(A^^B^^C); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); draw(A--B--C--cycle); for(real i=0.62; i<2.7; i+=0.29){ draw(circle((i,0.145), 0.145)); } [/asy] | First, let the circle tangent to $AB$ and $BC$ be $O$ and the other circle that is tangent to $AC$ and $BC$ be $R$ . Let $x$ be the distance from the tangency point on line segment $BC$ of the circle $O$ to $B$ . Also, let $y$ be the distance of the tangency point of circle $R$ on the line segment $BC$ to point $C$ . Realize that we can let $n$ be the number of circles tangent to line segment $BC$ and $r$ be the corresponding radius of each of the circles. Also, the circles that are tangent to $BC$ are similar. So, we can build the equation $BC = (x+y+2(n-1)) \times r$ . Looking at the given information, we see that when $n=8$ $r=34$ , and when $n=2024$ $r=1$ , and we also want to find the radius $r$ in the case where $n=1$ . Using these facts, we can write the following equations:
$BC = (x+y+2(8-1)) \times 34 = (x+y+2(2024-1)) \times 1 = (x+y+2(1-1)) \times r$
We can find that $x+y = \frac{1190}{11}$ . Now, let $(x+y+2(2024-1)) \times 1 = (x+y+2(1-1)) \times r$
Substituting $x+y = \frac{1190}{11}$ in, we find that \[r = \frac{192}{5} \implies \boxed{197}.\] | null | 197 |
8a01ecce19e9b77036e7e9ebd7597a58 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_8 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$ , respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] pair A = (2,1); pair B = (0,0); pair C = (3,0); dot(A^^B^^C); label("$A$", A, N); label("$B$", B, S); label("$C$", C, S); draw(A--B--C--cycle); for(real i=0.62; i<2.7; i+=0.29){ draw(circle((i,0.145), 0.145)); } [/asy] | Define $I, x_1, x_8, y_1, y_{2024}$ to be the incenter and centers of the first and last circles of the $8$ and $2024$ tangent circles to $BC,$ and define $r$ to be the inradius of triangle $\bigtriangleup ABC.$ We calculate $\overline{x_1x_8} = 34 \cdot 14$ and $\overline{y_1y_{2024}} = 1 \cdot 4046$ because connecting the center of the circles voids two extra radii.
We can easily see that $B, x_1, x_8,$ and $I$ are collinear, and the same follows for $C, y_1, y_2024,$ and $I$ (think angle bisectors).
We observe that triangles $\bigtriangleup I x_1 x_8$ and $\bigtriangleup I y_1 y_{2024}$ are similar, and therefore the ratio of the altitude to the base is the same, so we note
\[\frac{\text{altitude}}{\text{base}} = \frac{r-34}{34\cdot 14} = \frac{r-1}{1\cdot 4046}.\]
Solving yields $r = \frac{192}{5},$ so the answer is $192+5 = \boxed{197}.$ | null | 197 |
36889a8c2cbeed1386c927649a13d36d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_9 | Let $A$ $B$ $C$ , and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi. | A quadrilateral is a rhombus if and only if its two diagonals bisect each other and are perpendicular to each other. The first condition is automatically satisfied because of the hyperbola's symmetry about the origin. To satisfy the second condition, we set $BD$ as the line $y = mx$ and $AC$ as $y = -\frac{1}{m}x.$ Because the hyperbola has asymptotes of slopes $\pm \frac{\sqrt6}{\sqrt5},$ we have $m, -\frac{1}{m} \in \left(-\frac{\sqrt6}{\sqrt5}, \frac{\sqrt6}{\sqrt5}\right).$ This gives us $m^2 \in \left(\frac{5}{6}, \frac{6}{5}\right).$
Plugging $y = mx$ into the equation for the hyperbola yields $x^2 = \frac{120}{6-5m^2}$ and $y^2 = \frac{120m^2}{6-5m^2}.$ By symmetry of the hyperbola, we know that $\left(\frac{BD}{2}\right)^2 = x^2 + y^2,$ so we wish to find a lower bound for $x^2 + y^2 = 120\left(\frac{1+m^2}{6-5m^2}\right).$ This is equivalent to minimizing $\frac{1+m^2}{6-5m^2} = -\frac{1}{5} + \frac{11}{5(6-5m^2)}$ . It's then easy to see that this expression increases with $m^2,$ so we plug in $m^2 = \frac{5}{6}$ to get $x^2+y^2 > 120,$ giving $BD^2 > \boxed{480}.$ | null | 480 |
36889a8c2cbeed1386c927649a13d36d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_9 | Let $A$ $B$ $C$ , and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi. | Assume $AC$ is the asymptope of the hyperbola, $BD$ in that case is the smallest. The expression of $BD$ is $y=-\sqrt{\frac{5}{6}}x$ . Thus, we could get $\frac{x^2}{20}-\frac{y^2}{24}=1\implies x^2=\frac{720}{11}$ . The desired value is $4\cdot \frac{11}{6}x^2=480$ . This case wouldn't achieve, so all $BD^2$ would be greater than $\boxed{480}$ | null | 480 |
36889a8c2cbeed1386c927649a13d36d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_9 | Let $A$ $B$ $C$ , and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi. | $\textbf{warning: this solution is wrong}$
The pythagorean theorem in the last step is missing a factor of 2 - this was a lucky "solve".
A square is a rhombus. Take B to have coordinates $(x,x)$ and D to have coordinates $(-x,-x)$ . This means that $x$ satisfies the equations $\frac{x^2}{20}-\frac{x^2}{24}=1 \rightarrow x^2=120$ . This means that the distance from $B$ to $D$ is $\sqrt{2x^2+2x^2}\rightarrow 2x = \sqrt{480}$ . So $BD^2 = \boxed{480}$ . We use a square because it minimizes the length of the long diagonal (also because it's really easy).
~amcrunner | null | 480 |
36889a8c2cbeed1386c927649a13d36d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_9 | Let $A$ $B$ $C$ , and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi. | The only "numbers" provided in this problem are $24$ and $20$ , so the answer must be a combination of some operations on these numbers. If you're lucky, you could figure the most likely option is $24\cdot 20$ , as this yields $\boxed{480}$ and seems like a plausible answer for this question. | null | 480 |
78ab3292d5e0581bb24b7dc70a637ba2 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_10 | Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$ | From the tangency condition we have $\let\angle BCD = \let\angle CBD = \let\angle A$ . With LoC we have $\cos(A) = \frac{25+100-81}{2*5*10} = \frac{11}{25}$ and $\cos(B) = \frac{81+25-100}{2*9*5} = \frac{1}{15}$ . Then, $CD = \frac{\frac{9}{2}}{\cos(A)} = \frac{225}{22}$ . Using LoC we can find $AD$ $AD^2 = AC^2 + CD^2 - 2(AC)(CD)\cos(A+C) = 10^2+(\frac{225}{22})^2 + 2(10)\frac{225}{22}\cos(B) = 100 + \frac{225^2}{22^2} + 2(10)\frac{225}{22}*\frac{1}{15} = \frac{5^4*13^2}{484}$ . Thus, $AD = \frac{5^2*13}{22}$ . By Power of a Point, $DP*AD = CD^2$ so $DP*\frac{5^2*13}{22} = (\frac{225}{22})^2$ which gives $DP = \frac{5^2*9^2}{13*22}$ . Finally, we have $AP = AD - DP = \frac{5^2*13}{22} - \frac{5^2*9^2}{13*22} = \frac{100}{13} \rightarrow \boxed{113}$ | null | 113 |
78ab3292d5e0581bb24b7dc70a637ba2 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_10 | Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$ | We know $AP$ is the symmedian, which implies $\triangle{ABP}\sim \triangle{AMC}$ where $M$ is the midpoint of $BC$ . By Appolonius theorem, $AM=\frac{13}{2}$ . Thus, we have $\frac{AP}{AC}=\frac{AB}{AM}, AP=\frac{100}{13}\implies \boxed{113}$ | null | 113 |
78ab3292d5e0581bb24b7dc70a637ba2 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_10 | Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$ | Extend sides $\overline{AB}$ and $\overline{AC}$ to points $E$ and $F$ , respectively, such that $B$ and $C$ are the feet of the altitudes in $\triangle AEF$ . Denote the feet of the altitude from $A$ to $\overline{EF}$ as $X$ , and let $H$ denote the orthocenter of $\triangle AEF$ . Call $M$ the midpoint of segment $\overline{EF}$ . By the Three Tangents Lemma, we have that $MB$ and $MC$ are both tangents to $(ABC)$ $\implies$ $M = D$ , and since $M$ is the midpoint of $\overline{EF}$ $MF = MB$ . Additionally, by angle chasing, we get that: \[\angle ABC \cong \angle AHC \cong \angle EHX\] Also, \[\angle EHX = 90 ^\circ - \angle HEF = 90 ^\circ - (90 ^\circ - \angle AFE) = \angle AFE\] Furthermore, \[AB = AF \cdot \cos(A)\] From this, we see that $\triangle ABC \sim \triangle AFE$ with a scale factor of $\cos(A)$ . By the Law of Cosines, \[\cos(A) = \frac{10^2 + 5^2 - 9^2}{2 \cdot 10 \cdot 5} = \frac{11}{25}\] Thus, we can find that the side lengths of $\triangle AEF$ are $\frac{250}{11}, \frac{125}{11}, \frac{225}{11}$ . Then, by Stewart's theorem, $AM = \frac{13 \cdot 25}{22}$ . By Power of a Point, \[\overline{MB} \cdot \overline{MB} = \overline{MA} \cdot \overline{MP}\] \[\frac{225}{22} \cdot \frac{225}{22} = \overline{MP} \cdot \frac{13 \cdot 25}{22} \implies \overline{MP} = \frac{225 \cdot 9}{22 \cdot 13}\] Thus, \[AP = AM - MP = \frac{13 \cdot 25}{22} - \frac{225 \cdot 9}{22 \cdot 13} = \frac{100}{13}\] Therefore, the answer is $\boxed{113}$ | null | 113 |
78ab3292d5e0581bb24b7dc70a637ba2 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_10 | Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$ | Connect lines $\overline{PB}$ and $\overline{PC}$ . From the angle by tanget formula, we have $\angle PBD = \angle DAB$ . Therefore by AA similarity, $\triangle PBD \sim \triangle BAD$ . Let $\overline{BP} = x$ . Using ratios, we have \[\frac{x}{5}=\frac{BD}{AD}.\] Similarly, using angle by tangent, we have $\angle PCD = \angle DAC$ , and by AA similarity, $\triangle CPD \sim \triangle ACD$ . By ratios, we have \[\frac{PC}{10}=\frac{CD}{AD}.\] However, because $\overline{BD}=\overline{CD}$ , we have \[\frac{x}{5}=\frac{PC}{10},\] so $\overline{PC}=2x.$ Now using Law of Cosines on $\angle BAC$ in triangle $\triangle ABC$ , we have \[9^2=5^2+10^2-100\cos(\angle BAC).\] Solving, we find $\cos(\angle BAC)=\frac{11}{25}$ . Now we can solve for $x$ . Using Law of Cosines on $\triangle BPC,$ we have
\begin{align*}
81&=x^2+4x^2-4x^2\cos(180-\angle BAC) \\
&= 5x^2+4x^2\cos(BAC). \\
\end{align*}
Solving, we get $x=\frac{45}{13}.$ Now we have a system of equations using Law of Cosines on $\triangle BPA$ and $\triangle CPA$ \[AP^2=5^2+\left(\frac{45}{13}\right)^2 -(10) \left(\frac{45}{13} \right)\cos(ABP)\] \[AP^2=10^2+4 \left(\frac{45}{13} \right)^2 + (40) \left(\frac{45}{13} \right)\cos(ABP).\]
Solving, we find $\overline{AP}=\frac{100}{13}$ , so our desired answer is $100+13=\boxed{113}$ | null | 113 |
78ab3292d5e0581bb24b7dc70a637ba2 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_10 | Let $ABC$ be a triangle inscribed in circle $\omega$ . Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$ , and let $\overline{AD}$ intersect $\omega$ at $P$ . If $AB=5$ $BC=9$ , and $AC=10$ $AP$ can be written as the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime integers. Find $m + n$ | Following from the law of cosines, we can easily get $\cos A = \frac{11}{25}$ $\cos B = \frac{1}{15}$ $\cos C = \frac{13}{15}$
Hence, $\sin A = \frac{6 \sqrt{14}}{25}$ $\cos 2C = \frac{113}{225}$ $\sin 2C = \frac{52 \sqrt{14}}{225}$ .
Thus, $\cos \left( A + 2C \right) = - \frac{5}{9}$
Denote by $R$ the circumradius of $\triangle ABC$ .
In $\triangle ABC$ , following from the law of sines, we have $R = \frac{BC}{2 \sin A} = \frac{75}{4 \sqrt{14}}$
Because $BD$ and $CD$ are tangents to the circumcircle $ABC$ $\triangle OBD \cong \triangle OCD$ and $\angle OBD = 90^\circ$ .
Thus, $OD = \frac{OB}{\cos \angle BOD} = \frac{R}{\cos A}$
In $\triangle AOD$ , we have $OA = R$ and $\angle AOD = \angle BOD + \angle AOB = A + 2C$ .
Thus, following from the law of cosines, we have
\begin{align*}
AD & = \sqrt{OA^2 + OD^2 - 2 OA \cdot OD \cos \angle AOD} \\
& = \frac{26 \sqrt{14}}{33} R.
\end{align*}
Following from the law of cosines,
\begin{align*}
\cos \angle OAD & = \frac{AD^2 + OA^2 - OD^2}{2 AD \cdot OA} \\
& = \frac{8 \sqrt{14}}{39} .
\end{align*}
Therefore,
\begin{align*}
AP & = 2 OA \cos \angle OAD \\
& = \frac{100}{13} .
\end{align*}
Therefore, the answer is $100 + 13 = \boxed{113}$ | null | 113 |
ef9dbcdc237b9292da259fd487e4e7b4 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_12 | Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$ . Find the number of intersections of the graphs of \[y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).\] | If we graph $4g(f(x))$ , we see it forms a sawtooth graph that oscillates between $0$ and $1$ (for values of $x$ between $-1$ and $1$ , which is true because the arguments are between $-1$ and $1$ ). Thus by precariously drawing the graph of the two functions in the square bounded by $(0,0)$ $(0,1)$ $(1,1)$ , and $(1,0)$ , and hand-counting each of the intersections, we get $\boxed{385}$ | null | 385 |
ef9dbcdc237b9292da259fd487e4e7b4 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_12 | Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$ . Find the number of intersections of the graphs of \[y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).\] | We will denote $h(x)=4g(f(x))$ for simplicity. Denote $p(x)$ as the first equation and $q(y)$ as the graph of the second. We notice that both $f(x)$ and $g(x)$ oscillate between 0 and 1. The intersections are thus all in the square $(0,0)$ $(0,1)$ $(1,1)$ , and $(1,0)$ . Every $p(x)$ wave going up and down crosses every $q(y)$ wave. Now, we need to find the number of times each wave touches 0 and 1.
We notice that $h(x)=0$ occurs at $x=-\frac{3}{4}, -\frac{1}{4}, \frac{1}{4}, \frac{3}{4}$ , and $h(x)=1$ occurs at $x=-1, -\frac{1}{2}, 0,\frac{1}{2},1$ . A sinusoid passes through each point twice during each period, but it only passes through the extrema once. $p(x)$ has 1 period between 0 and 1, giving 8 solutions for $p(x)=0$ and 9 solutions for $p(x)=1$ , or 16 up and down waves. $q(y)$ has 1.5 periods, giving 12 solutions for $q(y)=0$ and 13 solutions for $q(y)=1$ , or 24 up and down waves. This amounts to $16\cdot24=384$ intersections.
However, we have to be very careful when counting around $(1, 1)$ . At this point, $q(y)$ has an infinite downwards slope and $p(x)$ is slanted, giving us an extra intersection; thus, we need to add 1 to our answer to get $\boxed{385}$ | null | 385 |
ef9dbcdc237b9292da259fd487e4e7b4 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_12 | Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$ . Find the number of intersections of the graphs of \[y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).\] | We can easily see that only $x, y \in \left[0,1 \right]$ may satisfy both functions.
We call function $y = 4g \left( f \left( \sin \left( 2 \pi x \right) \right) \right)$ as Function 1 and function $x = 4g \left( f \left( \cos \left( 3 \pi y \right) \right) \right)$ as Function 2.
For Function 1, in each interval $\left[ \frac{i}{4} , \frac{i+1}{4} \right]$ with $i \in \left\{ 0, 1, \cdots, 3 \right\}$ , Function 1's value oscillates between 0 and 1. It attains 1 at $x = \frac{i}{4}$ $\frac{i+1}{4}$ and another point between these two.
Between two consecutive points whose functional values are 1, the function first decreases from 1 to 0 and then increases from 0 to 1.
So the graph of this function in this interval consists of 4 monotonic pieces.
For Function 2, in each interval $\left[ \frac{i}{6} , \frac{i+1}{6} \right]$ with $i \in \left\{ 0, 1, \cdots, 5 \right\}$ , Function 2's value oscillates between 0 and 1. It attains 1 at $y = \frac{i}{6}$ $\frac{i+1}{6}$ and another point between these two.
Between two consecutive points whose functional values are 1, the function first decreases from 1 to 0 and then increases from 0 to 1.
So the graph of this function in this interval consists of 4 monotonic curves.
Consider any region $\left[ \frac{i}{4} , \frac{i+1}{4} \right] \times \left[ \frac{j}{6} , \frac{j+1}{6} \right]$ with $i \in \left\{ 0, 1, \cdots, 3 \right\}$ and $j \in \left\{0, 1, \cdots , 5 \right\}$ but $\left( i, j \right) \neq \left( 3, 5 \right)$ .
Both functions have four monotonic pieces.
Because Function 1's each monotonic piece can take any value in $\left[ \frac{j}{6} , \frac{j+1}{6} \right]$ and Function 2' each monotonic piece can take any value in $\left[ \frac{i}{4} , \frac{i+1}{4} \right]$ , Function 1's each monotonic piece intersects with Function 2's each monotonic piece.
Therefore, in the interval $\left[ \frac{i}{4} , \frac{i+1}{4} \right] \times \left[ \frac{j}{6} , \frac{j+1}{6} \right]$ , the number of intersecting points is $4 \cdot 4 = 16$
Next, we prove that if an intersecting point is on a line $x = \frac{i}{4}$ for $i \in \left\{ 0, 1, \cdots, 4 \right\}$ , then this point must be $\left( 1, 1 \right)$
For $x = \frac{i}{4}$ , Function 1 attains value 1.
For Function 2, if $y = 1$ , then $x = 1$ .
Therefore, the intersecting point is $\left( 1, 1 \right)$
Similarly, we can prove that if an intersecting point is on a line $y = \frac{i}{6}$ for $i \in \left\{ 0, 1, \cdots, 6 \right\}$ , then this point must be $\left( 1, 1 \right)$
Therefore, in each region $\left[ \frac{i}{4} , \frac{i+1}{4} \right] \times \left[ \frac{j}{6} , \frac{j+1}{6} \right]$ with $i \in \left\{ 0, 1, \cdots, 3 \right\}$ and $j \in \left\{0, 1, \cdots , 5 \right\}$ but $\left( i, j \right) \neq \left( 3, 5 \right)$ , all 16 intersecting points are interior.
That is, no two regions share any common intersecting point.
Next, we study region $\left[ \frac{3}{4} , 1 \right] \times \left[ \frac{5}{6} , 1 \right]$ .
Consider any pair of monotonic pieces, where one is from Function 1 and one is from Function 2, except the pair of two monotonic pieces from two functions that attain $\left( 1 , 1 \right)$ .
Two pieces in each pair intersects at an interior point on the region.
So the number of intersecting points is $4 \cdot 4 - 1 = 15$
Finally, we compute the number intersection points of two functions' monotonic pieces that both attain $\left( 1, 1 \right)$
One trivial intersection point is $\left( 1, 1 \right)$ .
Now, we study whether they intersect at another point.
Define $x = 1 - x'$ and $y = 1 - y'$ .
Thus, for positive and sufficiently small $x'$ and $y'$ , Function 1 is reduced to \[ y' = 4 \sin 2 \pi x' \hspace{1cm} (1) \] and Function 2 is reduced to \[ x' = 4 \left( 1 - \cos 3 \pi y' \right) . \hspace{1cm} (2) \]
Now, we study whether there is a non-zero solution.
Because we consider sufficiently small $x'$ and $y'$ , to get an intuition and quick estimate, we do approximations of the above equations.
Equation (1) is approximated as \[ y' = 4 \cdot 2 \pi x' \] and Equation (2) is approximated as \[ x' = 2 \left( 3 \pi y' \right)^2 \]
To solve these equations, we get $x' = \frac{1}{8^2 \cdot 18 \pi^4}$ and $y' = \frac{1}{8 \cdot 18 \pi^3}$ .
Therefore, two functions' two monotonic pieces that attain $\left( 1, 1 \right)$ have two intersecting points.
Putting all analysis above, the total number of intersecting points is $16 \cdot 4 \cdot 6 + 1 = \boxed{385}$ | null | 385 |
ab6ef926397100abaa5375710786be27 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_13 | Let $p$ be the least prime number for which there exists a positive integer $n$ such that $n^{4}+1$ is divisible by $p^{2}$ . Find the least positive integer $m$ such that $m^{4}+1$ is divisible by $p^{2}$ | If \(p=2\), then \(4\mid n^4+1\) for some integer \(n\). But \(\left(n^2\right)^2\equiv0\) or \(1\pmod4\), so it is impossible. Thus \(p\) is an odd prime.
For integer \(n\) such that \(p^2\mid n^4+1\), we have \(p\mid n^4+1\), hence \(p\nmid n^4-1\), but \(p\mid n^8-1\). By Fermat's Little Theorem , \(p\mid n^{p-1}-1\), so
\begin{equation*}
p\mid\gcd\left(n^{p-1}-1,n^8-1\right)=n^{\gcd(p-1,8)}-1.
\end{equation*}
Here, \(\gcd(p-1,8)\) mustn't be divide into \(4\) or otherwise \(p\mid n^{\gcd(p-1,8)}-1\mid n^4-1\), which contradicts. So \(\gcd(p-1,8)=8\), and so \(8\mid p-1\). The smallest such prime is clearly \(p=17=2\times8+1\).
So we have to find the smallest positive integer \(m\) such that \(17\mid m^4+1\). We first find the remainder of \(m\) divided by \(17\) by doing
\begin{array}{|c|cccccccccccccccc|}
\hline
\vphantom{\tfrac11}x\bmod{17}&1&2&3&4&5&6&7&8&9&10&11&12&13&14&15&16\\\hline
\vphantom{\dfrac11}\left(x^4\right)^2+1\bmod{17}&2&0&14&2&14&5&5&0&0&5&5&14&2&14&0&2\\\hline
\end{array}
So \(m\equiv\pm2\), \(\pm8\pmod{17}\). If \(m\equiv2\pmod{17}\), let \(m=17k+2\), by the binomial theorem,
\begin{align*}
0&\equiv(17k+2)^4+1\equiv\mathrm {4\choose 1}(17k)(2)^3+2^4+1=17(1+32k)\pmod{17^2}\\[3pt]
\implies0&\equiv1+32k\equiv1-2k\pmod{17}.
\end{align*}
So the smallest possible \(k=9\), and \(m=155\).
If \(m\equiv-2\pmod{17}\), let \(m=17k-2\), by the binomial theorem,
\begin{align*}
0&\equiv(17k-2)^4+1\equiv\mathrm {4\choose 1}(17k)(-2)^3+2^4+1=17(1-32k)\pmod{17^2}\\[3pt]
\implies0&\equiv1-32k\equiv1+2k\pmod{17}.
\end{align*}
So the smallest possible \(k=8\), and \(m=134\).
If \(m\equiv8\pmod{17}\), let \(m=17k+8\), by the binomial theorem,
\begin{align*}
0&\equiv(17k+8)^4+1\equiv\mathrm {4\choose 1}(17k)(8)^3+8^4+1=17(241+2048k)\pmod{17^2}\\[3pt]
\implies0&\equiv241+2048k\equiv3+8k\pmod{17}.
\end{align*}
So the smallest possible \(k=6\), and \(m=110\).
If \(m\equiv-8\pmod{17}\), let \(m=17k-8\), by the binomial theorem,
\begin{align*}
0&\equiv(17k-8)^4+1\equiv\mathrm {4\choose 1}(17k)(-8)^3+8^4+1=17(241-2048k)\pmod{17^2}\\[3pt]
\implies0&\equiv241+2048k\equiv3+9k\pmod{17}.
\end{align*}
So the smallest possible \(k=11\), and \(m=179\).
In conclusion, the smallest possible \(m\) is \(\boxed{110}\). | null | 110 |
ab6ef926397100abaa5375710786be27 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_13 | Let $p$ be the least prime number for which there exists a positive integer $n$ such that $n^{4}+1$ is divisible by $p^{2}$ . Find the least positive integer $m$ such that $m^{4}+1$ is divisible by $p^{2}$ | We work in the ring \(\mathbb Z/289\mathbb Z\) and use the formula \[\sqrt[4]{-1}=\pm\sqrt{\frac12}\pm\sqrt{-\frac12}.\] Since \(-\frac12=144\), the expression becomes \(\pm12\pm12i\), and it is easily calculated via Hensel that \(i=38\), thus giving an answer of \(\boxed{110}\). | null | 110 |
ab6ef926397100abaa5375710786be27 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_13 | Let $p$ be the least prime number for which there exists a positive integer $n$ such that $n^{4}+1$ is divisible by $p^{2}$ . Find the least positive integer $m$ such that $m^{4}+1$ is divisible by $p^{2}$ | Note that $n^4 + 1 \equiv 0 \pmod{p}$ means $\text{ord}_{p}(n) = 8 \mid p-1.$ The smallest prime that does this is $17$ and $2^4 + 1 = 17$ for example. Now let $g$ be a primitive root of $17^2.$ The satisfying $n$ are of the form, $g^{\frac{p(p-1)}{8}}, g^{3\frac{p(p-1)}{8}}, g^{5\frac{p(p-1)}{8}}, g^{7\frac{p(p-1)}{8}}.$ So if we find one such $n$ , then all $n$ are $n, n^3, n^5, n^7.$ Consider the $2$ from before. Note $17^2 \mid 2^{4 \cdot 17} + 1$ by LTE. Hence the possible $n$ are, $2^{17}, 2^{51}, 2^{85}, 2^{119}.$ Some modular arithmetic yields that $2^{51} \equiv \boxed{110}$ is the least value. | null | 110 |
02740733329ff12a5965ad1f50c6bb00 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_14 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$ $AC=BD= \sqrt{80}$ , and $BC=AD= \sqrt{89}$ . There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$ | Notice that \(41=4^2+5^2\), \(89=5^2+8^2\), and \(80=8^2+4^2\), let \(A~(0,0,0)\), \(B~(4,5,0)\), \(C~(0,5,8)\), and \(D~(4,0,8)\). Then the plane \(BCD\) has a normal
\begin{equation*}
\mathbf n:=\frac14\overrightarrow{BC}\times\overrightarrow{CD}=\frac14\begin{pmatrix}-4\\0\\8\end{pmatrix}\times\begin{pmatrix}4\\-5\\0\end{pmatrix}=\begin{pmatrix}10\\8\\5\end{pmatrix}.
\end{equation*}
Hence, the distance from \(A\) to plane \(BCD\), or the height of the tetrahedron, is
\begin{equation*}
h:=\frac{\mathbf n\cdot\overrightarrow{AB}}{|\mathbf n|}=\frac{10\times4+8\times5+5\times0}{\sqrt{10^2+8^2+5^2}}=\frac{80\sqrt{21}}{63}.
\end{equation*}
Each side of the tetrahedron has the same area due to congruency by "S-S-S", and we call it \(S\). Then by the volume formula for cones,
\begin{align*}
\frac13Sh&=V_{D\text-ABC}=V_{I\text-ABC}+V_{I\text-BCD}+V_{I\text-CDA}+V_{I\text-DAB}\\
&=\frac13Sr\cdot4.
\end{align*}
Hence, \(r=\tfrac h4=\tfrac{20\sqrt{21}}{63}\), and so the answer is \(20+21+63=\boxed{104}\). | null | 104 |
02740733329ff12a5965ad1f50c6bb00 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_14 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$ $AC=BD= \sqrt{80}$ , and $BC=AD= \sqrt{89}$ . There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$ | [asy] import three; currentprojection = orthographic(1,1,1); triple O = (0,0,0); triple A = (0,2,0); triple B = (0,0,1); triple C = (3,0,0); triple D = (3,2,1); triple E = (3,2,0); triple F = (0,2,1); triple G = (3,0,1); draw(A--B--C--cycle, red); draw(A--B--D--cycle, red); draw(A--C--D--cycle, red); draw(B--C--D--cycle, red); draw(E--A--O--C--cycle); draw(D--F--B--G--cycle); draw(O--B); draw(A--F); draw(E--D); draw(C--G); label("$O$", O, SW); label("$A$", A, NW); label("$B$", B, W); label("$C$", C, S); label("$D$", D, NE); label("$E$", E, SE); label("$F$", F, NW); label("$G$", G, NE); [/asy]
Inscribe tetrahedron $ABCD$ in an rectangular prism as shown above.
By the Pythagorean theorem, we note
\[OA^2 + OB^2 = AB^2 = 41,\] \[OA^2 + OC^2 = AC^2 = 80, \text{and}\] \[OB^2 + OC^2 = BC^2 = 89.\]
Solving yields $OA = 4, OB = 5,$ and $OC = 8.$
Since each face of the tetrahedron is congruent, we know the point we seek is the center of the circumsphere of $ABCD.$ We know all rectangular prisms can be inscribed in a circumsphere, therefore the circumsphere of the rectangular prism is also the circumsphere of $ABCD.$
We know that the distance from all $4$ faces must be the same, so we only need to find the distance from the center to plane $ABC$
Let $O = (0,0,0), A = (4,0,0), B = (0,5,0),$ and $C = (0,0,8).$ We obtain that the plane of $ABC$ can be marked as $\frac{x}{4} + \frac{y}{5} + \frac{z}{8} = 1,$ or $10x + 8y + 5z - 40 = 0,$ and the center of the prism is $(2,\frac{5}{2},4).$
Using the Point-to-Plane distance formula, our distance is
\[d = \frac{|10\cdot 2 + 8\cdot \frac{5}{2} + 5\cdot 4 - 40|}{\sqrt{10^2 + 8^2 + 5^2}} = \frac{20}{\sqrt{189}} = \frac{20\sqrt{21}}{63}.\]
Our answer is $20 + 21 + 63 = \boxed{104}.$ | null | 104 |
02740733329ff12a5965ad1f50c6bb00 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_14 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$ $AC=BD= \sqrt{80}$ , and $BC=AD= \sqrt{89}$ . There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$ | We use the formula for the volume of iscoceles tetrahedron. $V = \sqrt{(a^2 + b^2 - c^2)(b^2 + c^2 - a^2)(a^2 + c^2 - b^2)/72}$
Note that all faces have equal area due to equal side lengths. By Law of Cosines, we find \[\cos{\angle ACB} = \frac{80 + 89 - 41}{2\sqrt{80\cdot 89}}= \frac{16}{9\sqrt{5}}.\]
From this, we find \[\sin{\angle ACB} = \sqrt{1-\cos^2{\angle ACB}} = \sqrt{1 - \frac{256}{405}} = \sqrt{\frac{149}{405}}\] and can find the area of $\triangle ABC$ as \[A = \frac{1}{2} \sqrt{89\cdot 80}\cdot \sin{\angle ACB} = 6\sqrt{21}.\]
Let $R$ be the distance we want to find. By taking the sum of (equal) volumes \[[ABCI] + [ABDI] + [ACDI] + [BCDI] = V,\] We have \[V = \frac{4AR}{3}.\] Plugging in and simplifying, we get $R = \frac{20\sqrt{21}}{63}$ for an answer of $20 + 21 + 63 = \boxed{104}$ | null | 104 |
02740733329ff12a5965ad1f50c6bb00 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_14 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$ $AC=BD= \sqrt{80}$ , and $BC=AD= \sqrt{89}$ . There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$ | Let $AH$ be perpendicular to $BCD$ that meets this plane at point $H$ .
Let $AP$ $AQ$ , and $AR$ be heights to lines $BC$ $CD$ , and $BD$ with feet $P$ $Q$ , and $R$ , respectively.
We notice that all faces are congruent. Following from Heron's formula, the area of each face, denoted as $A$ , is $A = 6 \sqrt{21}$
Hence, by using this area, we can compute $AP$ $AQ$ and $AR$ .
We have $AP = \frac{2 A}{BC} = \frac{2A}{\sqrt{89}}$ $AQ = \frac{2 A}{CD} = \frac{2A}{\sqrt{41}}$ , and $AR = \frac{2 A}{BC} = \frac{2A}{\sqrt{80}}$
Because $AH \perp BCD$ , we have $AH \perp BC$ . Recall that $AP \perp BC$ .
Hence, $BC \perp APH$ . Hence, $BC \perp HP$
Analogously, $CD \perp HQ$ and $BD \perp HR$
We introduce a function $\epsilon \left( l \right)$ for $\triangle BCD$ that is equal to 1 (resp. -1) if point $H$ and the opposite vertex of side $l$ are on the same side (resp. opposite sides) of side $l$
The area of $\triangle BCD$ is
\begin{align*}
A & = \epsilon_{BC} {\rm Area} \ \triangle HBC
+ \epsilon_{CD} {\rm Area} \ \triangle HCD
+ \epsilon_{BD} {\rm Area} \ \triangle HBD \\
& = \frac{1}{2} \epsilon_{BC} BC \cdot HP
+ \frac{1}{2} \epsilon_{CD} CD \cdot HQ +
\frac{1}{2} \epsilon_{BD} BD \cdot HR \\
& = \frac{1}{2} \epsilon_{BC} BC \cdot \sqrt{AP^2 - AH^2}
+ \frac{1}{2} \epsilon_{CD} CD \cdot \sqrt{AQ^2 - AH^2} \\
& \quad + \frac{1}{2} \epsilon_{BD} CD \cdot \sqrt{AR^2 - AH^2} . \hspace{1cm} (1)
\end{align*}
Denote $B = 2A$ .
The above equation can be organized as
\begin{align*}
B & = \epsilon_{BC} \sqrt{B^2 - 89 AH^2}
+ \epsilon_{CD} \sqrt{B^2 - 41 AH^2} \\
& \quad + \epsilon_{BD} \sqrt{B^2 - 80 AH^2} .
\end{align*}
This can be further reorganized as
\begin{align*}
B - \epsilon_{BC} \sqrt{B^2 - 89 AH^2}
& = \epsilon_{CD} \sqrt{B^2 - 41 AH^2}
+ \epsilon_{BD} \sqrt{B^2 - 80 AH^2} .
\end{align*}
Taking squares on both sides and reorganizing terms, we get
\begin{align*}
& 16 AH^2 - \epsilon_{BC} B \sqrt{B^2 - 89 AH^2} \\
& = \epsilon_{CD} \epsilon_{BD}
\sqrt{\left( B^2 - 41 AH^2 \right) \left( B^2 - 80 AH^2 \right)} .
\end{align*}
Taking squares on both sides and reorganizing terms, we get \[ - \epsilon_{BC} 2 B \sqrt{B^2 - 89 AH^2} = - 2 B^2 + 189 AH^2 . \]
Taking squares on both sides, we finally get
\begin{align*}
AH & = \frac{20B}{189} \\
& = \frac{40A}{189}.
\end{align*}
Now, we plug this solution to Equation (1). We can see that $\epsilon_{BC} = -1$ $\epsilon_{CD} = \epsilon_{BD} = 1$ .
This indicates that $H$ is out of $\triangle BCD$ . To be specific, $H$ and $D$ are on opposite sides of $BC$ $H$ and $C$ are on the same side of $BD$ , and $H$ and $B$ are on the same side of $CD$
Now, we compute the volume of the tetrahedron $ABCD$ , denoted as $V$ . We have $V = \frac{1}{3} A \cdot AH = \frac{40 A^2}{3 \cdot 189}$
Denote by $r$ the inradius of the inscribed sphere in $ABCD$ .
Denote by $I$ the incenter.
Thus, the volume of $ABCD$ can be alternatively calculated as
\begin{align*}
V & = {\rm Vol} \ IABC + {\rm Vol} \ IACD + {\rm Vol} \ IABD + {\rm Vol} \ IBCD \\
& = \frac{1}{3} r \cdot 4A .
\end{align*}
From our two methods to compute the volume of $ABCD$ and equating them, we get
\begin{align*}
r & = \frac{10A}{189} \\
& = \frac{20 \sqrt{21}}{63} .
\end{align*}
Therefore, the answer is $20 + 21 + 63 = \boxed{104}$ | null | 104 |
02740733329ff12a5965ad1f50c6bb00 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_14 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$ $AC=BD= \sqrt{80}$ , and $BC=AD= \sqrt{89}$ . There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $p$ are relatively prime, and $n$ is not divisible by the square of any prime. Find $m+n+p$ | Consider the following construction of the tetrahedron. Place $AB$ on the floor. Construct an isosceles vertical triangle with $AB$ as its base and $M$ as the top vertex. Place $CD$ on the top vertex parallel to the ground with midpoint $M.$ Observe that $CD$ can rotate about its midpoint. At a certain angle, we observe that the lengths satisfy those given in the problem. If we project $AB$ onto the plane of $CD$ , let the minor angle $\theta$ be this discrepancy.
By Median formula or Stewart's theorem, $AM = \frac{1}{2}\sqrt{2AC^2 + 2AD^2 - CD^2} = \frac{3\sqrt{33}}{2}.$ Consequently the area of $\triangle AMB$ is $\frac{\sqrt{41}}{2} \left (\sqrt{(\frac{3\sqrt{33}}{2})^2 - (\frac{\sqrt{41}}{2})^2} \right ) = 4\sqrt{41}.$ Note the altitude $8$ is also the distance between the parallel planes containing $AB$ and $CD.$
By Distance Formula, \begin{align*} (\frac{\sqrt{41}}{2} - \frac{1}{2}CD \cos{\theta})^2 + (\frac{1}{2}CD \sin{\theta}^2) + (8)^2 &= AC^2 = 80 \\ (\frac{\sqrt{41}}{2} + \frac{1}{2}CD \cos{\theta})^2 + (\frac{1}{2}CD \sin{\theta}^2) + (8)^2 &= AD^2 = 89 \\ \implies CD \cos{\theta} \sqrt{41} &= 9 \\ \sin{\theta} &= \sqrt{1 - (\frac{9}{41})^2} = \frac{40}{41}. \end{align*} Then the volume of the tetrahedron is given by $\frac{1}{3} [AMB] \cdot CD \sin{\theta} = \frac{160}{3}.$
The volume of the tetrahedron can also be segmented into four smaller tetrahedrons from $I$ w.r.t each of the faces. If $r$ is the inradius, i.e the distance to the faces, then $\frac{1}{3} r([ABC] + [ABD] + [ACD] + [BCD])$ must the volume. Each face has the same area by SSS congruence, and by Heron's it is $\frac{1}{4}\sqrt{(a + b + c)(a + b - c)(c + (a-b))(c -(a - b))} = 6\sqrt{21}.$
Therefore the answer is, $\dfrac{3 \frac{160}{3}}{24 \sqrt{21}} = \frac{20\sqrt{21}}{63} \implies \boxed{104}.$ | null | 104 |
d098094f7ade00b993b32533ed8d10a0 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_15 | Let $\mathcal{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$ . Let $r$ be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of $\mathcal{B}$ . The value of $r^2$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$ | Observe that the "worst" possible box is one of the maximum possible length.
By symmetry, the height and the width are the same in this antioptimal box. (If the height and width weren't the same, the extra difference between them could be used to make the length longer.) Thus, let the width and height be of length $a$ and the length be $L$
We're given that the volume is $23$ ; thus, $a^2L=23$ . We're also given that the surface area is $54=2\cdot27$ ; thus, $a^2+2aL=27$
From the first equation, we can get $L=\dfrac{23}{a^2}$ . We do a bunch of algebra:
\begin{align*}
L&=\dfrac{23}{a^2} \\
27&=a^2+2aL \\
&=a^2+2a\left(\dfrac{23}{a^2}\right) \\
&=a^2+\dfrac{46}a \\
27a&=a^3+46 \\
a^3-27a+46&=0. \\
\end{align*}
We can use the Rational Root Theorem and test a few values. It turns out that $a=2$ works. We use synthetic division to divide by $a-2$
Asdf.png
As we expect, the remainder is $0$ , and we are left with the polynomial $x^2+2x-23$ . We can now simply use the quadratic formula and find that the remaining roots are $\dfrac{-2\pm\sqrt{4-4(-23)}}2=\dfrac{-2\pm\sqrt{96}}2=\dfrac{-2\pm4\sqrt{6}}2=-1\pm2\sqrt6$ . We want the smallest $a$ to maximize $L$ , and it turns out that $a=2$ is in fact the smallest root. Thus, we let $a=2$ . Substituting this into $L=\dfrac{23}{a^2}$ , we find that $L=\dfrac{23}4$ . However, this is not our answer! This is simply the length of the box; we want the radius of the sphere enclosing it. We know that the diameter of the sphere is the diagonal of the box, and the 3D Pythagorean Theorem can give us the space diagonal. Applying it, we find that the diagonal has length $\sqrt{2^2+2^2+\left(\dfrac{23}4\right)^2}=\sqrt{8+\dfrac{529}{16}}=\sqrt{\dfrac{128+529}{16}}=\dfrac{\sqrt{657}}4$ . This is the diameter; we halve it to find the radius, $\dfrac{\sqrt{657}}8$ . We then square this and end up with $\dfrac{657}{64}$ , giving us an answer of $657+64=\boxed{721}$ | null | 721 |
d098094f7ade00b993b32533ed8d10a0 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_15 | Let $\mathcal{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$ . Let $r$ be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of $\mathcal{B}$ . The value of $r^2$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$ | Denote by $x$ $y$ $z$ the length, width, and height of a rectangular box.
We have
\begin{align*}
xy + yz + zx & = \frac{54}{2} \hspace{1cm} (1) \\
xyz & = 23 \hspace{1cm} (2)
\end{align*}
We have
\begin{align*}
4 r^2 & = x^2 + y^2 + z^2 \\
& = \left( x + y + z \right)^2 - 2 \cdot \left( xy + yz + zx \right) \\
& = \left( x + y + z \right)^2 - 54 .
\end{align*}
Therefore, we solve the following constrained optimization problem:
\begin{align*}
\max_{x,y,z} \ & x + y + z \\
\mbox{subject to } & (1), (2)
\end{align*}
First, we prove that an optimal solution must have at least two out of $x$ $y$ $z$ that are the same.
Denote by $\lambda$ and $\eta$ lagrangian multipliers of constraints (1) and (2), respectively.
Consider the following Lagrangian:
\begin{align*}
\max_{x,y,z, \lambda, \eta} & x + y + z + \lambda \left( xy + yz + zx - 27 \right)
+ \eta \left( xyz - 23 \right) .
\end{align*}
Taking first-order-condition with respect to $x$ $y$ $z$ , respectively, we get
\begin{align*}
1 + \lambda \left( y + z \right) + \eta yz & = 0 \hspace{1cm} (3) \\
1 + \lambda \left( z + x \right) + \eta zx & = 0 \hspace{1cm} (4) \\
1 + \lambda \left( x + y \right) + \eta xy & = 0 \hspace{1cm} (5)
\end{align*}
Suppose there is an optimal solution with $x$ $y$ $z$ that are all distinct.
Taking $(4)-(3)$ , we get \[ \left( x - y \right) \left( \lambda + \eta z \right) = 0 . \]
Because $x \neq y$ , we have \[ \lambda + \eta z = 0 \hspace{1cm} (6) \]
Analogously, we have
\begin{align*}
\lambda + \eta x & = 0 \hspace{1cm} (7)
\end{align*}
Taking $(6) - (7)$ , we get $\eta \left( z - x \right) = 0$ .
Because $z \neq x$ , we have $\eta = 0$ . Plugging this into (6), we get $\lambda = 0$
However, the solution that $\lambda = \eta = 0$ is a contradiction with (3).
Therefore, in an optimal solution, we cannot have $x$ $y$ , and $z$ to be all distinct.
W.L.O.G, in our remaining analysis, we assume an optimal solution satisfies $y = z$
Therefore, we need to solve the following two-variable optimization problem:
\begin{align*}
\max_{x,y} \ & x + 2y \\
\mbox{subject to } & 2 xy + y^2 = 27 \\
& xy^2 = 23
\end{align*}
Replacing $x$ with $y$ by using the constraint $xy^2 = 23$ , we solve the following single-variable optimization problem:
\begin{align*}
\max_y \ & \frac{23}{y^2} + 2y \hspace{1cm} (8) \\
\mbox{subject to } & \frac{46}{y} + y^2 = 27 \hspace{1cm} (9)
\end{align*}
By solving (9), we get $y = 2$ and $-1 + 2 \sqrt{6}$
Plugging $y = 2$ into (8), we get $\frac{23}{y^2} + 2y = \frac{39}{4}$
Plugging $y = -1 + 2 \sqrt{6}$ into (8), we get $\frac{23}{y^2} + 2y = \frac{96 \sqrt{6} - 21}{23}$
We have $\frac{96 \sqrt{6} - 21}{23} < \frac{39}{4}$ .
Therefore, the maximum value of $x + y + z$ is $\frac{39}{4}$
Therefore,
\begin{align*}
r^2 & = \frac{1}{4} \left( \left( x + y + z \right)^2 - 54 \right) \\
& = \frac{1}{4} \left( \left( \frac{39}{4} \right)^2 - 54 \right) \\
& = \frac{657}{64} .
\end{align*}
Therefore, the answer is $657 + 64 = \boxed{721}$ | null | 721 |
d098094f7ade00b993b32533ed8d10a0 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_I_Problems/Problem_15 | Let $\mathcal{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$ . Let $r$ be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of $\mathcal{B}$ . The value of $r^2$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$ | First, let's list the conditions:
Denote by $l$ $w$ $h$ the length, width, and height of a rectangular box.
\[lwh=23\] \begin{align*}
2(lw+wh+hl)&=54\\
lw+wh+hl&=27.
\end{align*}
Applying the Pythagorean theorem, we can establish that
\begin{align*}
(2r)^2&=(l^2+w^2+h^2)\\
4r^2&=(l^2+w^2+h^2)\\
4r^2&=(l+w+h)^2-2(lw+wh+hl)\\
4r^2&=(l+w+h)^2-54.
\end{align*}
We can spot Vieta's formula hidden inside this equation and call this $m$ . Now we have three equations:
\[lwh=23\] \[lw+wh+hl)=27\] \[l+w+h=m\]
Let there be a cubic equation. $x^3+bx^2+cx+d=0$ . Its roots are $l$ $w$ and $h$ . We can use our formulas from before to derive $c$ and $d$
\[-b=l+w+h=m\]
\[c=lw+wh+lh=27\]
\[-d=lwh=23\]
We can now rewrite the equation from before:
$x^3-mx^2+27x-23=0$
To find the maximum $r$ we need the maximum $m$ . This only occurs when this equation has double roots illustrated with graph below.
WLOG we can set $h=w$
Thus:
\[lw+w^2+wl=27\] \[lw^2=23\]
We can substitute $l$ and form a depressed cubic equation with $w$ .
\begin{align*}
lw^2&=23\\
l&=\frac{23}{w^2}\\
2\left(\frac{23}{w^2}\right)w+w^2&=27\\
\frac{46}{w}+w^2&=27\\
w^2+\frac{46}{w}-27&=0\\
w^3 -27w+46&=0.
\end{align*}
Based on Rational Root Theorem the possible rational roots are $\pm1, \pm2, \pm23$
A quick test reveals that $2$ is a root of the equation. Comparing coefficients we can factorize the equation into:
$(w-2)(w^2+2w-23)=0$
Besides $2$ , we derive another positive root using the quadratic formula, $2\sqrt{6}-1$ But to maximize the $m$ we need to pick the smaller $w$ , which is $2$
Substituting this into $l=\frac{23}{w^2}$ , we find that $l=\dfrac{23}4$
Applying it to our equation above:
\begin{align*}
4r^2&=(l+w+h)^2-54\\
4r^2&=(l+2w)^2-54\\
4r^2&=\left(\dfrac{23}4+2\cdot2\right)^2-54\\
4r^2&=\left(\dfrac{39}4\right)^2-54\\
4r^2&=\left(\dfrac{1521}{16}\right)-54\\
4r^2&=\left(\dfrac{657}{16}\right)\\
r^2&=\left(\dfrac{657}{64}\right).
\end{align*} $657+64=\boxed{721}$ | null | 721 |
8e676e89a3393aaf224e348b510dee94 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_2 | A list of positive integers has the following properties:
$\bullet$ The sum of the items in the list is $30$
$\bullet$ The unique mode of the list is $9$
$\bullet$ The median of the list is a positive integer that does not appear in the list itself.
Find the sum of the squares of all the items in the list. | The third condition implies that the list's size must be an even number, as if it were an odd number, the median of hte list would surely appear in the list itself.
Therefore, we can casework on what even numbers work.
Say the size is 2. Clearly, this doesn't work as the only list would be $\{9, 9\}$ , which doesn't satisfy condition 1.
If the size is 4, then we can have two $9$ s, and a remaining sum of $12$ . Since the other two values in the list must be distinct, and their sum must equal $30-18=12$ , we have that the two numbers are in the form $a$ and $12-a$ . Note that we cannot have both values greater than $9$ , and we cannot have only one value greater than $9$ , because this would make the median $9$ , which violates condition 3. Since the median of the list is a positive integer, this means that the greater of $a$ and $12-a$ must be an odd number. The only valid solution to this is $a=5$ . Thus, our answer is $5^2+7^2+9^2+9^2 = \boxed{236}$ . ~akliu | null | 236 |
8e676e89a3393aaf224e348b510dee94 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_2 | A list of positive integers has the following properties:
$\bullet$ The sum of the items in the list is $30$
$\bullet$ The unique mode of the list is $9$
$\bullet$ The median of the list is a positive integer that does not appear in the list itself.
Find the sum of the squares of all the items in the list. | If there were an odd number of elements, the median would be in the set. Thus, we start with 4 elements. For 9 to be the mode, there must be 2 9s. For 9 to not be the median, either both numbers are greater than 9, or both numbers are less than 9. Clearly, both numbers must be less. From here, the numbers are clearly $(5,7,9,9)$ , and we add their squares to get $\boxed{236}$ -westwoodmonster | null | 236 |
8e676e89a3393aaf224e348b510dee94 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_2 | A list of positive integers has the following properties:
$\bullet$ The sum of the items in the list is $30$
$\bullet$ The unique mode of the list is $9$
$\bullet$ The median of the list is a positive integer that does not appear in the list itself.
Find the sum of the squares of all the items in the list. | Since the median is not in the list, there must not be an odd number of elements. Suppose the list has two elements. To meet the mode condition, both must equal $9$ , but this does not satisfy the other conditions.
Next, suppose the list has six elements. If there were at least three $9$ s, then the other elements would sum to at most $30-27=3$ . Since the elements are positive integers, this can only be achieved with the set $\{1,1,1,9,9,9\}$ , which violates the unique mode condition. Therefore, there must be exactly two $9$ s, and the other four elements must be distinct to satisfy the unique mode condition. Two sets of four unique positive integers add to $12$ $\{1,2,3,6\}$ and $\{1,2,4,5\}$ . Neither can act as the remaining four elements since both possibilities violate the constraint that the median is an integer.
Next, suppose the list had at least eight elements. For the sake of contradiction, suppose the third-largest element was at least $9$ . Then, since every element is a positive integer, the minimum sum would be $1+1+1+1+1+9+9+9>30$ . So, to satisfy the unique mode condition, there must be exactly two $9$ s, and the other elements must be distinct. But then the minimum sum is $1+2+3+4+5+6+9+9>30$ , so the sum constraint can never be satisfied. From these deductions, we conclude that the list has exactly four elements.
Note that no element can appear three times in the list, or else the middle-two-largest elements would be equal, violating the condition that the median is not in the list. Therefore, to satisfy the unique mode condition, the list contains two $9$ s and two other distinct integers that add to $30-18=12$ . Five sets of two unique positive integers add to $12$ $\{1,11\}$ $\{2,10\}$ $\{3,9\}$ $\{4,8\}$ , and $\{5,7\}$ . The first four options violate the median condition (either they make the median one of the list elements, or they make the median a non-integer). Thus, the set must be $\{5,7,9,9\}$ , and the sum of the squares of these elements is $25+49+81+81=\boxed{236}$ | null | 236 |
85e9501d4b790ab1df73ed00208df28d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_3 | Find the number of ways to place a digit in each cell of a 2x3 grid so that the sum of the two numbers formed by reading left to right is $999$ , and the sum of the three numbers formed by reading top to bottom is $99$ . The grid below is an example of such an arrangement because $8+991=999$ and $9+9+81=99$
\[\begin{array}{|c|c|c|} \hline 0 & 0 & 8 \\ \hline 9 & 9 & 1 \\ \hline \end{array}\] | Consider this table:
$\begin{array}{|c|c|c|} \hline a & b & c \\ \hline d & e & f\\ \hline \end{array}$
We note that $c+f = 9$ , because $c+f \leq 18$ , meaning it never achieves a unit's digit sum of $9$ otherwise. Since no values are carried onto the next digit, this implies $b+e=9$ and $a+d=9$ . We can then simplify our table into this:
$\begin{array}{|c|c|c|} \hline a & b & c \\ \hline 9-a & 9-b & 9-c \\ \hline \end{array}$
We want $10(a+b+c) + (9-a+9-b+9-c) = 99$ , or $9(a+b+c+3) = 99$ , or $a+b+c=8$ . Since zeroes are allowed, we just need to apply stars and bars on $a, b, c$ , to get $\tbinom{8+3-1}{3-1} = \boxed{045}$ . ~akliu | null | 045 |
b2b2a26baed48040c0254e521b48d2ff | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_4 | Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations: \[\log_2\left({x \over yz}\right) = {1 \over 2}\] \[\log_2\left({y \over xz}\right) = {1 \over 3}\] \[\log_2\left({z \over xy}\right) = {1 \over 4}\] Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Denote $\log_2(x) = a$ $\log_2(y) = b$ , and $\log_2(z) = c$
Then, we have: $a-b-c = \frac{1}{2}$ $-a+b-c = \frac{1}{3}$ $-a-b+c = \frac{1}{4}$
Now, we can solve to get $a = \frac{-7}{24}, b = \frac{-9}{24}, c = \frac{-5}{12}$ . Plugging these values in, we obtain $|4a + 3b + 2c| = \frac{25}{8} \implies \boxed{033}$ . ~akliu | null | 033 |
b2b2a26baed48040c0254e521b48d2ff | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_4 | Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations: \[\log_2\left({x \over yz}\right) = {1 \over 2}\] \[\log_2\left({y \over xz}\right) = {1 \over 3}\] \[\log_2\left({z \over xy}\right) = {1 \over 4}\] Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | $\log_2(y/xz) + \log_2(z/xy) = \log_2(1/x^2) = -2\log_2(x) = \frac{7}{12}$
$\log_2(x/yz) + \log_2(z/xy) = \log_2(1/y^2) = -2\log_2(y) = \frac{3}{4}$
$\log_2(x/yz) + \log_2(y/xz) = \log_2(1/z^2) = -2\log_2(z) = \frac{5}{6}$
$\log_2(x) = -\frac{7}{24}$
$\log_2(y) = -\frac{3}{8}$
$\log_2(z) = -\frac{5}{12}$
$4\log_2(x) + 3\log_2(y) + 2\log_2(z) = -25/8$
$25 + 8 = \boxed{033}$ | null | 033 |
b2b2a26baed48040c0254e521b48d2ff | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_4 | Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations: \[\log_2\left({x \over yz}\right) = {1 \over 2}\] \[\log_2\left({y \over xz}\right) = {1 \over 3}\] \[\log_2\left({z \over xy}\right) = {1 \over 4}\] Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Adding all three equations, $\log_2(\frac{1}{xyz}) = \frac{1}{2}+\frac{1}{3}+\frac{1}{4} = \frac{13}{12}$ . Subtracting this from every equation, we have: \[2\log_2x = -\frac{7}{12},\] \[2\log_2y = -\frac{3}{4},\] \[2\log_2z = -\frac{5}{6}\] Our desired quantity is the absolute value of $4\log_2x+3\log_2y+2\log_2z = 2(\frac{7}{12})+3/2(\frac{3}{4})+\frac{5}{6} = \frac{25}{8}$ , so our answer is $25+8 = \boxed{033}$ .
~Spoirvfimidf | null | 033 |
c0cfceed27643d9b1ed943b9c53f35be | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_5 | Let ABCDEF be a convex equilateral hexagon in which all pairs of opposite sides are parallel. The triangle whose sides are extensions of segments AB, CD, and EF has side lengths 200, 240, and 300. Find the side length of the hexagon. | (Sorry i have zero idea how to make drawings)
Draw a good diagram!
Let $AB \cap DC$ $CD \cap FE$ , and $BA \cap EF$ be P, Q, and R, respectively. Let $QR=200, RP=300, PQ=240$ . Notice that all smaller triangles formed are all similar to the larger $(200,240,300)$ triangle. Let the side length of the hexagon be x. Triangle $\triangle BCP \sim \triangle RQP$ , so $\frac{BC}{BP} =\frac{x}{BP} =\frac{200}{300} \implies BP=\frac{3x}{2}$ . Triangle $\triangle AFR \sim \triangle PQR$ , so $\frac{AF}{AR}=\frac{x}{AR} = \frac{240}{300} \implies AR=\frac{5x}{4}$ . We know $RA+AB+BP=300$ , so $\frac{5}{4}x + x + \frac{3}{2}x = 300$ . Solving, we get $x=\boxed{080}$ . -westwoodmonster | null | 080 |
c0cfceed27643d9b1ed943b9c53f35be | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_5 | Let ABCDEF be a convex equilateral hexagon in which all pairs of opposite sides are parallel. The triangle whose sides are extensions of segments AB, CD, and EF has side lengths 200, 240, and 300. Find the side length of the hexagon. | Draw an accurate diagram using the allowed compass and ruler: Draw a to-scale diagram of the $(200,240,300)$ triangle (e.g. 10cm-12cm-15cm). Because of the nature of these lengths and the integer answer needed, it can be assumed that the side length of the hexagon will be divisible by 10. Therefore, a trial-and-error method can be set up, wherein line segments of length $n\cdot 10$ , scaled to the same scale as the triangle, can be drawn to represent the sides of the hexagon. For instance, side $BC$ would be drawn parallel to the side of the triangle of length 300, and would have endpoints on the other sides of the triangle. Using this method, it would be evident that line segments of length 80 units, scaled proportionally (4cm using the scale above), would create a perfect equilateral hexagon when drawn parallel to the sides of the triangle. $x=\boxed{080}$ . - lackolith | null | 080 |
7ecacb60e248e6974698678b3e7c45dc | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_6 | Alice chooses a set $A$ of positive integers. Then Bob lists all finite nonempty sets $B$ of positive integers with the property that the maximum element of $B$ belongs to $A$ . Bob's list has 2024 sets. Find the sum of the elements of A. | Let $k$ be one of the elements in Alices set $A$ of positive integers. The number of sets that Bob lists with the property that their maximum element is k is $2^{k-1}$ , since every positive integer less than k can be in the set or out. Thus, for the number of sets bob have listed to be 2024, we want to find a sum of unique powers of two that can achieve this. 2024 is equal to $2^{10}+2^9+2^8+2^7+2^6+2^5+2^3$ . We must increase each power by 1 to find the elements in set $A$ , which are $(11,10,9,8,7,6,4)$ . Add these up to get $\boxed{055}$ . -westwoodmonster | null | 055 |
7ecacb60e248e6974698678b3e7c45dc | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_6 | Alice chooses a set $A$ of positive integers. Then Bob lists all finite nonempty sets $B$ of positive integers with the property that the maximum element of $B$ belongs to $A$ . Bob's list has 2024 sets. Find the sum of the elements of A. | Let $A = \left\{ a_1, a_2, \cdots, a_n \right\}$ with $a_1 < a_2 < \cdots < a_n$
If the maximum element of $B$ is $a_i$ for some $i \in \left\{ 1, 2, \cdots , n \right\}$ , then each element in $\left\{ 1, 2, \cdots, a_i- 1 \right\}$ can be either in $B$ or not in $B$ .
Therefore, the number of such sets $B$ is $2^{a_i - 1}$
Therefore, the total number of sets $B$ is
\begin{align*}
\sum_{i=1}^n 2^{a_i - 1} & = 2024 .
\end{align*}
Thus
\begin{align*}
\sum_{i=1}^n 2^{a_i} & = 4048 .
\end{align*}
Now, the problem becomes writing 4048 in base 2, say, $4048 = \left( \cdots b_2b_1b_0 \right)_2$ .
We have $A = \left\{ j \geq 1: b_j = 1 \right\}$
We have $4048 = \left( 111,111,010,000 \right)_2$ .
Therefore, $A = \left\{ 4, 6, 7, 8, 9, 10, 11 \right\}$ .
Therefore, the sum of all elements in $A$ is $\boxed{55}$ | null | 55 |
644379656904b8f094fc107794f00338 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_7 | Let $N$ be the greatest four-digit positive integer with the property that whenever one of its digits is changed to $1$ , the resulting number is divisible by $7$ . Let $Q$ and $R$ be the quotient and remainder, respectively, when $N$ is divided by $1000$ . Find $Q+R$ | We note that by changing a digit to $1$ for the number $\overline{abcd}$ , we are subtracting the number by either $1000(a-1)$ $100(b-1)$ $10(c-1)$ , or $d-1$ . Thus, $1000a + 100b + 10c + d \equiv 1000(a-1) \equiv 100(b-1) \equiv 10(c-1) \equiv d-1 \pmod{7}$ . We can casework on $a$ backwards, finding the maximum value.
(Note that computing $1000 \equiv 6 \pmod{7}, 100 \equiv 2 \pmod{7}, 10 \equiv 3 \pmod{7}$ greatly simplifies computation).
Applying casework on $a$ , we can eventually obtain a working value of $\overline{abcd} = 5694 \implies \boxed{699}$ . ~akliu | null | 699 |
644379656904b8f094fc107794f00338 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_7 | Let $N$ be the greatest four-digit positive integer with the property that whenever one of its digits is changed to $1$ , the resulting number is divisible by $7$ . Let $Q$ and $R$ be the quotient and remainder, respectively, when $N$ is divided by $1000$ . Find $Q+R$ | Let our four digit number be $abcd$ . Replacing digits with 1, we get the following equations:
$1000+100b+10c+d \equiv 0 \pmod{7}$
$1000a+100+10c+d \equiv 0 \pmod{7}$
$1000a+100b+10+d \equiv 0 \pmod{7}$
$1000a+100b+10c+1 \equiv 0 \pmod{7}$
Reducing, we get
$6+2b+3c+d \equiv 0 \pmod{7}$ $(1)$
$6a+2+3c+d \equiv 0 \pmod{7}$ $(2)$
$6a+2b+3+d \equiv 0 \pmod{7}$ $(3)$
$6a+2b+3c+1 \equiv 0 \pmod{7}$ $(4)$
Subtracting $(2)-(1), (3)-(2), (4)-(3), (4)-(1)$ , we get:
$3a-b \equiv 2 \pmod{7}$
$2b-3c \equiv 6 \pmod{7}$
$3c-d \equiv 2 \pmod{7}$
$6a-d \equiv 5 \pmod{7}$
For the largest 4 digit number, we test values for a starting with 9. When a is 9, b is 4, c is 3, and d is 7. However, when switching the digits with 1, we quickly notice this doesnt work. Once we get to a=5, we get b=6,c=9,and d=4. Adding 694 with 5, we get $\boxed{699}$ -westwoodmonster | null | 699 |
644379656904b8f094fc107794f00338 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_7 | Let $N$ be the greatest four-digit positive integer with the property that whenever one of its digits is changed to $1$ , the resulting number is divisible by $7$ . Let $Q$ and $R$ be the quotient and remainder, respectively, when $N$ is divided by $1000$ . Find $Q+R$ | Let our four digit number be $abcd$ . Replacing digits with 1, we get the following equations:
$1000+100b+10c+d \equiv 0 \pmod{7}$
$1000a+100+10c+d \equiv 0 \pmod{7}$
$1000a+100b+10+d \equiv 0 \pmod{7}$
$1000a+100b+10c+1 \equiv 0 \pmod{7}$
Add the equations together, we get:
$3000a+300b+30c+3d+1111 \equiv 0 \pmod{7}$
And since the remainder of 1111 divided by 7 is 5, we get:
$3abcd \equiv 2 \pmod{7}$
Which gives us:
$abcd \equiv 3 \pmod{7}$
And since we know that changing each digit into 1 will make abcd divisible by 7, we get that $d-1$ $10c-10$ $100b-100$ , and $1000a-1000$ all have a remainder of 3 when divided by 7. Thus, we get $a=5$ $b=6$ $c=9$ , and $d=4$ . Thus, we get 5694 as abcd, and the answer is $694+5=\boxed{699}$ | null | 699 |
644379656904b8f094fc107794f00338 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_7 | Let $N$ be the greatest four-digit positive integer with the property that whenever one of its digits is changed to $1$ , the resulting number is divisible by $7$ . Let $Q$ and $R$ be the quotient and remainder, respectively, when $N$ is divided by $1000$ . Find $Q+R$ | Let our four digit number be $abcd$ . Replacing digits with 1, we get the following equations:
$1000+100b+10c+d \equiv 0 \pmod{7}$
$1000a+100+10c+d \equiv 0 \pmod{7}$
$1000a+100b+10+d \equiv 0 \pmod{7}$
$1000a+100b+10c+1 \equiv 0 \pmod{7}$
Then, we let x, y, z, t be the smallest whole number satisfying the following equations:
$1000a \equiv x \pmod{7}$
$100b \equiv y \pmod{7}$
$10a \equiv z \pmod{7}$
$d \equiv t \pmod{7}$
Since 1000, 100, 10, and 1 have a remainder of 6, 2, 3, and 1 when divided by 7, we can get the equations of:
(1): $6+y+z+t \equiv 0 \pmod{7}$
(2): $x+2+z+t \equiv 0 \pmod{7}$
(3): $x+y+3+t \equiv 0 \pmod{7}$
(4): $x+y+z+1 \equiv 0 \pmod{7}$
Add (1), (2), (3) together, we get:
$2x+2y+2z+3t+11 \equiv 0 \pmod{7}$
We can transform this equation to:
$2(x+y+z+1)+3t+9 \equiv 0 \pmod{7}$
Since, according to (4), $x+y+z+1$ has a remainder of 0 when divided by 7, we get:
$3t+9 \equiv 0 \pmod{7}$
And because t is 0 to 6 due to it being a remainder when divided by 7, we use casework and determine that t is 4.
Using the same methods of simplification, we get that x=2, y=5, and z=6, which means that 1000a, 100b, 10c, and d has a remainder of 2, 5, 6, and 4, respectively. Since a, b, c, and d is the largest possible number between 0 to 9, we use casework to determine the answer is a=5, b=6, c=9, and d=4, which gives us an answer of $5+694=\boxed{699}$ | null | 699 |
beadcaf456d006ced092341939f76df0 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_8 | Torus $T$ is the surface produced by revolving a circle with radius $3$ around an axis in the plane of the circle that is a distance $6$ from the center of the circle (so like a donut). Let $S$ be a sphere with a radius $11$ . When $T$ rests on the inside of $S$ , it is internally tangent to $S$ along a circle with radius $r_i$ , and when $T$ rests on the outside of $S$ , it is externally tangent to $S$ along a circle with radius $r_o$ . The difference $r_i-r_o$ can be written as $\tfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
[asy] unitsize(0.3 inch); draw(ellipse((0,0), 3, 1.75)); draw((-1.2,0.1)..(-0.8,-0.03)..(-0.4,-0.11)..(0,-0.15)..(0.4,-0.11)..(0.8,-0.03)..(1.2,0.1)); draw((-1,0.04)..(-0.5,0.12)..(0,0.16)..(0.5,0.12)..(1,0.04)); draw((0,2.4)--(0,-0.15)); draw((0,-0.15)--(0,-1.75), dashed); draw((0,-1.75)--(0,-2.25)); draw(ellipse((2,0), 1, 0.9)); draw((2.03,-0.02)--(2.9,-0.4)); [/asy] | First, let's consider a section $\mathcal{P}$ of the solids, along the axis.
By some 3D-Geomerty thinking, we can simply know that the axis crosses the sphere center. So, that is saying, the $\mathcal{P}$ we took crosses one of the equator of the sphere.
Here I drew two graphs, the first one is the case when $T$ is internally tangent to $S$
[asy] unitsize(0.35cm); pair O = (0, 0); real r1 = 11; real r2 = 3; draw(circle(O, r1)); pair A = O + (0, -r1); pair B = O + (0, r1); draw(A--B); pair C = O + (0, -1.25*r1); pair D = O + (0, 1.25*r1); draw(C--D, dashed); dot(O); pair E = (2 * r2, -sqrt((r1 - r2) * (r1 - r2) - 4 * r2 * r2)); pair F = (0, -sqrt((r1 - r2) * (r1 - r2) - 4 * r2 * r2)); pair G = (-r2 * O + r1 * E) / (r1 - r2); pair H = (-r2 * O + r1 * F) / (r1 - r2); draw(circle(E, r2)); draw(circle((-2 * r2, -sqrt((r1 - r2) * (r1 - r2) - 4 * r2 * r2)), r2)); draw(O--G, dashed); draw(F--E, dashed); draw(G--H, dashed); label("$O$", O, SW); label("$A$", A, SW); label("$B$", B, NW); label("$C$", C, NW); label("$D$", D, SW); label("$E_i$", E, NE); label("$F_i$", F, W); label("$G_i$", G, SE); label("$H_i$", H, W); label("$r_i$", 0.5 * H + 0.5 * G, NE); label("$3$", 0.5 * E + 0.5 * G, NE); label("$11$", 0.5 * O + 0.5 * G, NE); [/asy]
and the second one is when $T$ is externally tangent to $S$
[asy] unitsize(0.35cm); pair O = (0, 0); real r1 = 11; real r2 = 3; draw(circle(O, r1)); pair A = O + (0, -r1); pair B = O + (0, r1); draw(A--B); pair C = O + (0, -1.25*(r1 + r2)); pair D = O + (0, 1.25*r1); draw(C--D, dashed); dot(O); pair E = (2 * r2, -sqrt((r1 + r2) * (r1 + r2) - 4 * r2 * r2)); pair F = (0, -sqrt((r1 + r2) * (r1 + r2) - 4 * r2 * r2)); pair G = (r2 * O + r1 * E) / (r1 + r2); pair H = (r2 * O + r1 * F) / (r1 + r2); draw(circle(E, r2)); draw(circle((-2 * r2, -sqrt((r1 + r2) * (r1 + r2) - 4 * r2 * r2)), r2)); draw(O--E, dashed); draw(F--E, dashed); draw(G--H, dashed); label("$O$", O, SW); label("$A$", A, SW); label("$B$", B, NW); label("$C$", C, NW); label("$D$", D, SW); label("$E_o$", E, NE); label("$F_o$", F, SW); label("$G_o$", G, S); label("$H_o$", H, W); label("$r_o$", 0.5 * H + 0.5 * G, NE); label("$3$", 0.5 * E + 0.5 * G, NE); label("$11$", 0.5 * O + 0.5 * G, NE); [/asy]
For both graphs, point $O$ is the center of sphere $S$ , and points $A$ and $B$ are the intersections of the sphere and the axis. Point $E$ (ignoring the subscripts) is one of the circle centers of the intersection of torus $T$ with section $\mathcal{P}$ . Point $G$ (again, ignoring the subscripts) is one of the tangents between the torus $T$ and sphere $S$ on section $\mathcal{P}$ $EF\bot CD$ $HG\bot CD$
And then, we can start our calculation.
In both cases, we know $\Delta OEF\sim \Delta OGH\Longrightarrow \frac{EF}{OE} =\frac{GH}{OG}$
Hence, in the case of internal tangent, $\frac{E_iF_i}{OE_i} =\frac{G_iH_i}{OG_i}\Longrightarrow \frac{6}{11-3} =\frac{r_i}{11}\Longrightarrow r_i=\frac{33}{4}$
In the case of external tangent, $\frac{E_oF_o}{OE_o} =\frac{G_oH_o}{OG_o}\Longrightarrow \frac{6}{11+3} =\frac{r_o}{11}\Longrightarrow r_o=\frac{33}{7}$
Thereby, $r_i-r_o=\frac{33}{4}-\frac{33}{7}=\frac{99}{28}$ . And there goes the answer, $99+28=\boxed{127}$ | null | 127 |
a39b9c371894bbb2a933b8ea7a92ed09 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_9 | There is a collection of $25$ indistinguishable white chips and $25$ indistinguishable black chips. Find the number of ways to place some of these chips in the $25$ unit cells of a $5\times5$ grid such that: | The problem says "some", so not all cells must be occupied.
We start by doing casework on the column on the left. There can be 5,4,3,2, or 1 black chip. The same goes for white chips, so we will multiply by 2 at the end. There is $1$ way to select $5$ cells with black chips. Because of the 2nd condition, there can be no white, and the grid must be all black- $1$ way . There are $5$ ways to select 4 cells with black chips. We now consider the row that does not contain a black chip. The first cell must be blank, and the remaining $4$ cells have $2^4-1$ different ways( $-1$ comes from all blank). This gives us $75$ ways. Notice that for 3,2 or 1 black chips on the left there is a pattern. Once the first blank row is chosen, the rest of the blank rows must be ordered similarly. For example, with 2 black chips on the left, there will be 3 blank rows. There are 15 ways for the first row to be chosen, and the following 2 rows must have the same order. Thus, The number of ways for 3,2,and 1 black chips is $10*15$ $10*15$ $5*15$ . Adding these up, we have $1+75+150+150+75 = 451$ . Multiplying this by 2, we get $\boxed{902}$ .
~westwoodmonster | null | 902 |
a39b9c371894bbb2a933b8ea7a92ed09 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_9 | There is a collection of $25$ indistinguishable white chips and $25$ indistinguishable black chips. Find the number of ways to place some of these chips in the $25$ unit cells of a $5\times5$ grid such that: | Note that the answer is equivalent to the number of ways to choose rows and columns that the white chips occupy, as once those are chosen, there is only one way to place the chips, and every way to place the chips corresponds to a set of rows and columns occupied by the white pieces.
If the white pieces occupy none of the rows, then because they don't appear on the board, they will not occupy any of the columns. Similar logic can be applied to show that if white pieces occupy all of the rows, they will also occupy all of the columns.
The number of sets of rows and columns that white can occupy are $2^{5} - 2 = 30$ each, accounting for the empty and full set.
So, including the board with 25 white pieces and the board with 25 black pieces, the answer is $30^{2}+2 = \boxed{902}$ | null | 902 |
a39b9c371894bbb2a933b8ea7a92ed09 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_9 | There is a collection of $25$ indistinguishable white chips and $25$ indistinguishable black chips. Find the number of ways to place some of these chips in the $25$ unit cells of a $5\times5$ grid such that: | Case 1: All chips on the grid have the same color.
In this case, all cells are occupied with chips with the same color.
Therefore, the number of configurations in this case is 2.
Case 2: Both black and white chips are on the grid.
Observation 1: Each colored chips must occupy at least one column and one row.
This is because, for each given color, there must be at least one chip. Therefore, all chips placed in the cells that are in the same row or the same column with this given chip must have the same color with this chip.
Observation 2: Each colored chips occupy at most 4 rows and 4 columns.
This directly follows from Observation 1.
Observation 3: For each color, if all chips in this color occupy columns with $x$ -coordinates $\left\{ x_1, \cdots, x_m \right\}$ and rows with $y$ -coordinates $\left\{ y_1, \cdots, y_n \right\}$ , then every cell $\left( x, y \right)$ with $x \in \left\{ x_1, \cdots , x_m \right\}$ and $y \in \left\{ y_1, \cdots , y_n \right\}$ is occupied by a chip with the same color.
This is because, if there is any cell in this region occupied by a chip with a different color, it violates Condition 2.
If there is any cell in this region that is empty, then it violates Condition 3.
Observation 4: For each color, if all chips in this color occupy columns with $x$ -coordinates $\left\{ x_1, \cdots, x_m \right\}$ and rows with $y$ -coordinates $\left\{ y_1, \cdots, y_n \right\}$ , then every cell $\left( x, y \right)$ with $x \notin \left\{ x_1, \cdots , x_m \right\}$ and $y \in \left\{ y_1, \cdots , y_n \right\}$ , or $x \in \left\{ x_1, \cdots , x_m \right\}$ and $y \notin \left\{ y_1, \cdots , y_n \right\}$ is empty.
This is because, if there is any cell in this region occupied by a chip with a different color, it violates Condition 2.
Observation 5: For each color, if all chips in this color occupy columns with $x$ -coordinates $\left\{ x_1, \cdots, x_m \right\}$ and rows with $y$ -coordinates $\left\{ y_1, \cdots, y_n \right\}$ , then every cell $\left( x, y \right)$ with $x \notin \left\{ x_1, \cdots , x_m \right\}$ and $y \notin \left\{ y_1, \cdots , y_n \right\}$ is occupied by chips with the different color.
This follows from Condition 3.
By using the above observations, the number of feasible configurations in this case is given by
\begin{align*}
\sum_{n=1}^4 \sum_{m=1}^4 \binom{5}{n} \binom{5}{m}
& = \left( \sum_{n=1}^4 \binom{5}{n} \right)
\left( \sum_{m=1}^4 \binom{5}{m} \right) \\
& = \left( 2^5 - 2 \right)^2 \\
& = 900 .
\end{align*}
Putting all cases together, the total number of feasible configurations is $2 + 900 = \boxed{902}$ | null | 902 |
6af406314ab48fb3aded5aae38b5a549 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_10 | Let $\triangle ABC$ have circumcenter $O$ and incenter $I$ with $\overline{IA}\perp\overline{OI}$ , circumradius $13$ , and inradius $6$ . Find $AB\cdot AC$ | By Euler's formula $OI^{2}=R(R-2r)$ , we have $OI^{2}=13(13-12)=13$ . Thus, by the Pythagorean theorem, $AI^{2}=13^{2}-13=156$ . Let $AI\cap(ABC)=M$ ; notice $\triangle AOM$ is isosceles and $\overline{OI}\perp\overline{AM}$ which is enough to imply that $I$ is the midpoint of $\overline{AM}$ , and $M$ itself is the midpoint of $II_{a}$ where $I_{a}$ is the $A$ -excenter of $\triangle ABC$ . Therefore, $AI=IM=MI_{a}=\sqrt{156}$ and \[AB\cdot AC=AI\cdot AI_{a}=3\cdot AI^{2}=\boxed{468}.\] | null | 468 |
6af406314ab48fb3aded5aae38b5a549 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_10 | Let $\triangle ABC$ have circumcenter $O$ and incenter $I$ with $\overline{IA}\perp\overline{OI}$ , circumradius $13$ , and inradius $6$ . Find $AB\cdot AC$ | Denote $AB=a, AC=b, BC=c$ . By the given condition, $\frac{abc}{4A}=13; \frac{2A}{a+b+c}=6$ , where $A$ is the area of $\triangle{ABC}$
Moreover, since $OI\bot AI$ , the second intersection of the line $AI$ and $(ABC)$ is the reflection of $A$ about $I$ , denote that as $D$ . By the incenter-excenter lemma, $DI=BD=CD=\frac{AD}{2}\implies BD(a+b)=2BD\cdot c\implies a+b=2c$
Thus, we have $\frac{2A}{a+b+c}=\frac{2A}{3c}=6, A=9c$ . Now, we have $\frac{abc}{4A}=\frac{abc}{36c}=\frac{ab}{36}=13\implies ab=\boxed{468}$ | null | 468 |
6af406314ab48fb3aded5aae38b5a549 | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_10 | Let $\triangle ABC$ have circumcenter $O$ and incenter $I$ with $\overline{IA}\perp\overline{OI}$ , circumradius $13$ , and inradius $6$ . Find $AB\cdot AC$ | Denote by $R$ and $r$ the circumradius and inradius, respectively.
First, we have \[ r = 4 R \sin \frac{A}{2} \sin \frac{B}{2} \sin \frac{C}{2} \hspace{1cm} (1) \]
Second, because $AI \perp IO$ ,
\begin{align*}
AI & = AO \cos \angle IAO \\
& = AO \cos \left( 90^\circ - C - \frac{A}{2} \right) \\
& = AO \sin \left( C + \frac{A}{2} \right) \\
& = R \sin \left( C + \frac{180^\circ - B - C}{2} \right) \\
& = R \cos \frac{B - C}{2} .
\end{align*}
Thus,
\begin{align*}
r & = AI \sin \frac{A}{2} \\
& = R \sin \frac{A}{2} \cos \frac{B-C}{2} \hspace{1cm} (2)
\end{align*}
Taking $(1) - (2)$ , we get
\[
4 \sin \frac{B}{2} \sin \frac{C}{2} = \cos \frac{B-C}{2} .
\]
We have
\begin{align*}
2 \sin \frac{B}{2} \sin \frac{C}{2}
& = - \cos \frac{B+C}{2} + \cos \frac{B-C}{2} .
\end{align*}
Plugging this into the above equation, we get
\[
\cos \frac{B-C}{2} = 2 \cos \frac{B+C}{2} . \hspace{1cm} (3)
\]
Now, we analyze Equation (2). We have
\begin{align*}
\frac{r}{R} & = \sin \frac{A}{2} \cos \frac{B-C}{2} \\
& = \sin \frac{180^\circ - B - C}{2} \cos \frac{B-C}{2} \\
& = \cos \frac{B+C}{2} \cos \frac{B-C}{2} \hspace{1cm} (4)
\end{align*}
Solving Equations (3) and (4), we get
\[
\cos \frac{B+C}{2} = \sqrt{\frac{r}{2R}}, \hspace{1cm}
\cos \frac{B-C}{2} = \sqrt{\frac{2r}{R}} . \hspace{1cm} (5)
\]
Now, we compute $AB \cdot AC$ . We have
\begin{align*}
AB \cdot AC & = 2R \sin C \cdot 2R \sin B \\
& = 2 R^2 \left( - \cos \left( B + C \right) + \cos \left( B - C \right) \right) \\
& = 2 R^2 \left( - \left( 2 \left( \cos \frac{B+C}{2} \right)^2 - 1 \right)
+ \left( 2 \left( \cos \frac{B-C}{2} \right)^2 - 1 \right) \right) \\
& = 6 R r \\
& = \boxed{468}
\end{align*}
where the first equality follows from the law of sines, the fourth equality follows from (5). | null | 468 |
ac6f5dcef79f32e2da8995b725b2002d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_11 | Find the number of triples of nonnegative integers \((a,b,c)\) satisfying \(a + b + c = 300\) and
\begin{equation*}
a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.
\end{equation*} | $ab(a+b)+bc(b+c)+ac(a+c)=300(ab+bc+ac)-3abc=6000000, 100(ab+bc+ac)-abc=2000000$
Note $(100-a)(100-b)(100-c)=1000000-10000(a+b+c)+100(ab+bc+ac)-abc=0$ . Thus, $a/b/c=100$ . There are $201$ cases for each but we need to subtract $2$ for $(100,100,100)$ . The answer is $\boxed{601}$ | null | 601 |
ac6f5dcef79f32e2da8995b725b2002d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_11 | Find the number of triples of nonnegative integers \((a,b,c)\) satisfying \(a + b + c = 300\) and
\begin{equation*}
a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.
\end{equation*} | We have
\begin{align*}
& a^2 b + a^2 c + b^2 a + b^2 c + c^2 a + c^2 b \\
& = ab \left( a + b \right) + bc \left( b + c \right) + ca \left( c + a \right) \\
& = ab \left( 300 - c \right) + bc \left( 300 - a \right) + ca \left( 300 - b \right) \\
& = 300 \left( ab + bc + ca \right) - 3 abc \\
& = -3 \left(
\left( a - 100 \right) \left( b - 100 \right) \left( c - 100 \right)
- 10^4 \left( a + b + c \right) + 10^6
\right) \\
& = -3 \left(
\left( a - 100 \right) \left( b - 100 \right) \left( c - 100 \right)
- 2 \cdot 10^6
\right) \\
& = 6 \cdot 10^6 .
\end{align*}
The first and the fifth equalities follow from the condition that $a+b+c = 300$
Therefore,
\[
\left( a - 100 \right) \left( b - 100 \right) \left( c - 100 \right) = 0 .
\]
Case 1: Exactly one out of $a - 100$ $b - 100$ $c - 100$ is equal to 0.
Step 1: We choose which term is equal to 0. The number ways is 3.
Step 2: For the other two terms that are not 0, we count the number of feasible solutions.
W.L.O.G, we assume we choose $a - 100 = 0$ in Step 1. In this step, we determine $b$ and $c$
Recall $a + b + c = 300$ . Thus, $b + c = 200$ .
Because $b$ and $c$ are nonnegative integers and $b - 100 \neq 0$ and $c - 100 \neq 0$ , the number of solutions is 200.
Following from the rule of product, the number of solutions in this case is $3 \cdot 200 = 600$
Case 2: At least two out of $a - 100$ $b - 100$ $c - 100$ are equal to 0.
Because $a + b + c = 300$ , we must have $a = b = c = 100$
Therefore, the number of solutions in this case is 1.
Putting all cases together, the total number of solutions is $600 + 1 = \boxed{601}$ | null | 601 |
ac6f5dcef79f32e2da8995b725b2002d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_11 | Find the number of triples of nonnegative integers \((a,b,c)\) satisfying \(a + b + c = 300\) and
\begin{equation*}
a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.
\end{equation*} | We will use Vieta's formulas to solve this problem. We assume $a + b + c = 300$ $ab + bc + ca = m$ , and $abc = n$ . Thus $a$ $b$ $c$ are the three roots of a cubic polynomial $f(x)$
We note that $300m = (a + b + c)(ab + bc + ca)=\sum_{cyc} a^2b + 3abc = 6000000 + 3n$ , which simplifies to $100m - 2000000 = n$
Our polynomial $f(x)$ is therefore equal to $x^3 - 300x^2 + mx - (100m - 2000000)$ . Note that $f(100) = 0$ , and by polynomial division we obtain $f(x) = (x - 100)(x^2 - 200x - (m-20000))$
We now notice that the solutions to the quadratic equation above are $x = 100 \pm \frac{\sqrt{200^2 - 4(m - 20000)}}{2} = 100 \pm \sqrt{90000 - 4m}$ , and that by changing the value of $m$ we can let the roots of the equation be any pair of two integers which sum to $200$ . Thus any triple in the form $(100, 100 - x, 100 + x)$ where $x$ is an integer between $0$ and $100$ satisfies the conditions.
Now to count the possible solutions, we note that when $x \ne 100$ , the three roots are distinct; thus there are $3! = 6$ ways to order the three roots. As we can choose $x$ from $0$ to $99$ , there are $100 \cdot 3! = 600$ triples in this case. When $x = 100$ , all three roots are equal to $100$ , and there is only one triple in this case.
In total, there are thus $\boxed{601}$ distinct triples. | null | 601 |
ac6f5dcef79f32e2da8995b725b2002d | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_11 | Find the number of triples of nonnegative integers \((a,b,c)\) satisfying \(a + b + c = 300\) and
\begin{equation*}
a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.
\end{equation*} | Let's define $a=100+x$ $b=100+y$ $c=100+z$ . Then we have $x+y+z=0$ and $6000000 = \sum a^2(b+c)$
$= \sum (100+x)^2(200-x) = \sum (10000+200x+x^2)(200-x) = \sum (20000 - 10000 x + x(40000-x^2))$
$= \sum (20000 + 30000 x -x^3) = 6000000 - \sum x^3$ , so we get $x^3 + y^3 + z^3 = 0$ . Then from $x+y+z = 0$ , we can find $0 = x^3+y^3+z^3 = x^3+y^3-(x+y)^3 = 3xyz$ , which means that one of $a$ $b$ $c$ must be 0. There are 201 solutions for each of $a=0$ $b=0$ and $c=0$ , and subtract the overcounting of 2 for solution $(200, 200, 200)$ , the final result is $201 \times 3 - 2 = \boxed{601}$ | null | 601 |
9e99ff9c7bc7d5310d3ae996d4e1d80f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_12 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point \(C\) on \(\overline{AB}\), distinct from \(A\) and \(B\), that does not belong to any segment from \(\mathcal{F}\) other than \(\overline{AB}\). Then \(OC^2=\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p+q\). | By Furaken [asy] pair O=(0,0); pair X=(1,0); pair Y=(0,1); pair A=(0.5,0); pair B=(0,sin(pi/3)); dot(O); dot(X); dot(Y); dot(A); dot(B); draw(X--O--Y); draw(A--B); label("$B'$", B, W); label("$A'$", A, S); label("$O$", O, SW); pair C=(1/8,3*sqrt(3)/8); dot(C); pair D=(1/8,0); dot(D); pair E=(0,3*sqrt(3)/8); dot(E); label("$C$", C, NE); label("$D$", D, S); label("$E$", E, W); draw(D--C--E); [/asy]
Let $C = (\tfrac18,\tfrac{3\sqrt3}8)$ This is sus, furaken randomly guessed C and proceeded to prove it works Draw a line through $C$ intersecting the $x$ -axis at $A'$ and the $y$ -axis at $B'$ . We shall show that $A'B' \ge 1$ , and that equality only holds when $A'=A$ and $B'=B$
Let $\theta = \angle OA'C$ . Draw $CD$ perpendicular to the $x$ -axis and $CE$ perpendicular to the $y$ -axis as shown in the diagram. Then \[8A'B' = 8CA' + 8CB' = \frac{3\sqrt3}{\sin\theta} + \frac{1}{\cos\theta}\] By some inequality (I forgot its name), \[\left(\frac{3\sqrt3}{\sin\theta} + \frac{1}{\cos\theta}\right) \cdot \left(\frac{3\sqrt3}{\sin\theta} + \frac{1}{\cos\theta}\right) \cdot (\sin^2\theta + \cos^2\theta) \ge (3+1)^3 = 64\] We know that $\sin^2\theta + \cos^2\theta = 1$ . Thus $\tfrac{3\sqrt3}{\sin\theta} + \tfrac{1}{\cos\theta} \ge 8$ . Equality holds if and only if \[\frac{3\sqrt3}{\sin\theta} : \frac{1}{\cos\theta} = \frac{3\sqrt3}{\sin\theta} : \frac{1}{\cos\theta} = \sin^2\theta : \cos^2\theta\] which occurs when $\theta=\tfrac\pi3$ . Guess what, $\angle OAB$ happens to be $\tfrac\pi3$ , thus $A'=A$ and $B'=B$ . Thus, $AB$ is the only segment in $\mathcal{F}$ that passes through $C$ . Finally, we calculate $OC^2 = \tfrac1{64} + \tfrac{27}{64} = \tfrac7{16}$ , and the answer is $\boxed{023}$ .
~Furaken | null | 023 |
9e99ff9c7bc7d5310d3ae996d4e1d80f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_12 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point \(C\) on \(\overline{AB}\), distinct from \(A\) and \(B\), that does not belong to any segment from \(\mathcal{F}\) other than \(\overline{AB}\). Then \(OC^2=\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p+q\). | $y=-(\tan \theta) x+\sin \theta=-\sqrt{3}x+\frac{\sqrt{3}}{2}, x=\frac{\sqrt{3}-2\sin \theta}{2\sqrt{3}-2\tan \theta}$
Now, we want to find $\lim_{\theta\to\frac{\pi}{3}}\frac{\sqrt{3}-2\sin \theta}{2\sqrt{3}-2\tan \theta}$ . By L'Hôpital's rule, we get $\lim_{\theta\to\frac{\pi}{3}}\frac{\sqrt{3}-2\sin \theta}{2\sqrt{3}-2\tan \theta}=\lim_{\theta\to\frac{\pi}{3}}cos^3{x}=\frac{1}{8}$ . This means that $y=\frac{3\sqrt{3}}{8}\implies OC^2=\frac{7}{16}$ , so we get $\boxed{023}$ | null | 023 |
9e99ff9c7bc7d5310d3ae996d4e1d80f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_12 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point \(C\) on \(\overline{AB}\), distinct from \(A\) and \(B\), that does not belong to any segment from \(\mathcal{F}\) other than \(\overline{AB}\). Then \(OC^2=\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p+q\). | The equation of line $AB$ is \[ y = \frac{\sqrt{3}}{2} x - \sqrt{3} x. \hspace{1cm} (1) \]
The position of line $PQ$ can be characterized by $\angle QPO$ , denoted as $\theta$ .
Thus, the equation of line $PQ$ is
\[ y = \sin \theta - \tan \theta \cdot x . \hspace{1cm} (2) \]
Solving (1) and (2), the $x$ -coordinate of the intersecting point of lines $AB$ and $PQ$ satisfies the following equation:
\[ \frac{\frac{\sqrt{3}}{2} - \sqrt{3} x}{\sin \theta} + \frac{x}{\cos \theta} = 1 . \hspace{1cm} (1) \]
We denote the L.H.S. as $f \left( \theta; x \right)$
We observe that $f \left( 60^\circ ; x \right) = 1$ for all $x$ .
Therefore, the point $C$ that this problem asks us to find can be equivalently stated in the following way:
We interpret Equation (1) as a parameterized equation that $x$ is a tuning parameter and $\theta$ is a variable that shall be solved and expressed in terms of $x$ .
In Equation (1), there exists a unique $x \in \left( 0, 1 \right)$ , denoted as $x_C$ $x$ -coordinate of point $C$ ), such that the only solution is $\theta = 60^\circ$ . For all other $x \in \left( 0, 1 \right) \backslash \{ x_C \}$ , there are more than one solutions with one solution $\theta = 60^\circ$ and at least another solution.
Given that function $f \left( \theta ; x \right)$ is differentiable, the above condition is equivalent to the first-order-condition \[ \frac{\partial f \left( \theta ; x_C \right) }{\partial \theta} \bigg|_{\theta = 60^\circ} = 0 . \]
Calculating derivatives in this equation, we get \[ - \left( \frac{\sqrt{3}}{2} - \sqrt{3} x_C \right) \frac{\cos 60^\circ}{\sin^2 60^\circ} + x_C \frac{\sin 60^\circ}{\cos^2 60^\circ} = 0. \]
By solving this equation, we get \[ x_C = \frac{1}{8} . \]
Plugging this into Equation (1), we get the $y$ -coordinate of point $C$ \[ y_C = \frac{3 \sqrt{3}}{8} . \]
Therefore,
\begin{align*}
OC^2 & = x_C^2 + y_C^2 \\
& = \frac{7}{16} .
\end{align*}
Therefore, the answer is $7 + 16 = \boxed{23}$ | null | 23 |
9e99ff9c7bc7d5310d3ae996d4e1d80f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_12 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point \(C\) on \(\overline{AB}\), distinct from \(A\) and \(B\), that does not belong to any segment from \(\mathcal{F}\) other than \(\overline{AB}\). Then \(OC^2=\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p+q\). | Let $s$ be a segment in $\mathcal{F}$ with x-intercept $a$ and y-intercept $b$ . We can write $s$ as
\begin{align*}
\frac{x}{a} + \frac{y}{b} &= 1 \\
y &= b(1 - \frac{x}{a}).
\end{align*}
Let the unique point in the first quadrant $(x, y)$ lie on $s$ and no other segment in $\mathcal{F}$ . We can find $x$ by solving \[b(1 - \frac{x}{a}) = (b + db)(1 - \frac{x}{a + da})\] and taking the limit as $da, db \to 0$ . Since $s$ has length $1$ $a^2 + b^2 = 1^2$ by the Pythagorean theorem. Solving this for $db$ , we get
\begin{align*}
a^2 + b^2 &= 1 \\
b^2 &= 1 - a^2 \\
\frac{db^2}{da} &= \frac{d(1 - a^2)}{da} \\
2a\frac{db}{da} &= -2a \\
db &= -\frac{a}{b}da.
\end{align*}
After we substitute $db = -\frac{a}{b}da$ , the equation for $x$ becomes \[b(1 - \frac{x}{a}) = (b -\frac{a}{b} da)(1 - \frac{x}{a + da}).\]
In $\overline{AB}$ $a = \frac{1}{2}$ and $b = \frac{\sqrt{3}}{2}$ . To find the x-coordinate of $C$ , we substitute these into the equation for $x$ and get
\begin{align*}
\frac{\sqrt{3}}{2}(1 - \frac{x}{\frac{1}{2}}) &= (\frac{\sqrt{3}}{2} - \frac{\frac{1}{2}}{\frac{\sqrt{3}}{2}} da)(1 - \frac{x}{\frac{1}{2} + da}) \\
\frac{\sqrt{3}}{2}(1 - 2x) &= (\frac{\sqrt{3}}{2} - \frac{da}{\sqrt{3}})(1 - \frac{x}{\frac{1 + 2da}{2}}) \\
\frac{\sqrt{3}}{2} - \sqrt{3}x &= \frac{3 - 2da}{2\sqrt{3}}(1 - \frac{2x}{1 + 2da}) \\
\frac{\sqrt{3}}{2} - \sqrt{3}x &= \frac{3 - 2da}{2\sqrt{3}} \cdot \frac{1 + 2da - 2x}{1 + 2da} \\
\frac{\sqrt{3}}{2} - \sqrt{3}x &= \frac{3 + 6da - 6x - 2da - 4da^2 + 4xda}{2\sqrt{3} + 4\sqrt{3}da} \\
(\frac{\sqrt{3}}{2} - \sqrt{3}x)(2\sqrt{3} + 4\sqrt{3}da) &= 3 + 6da - 6x - 2da - 4da^2 + 4xda \\
3 + 6da - 6x - 12xda &= 3 + 4da - 6x - 4da^2 + 4xda \\
2da &= -4da^2 + 16xda \\
16xda &= 2da + 4da^2 \\
x &= \frac{da + 2da^2}{8da}.
\end{align*}
We take the limit as $da \to 0$ to get \[x = \lim_{da \to 0} \frac{da + 2da^2}{8da} = \lim_{da \to 0} \frac{1 + 2da}{8} = \frac{1}{8}.\] We substitute $x = \frac{1}{8}$ into the equation for $\overline{AB}$ to find the y-coordinate of $C$ \[y = b(1 - \frac{x}{a}) = \frac{\sqrt{3}}{2}(1 - \frac{\frac{1}{8}}{\frac{1}{2}}) = \frac{3\sqrt{3}}{8}.\] The problem asks for \[OC^2 = x^2 + y^2 = (\frac{1}{8})^2 + (\frac{3\sqrt{3}}{8})^2 = \frac{7}{16} = \frac{p}{q},\] so $p + q = 7 + 16 = \boxed{023}$ | null | 023 |
9e99ff9c7bc7d5310d3ae996d4e1d80f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_12 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point \(C\) on \(\overline{AB}\), distinct from \(A\) and \(B\), that does not belong to any segment from \(\mathcal{F}\) other than \(\overline{AB}\). Then \(OC^2=\tfrac{p}{q}\), where \(p\) and \(q\) are relatively prime positive integers. Find \(p+q\). | [asy] pair O=(0,0); pair X=(1,0); pair Y=(0,1); pair A=(0.5,0); pair B=(0,sin(pi/3)); pair A1=(0.6,0); pair B1=(0,0.8); pair A2=(0.575,0.04); pair B2=(0.03,0.816); dot(O); dot(X); dot(Y); dot(A); dot(B); dot(A1); dot(B1); dot(A2); dot(B2); draw(X--O--Y); draw(A--B); draw(A1--B1); draw(A--A2); draw(B1--B2); label("$B$", B, W); label("$A$", A, S); label("$B_1$", B1, SW); label("$A_1$", A1, S); label("$B_2$", B2, E); label("$A_2$", A2, NE); label("$O$", O, SW); pair C=(0.18,0.56); label("$C$", C, E); dot(C); [/asy]
Let's move a little bit from $A$ to $A_1$ , then $B$ must move to $B_1$ to keep $A_1B_1 = 1$ $AB$ intersects with $A_1B_1$ at $C$ . Pick points $A_2$ and $B_2$ on $CA_1$ and $CB$ such that $CA_2 = CA$ $CB_2 = CB_1$ , we have $A_1A_2 = BB_2$ . Since $AA_1$ is very small, $\angle CA_1A \approx 60^\circ$ $\angle CBB_1 \approx 30^\circ$ , so $AA_2\approx \sqrt{3}A_1A_2$ $B_1B_2 \approx \frac{1}{\sqrt{3}}BB_2$ , by similarity, $\frac{CA}{CB} \approx \frac{CA}{CB_2} = \frac{AA_2}{B_1B_2} = \frac{\sqrt{3}A_1A_2}{\frac{1}{\sqrt{3}}BB_2} = 3$ . So the coordinates of $C$ is $\left(\frac{1}{8}, \frac{3\sqrt{3}}{8}\right)$
so $OC^2 = \frac{1}{64} + \frac{27}{64} = \frac{7}{16}$ , the answer is $\boxed{023}$ | null | 023 |
1fb9ad12627487ae94b90b34ea4fe08f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_13 | Let $\omega\neq 1$ be a 13th root of unity. Find the remainder when \[\prod_{k=0}^{12}(2-2\omega^k+\omega^{2k})\] is divided by 1000. | \[\prod_{k=0}^{12} \left(2- 2\omega^k + \omega^{2k}\right) = \prod_{k=0}^{12} \left((1 - \omega^k)^2 + 1\right) = \prod_{k=0}^{12} \left((1 + i) - \omega^k)((1 - i) - \omega^k\right)\]
Now, we consider the polynomial $x^{13} - 1$ whose roots are the 13th roots of unity. Taking our rewritten product from $0$ to $12$ , we see that both instances of $\omega^k$ cycle through each of the 13th roots. Then, our answer is:
\[((1 + i)^{13} - 1)(1 - i)^{13} - 1)\]
\[= (-64(1 + i) - 1)(-64(1 - i) - 1)\]
\[= (65 + 64i)(65 - 64i)\]
\[= 65^2 + 64^2\]
\[= 8\boxed{321}\] | null | 321 |
1fb9ad12627487ae94b90b34ea4fe08f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_13 | Let $\omega\neq 1$ be a 13th root of unity. Find the remainder when \[\prod_{k=0}^{12}(2-2\omega^k+\omega^{2k})\] is divided by 1000. | To find $\prod_{k=0}^{12} (2 - 2w^k + w^{2k})$ , where $w\neq1$ and $w^{13}=1$ , rewrite this is as
$(r-w)(s-w)(r-w^2)(s-w^2)...(r-w^{12})(s-w^{12})$ where $r$ and $s$ are the roots of the quadratic $x^2-2x+2=0$
Grouping the $r$ 's and $s$ 's results in $\frac{r^{13}-1}{r-1} \cdot\frac{s^{13}-1}{s-1}$
the denomiator $(r-1)(s-1)=1$ by vietas.
the numerator $(rs)^{13} - (r^{13} + s^{13}) + 1 = 2^{13} - (-128) + 1= 8321$ by newtons sums
so the answer is $\boxed{321}$ | null | 321 |
1fb9ad12627487ae94b90b34ea4fe08f | https://artofproblemsolving.com/wiki/index.php/2024_AIME_II_Problems/Problem_13 | Let $\omega\neq 1$ be a 13th root of unity. Find the remainder when \[\prod_{k=0}^{12}(2-2\omega^k+\omega^{2k})\] is divided by 1000. | Denote $r_j = e^{\frac{i 2 \pi j}{13}}$ for $j \in \left\{ 0, 1, \cdots , 12 \right\}$
Thus, for $\omega \neq 1$ $\left( \omega^0, \omega^1, \cdots, \omega^{12} \right)$ is a permutation of $\left( r_0, r_1, \cdots, r_{12} \right)$
We have
\begin{align*}\
\Pi_{k = 0}^{12} \left( 2 - 2 \omega^k + \omega^{2k} \right)
& = \Pi_{k=0}^{12} \left( 1 + i - \omega^k \right)
\left( 1 - i - \omega^k \right) \\
& = \Pi_{k=0}^{12} \left( \sqrt{2} e^{i \frac{\pi}{4}} - \omega^k \right)
\left( \sqrt{2} e^{-i \frac{\pi}{4}} - \omega^k \right) \\
& = \Pi_{k=0}^{12} \left( \sqrt{2} e^{i \frac{\pi}{4}} - r_k \right)
\left( \sqrt{2} e^{-i \frac{\pi}{4}} - r_k \right) \\
& = \left(
\Pi_{k=0}^{12} \left( \sqrt{2} e^{i \frac{\pi}{4}} - r_k \right)
\right)
\left(
\Pi_{k=0}^{12} \left( \sqrt{2} e^{-i \frac{\pi}{4}} - r_k \right)
\right) . \hspace{1cm} (1)
\end{align*}
The third equality follows from the above permutation property.
Note that $r_0, r_1, \cdots , r_{12}$ are all zeros of the polynomial $z^{13} - 1$ .
Thus, \[ z^{13} - 1 = \Pi_{k=0}^{12} \left( z - r_k \right) . \]
Plugging this into Equation (1), we get
\begin{align*}
(1)
& = \left( \left( \sqrt{2} e^{i \frac{\pi}{4}} \right)^{13} - 1 \right)
\left( \left( \sqrt{2} e^{-i \frac{\pi}{4}} \right)^{13} - 1 \right) \\
& = \left( - 2^{13/2} e^{i \frac{\pi}{4}} - 1 \right)
\left( - 2^{13/2} e^{-i \frac{\pi}{4}} - 1 \right) \\
& = 2^{13} + 1 + 2^{13/2} \cdot 2 \cos \frac{\pi}{4} \\
& = 2^{13} + 1 + 2^7 \\
& = 8321 .
\end{align*}
Therefore, the answer is $\boxed{321}$ | null | 321 |