id int64 1 7.14k | link stringlengths 75 84 | no int64 1 14 | problem stringlengths 14 5.33k | solution stringlengths 21 6.43k | answer int64 0 999 |
|---|---|---|---|---|---|
6,501 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_12 | 3 | The members of a distinguished committee were choosing a president, and each member gave one vote to one of the 27 candidates. For each candidate, the exact percentage of votes the candidate got was smaller by at least 1 than the number of votes for that candidate. What was the smallest possible number of members of ... | Let $n$ be the total number of people in the committee, and $a_i$ be the number of votes candidate $i$ gets where $1 \leq i \leq 27$ . The problem tells us that \[\frac{100a_i}{n} \leq a_i - 1 \implies 100a_i \leq na_i - n \implies a_i \geq \frac{n}{n-100}.\] Therefore, \[\sum^{27}_{i=1} a_i = n \geq \sum^{27}_{i=1} \... | 134 |
6,502 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_13 | 1 | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are... | Let $P_n$ represent the probability that the bug is at its starting vertex after $n$ moves. If the bug is on its starting vertex after $n$ moves, then it must be not on its starting vertex after $n-1$ moves. At this point it has $\frac{1}{2}$ chance of reaching the starting vertex in the next move. Thus $P_n=\frac{1}{2... | 683 |
6,503 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_13 | 2 | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are... | Consider there to be a clockwise and a counterclockwise direction around the triangle. Then, in order for the ant to return to the original vertex, the net number of clockwise steps must be a multiple of 3, i.e., $\#CW - \#CCW \equiv 0 \pmod{3}$ . Since $\#CW + \#CCW = 10$ , it is only possible that $(\#CW,\, \#CCW) ... | 683 |
6,504 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_13 | 3 | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are... | Label the vertices of the triangle $A,B,C$ with the ant starting at $A$ . We will make a table of the number of ways to get to $A,B,C$ in $n$ moves $n\leq10$ . The values of the table are calculated from the fact that the number of ways from a vertex say $A$ in $n$ steps equals the number of ways to get to $B$ in $n-1$... | 683 |
6,505 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_13 | 4 | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are... | As a note, do NOT do this on the exam as it will eat up your time, but feel free to experiment around with this if you have a good enough understanding of linear algebra. This writeup will be extremely lengthy because I am assuming just very basic concepts of linear algebra. The concepts here extend to higher levels of... | 683 |
6,506 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_13 | 5 | A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are... | This method does not rigorously get the answer, but it works. As the bug makes more and more moves, the probability of it going back to the origin approaches closer and closer to 1/3. Therefore, after 10 moves, the probability gets close to $341.33/1024$ . We can either round up or down. If we round down, we see $341/1... | 683 |
6,507 | https://artofproblemsolving.com/wiki/index.php/2003_AIME_II_Problems/Problem_14 | 2 | Let $A = (0,0)$ and $B = (b,2)$ be points on the coordinate plane. Let $ABCDEF$ be a convex equilateral hexagon such that $\angle FAB = 120^\circ,$ $\overline{AB}\parallel \overline{DE},$ $\overline{BC}\parallel \overline{EF,}$ $\overline{CD}\parallel \overline{FA},$ and the y-coordinates of its vertices are distinct e... | [asy] size(200); draw((0,0)--(10/sqrt(3),2)--(18/sqrt(3),6)--(10/sqrt(3),10)--(0,8)--(-8/sqrt(3),4)--cycle); dot((0,0));dot((10/sqrt(3),2));dot((18/sqrt(3),6));dot((10/sqrt(3),10));dot((0,8));dot((-8/sqrt(3),4)); label("$A (0,0)$",(0,0),S);label("$B (b,2)$",(10/sqrt(3),2),SE);label("$C$",(18/sqrt(3),6),E);label("$D$",(... | 51 |
6,508 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_2 | 1 | The diagram shows twenty congruent circles arranged in three rows and enclosed in a rectangle. The circles are tangent to one another and to the sides of the rectangle as shown in the diagram. The ratio of the longer dimension of the rectangle to the shorter dimension can be written as $\dfrac{1}{2}(\sqrt{p}-q)$ where ... | Let the radius of the circles be $r$ . The longer dimension of the rectangle can be written as $14r$ , and by the Pythagorean Theorem , we find that the shorter dimension is $2r\left(\sqrt{3}+1\right)$
Therefore, $\frac{14r}{2r\left(\sqrt{3}+1\right)}= \frac{7}{\sqrt{3} + 1} \cdot \left[\frac{\sqrt{3}-1}{\sqrt{3}-1}\ri... | 154 |
6,509 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_2 | 2 | The diagram shows twenty congruent circles arranged in three rows and enclosed in a rectangle. The circles are tangent to one another and to the sides of the rectangle as shown in the diagram. The ratio of the longer dimension of the rectangle to the shorter dimension can be written as $\dfrac{1}{2}(\sqrt{p}-q)$ where ... | Since we only care about the ratio between the longer side and shorter side, we can set the longer side to $14$ . So, this means that each of the radii is $1$ . Now, we connect the radii of three circles such that they form an equilateral triangle with side length 4. Obviously, the height this triangle is $2\sqrt{3}$ ,... | 154 |
6,510 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_5 | 1 | Let $A_1,A_2,A_3,\cdots,A_{12}$ be the vertices of a regular dodecagon. How many distinct squares in the plane of the dodecagon have at least two vertices in the set $\{A_1,A_2,A_3,\cdots,A_{12}\} ?$ | Proceed as above to initially get 198 squares (with overcounting). Then note that any square with all four vertices on the dodecagon has to have three sides "between" each vertex, giving us a total of three squares. However, we counted these squares with all four of their sides plus both of their diagonals, meaning we ... | 183 |
6,511 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_7 | 1 | The Binomial Expansion is valid for exponents that are not integers. That is, for all real numbers $x,y$ and $r$ with $|x|>|y|$
\[(x+y)^r=x^r+rx^{r-1}y+\dfrac{r(r-1)}{2}x^{r-2}y^2+\dfrac{r(r-1)(r-2)}{3!}x^{r-3}y^3 \cdots\]
What are the first three digits to the right of the decimal point in the decimal representation o... | $1^n$ will always be 1, so we can ignore those terms, and using the definition ( $2002 / 7 = 286$ ):
\[(10^{2002} + 1)^{\frac {10}7} = 10^{2860}+\dfrac{10}{7}10^{858}+\dfrac{15}{49}10^{-1144}+\cdots\]
Since the exponent of the $10$ goes down extremely fast, it suffices to consider the first few terms. Also, the $10^{28... | 428 |
6,512 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_8 | 1 | Find the smallest integer $k$ for which the conditions
(1) $a_1,a_2,a_3\cdots$ is a nondecreasing sequence of positive integers
(2) $a_n=a_{n-1}+a_{n-2}$ for all $n>2$
(3) $a_9=k$
are satisfied by more than one sequence. | From $(2)$ $a_9=$ $a_8+a_7=2a_7+a_6=3a_6+2a_5=5a_5+3a_4=8a_4+5a_3=13a_3+8a_2=21a_2+13a_1$ $=k$
Suppose that $a_1=x_0$ is the smallest possible value for $a_1$ that yields a good sequence, and $a_2=y_0$ in this sequence. So, $13x_0+21y_0=k$
Since $\gcd(13,21)=1$ , the next smallest possible value for $a_1$ that yields a... | 748 |
6,513 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_9 | 1 | Harold, Tanya, and Ulysses paint a very long picket fence.
Call the positive integer $100h+10t+u$ paintable when the triple $(h,t,u)$ of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers. | Note that it is impossible for any of $h,t,u$ to be $1$ , since then each picket will have been painted one time, and then some will be painted more than once.
$h$ cannot be $2$ , or that will result in painting the third picket twice. If $h=3$ , then $t$ may not equal anything not divisible by $3$ , and the same for $... | 757 |
6,514 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_9 | 2 | Harold, Tanya, and Ulysses paint a very long picket fence.
Call the positive integer $100h+10t+u$ paintable when the triple $(h,t,u)$ of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers. | Again, note that $h,t,u \neq 1$ . The three conditions state that no picket number $n$ may satisfy any two of the conditions: $n \equiv 1 \pmod{h},\ n \equiv 2 \pmod{t},\ n \equiv 3 \pmod{u}$ . By the Chinese Remainder Theorem , the greatest common divisor of any pair of the three numbers $\{h,t,u\}$ cannot be $1$ (sin... | 757 |
6,515 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_9 | 3 | Harold, Tanya, and Ulysses paint a very long picket fence.
Call the positive integer $100h+10t+u$ paintable when the triple $(h,t,u)$ of positive integers results in every picket being painted exactly once. Find the sum of all the paintable integers. | The three conditions state that no picket number $n$ may satisfy any two of the conditions: $n \equiv 1 \pmod{h},\ n \equiv 2 \pmod{t},\ n \equiv 3 \pmod{u}$ . Note that the smallest number, $min \{ h,t,u \},$ divides the other $2$ , and the next smallest divide the largest number, otherwise there is a common solution ... | 757 |
6,516 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_10 | 1 | In the diagram below, angle $ABC$ is a right angle. Point $D$ is on $\overline{BC}$ , and $\overline{AD}$ bisects angle $CAB$ . Points $E$ and $F$ are on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $AE=3$ and $AF=10$ . Given that $EB=9$ and $FC=27$ , find the integer closest to the area of quadrilateral... | By the Pythagorean Theorem, $BC=35$ . Letting $BD=x$ we can use the Angle Bisector Theorem on triangle $ABC$ to get $x/12=(35-x)/37$ , and solving gives $BD=60/7$ and $DC=185/7$
The area of triangle $AGF$ is $10/3$ that of triangle $AEG$ , since they share a common side and angle, so the area of triangle $AGF$ is $10/1... | 148 |
6,517 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_10 | 2 | In the diagram below, angle $ABC$ is a right angle. Point $D$ is on $\overline{BC}$ , and $\overline{AD}$ bisects angle $CAB$ . Points $E$ and $F$ are on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $AE=3$ and $AF=10$ . Given that $EB=9$ and $FC=27$ , find the integer closest to the area of quadrilateral... | By the Pythagorean Theorem, $BC=35$ . From now on, every number we get will be rounded to two decimal points. Using law of cosines on AEF, EF is around 9.46. Using the angle bisector theorem, GF and DC are 7.28 and (185/7), respectively. We also know the lengths of EG and BD, so a quick Stewart's Theorem for triangles ... | 148 |
6,518 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_10 | 3 | In the diagram below, angle $ABC$ is a right angle. Point $D$ is on $\overline{BC}$ , and $\overline{AD}$ bisects angle $CAB$ . Points $E$ and $F$ are on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $AE=3$ and $AF=10$ . Given that $EB=9$ and $FC=27$ , find the integer closest to the area of quadrilateral... | By the Pythagorean Theorem, $BC=35$ . By the Angle Bisector Theorem $BD = 60/7$ and $DC = 185/7$ . We can find the coordinates of F, and use that the find the equation of line EF. Then, we can find the coordinates of G. Triangle $ADC = 1110/7$ and we can find the area triangle $AGF$ with the shoelace theorem, so subtra... | 148 |
6,519 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_10 | 4 | In the diagram below, angle $ABC$ is a right angle. Point $D$ is on $\overline{BC}$ , and $\overline{AD}$ bisects angle $CAB$ . Points $E$ and $F$ are on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $AE=3$ and $AF=10$ . Given that $EB=9$ and $FC=27$ , find the integer closest to the area of quadrilateral... | By the Pythagorean Theorem, $BC = 35$ , and by the Angle Bisector Theorem $BD = 60/7$ and $DC = 185/7$ . Draw a perpendicular from $F$ to $\overline{AE}$ . Let the intersection of $F$ and $\overline{AE}$ be $H$ . triangle $AHF$ is similar to $ABC$ by $AA$ similarity. thus, $AF/AC = HF/BC$ . We find that $HF = 350/37$ ,... | 148 |
6,520 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_11 | 1 | Let $ABCD$ and $BCFG$ be two faces of a cube with $AB=12$ . A beam of light emanates from vertex $A$ and reflects off face $BCFG$ at point $P$ , which is 7 units from $\overline{BG}$ and 5 units from $\overline{BC}$ . The beam continues to be reflected off the faces of the cube. The length of the light path from the ti... | When a light beam reflects off a surface, the path is like that of a ball bouncing. Picture that, and also imagine X, Y, and Z coordinates for the cube vertices. The coordinates will all involve 0's and 12's only, so that means that the X, Y, and Z distance traveled by the light must all be divisible by 12. Since the l... | 230 |
6,521 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_11 | 2 | Let $ABCD$ and $BCFG$ be two faces of a cube with $AB=12$ . A beam of light emanates from vertex $A$ and reflects off face $BCFG$ at point $P$ , which is 7 units from $\overline{BG}$ and 5 units from $\overline{BC}$ . The beam continues to be reflected off the faces of the cube. The length of the light path from the ti... | We can use a similar trick as with reflections in 2D: Imagine that the entire space is divided into cubes identical to the one we have. Now let's follow two photons of light that start in $A$ at the same time: one of them will reflect as given in the problem statement, the second will simply fly straight through all cu... | 230 |
6,522 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_12 | 1 | Let $F(z)=\dfrac{z+i}{z-i}$ for all complex numbers $z\neq i$ , and let $z_n=F(z_{n-1})$ for all positive integers $n$ . Given that $z_0=\dfrac{1}{137}+i$ and $z_{2002}=a+bi$ , where $a$ and $b$ are real numbers, find $a+b$ | Iterating $F$ we get:
\begin{align*} F(z) &= \frac{z+i}{z-i}\\ F(F(z)) &= \frac{\frac{z+i}{z-i}+i}{\frac{z+i}{z-i}-i} = \frac{(z+i)+i(z-i)}{(z+i)-i(z-i)}= \frac{z+i+zi+1}{z+i-zi-1}= \frac{(z+1)(i+1)}{(z-1)(1-i)}\\ &= \frac{(z+1)(i+1)^2}{(z-1)(1^2+1^2)}= \frac{(z+1)(2i)}{(z-1)(2)}= \frac{z+1}{z-1}i\\ F(F(F(z))) &= \frac... | 275 |
6,523 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_13 | 5 | In triangle $ABC$ the medians $\overline{AD}$ and $\overline{CE}$ have lengths $18$ and $27$ , respectively, and $AB=24$ . Extend $\overline{CE}$ to intersect the circumcircle of $ABC$ at $F$ . The area of triangle $AFB$ is $m\sqrt{n}$ , where $m$ and $n$ are positive integers and $n$ is not divisible by the square of ... | Apply barycentric coordinates on $\triangle ABC$ . We know that $D=\left(0, \frac{1}{2}, \frac{1}{2}\right), E=\left(\frac{1}{2}, \frac{1}{2}, 0\right)$ . We can now get the displacement vectors $\overrightarrow{AD} = \left(1, -\frac{1}{2}, -\frac{1}{2}\right)$ and $\overrightarrow{CE}=\left(-\frac{1}{2}, -\frac{1}{2},... | 63 |
6,524 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_I_Problems/Problem_15 | 1 | Polyhedron $ABCDEFG$ has six faces. Face $ABCD$ is a square with $AB = 12;$ face $ABFG$ is a trapezoid with $\overline{AB}$ parallel to $\overline{GF},$ $BF = AG = 8,$ and $GF = 6;$ and face $CDE$ has $CE = DE = 14.$ The other three faces are $ADEG, BCEF,$ and $EFG.$ The distance from $E$ to face $ABCD$ is 12. Given ... | We let $A$ be the origin, or $(0,0,0)$ $B = (0,0,12)$ , and $D = (12,0,0)$ . Draw the perpendiculars from F and G to AB, and let their intersections be X and Y, respectively. By symmetry, $FX = GY = \frac{12-6}2 = 3$ , so $G = (a,b,3)$ , where a and b are variables.
We can now calculate the coordinates of E. Drawing th... | 163 |
6,525 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_3 | 1 | It is given that $\log_{6}a + \log_{6}b + \log_{6}c = 6,$ where $a,$ $b,$ and $c$ are positive integers that form an increasing geometric sequence and $b - a$ is the square of an integer. Find $a + b + c.$ | $abc=6^6$ . Since they form an increasing geometric sequence, $b$ is the geometric mean of the product $abc$ $b=\sqrt[3]{abc}=6^2=36$
Since $b-a$ is the square of an integer, we can find a few values of $a$ that work: $11, 20, 27, 32,$ and $35$ . Out of these, the only value of $a$ that works is $a=27$ , from which we ... | 111 |
6,526 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_3 | 2 | It is given that $\log_{6}a + \log_{6}b + \log_{6}c = 6,$ where $a,$ $b,$ and $c$ are positive integers that form an increasing geometric sequence and $b - a$ is the square of an integer. Find $a + b + c.$ | Let $r$ be the common ratio of the geometric sequence. Since it is increasing, that means that $b = ar$ , and $c = ar^2$ . Simplifying the logarithm, we get $\log_6(a^3*r^3) = 6$ . Therefore, $a^3*r^3 = 6^6$ . Taking the cube root of both sides, we see that $ar = 6^2 = 36$ . Now since $ar = b$ , that means $b = 36$ . U... | 111 |
6,527 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_4 | 1 | Patio blocks that are hexagons $1$ unit on a side are used to outline a garden by placing the blocks edge to edge with $n$ on each side. The diagram indicates the path of blocks around the garden when $n=5$
AIME 2002 II Problem 4.gif
If $n=202$ , then the area of the garden enclosed by the path, not including the path ... | When $n>1$ , the path of blocks has $6(n-1)$ blocks total in it. When $n=1$ , there is just one lonely block. Thus, the area of the garden enclosed by the path when $n=202$ is
\[(1+6+12+18+\cdots +1200)A=(1+6(1+2+3...+200))A\]
where $A$ is the area of one block. Then, because $n(n+1)/2$ is equal to the sum of the first... | 803 |
6,528 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_7 | 1 | It is known that, for all positive integers $k$
Find the smallest positive integer $k$ such that $1^2+2^2+3^2+\ldots+k^2$ is a multiple of $200$ | $\frac{k(k+1)(2k+1)}{6}$ is a multiple of $200$ if $k(k+1)(2k+1)$ is a multiple of $1200 = 2^4 \cdot 3 \cdot 5^2$ .
So $16,3,25|k(k+1)(2k+1)$
Since $2k+1$ is always odd, and only one of $k$ and $k+1$ is even, either $k, k+1 \equiv 0 \pmod{16}$
Thus, $k \equiv 0, 15 \pmod{16}$
If $k \equiv 0 \pmod{3}$ , then $3|k$ . If... | 112 |
6,529 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_10 | 1 | While finding the sine of a certain angle, an absent-minded professor failed to notice that his calculator was not in the correct angular mode. He was lucky to get the right answer. The two least positive real values of $x$ for which the sine of $x$ degrees is the same as the sine of $x$ radians are $\frac{m\pi}{n-\pi}... | Note that $x$ degrees is equal to $\frac{\pi x}{180}$ radians. Also, for $\alpha \in \left[0 , \frac{\pi}{2} \right]$ , the two least positive angles $\theta > \alpha$ such that $\sin{\theta} = \sin{\alpha}$ are $\theta = \pi-\alpha$ , and $\theta = 2\pi + \alpha$
Clearly $x > \frac{\pi x}{180}$ for positive real value... | 900 |
6,530 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_11 | 1 | Two distinct, real, infinite geometric series each have a sum of $1$ and have the same second term. The third term of one of the series is $1/8$ , and the second term of both series can be written in the form $\frac{\sqrt{m}-n}p$ , where $m$ $n$ , and $p$ are positive integers and $m$ is not divisible by the square of ... | Let the second term of each series be $x$ . Then, the common ratio is $\frac{1}{8x}$ , and the first term is $8x^2$
So, the sum is $\frac{8x^2}{1-\frac{1}{8x}}=1$ . Thus, $64x^3-8x+1 = (4x-1)(16x^2+4x-1) = 0 \Rightarrow x = \frac{1}{4}, \frac{-1 \pm \sqrt{5}}{8}$
The only solution in the appropriate form is $x = \frac{... | 518 |
6,531 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_11 | 2 | Two distinct, real, infinite geometric series each have a sum of $1$ and have the same second term. The third term of one of the series is $1/8$ , and the second term of both series can be written in the form $\frac{\sqrt{m}-n}p$ , where $m$ $n$ , and $p$ are positive integers and $m$ is not divisible by the square of ... | Let's ignore the "two distinct, real, infinite geometric series" part for now and focus on what it means to be a geometric series.
Let the first term of the series with the third term equal to $\frac18$ be $a,$ and the common ratio be $r.$ Then, we get that $\frac{a}{1-r} = 1 \implies a = 1-r,$ and $ar^2 = \frac18 \imp... | 518 |
6,532 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_12 | 1 | A basketball player has a constant probability of $.4$ of making any given shot, independent of previous shots. Let $a_n$ be the ratio of shots made to shots attempted after $n$ shots. The probability that $a_{10} = .4$ and $a_n\le.4$ for all $n$ such that $1\le n\le9$ is given to be $p^aq^br/\left(s^c\right)$ where $p... | We graph the $10$ shots on a grid. Suppose that a made shot is represented by a step of $(0,1)$ , and a missed shot is represented by $(1,0)$ . Then the basketball player's shots can be represented by the number of paths from $(0,0)$ to $(6,4)$ that always stay below the line $y=\frac{2x}{3}$ . We can find the number o... | 660 |
6,533 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_12 | 2 | A basketball player has a constant probability of $.4$ of making any given shot, independent of previous shots. Let $a_n$ be the ratio of shots made to shots attempted after $n$ shots. The probability that $a_{10} = .4$ and $a_n\le.4$ for all $n$ such that $1\le n\le9$ is given to be $p^aq^br/\left(s^c\right)$ where $p... | The first restriction is that $a_{10} = .4$ , meaning that the player gets exactly 4 out of 10 baskets. The second restriction is $a_n\le.4$ . This means that the player may never have a shooting average over 40%. Thus, the first and second shots must fail, since $\frac{1}{1}$ and $\frac{1}{2}$ are both over $.4$ , ... | 660 |
6,534 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_12 | 3 | A basketball player has a constant probability of $.4$ of making any given shot, independent of previous shots. Let $a_n$ be the ratio of shots made to shots attempted after $n$ shots. The probability that $a_{10} = .4$ and $a_n\le.4$ for all $n$ such that $1\le n\le9$ is given to be $p^aq^br/\left(s^c\right)$ where $p... | Note $a_{10}=.4$ . Therefore the player made 4 shots out of 10. He must make the 10th shot, because if he doesn't, then $a_9=\frac{4}{9}>.4$ . Since $a_n\leq .4$ for all $n$ less than 11, we know that $a_1=a_2=0$ . Now we must look at the 3rd through 9th shot.
Now let's take a look at those un-determined shots. Let's p... | 660 |
6,535 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_13 | 1 | In triangle $ABC,$ point $D$ is on $\overline{BC}$ with $CD = 2$ and $DB = 5,$ point $E$ is on $\overline{AC}$ with $CE = 1$ and $EA = 3,$ $AB = 8,$ and $\overline{AD}$ and $\overline{BE}$ intersect at $P.$ Points $Q$ and $R$ lie on $\overline{AB}$ so that $\overline{PQ}$ is parallel to $\overline{CA}$ and $\overline{P... | First draw $\overline{CP}$ and extend it so that it meets with $\overline{AB}$ at point $X$
[asy] size(10cm); pair A,B,C,D,E,X,P,Q,R; A=(0,0); B=(8,0); C=(1.9375,3.4994); D=(3.6696,2.4996); E=(1.4531,2.6246); X=(4.3636,0); P=(2.9639,2.0189); Q=(1.8462,0); R=(6.4615,0); dot(A); dot(B); dot(C); dot(D); dot(E); ... | 901 |
6,536 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_13 | 2 | In triangle $ABC,$ point $D$ is on $\overline{BC}$ with $CD = 2$ and $DB = 5,$ point $E$ is on $\overline{AC}$ with $CE = 1$ and $EA = 3,$ $AB = 8,$ and $\overline{AD}$ and $\overline{BE}$ intersect at $P.$ Points $Q$ and $R$ lie on $\overline{AB}$ so that $\overline{PQ}$ is parallel to $\overline{CA}$ and $\overline{P... | [asy] size(10cm); pair A,B,C,D,E,P,Q,R; A=(0,0); B=(8,0); C=(1.9375,3.4994); D=(3.6696,2.4996); E=(1.4531,2.6246); P=(2.9639,2.0189); Q=(1.8462,0); R=(6.4615,0); dot(A); dot(B); dot(C); dot(D); dot(E); dot(P); dot(Q); dot(R); label("$A$",A,WSW); label("$B$",B,ESE); label("$C$",C,NNW); label("$D$",D,NE); label(... | 901 |
6,537 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_15 | 1 | Circles $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ intersect at two points, one of which is $(9,6)$ , and the product of the radii is $68$ . The x-axis and the line $y = mx$ , where $m > 0$ , are tangent to both circles. It is given that $m$ can be written in the form $a\sqrt {b}/c$ , where $a$ $b$ , and $c$ are positive ... | Let the smaller angle between the $x$ -axis and the line $y=mx$ be $\theta$ . Note that the centers of the two circles lie on the angle bisector of the angle between the $x$ -axis and the line $y=mx$ . Also note that if $(x,y)$ is on said angle bisector, we have that $\frac{y}{x}=\tan{\frac{\theta}{2}}$ . Let $\tan{\f... | 282 |
6,538 | https://artofproblemsolving.com/wiki/index.php/2002_AIME_II_Problems/Problem_15 | 2 | Circles $\mathcal{C}_{1}$ and $\mathcal{C}_{2}$ intersect at two points, one of which is $(9,6)$ , and the product of the radii is $68$ . The x-axis and the line $y = mx$ , where $m > 0$ , are tangent to both circles. It is given that $m$ can be written in the form $a\sqrt {b}/c$ , where $a$ $b$ , and $c$ are positive ... | Let the centers of $C_1$ and $C_2$ be $A$ and $B$ , respectively, and let the point $(9, 6)$ be $P$
Because both $C_1$ and $C_2$ are tangent to the x-axis, and both of them pass through $P$ , both $A$ and $B$ must be equidistant from $P$ and the x-axis. Therefore, they must both be on the parabola with $P$ as the focus... | 282 |
6,539 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_1 | 1 | Find the sum of all positive two-digit integers that are divisible by each of their digits. | Let our number be $10a + b$ $a,b \neq 0$ . Then we have two conditions: $10a + b \equiv 10a \equiv 0 \pmod{b}$ and $10a + b \equiv b \pmod{a}$ , or $a$ divides into $b$ and $b$ divides into $10a$ . Thus $b = a, 2a,$ or $5a$ (note that if $b = 10a$ , then $b$ would not be a digit).
If we ignore the case $b = 0$ as we ha... | 630 |
6,540 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_1 | 2 | Find the sum of all positive two-digit integers that are divisible by each of their digits. | Using casework, we can list out all of these numbers: \[11+12+15+22+24+33+36+44+48+55+66+77+88+99=\boxed{630}.\] | 630 |
6,541 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_2 | 1 | A finite set $\mathcal{S}$ of distinct real numbers has the following properties: the mean of $\mathcal{S}\cup\{1\}$ is $13$ less than the mean of $\mathcal{S}$ , and the mean of $\mathcal{S}\cup\{2001\}$ is $27$ more than the mean of $\mathcal{S}$ . Find the mean of $\mathcal{S}$ | Let $x$ be the mean of $\mathcal{S}$ . Let $a$ be the number of elements in $\mathcal{S}$ .
Then, the given tells us that $\frac{ax+1}{a+1}=x-13$ and $\frac{ax+2001}{a+1}=x+27$ . Subtracting, we have \begin{align*}\frac{ax+2001}{a+1}-40=\frac{ax+1}{a+1} \Longrightarrow \frac{2000}{a+1}=40 \Longrightarrow a=49\end{align... | 651 |
6,542 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_2 | 2 | A finite set $\mathcal{S}$ of distinct real numbers has the following properties: the mean of $\mathcal{S}\cup\{1\}$ is $13$ less than the mean of $\mathcal{S}$ , and the mean of $\mathcal{S}\cup\{2001\}$ is $27$ more than the mean of $\mathcal{S}$ . Find the mean of $\mathcal{S}$ | Since this is a weighted average problem, the mean of $S$ is $\frac{13}{27}$ as far from $1$ as it is from $2001$ . Thus, the mean of $S$ is $1 + \frac{13}{13 + 27}(2001 - 1) = \boxed{651}$ | 651 |
6,543 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_3 | 1 | Find the sum of the roots , real and non-real, of the equation $x^{2001}+\left(\frac 12-x\right)^{2001}=0$ , given that there are no multiple roots. | From Vieta's formulas , in a polynomial of the form $a_nx^n + a_{n-1}x^{n-1} + \cdots + a_0 = 0$ , then the sum of the roots is $\frac{-a_{n-1}}{a_n}$
From the Binomial Theorem , the first term of $\left(\frac 12-x\right)^{2001}$ is $-x^{2001}$ , but $x^{2001}+-x^{2001}=0$ , so the term with the largest degree is $x^{2... | 500 |
6,544 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_3 | 2 | Find the sum of the roots , real and non-real, of the equation $x^{2001}+\left(\frac 12-x\right)^{2001}=0$ , given that there are no multiple roots. | We find that the given equation has a $2000^{\text{th}}$ degree polynomial. Note that there are no multiple roots. Thus, if $\frac{1}{2} - x$ is a root, $x$ is also a root. Thus, we pair up $1000$ pairs of roots that sum to $\frac{1}{2}$ to get a sum of $\boxed{500}$ | 500 |
6,545 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_3 | 3 | Find the sum of the roots , real and non-real, of the equation $x^{2001}+\left(\frac 12-x\right)^{2001}=0$ , given that there are no multiple roots. | Note that if $r$ is a root, then $\frac{1}{2}-r$ is a root and they sum up to $\frac{1}{2}.$ We make the substitution $y=x-\frac{1}{4}$ so \[(\frac{1}{4}+y)^{2001}+(\frac{1}{4}-y)^{2001}=0.\] Expanding gives \[2\cdot\frac{1}{4}\cdot\binom{2001}{1}y^{2000}-0y^{1999}+\cdots\] so by Vieta, the sum of the roots of $y$ is 0... | 500 |
6,546 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_4 | 1 | In triangle $ABC$ , angles $A$ and $B$ measure $60$ degrees and $45$ degrees, respectively. The bisector of angle $A$ intersects $\overline{BC}$ at $T$ , and $AT=24$ . The area of triangle $ABC$ can be written in the form $a+b\sqrt{c}$ , where $a$ $b$ , and $c$ are positive integers, and $c$ is not divisible by the squ... | After chasing angles, $\angle ATC=75^{\circ}$ and $\angle TCA=75^{\circ}$ , meaning $\triangle TAC$ is an isosceles triangle and $AC=24$
Using law of sines on $\triangle ABC$ , we can create the following equation:
$\frac{24}{\sin(\angle ABC)}$ $=$ $\frac{BC}{\sin(\angle BAC)}$
$\angle ABC=45^{\circ}$ and $\angle BAC=6... | 291 |
6,547 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_4 | 2 | In triangle $ABC$ , angles $A$ and $B$ measure $60$ degrees and $45$ degrees, respectively. The bisector of angle $A$ intersects $\overline{BC}$ at $T$ , and $AT=24$ . The area of triangle $ABC$ can be written in the form $a+b\sqrt{c}$ , where $a$ $b$ , and $c$ are positive integers, and $c$ is not divisible by the squ... | First, draw a good diagram.
We realize that $\angle C = 75^\circ$ , and $\angle CAT = 30^\circ$ . Therefore, $\angle CTA = 75^\circ$ as well, making $\triangle CAT$ an isosceles triangle. $AT$ and $AC$ are congruent, so $AC=24$ . We now drop an altitude from $C$ , and call the foot this altitude point $D$
By 30-60-90 ... | 291 |
6,548 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_5 | 1 | An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Denote the vertices of the triangle $A,B,$ and $C,$ where $B$ is in quadrant 4 and $C$ is in quadrant $3.$
Note that the slope of $\overline{AC}$ is $\tan 60^\circ = \sqrt {3}.$ Hence, the equation of the line containing $\overline{AC}$ is \[y = x\sqrt {3} + 1.\] This will intersect the ellipse when \begin{eqnarray*}4 ... | 937 |
6,549 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_5 | 2 | An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Solving for $y$ in terms of $x$ gives $y=\sqrt{4-x^2}/2$ , so the two other points of the triangle are $(x,\sqrt{4-x^2}/2)$ and $(-x,\sqrt{4-x^2}/2)$ , which are a distance of $2x$ apart. Thus $2x$ equals the distance between $(x,\sqrt{4-x^2}/2)$ and $(0,1)$ , so by the distance formula we have
\[2x=\sqrt{x^2+(1-\sqrt{... | 937 |
6,550 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_5 | 3 | An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Since the altitude goes along the $y$ axis, this means that the base is a horizontal line, which means that the endpoints of the base are $(x,y)$ and $(-x,y)$ , and WLOG, we can say that $x$ is positive.
Now, since all sides of an equilateral triangle are the same, we can do this (distance from one of the endpoints of ... | 937 |
6,551 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_5 | 4 | An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Denote $(0,1)$ as vertex $A,$ $B$ as the vertex to the left of the $y$ -axis and $C$ as the vertex to the right of the $y$ -axis. Let $D$ be the intersection of $BC$ and the $y$ -axis.
Let $x_0$ be the $x$ -coordinate of $C.$ This implies \[C=\left(x_0 , \sqrt{\frac{4-x_0^2}{4}}\right)\] and \[B=\left(-x_0 , \sqrt{\fra... | 937 |
6,552 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_5 | 6 | An equilateral triangle is inscribed in the ellipse whose equation is $x^2+4y^2=4$ . One vertex of the triangle is $(0,1)$ , one altitude is contained in the y-axis, and the square of the length of each side is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$ | Consider the transformation $(x,y)$ to $(x/2, y).$ This sends the ellipse to the unit circle. If we let $n$ be one-fourth of the side length of the triangle, the equilateral triangle is sent to an isosceles triangle with side lengths $2n, n\sqrt{13}, n\sqrt{13}.$ Let the triangle be $ABC$ such that $AB=AC.$ Let the foo... | 937 |
6,553 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_6 | 4 | A fair die is rolled four times. The probability that each of the final three rolls is at least as large as the roll preceding it may be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers . Find $m + n$ | Call the dice rolls $a, b, c, d$ . The difference between the $a$ and $d$ distinguishes the number of possible rolls there are.
Continuing, we see that the sum is equal to $\sum_{i = 0}^{5}{i+2\choose2}(6 - i) = 6 + 15 + 24 + 30 + 30 + 21 = 126$ . The requested probability is $\frac{126}{6^4} = \frac{7}{72}$ and our an... | 79 |
6,554 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_6 | 9 | A fair die is rolled four times. The probability that each of the final three rolls is at least as large as the roll preceding it may be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers . Find $m + n$ | Let the rolls be $a,b,c$ and $d\newline$ let $z=a-1, e=b-a, f=c-b, g=d-c, h=6-d\newline$ $z+e+f+g+h=5\newline$ This equation has $C(5+5-1, 5-1)=126$ integer solutions $\newline$ $126/1296=7/72\newline$ $7+72=\boxed{79}$ ~ryanbear | 79 |
6,555 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 1 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | Let $I$ be the incenter of $\triangle ABC$ , so that $BI$ and $CI$ are angle bisectors of $\angle ABC$ and $\angle ACB$ respectively. Then, $\angle BID = \angle CBI = \angle DBI,$ so $\triangle BDI$ is isosceles , and similarly $\triangle CEI$ is isosceles. It follows that $DE = DB + EC$ , so the perimeter of $\triangl... | 923 |
6,556 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 2 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | The semiperimeter of $ABC$ is $s = \frac{20 + 21 + 22}{2} = \frac{63}{2}$ . By Heron's formula , the area of the whole triangle is $A = \sqrt{s(s-a)(s-b)(s-c)} = \frac{21\sqrt{1311}}{4}$ . Using the formula $A = rs$ , we find that the inradius is $r = \frac{A}{s} = \frac{\sqrt{1311}}6$ . Since $\triangle ADE \sim \tria... | 923 |
6,557 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 3 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | Let $P$ be the incenter ; then it is be the intersection of all three angle bisectors . Draw the bisector $AP$ to where it intersects $BC$ , and name the intersection $F$
Using the angle bisector theorem , we know the ratio $BF:CF$ is $21:22$ , thus we shall assign a weight of $22$ to point $B$ and a weight of $21$ to ... | 923 |
6,558 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 4 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | More directly than Solution 2, we have \[DE=BC\left(\frac{h_a-r}{h_a}\right)=20\left(1-\frac{r}{\frac{[ABC]}{\frac{BC}{2}}}\right)=20\left(1-\frac{10r}{sr}\right)=20\left(1-\frac{10}{\frac{63}{2}}\right)=\frac{860}{63}\implies \boxed{923}.\] | 923 |
6,559 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 5 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | Diagram borrowed from Solution 3.
Let the angle bisector of $\angle{A}$ intersects $BC$ at $F$
Applying the Angle Bisector Theorem on $\angle{A}$ we have \[\frac{AB}{BF}=\frac{AC}{CF}\] \[BF=BC\cdot(\frac{AB}{AB+AC})\] \[BF=\frac{420}{43}\] Since $BP$ is the angle bisector of $\angle{B}$ , we can once again apply the A... | 923 |
6,560 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_7 | 6 | Triangle $ABC$ has $AB=21$ $AC=22$ and $BC=20$ . Points $D$ and $E$ are located on $\overline{AB}$ and $\overline{AC}$ , respectively, such that $\overline{DE}$ is parallel to $\overline{BC}$ and contains the center of the inscribed circle of triangle $ABC$ . Then $DE=m/n$ , where $m$ and $n$ are relatively prime posit... | Label $P$ the point the angle bisector of $A$ intersects ${BC}$ . First we find ${BP}$ and ${PC}$ . By the Angle Bisector Theorem, $\frac{BP}{PC} = \frac{21}{22}$ and solving for each using the fact that ${BC} = 20$ , we see that ${BP} = \frac{420}{43}$ and $PC = \frac{440}{43}$
\[{AP} = 21*22 - \frac{440}{43}\cdot\fra... | 923 |
6,561 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_8 | 1 | Call a positive integer $N$ 7-10 double if the digits of the base- $7$ representation of $N$ form a base- $10$ number that is twice $N$ . For example, $51$ is a 7-10 double because its base- $7$ representation is $102$ . What is the largest 7-10 double? | Let $A$ be the base $10$ representation of our number, and let $B$ be its base $7$ representation.
Given this is an AIME problem, $A<1000$ . If we look at $B$ in base $10$ , it must be equal to $2A$ , so $B<2000$ when $B$ is looked at in base $10.$
If $B$ in base $10$ is less than $2000$ , then $B$ as a number in base ... | 315 |
6,562 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_10 | 1 | Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime ... | The distance between the $x$ $y$ , and $z$ coordinates must be even so that the midpoint can have integer coordinates. Therefore,
However, we have $3\cdot 4\cdot 5 = 60$ cases where we have simply taken the same point twice, so we subtract those. Therefore, our answer is $\frac {5\cdot 8\cdot 13 - 60}{60\cdot 59} = \fr... | 200 |
6,563 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_10 | 2 | Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime ... | There are $(2 + 1)(3 + 1)(4 + 1) = 60$ points in total. We group the points by parity of each individual coordinate -- that is, if $x$ is even or odd, $y$ is even or odd, and $z$ is even or odd. Note that to have something that works, the two points must have this same type of classification (otherwise, if one doesn't ... | 200 |
6,564 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_10 | 3 | Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime ... | Similarly to Solution 2, we note that there are $60$ points and that the parities of the two points' coordinates must be the same in order for the midpoint to be in $S$
Ignore the distinct points condition. The probability that the midpoint is in $S$ is then \[\left(\left(\frac 23\right)^2+\left(\frac 13\right)^2\right... | 200 |
6,565 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_10 | 4 | Let $S$ be the set of points whose coordinates $x,$ $y,$ and $z$ are integers that satisfy $0\le x\le2,$ $0\le y\le3,$ and $0\le z\le4.$ Two distinct points are randomly chosen from $S.$ The probability that the midpoint of the segment they determine also belongs to $S$ is $m/n,$ where $m$ and $n$ are relatively prime ... | There are $(2 + 1)(3 + 1)(4 + 1) = 60$ points in total. Note that in order for the midpoint of the line segment to be a lattice point, the lengths on the x, y, and z axis must be even numbers. We will define all segments by denoting the amount they extend in each dimension: $(x, y, z)$ . For example, the longest diagon... | 200 |
6,566 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_11 | 1 | In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through $N,$ the second row is numbered $N + 1$ through $2N,$ and so forth. Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so t... | Let each point $P_i$ be in column $c_i$ . The numberings for $P_i$ can now be defined as follows. \begin{align*}x_i &= (i - 1)N + c_i\\ y_i &= (c_i - 1)5 + i \end{align*}
We can now convert the five given equalities. \begin{align}x_1&=y_2 & \Longrightarrow & & c_1 &= 5 c_2-3\\ x_2&=y_1 & \Longrightarrow & & N+c_2 &= 5 ... | 149 |
6,567 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_11 | 2 | In a rectangular array of points, with 5 rows and $N$ columns, the points are numbered consecutively from left to right beginning with the top row. Thus the top row is numbered 1 through $N,$ the second row is numbered $N + 1$ through $2N,$ and so forth. Five points, $P_1, P_2, P_3, P_4,$ and $P_5,$ are selected so t... | If we express all the $c_i$ in terms of $N$ , we have \[24c_1=5N+23\] \[24c_2=N+19\] \[124c_3=117N+51\] \[124c_4=73N+35\] \[124c_5=89N+7\]
It turns out that there exists such an array satisfying the problem conditions if and only if \[N\equiv 149 \pmod{744}\]
In addition, the first two equation can be written $n = 5mod... | 149 |
6,568 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_13 | 1 | In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers. F... | Note that a cyclic quadrilateral in the form of an isosceles trapezoid can be formed from three chords of three $d$ -degree arcs and one chord of one $3d$ -degree arc. The diagonals of this trapezoid turn out to be two chords of two $2d$ -degree arcs. Let $AB$ $AC$ , and $BD$ be the chords of the $d$ -degree arcs, and ... | 174 |
6,569 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_13 | 2 | In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers. F... | Let $z=\frac{d}{2},$ and $R$ be the circumradius. From the given information, \[2R\sin z=22\] \[2R(\sin 2z-\sin 3z)=20\] Dividing the latter by the former, \[\frac{2\sin z\cos z-(3\cos^2z\sin z-\sin^3 z)}{\sin z}=2\cos z-(3\cos^2z-\sin^2z)=1+2\cos z-4\cos^2z=\frac{10}{11}\] \[4\cos^2z-2\cos z-\frac{1}{11}=0 (1)\] We wa... | 174 |
6,570 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_13 | 3 | In a certain circle , the chord of a $d$ -degree arc is $22$ centimeters long, and the chord of a $2d$ -degree arc is $20$ centimeters longer than the chord of a $3d$ -degree arc, where $d < 120.$ The length of the chord of a $3d$ -degree arc is $- m + \sqrt {n}$ centimeters, where $m$ and $n$ are positive integers. F... | Let $z=\frac{d}{2}$ $R$ be the circumradius, and $a$ be the length of 3d degree chord. Using the extended sine law, we obtain: \[22=2R\sin(z)\] \[20+a=2R\sin(2z)\] \[a=2R\sin(3z)\] Dividing the second from the first we get $\cos(z)=\frac{20+a}{44}$ By the triple angle formula we can manipulate the third equation as fol... | 174 |
6,571 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_14 | 1 | A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | Let $0$ represent a house that does not receive mail and $1$ represent a house that does receive mail. This problem is now asking for the number of $19$ -digit strings of $0$ 's and $1$ 's such that there are no two consecutive $1$ 's and no three consecutive $0$ 's.
The last two digits of any $n$ -digit string can't b... | 351 |
6,572 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_14 | 2 | A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | We split the problem into cases using the number of houses that get mail. Let "|" represent a house that gets mail, and "o" represent a house that doesn't. With a fixed number of |, an o can be inserted between 2 |'s or on the very left or right. There cannot be more than one o that is free to arrange to be placed betw... | 351 |
6,573 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_14 | 3 | A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | There doesn't seem to be anything especially noticeable about the number nineteen in this problem, meaning that we can replace the number nineteen with any number without a big effect on the logic that we use to solve the problem. This pits the problem as a likely candidate for recursion.
At first, it's not immediately... | 351 |
6,574 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_14 | 4 | A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | Let $w_n$ be the number of possible ways if the last house has mail, and $b_n$ be the number of possible ways if the last house does not have mail.
If the last house has mail, then, the next house can't have mail, meaning that $b_n = w_{n - 1}$
If the last house doesn't have mail, then the next house can either have ma... | 351 |
6,575 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_I_Problems/Problem_14 | 5 | A mail carrier delivers mail to the nineteen houses on the east side of Elm Street. The carrier notices that no two adjacent houses ever get mail on the same day, but that there are never more than two houses in a row that get no mail on the same day. How many different patterns of mail delivery are possible? | Let $a_n$ be the number of ways if the first house has mail, and let $b_n$ be the number of ways if the first house does not get mail.
$a_n=a_{n-2}+a_{n-3}$ because if the first house gets mail, the next house that gets mail must either be the third or fourth house.
$b_n=a_{n-1}+a_{n-2}$ because if the first house does... | 351 |
6,576 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_1 | 1 | Let $N$ be the largest positive integer with the following property: reading from left to right, each pair of consecutive digits of $N$ forms a perfect square. What are the leftmost three digits of $N$ | The two-digit perfect squares are $16, 25, 36, 49, 64, 81$ . We try making a sequence starting with each one:
The largest is $81649$ , so our answer is $\boxed{816}$ | 816 |
6,577 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_2 | 1 | Each of the $2001$ students at a high school studies either Spanish or French, and some study both. The number who study Spanish is between $80$ percent and $85$ percent of the school population, and the number who study French is between $30$ percent and $40$ percent. Let $m$ be the smallest number of students who cou... | Let $S$ be the percent of people who study Spanish, $F$ be the number of people who study French, and let $S \cap F$ be the number of students who study both. Then $\left\lceil 80\% \cdot 2001 \right\rceil = 1601 \le S \le \left\lfloor 85\% \cdot 2001 \right\rfloor = 1700$ , and $\left\lceil 30\% \cdot 2001 \right\rcei... | 298 |
6,578 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_3 | 1 | Given that
\begin{align*}x_{1}&=211,\\ x_{2}&=375,\\ x_{3}&=420,\\ x_{4}&=523,\ \text{and}\\ x_{n}&=x_{n-1}-x_{n-2}+x_{n-3}-x_{n-4}\ \text{when}\ n\geq5, \end{align*}
find the value of $x_{531}+x_{753}+x_{975}$ | We find that $x_5 = 267$ by the recursive formula. Summing the recursions
\begin{align*} x_{n}&=x_{n-1}-x_{n-2}+x_{n-3}-x_{n-4} \\ x_{n-1}&=x_{n-2}-x_{n-3}+x_{n-4}-x_{n-5} \end{align*}
yields $x_{n} = -x_{n-5}$ . Thus $x_n = (-1)^k x_{n-5k}$ . Since $531 = 106 \cdot 5 + 1,\ 753 = 150 \cdot 5 + 3,\ 975 = 194 \cdot 5 + 5... | 898 |
6,579 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_3 | 2 | Given that
\begin{align*}x_{1}&=211,\\ x_{2}&=375,\\ x_{3}&=420,\\ x_{4}&=523,\ \text{and}\\ x_{n}&=x_{n-1}-x_{n-2}+x_{n-3}-x_{n-4}\ \text{when}\ n\geq5, \end{align*}
find the value of $x_{531}+x_{753}+x_{975}$ | The recursive formula suggests telescoping. Indeed, if we add $x_n$ and $x_{n-1}$ , we have $x_n + x_{n-1} = (x_{n-1} - x_{n-2} + x_{n-3} - x_{n-4}) + (x_{n-2} - x_{n-3} + x_{n-4} - x_{n-5}) = x_{n-1} - x_{n-5}$
Subtracting $x_{n-1}$ yields $x_n = -x_{n-5} \implies x_n = -(-(x_{n-10})) = x_{n-10}$
Thus,
\[x_{531} + x_{... | 898 |
6,580 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_3 | 3 | Given that
\begin{align*}x_{1}&=211,\\ x_{2}&=375,\\ x_{3}&=420,\\ x_{4}&=523,\ \text{and}\\ x_{n}&=x_{n-1}-x_{n-2}+x_{n-3}-x_{n-4}\ \text{when}\ n\geq5, \end{align*}
find the value of $x_{531}+x_{753}+x_{975}$ | Calculate the first few terms:
\[211,375,420,523,267,-211,-375,-420,-523,\dots\]
At this point it is pretty clear that the sequence is periodic with period 10 (one may prove it quite easily like in solution 1) so our answer is obviously $211+420+267=\boxed{898}$ | 898 |
6,581 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_6 | 1 | Square $ABCD$ is inscribed in a circle . Square $EFGH$ has vertices $E$ and $F$ on $\overline{CD}$ and vertices $G$ and $H$ on the circle. If the area of square $ABCD$ is $1$ , then the area of square $EFGH$ can be expressed as $\frac {m}{n}$ where $m$ and $n$ are relatively prime positive integers and $m < n$ . Find $... | Let $O$ be the center of the circle, and $2a$ be the side length of $ABCD$ $2b$ be the side length of $EFGH$ . By the Pythagorean Theorem , the radius of $\odot O = OC = a\sqrt{2}$
Now consider right triangle $OGI$ , where $I$ is the midpoint of $\overline{GH}$ . Then, by the Pythagorean Theorem,
\begin{align*} OG^2 = ... | 251 |
6,582 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_6 | 2 | Square $ABCD$ is inscribed in a circle . Square $EFGH$ has vertices $E$ and $F$ on $\overline{CD}$ and vertices $G$ and $H$ on the circle. If the area of square $ABCD$ is $1$ , then the area of square $EFGH$ can be expressed as $\frac {m}{n}$ where $m$ and $n$ are relatively prime positive integers and $m < n$ . Find $... | Let point $A$ be the top-left corner of square $ABCD$ and the rest of the vertices be arranged, in alphabetical order, in a clockwise arrangement from there. Let $D$ have coordinates $(0,0)$ and the side length of square $ABCD$ be $a$ . Let $DF$ $b$ and diameter $HI$ go through $J$ the midpoint of $EF$ . Since a diamet... | 251 |
6,583 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_7 | 1 | Let $\triangle{PQR}$ be a right triangle with $PQ = 90$ $PR = 120$ , and $QR = 150$ . Let $C_{1}$ be the inscribed circle . Construct $\overline{ST}$ with $S$ on $\overline{PR}$ and $T$ on $\overline{QR}$ , such that $\overline{ST}$ is perpendicular to $\overline{PR}$ and tangent to $C_{1}$ . Construct $\overline{UV}$ ... | Let $P = (0,0)$ be at the origin. Using the formula $A = rs$ on $\triangle PQR$ , where $r_{1}$ is the inradius (similarly define $r_2, r_3$ to be the radii of $C_2, C_3$ ), $s = \frac{PQ + QR + RP}{2} = 180$ is the semiperimeter , and $A = \frac 12 bh = 5400$ is the area, we find $r_{1} = \frac As = 30$ . Or, the inra... | 725 |
6,584 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_7 | 2 | Let $\triangle{PQR}$ be a right triangle with $PQ = 90$ $PR = 120$ , and $QR = 150$ . Let $C_{1}$ be the inscribed circle . Construct $\overline{ST}$ with $S$ on $\overline{PR}$ and $T$ on $\overline{QR}$ , such that $\overline{ST}$ is perpendicular to $\overline{PR}$ and tangent to $C_{1}$ . Construct $\overline{UV}$ ... | We compute $r_1 = 30, r_2 = 15, r_3 = 10$ as above. Let $A_1, A_2, A_3$ respectively the points of tangency of $C_1, C_2, C_3$ with $QR$
By the Two Tangent Theorem , we find that $A_{1}Q = 60$ $A_{1}R = 90$ . Using the similar triangles, $RA_{2} = 45$ $QA_{3} = 20$ , so $A_{2}A_{3} = QR - RA_2 - QA_3 = 85$ . Thus $(O_{... | 725 |
6,585 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_7 | 3 | Let $\triangle{PQR}$ be a right triangle with $PQ = 90$ $PR = 120$ , and $QR = 150$ . Let $C_{1}$ be the inscribed circle . Construct $\overline{ST}$ with $S$ on $\overline{PR}$ and $T$ on $\overline{QR}$ , such that $\overline{ST}$ is perpendicular to $\overline{PR}$ and tangent to $C_{1}$ . Construct $\overline{UV}$ ... | The radius of an incircle is $r=A_t/\text{semiperimeter}$ . The area of the triangle is equal to $\frac{90\times120}{2} = 5400$ and the semiperimeter is equal to $\frac{90+120+150}{2} = 180$ . The radius, therefore, is equal to $\frac{5400}{180} = 30$ . Thus using similar triangles the dimensions of the triangle circum... | 725 |
6,586 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_7 | 4 | Let $\triangle{PQR}$ be a right triangle with $PQ = 90$ $PR = 120$ , and $QR = 150$ . Let $C_{1}$ be the inscribed circle . Construct $\overline{ST}$ with $S$ on $\overline{PR}$ and $T$ on $\overline{QR}$ , such that $\overline{ST}$ is perpendicular to $\overline{PR}$ and tangent to $C_{1}$ . Construct $\overline{UV}$ ... | We can calculate the inradius of each triangle as with the previous solutions. Now, notice that the hexagon $PSTVU$ is a square with its corner cut off. We literally complete the square and mark the last corner as point X. Now, construct right triangle with $C_3C_2$ as its hypotenuse. The right angle will be at point $... | 725 |
6,587 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_8 | 1 | A certain function $f$ has the properties that $f(3x) = 3f(x)$ for all positive real values of $x$ , and that $f(x) = 1-|x-2|$ for $1\le x \le 3$ . Find the smallest $x$ for which $f(x) = f(2001)$ | Iterating the condition $f(3x) = 3f(x)$ , we find that $f(x) = 3^kf\left(\frac{x}{3^k}\right)$ for positive integers $k$ . We know the definition of $f(x)$ from $1 \le x \le 3$ , so we would like to express $f(2001) = 3^kf\left(\frac{2001}{3^k}\right),\ 1 \le \frac{2001}{3^k} \le 3 \Longrightarrow k = 6$ . Indeed,
\[f(... | 429 |
6,588 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_8 | 2 | A certain function $f$ has the properties that $f(3x) = 3f(x)$ for all positive real values of $x$ , and that $f(x) = 1-|x-2|$ for $1\le x \le 3$ . Find the smallest $x$ for which $f(x) = f(2001)$ | First, we start by graphing the function when $1\leq{x}\leq3$ , which consists of the lines $y=x-1$ and $y=3-x$ that intersect at $(2,1)$ . Similarly, using $f(3x)=3f(x)$ , we get a dilation of our initial figure by a factor of 3 for the next interval and so on.
Observe that the intersection of two lines always has coo... | 429 |
6,589 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_9 | 1 | Each unit square of a 3-by-3 unit-square grid is to be colored either blue or red. For each square, either color is equally likely to be used. The probability of obtaining a grid that does not have a 2-by-2 red square is $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | We can use complementary counting , counting all of the colorings that have at least one red $2\times 2$ square.
By the Principle of Inclusion-Exclusion , there are (alternatively subtracting and adding) $128-40+8-1=95$ ways to have at least one red $2 \times 2$ square.
There are $2^9=512$ ways to paint the $3 \times 3... | 929 |
6,590 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_9 | 2 | Each unit square of a 3-by-3 unit-square grid is to be colored either blue or red. For each square, either color is equally likely to be used. The probability of obtaining a grid that does not have a 2-by-2 red square is $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | We consider how many ways we can have 2*2 grid
$(1)$ : All the grids are red-- $1$ case
$(2)$ : One unit square is blue--The blue lies on the center of the bigger square, makes no 2*2 grid $9-1=8$ cases
$(3)$ : Two unit squares are blue--one of the squares lies in the center of the bigger square, makes no 2*2 grid, $8$... | 929 |
6,591 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_9 | 3 | Each unit square of a 3-by-3 unit-square grid is to be colored either blue or red. For each square, either color is equally likely to be used. The probability of obtaining a grid that does not have a 2-by-2 red square is $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$ | \[\begin{array}{|c|c|c|} \hline C_{11} & C_{12} & C_{13}\\ \hline C_{21} & C_{22} & C_{23}\\ \hline C_{31} & C_{32} & C_{33}\\ \hline \end{array}\]
Case 1: The 3-by-3 unit-square grid has exactly $1$ 2-by-2 red square
Assume the 2-by-2 red square is at $C_{11}, C_{12}, C_{21}, C_{22}$ . To make sure there are no more 2... | 929 |
6,592 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_10 | 1 | How many positive integer multiples of $1001$ can be expressed in the form $10^{j} - 10^{i}$ , where $i$ and $j$ are integers and $0\leq i < j \leq 99$ | Observation: We see that there is a pattern with $10^k \pmod{1001}$ \[10^0 \equiv 1 \pmod{1001}\] \[10^1 \equiv 10 \pmod{1001}\] \[10^2 \equiv 100 \pmod{1001}\] \[10^3 \equiv -1 \pmod{1001}\] \[10^4 \equiv -10 \pmod{1001}\] \[10^5 \equiv -100 \pmod{1001}\] \[10^6 \equiv 1 \pmod{1001}\] \[10^7 \equiv 10 \pmod{1001}\] \[... | 784 |
6,593 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_10 | 2 | How many positive integer multiples of $1001$ can be expressed in the form $10^{j} - 10^{i}$ , where $i$ and $j$ are integers and $0\leq i < j \leq 99$ | Note that $1001=7\cdot 11\cdot 13,$ and note that $10^3 \equiv \pmod{p}$ for prime $p | 1001$ ; therefore, the order of 10 modulo $7,11$ , and $13$ must divide 6. A quick check on 7 reveals that it is indeed 6. Therefore we note that $i-j=6k$ for some natural number k. From here, we note that for $j=0,1,2,3,$ we have 1... | 784 |
6,594 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_11 | 1 | Club Truncator is in a soccer league with six other teams, each of which it plays once. In any of its 6 matches, the probabilities that Club Truncator will win, lose, or tie are each $\frac {1}{3}$ . The probability that Club Truncator will finish the season with more wins than losses is $\frac {m}{n}$ , where $m$ and ... | Note that the probability that Club Truncator will have more wins than losses is equal to the probability that it will have more losses than wins; the only other possibility is that they have the same number of wins and losses. Thus, by the complement principle , the desired probability is half the probability that Clu... | 341 |
6,595 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_11 | 2 | Club Truncator is in a soccer league with six other teams, each of which it plays once. In any of its 6 matches, the probabilities that Club Truncator will win, lose, or tie are each $\frac {1}{3}$ . The probability that Club Truncator will finish the season with more wins than losses is $\frac {m}{n}$ , where $m$ and ... | At first, it wins $6$ games, only one way
Secondly, it wins $5$ games, the other game can be either win or loss, there are $\binom{6}{5}\cdot 2=12$ ways
Thirdly, it wins $4$ games, still the other two games can be either win or loss, there are $\binom{6}{4}\cdot 2^2=60$ ways
Fourthly, it wins $3$ games, this time, it c... | 341 |
6,596 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_12 | 1 | Given a triangle , its midpoint triangle is obtained by joining the midpoints of its sides. A sequence of polyhedra $P_{i}$ is defined recursively as follows: $P_{0}$ is a regular tetrahedron whose volume is 1. To obtain $P_{i + 1}$ , replace the midpoint triangle of every face of $P_{i}$ by an outward-pointing regular... | On the first construction, $P_1$ , four new tetrahedra will be constructed with side lengths $\frac 12$ of the original one. Since the ratio of the volume of similar polygons is the cube of the ratio of their corresponding lengths, it follows that each of these new tetrahedra will have volume $\left(\frac 12\right)^3 =... | 101 |
6,597 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_14 | 1 | There are $2n$ complex numbers that satisfy both $z^{28} - z^{8} - 1 = 0$ and $\mid z \mid = 1$ . These numbers have the form $z_{m} = \cos\theta_{m} + i\sin\theta_{m}$ , where $0\leq\theta_{1} < \theta_{2} < \ldots < \theta_{2n} < 360$ and angles are measured in degrees. Find the value of $\theta_{2} + \theta_{4} + \l... | $z$ can be written in the form $\text{cis\,}\theta$ . Rearranging, we find that $\text{cis\,}{28}\theta = \text{cis\,}{8}\theta+1$
Since the real part of $\text{cis\,}{28}\theta$ is one more than the real part of $\text{cis\,} {8}\theta$ and their imaginary parts are equal, it is clear that either $\text{cis\,}{28}\the... | 840 |
6,598 | https://artofproblemsolving.com/wiki/index.php/2001_AIME_II_Problems/Problem_15 | 1 | Let $EFGH$ $EFDC$ , and $EHBC$ be three adjacent square faces of a cube , for which $EC = 8$ , and let $A$ be the eighth vertex of the cube. Let $I$ $J$ , and $K$ , be the points on $\overline{EF}$ $\overline{EH}$ , and $\overline{EC}$ , respectively, so that $EI = EJ = EK = 2$ . A solid $S$ is obtained by drilling a t... | Set the coordinate system so that vertex $E$ , where the drilling starts, is at $(8,8,8)$ . Using a little visualization (involving some similar triangles , because we have parallel lines) shows that the tunnel meets the bottom face (the xy plane one) in the line segments joining $(1,0,0)$ to $(2,2,0)$ , and $(0,1,0)$ ... | 417 |
6,599 | https://artofproblemsolving.com/wiki/index.php/2000_AIME_I_Problems/Problem_1 | 1 | Find the least positive integer $n$ such that no matter how $10^{n}$ is expressed as the product of any two positive integers, at least one of these two integers contains the digit $0$ | If a factor of $10^{n}$ has a $2$ and a $5$ in its prime factorization , then that factor will end in a $0$ . Therefore, we have left to consider the case when the two factors have the $2$ s and the $5$ s separated, so we need to find the first power of 2 or 5 that contains a 0.
For $n = 1:$ \[2^1 = 2 , 5^1 = 5\] $n = ... | 8 |
6,600 | https://artofproblemsolving.com/wiki/index.php/2000_AIME_I_Problems/Problem_3 | 1 | In the expansion of $(ax + b)^{2000},$ where $a$ and $b$ are relatively prime positive integers, the coefficients of $x^{2}$ and $x^{3}$ are equal. Find $a + b$ | Using the binomial theorem $\binom{2000}{1998} b^{1998}a^2 = \binom{2000}{1997}b^{1997}a^3 \Longrightarrow b=666a$
Since $a$ and $b$ are positive relatively prime integers, $a=1$ and $b=666$ , and $a+b=\boxed{667}$ | 667 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.