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,701 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_7 | 2 | A car travels due east at $\frac 23$ mile per minute on a long, straight road. At the same time, a circular storm, whose radius is $51$ miles, moves southeast at $\frac 12\sqrt{2}$ mile per minute. At time $t=0$ , the center of the storm is $110$ miles due north of the car. At time $t=t_1$ minutes, the car enters the storm circle, and at time $t=t_2$ minutes, the car leaves the storm circle. Find $\frac 12(t_1+t_2)$ | First do the same process for assigning coordinates to the car. The car moves $\frac{2}{3}$ miles per minute to the right, so the position starting from $(0,0)$ is $\left(\frac{2}{3}t, 0\right)$
Take the storm as circle. Given southeast movement, split the vector into component, getting position $\left(\frac{1}{2}t, 110 - \frac{1}{2}t\right)$ for the storm's center. This circle with radius 51 yields $\left(x - \frac{1}{2}t\right)^2 + \left(y -110 + \frac{1}{2}t\right)^2 = 51^2$
Now substitute the car's coordinates into the circle's:
$\left(\frac{2}{3}t - \frac{1}{2}t\right)^2 + \left(-110 + \frac{1}{2}t\right)^2 = 51^2$
Simplifying and then squaring:
$\left(\frac{1}{6}t\right)^2 + \left(-110 + \frac{1}{2}t\right)^2 = 51^2$
$\frac{1}{36}t^2 + \frac{1}{4}t^2 - 110t + 110^2$
Forming into a quadratic we get the following, then set equal to 0, since the first time the car hits the circumference of the storm is $t_{1}$ and the second is $t_{2}$
$\frac{5}{18}t^2 - 110t + 110^2 - 51^2 = 0$
The problem asks for sum of solutions divided by 2 so sum is equal to:
$-\frac{b}{a} = -\frac{-110}{\frac{5}{18}} = 110\cdot{\frac{18}{5}} = 396\cdot{\frac{1}{2}} = \boxed{198}$ | 198 |
6,702 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_7 | 3 | A car travels due east at $\frac 23$ mile per minute on a long, straight road. At the same time, a circular storm, whose radius is $51$ miles, moves southeast at $\frac 12\sqrt{2}$ mile per minute. At time $t=0$ , the center of the storm is $110$ miles due north of the car. At time $t=t_1$ minutes, the car enters the storm circle, and at time $t=t_2$ minutes, the car leaves the storm circle. Find $\frac 12(t_1+t_2)$ | We only need to know how the storm and car move relative to each other, so we can find this by subtracting the storm's movement vector from the car's. This gives the car's movement vector as $\left(\frac{1}{6}, \frac{1}{2}\right)$ . Labeling the car's starting position A, the storm center B, and the right triangle formed by AB with a right angle at B and the car's path, we get the following diagram, with AD as our desired length since D is the average of the points where the car enters and exits the storm.
[asy] size(200,200); draw((0,0)--(0,110)); label("A",(0,0),S); dot((0,0)); dot((0,110)); label("B",(0,110),NE); draw(circle((0,110),51)); draw((0,0)--(161/3,161.0),EndArrow); draw((0,110)--(110/3,110.0)); label("C",(110/3,110.0),SE); dot((110/3,110.0)); label("D",(33,99),SE); dot((33,99)); draw((0,110)--(33,99)); markscalefactor=1; draw(rightanglemark((0,110),(33,99),(0,0))); [/asy]
$AB = 110$ , so $CB = \frac{110}{3}$ . The Pythagorean Theorem then gives $AC = \frac{110\sqrt{10}}{3}$ , and since $\bigtriangleup ABC \sim \bigtriangleup ADB$ $AD = (AB)\frac{AB}{AC} = 33\sqrt{10}$ . The Pythagorean Theorem now gives the car's speed as $\sqrt{\frac{5}{18}}$ , and finally $\frac{33\sqrt{10}}{\sqrt{\frac{5}{18}}} = \boxed{198}$ | 198 |
6,703 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_9 | 1 | Given a nonnegative real number $x$ , let $\langle x\rangle$ denote the fractional part of $x$ ; that is, $\langle x\rangle=x-\lfloor x\rfloor$ , where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$ . Suppose that $a$ is positive, $\langle a^{-1}\rangle=\langle a^2\rangle$ , and $2<a^2<3$ . Find the value of $a^{12}-144a^{-1}$ | Looking at the properties of the number, it is immediately guess-able that $a = \phi = \frac{1+\sqrt{5}}2$ (the golden ratio ) is the answer. The following is the way to derive that:
Since $\sqrt{2} < a < \sqrt{3}$ $0 < \frac{1}{\sqrt{3}} < a^{-1} < \frac{1}{\sqrt{2}} < 1$ . Thus $\langle a^2 \rangle = a^{-1}$ , and it follows that $a^2 - 2 = a^{-1} \Longrightarrow a^3 - 2a - 1 = 0$ . Noting that $-1$ is a root, this factors to $(a+1)(a^2 - a - 1) = 0$ , so $a = \frac{1 + \sqrt{5}}{2}$ (we discard the negative root).
Our answer is $(a^2)^{6}-144a^{-1} = \left(\frac{3+\sqrt{5}}2\right)^6 - 144\left(\frac{2}{1 + \sqrt{5}}\right)$ Complex conjugates reduce the second term to $-72(\sqrt{5}-1)$ . The first term we can expand by the binomial theorem to get $\frac 1{2^6}\left(3^6 + 6\cdot 3^5\sqrt{5} + 15\cdot 3^4 \cdot 5 + 20\cdot 3^3 \cdot 5\sqrt{5} + 15 \cdot 3^2 \cdot 25 + 6 \cdot 3 \cdot 25\sqrt{5} + 5^3\right)$ $= \frac{1}{64}\left(10304 + 4608\sqrt{5}\right) = 161 + 72\sqrt{5}$ . The answer is $161 + 72\sqrt{5} - 72\sqrt{5} + 72 = \boxed{233}$ | 233 |
6,704 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_9 | 2 | Given a nonnegative real number $x$ , let $\langle x\rangle$ denote the fractional part of $x$ ; that is, $\langle x\rangle=x-\lfloor x\rfloor$ , where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$ . Suppose that $a$ is positive, $\langle a^{-1}\rangle=\langle a^2\rangle$ , and $2<a^2<3$ . Find the value of $a^{12}-144a^{-1}$ | Find $a$ as shown above. Note that, since $a$ is a root of the equation $a^3 - 2a - 1 = 0$ $a^3 = 2a + 1$ , and $a^{12} = (2a + 1)^4$ . Also note that, since $a$ is a root of $a^2 - a - 1 = 0$ $\frac{1}{a} = a - 1$ . The expression we wish to calculate then becomes $(2a + 1)^4 - 144(a - 1)$ . Plugging in $a = \frac{1 + \sqrt{5}}{2}$ , we plug in to get an answer of $(161 + 72\sqrt{5}) + 72 - 72\sqrt{5} = 161 + 72 = \boxed{233}$ | 233 |
6,705 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_9 | 4 | Given a nonnegative real number $x$ , let $\langle x\rangle$ denote the fractional part of $x$ ; that is, $\langle x\rangle=x-\lfloor x\rfloor$ , where $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$ . Suppose that $a$ is positive, $\langle a^{-1}\rangle=\langle a^2\rangle$ , and $2<a^2<3$ . Find the value of $a^{12}-144a^{-1}$ | As Solution 1 stated, $a^3 - 2a - 1 = 0$ $a^3 - 2a - 1 = a^3 - a^2 -a + a^2 -a -1 = (a+1)(a^2 - a - 1)$ . So, $a^2 - a - 1 = 0$ $1 = a^2 - a$ $\frac1a = a-1$ $a^3 = 2a+1$ $a^2 = a+1$
$a^6 = (a^3)^2 = (2a+1)^2= 4a^2 + 4a +1= 4(a+1) + 4a + 1= 8a+5$
$a^{12} = (a^6)^2 = (8a+5)^2 = 64a^2 + 80a + 25 = 64(a+1) + 80a + 25 = 144a + 89$
Therefore, $a^{12} - 144 a^{-1} = 144a + 89 - 144(a-1) = 89 + 144 = \boxed{233}$ | 233 |
6,706 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_10 | 1 | Every card in a deck has a picture of one shape - circle, square, or triangle, which is painted in one of the three colors - red, blue, or green. Furthermore, each color is applied in one of three shades - light, medium, or dark. The deck has 27 cards, with every shape-color-shade combination represented. A set of three cards from the deck is called complementary if all of the following statements are true:
i. Either each of the three cards has a different shape or all three of the cards have the same shape.
ii. Either each of the three cards has a different color or all three of the cards have the same color.
iii. Either each of the three cards has a different shade or all three of the cards have the same shade.
How many different complementary three-card sets are there? | Adding the cases up, we get $27 + 54 + 36 = \boxed{117}$ | 117 |
6,707 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_10 | 2 | Every card in a deck has a picture of one shape - circle, square, or triangle, which is painted in one of the three colors - red, blue, or green. Furthermore, each color is applied in one of three shades - light, medium, or dark. The deck has 27 cards, with every shape-color-shade combination represented. A set of three cards from the deck is called complementary if all of the following statements are true:
i. Either each of the three cards has a different shape or all three of the cards have the same shape.
ii. Either each of the three cards has a different color or all three of the cards have the same color.
iii. Either each of the three cards has a different shade or all three of the cards have the same shade.
How many different complementary three-card sets are there? | Let's say we have picked two cards. We now compare their attributes to decide how we can pick the third card to make a complement set. For each of the three attributes, should the two values be the same we have one option - choose a card with the same value for that attribute. Furthermore, should the two be different there is only one option- choose the only value that is remaining. In this way, every two card pick corresponds to exactly one set, for a total of $\binom{27}{2} = 27*13 = 351$ possibilities. Note, however, that each set is generated by ${3\choose 2} = 3$ pairs, so we've overcounted by a multiple of 3 and the answer is $\frac{351}{3} = \boxed{117}$ | 117 |
6,708 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_10 | 3 | Every card in a deck has a picture of one shape - circle, square, or triangle, which is painted in one of the three colors - red, blue, or green. Furthermore, each color is applied in one of three shades - light, medium, or dark. The deck has 27 cards, with every shape-color-shade combination represented. A set of three cards from the deck is called complementary if all of the following statements are true:
i. Either each of the three cards has a different shape or all three of the cards have the same shape.
ii. Either each of the three cards has a different color or all three of the cards have the same color.
iii. Either each of the three cards has a different shade or all three of the cards have the same shade.
How many different complementary three-card sets are there? | Treat the sets as ordered. Then for each of the three criterion, there are $3!=6$ choices if the attribute is different and there are $3$ choices is the attribute is the same. Thus all three attributes combine to a total of $(6+3)^3=729$ possibilities. However if all three attributes are the same then the set must be composed of three cards that are the same, which is impossible. This takes out $3^3=27$ possibilities. Notice that we have counted every set $3!=6$ times by treating the set as ordered. The final solution is then $\frac{729-27}{6}=\boxed{117}$ | 117 |
6,709 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 1 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | Note that $\frac{\sum_{n=1}^{44} \cos n}{\sum_{n=1}^{44} \sin n} = \frac{\sum_{n=1}^{44} \cos n}{\sum_{n=46}^{89} \cos n} = \frac {\cos 1 + \cos 2 + \dots + \cos 44}{\cos 89 + \cos 88 + \dots + \cos 46}$ by the cofunction identities.(We could have also written it as $\frac{\sum_{n=1}^{44} \cos n}{\sum_{n=1}^{44} \sin n} = \frac{\sum_{n=46}^{89} \sin n}{\sum_{n=1}^{44} \sin n} = \frac {\sin 89 + \sin 88 + \dots + \sin 46}{\sin 1 + \sin 2 + \dots + \sin 44}$ .)
Now use the sum-product formula $\cos x + \cos y = 2\cos\left(\frac{x+y}{2}\right)\cos\left(\frac{x-y}{2}\right)$ We want to pair up $[1, 44]$ $[2, 43]$ $[3, 42]$ , etc. from the numerator and $[46, 89]$ $[47, 88]$ $[48, 87]$ etc. from the denominator. Then we get: \[\frac{\sum_{n=1}^{44} \cos n}{\sum_{n=1}^{44} \sin n} = \frac{\sum_{n=1}^{44} \cos n}{\sum_{n=46}^{89} \cos n} = \frac{2\cos(\frac{45}{2})[\cos(\frac{43}{2})+\cos(\frac{41}{2})+\dots+\cos(\frac{1}{2})]}{2\cos(\frac{135}{2})[\cos(\frac{43}{2})+\cos(\frac{41}{2})+\dots+\cos(\frac{1}{2})]} \Rightarrow \frac{\cos(\frac{45}{2})}{\cos(\frac{135}{2})}\]
To calculate this number, use the half angle formula. Since $\cos\left(\frac{x}{2}\right) = \pm \sqrt{\frac{\cos x + 1}{2}}$ , then our number becomes: \[\frac{\sqrt{\frac{\frac{\sqrt{2}}{2} + 1}{2}}}{\sqrt{\frac{\frac{-\sqrt{2}}{2} + 1}{2}}}\] in which we drop the negative roots (as it is clear cosine of $22.5$ and $67.5$ are positive). We can easily simplify this:
\begin{eqnarray*} \frac{\sqrt{\frac{\frac{\sqrt{2}}{2} + 1}{2}}}{\sqrt{\frac{\frac{-\sqrt{2}}{2} + 1}{2}}} &=& \sqrt{\frac{\frac{2+\sqrt{2}}{4}}{\frac{2-\sqrt{2}}{4}}} \\ &=& \sqrt{\frac{2+\sqrt{2}}{2-\sqrt{2}}} \cdot \sqrt{\frac{2+\sqrt{2}}{2+\sqrt{2}}} \\ &=& \sqrt{\frac{(2+\sqrt{2})^2}{2}} \\ &=& \frac{2+\sqrt{2}}{\sqrt{2}} \cdot \sqrt{2} \\ &=& \sqrt{2}+1 \end{eqnarray*}
And hence our answer is $\lfloor 100x \rfloor = \lfloor 100(1 + \sqrt {2}) \rfloor = \boxed{241}$ | 241 |
6,710 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 2 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | \begin{eqnarray*} x &=& \frac {\sum_{n = 1}^{44} \cos n^\circ}{\sum_{n = 1}^{44} \sin n^\circ} = \frac {\cos 1 + \cos 2 + \dots + \cos 44}{\sin 1 + \sin 2 + \dots + \sin 44}\\ &=& \frac {\cos (45 - 1) + \cos(45 - 2) + \dots + \cos(45 - 44)}{\sin 1 + \sin 2 + \dots + \sin 44} \end{eqnarray*}
Using the identity $\sin a + \sin b = 2\sin \frac{a+b}2 \cos \frac{a-b}{2}$ $\Longrightarrow \sin x + \cos x$ $= \sin x + \sin (90-x)$ $= 2 \sin 45 \cos (45-x)$ $= \sqrt{2} \cos (45-x)$ , that summation reduces to
\begin{eqnarray*}x &=& \left(\frac {1}{\sqrt {2}}\right)\left(\frac {(\cos 1 + \cos2 + \dots + \cos44) + (\sin1 + \sin2 + \dots + \sin44)}{\sin1 + \sin2 + \dots + \sin44}\right)\\ &=& \left(\frac {1}{\sqrt {2}}\right)\left(1 + \frac {\cos 1 + \cos 2 + \dots + \cos 44}{\sin 1 + \sin 2 + \dots + \sin 44}\right) \end{eqnarray*}
This fraction is equivalent to $x$ . Therefore, \begin{eqnarray*} x &=& \left(\frac {1}{\sqrt {2}}\right)\left(1 + x\right)\\ \frac {1}{\sqrt {2}} &=& x\left(\frac {\sqrt {2} - 1}{\sqrt {2}}\right)\\ x &=& \frac {1}{\sqrt {2} - 1} = 1 + \sqrt {2}\\ \lfloor 100x \rfloor &=& \lfloor 100(1 + \sqrt {2}) \rfloor = \boxed{241} | 241 |
6,711 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 3 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | A slight variant of the above solution, note that
\begin{eqnarray*} \sum_{n=1}^{44} \cos n + \sum_{n=1}^{44} \sin n &=& \sum_{n=1}^{44} \sin n + \sin(90-n)\\ &=& \sqrt{2}\sum_{n=1}^{44} \cos(45-n) = \sqrt{2}\sum_{n=1}^{44} \cos n\\ \sum_{n=1}^{44} \sin n &=& (\sqrt{2}-1)\sum_{n=1}^{44} \cos n \end{eqnarray*}
This is the ratio we are looking for. $x$ reduces to $\frac{1}{\sqrt{2} - 1} = \sqrt{2} + 1$ , and $\lfloor 100(\sqrt{2} + 1)\rfloor = \boxed{241}$ | 241 |
6,712 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 4 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | Consider the sum $\sum_{n = 1}^{44} \text{cis } n^\circ$ . The fraction is given by the real part divided by the imaginary part.
The sum can be written $- 1 + \sum_{n = 0}^{44} \text{cis } n^\circ = - 1 + \frac {\text{cis } 45^\circ - 1}{\text{cis } 1^\circ - 1}$ (by De Moivre's Theorem with geometric series)
$= - 1 + \frac {\frac {\sqrt {2}}{2} - 1 + \frac {i \sqrt {2}}{2}}{\text{cis } 1^\circ - 1} = - 1 + \frac {\left( \frac {\sqrt {2}}{2} - 1 + \frac {i \sqrt {2}}{2} \right) (\text{cis } ( - 1^\circ) - 1)}{(\cos 1^\circ - 1)^2 + \sin^2 1^\circ}$ (after multiplying by complex conjugate
$= - 1 + \frac {\left( \frac {\sqrt {2}}{2} - 1 \right) (\cos 1^\circ - 1) + \frac {\sqrt {2}}{2}\sin 1^\circ + i\left( \left(1 - \frac {\sqrt {2}}{2} \right) \sin 1^\circ + \frac {\sqrt {2}}{2} (\cos 1^\circ - 1)\right)}{2(1 - \cos 1^\circ)}$
$= - \frac {1}{2} - \frac {\sqrt {2}}{4} - \frac {i\sqrt {2}}{4} + \frac {\sin 1^\circ \left( \frac {\sqrt {2}}{2} + i\left( 1 - \frac {\sqrt {2}}{2} \right) \right)}{2(1 - \cos 1^\circ)}$
Using the tangent half-angle formula , this becomes $\left( - \frac {1}{2} + \frac {\sqrt {2}}{4}[\cot (1/2^\circ) - 1] \right) + i\left( \frac {1}{2}\cot (1/2^\circ) - \frac {\sqrt {2}}{4}[\cot (1/2^\circ) + 1] \right)$
Dividing the two parts and multiplying each part by 4, the fraction is $\frac { - 2 + \sqrt {2}[\cot (1/2^\circ) - 1]}{2\cot (1/2^\circ) - \sqrt {2}[\cot (1/2^\circ) + 1]}$
Although an exact value for $\cot (1/2^\circ)$ in terms of radicals will be difficult, this is easily known: it is really large!
So treat it as though it were $\infty$ . The fraction is approximated by $\frac {\sqrt {2}}{2 - \sqrt {2}} = \frac {\sqrt {2}(2 + \sqrt {2})}{2} = 1 + \sqrt {2}\Rightarrow \lfloor 100(1+\sqrt2)\rfloor=\boxed{241}$ | 241 |
6,713 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 5 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | Consider the sum $\sum_{n = 1}^{44} \text{cis } n^\circ$ . The fraction is given by the real part divided by the imaginary part.
The sum can be written as $\sum_{n=1}^{22} (\text{cis } n^\circ + \text{cis } 45-n^\circ)$ .
Consider the rhombus $OABC$ on the complex plane such that $O$ is the origin, $A$ represents $\text{cis } n^\circ$ $B$ represents $\text{cis } n^\circ + \text{cis } 45-n^\circ$ and $C$ represents $\text{cis } n^\circ$ . Simple geometry shows that $\angle BOA = 22.5-k^\circ$ , so the angle that $\text{cis } n^\circ + \text{cis } 45-n^\circ$ makes with the real axis is simply $22.5^\circ$ . So $\sum_{n=1}^{22} (\text{cis } n^\circ + \text{cis } 45-n^\circ)$ is the sum of collinear complex numbers, so the angle the sum makes with the real axis is $22.5^\circ$ . So our answer is $\lfloor 100 \cot(22.5^\circ) \rfloor = \boxed{241}$ | 241 |
6,714 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 6 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | We write $x =\frac{\sum_{n=46}^{89} \sin n^{\circ}}{\sum_{n=1}^{44} \sin n^{\circ}}$ since $\cos x = \sin (90^{\circ}-x).$ Now we by the sine angle sum we know that $\sin (x+45^{\circ}) = \sin 45^{\circ}(\sin x + \cos x).$ So the expression simplifies to $\sin 45^{\circ}\left(\frac{\sum_{n=1}^{44} (\sin n^{\circ}+\cos n^{\circ})}{\sum_{n=1}^{44} \sin n^{\circ}}\right) = \sin 45^{\circ}\left(1+\frac{\sum_{n=1}^{44} \cos n^{\circ}}{\sum_{n=1}^{44} \sin n^{\circ}}\right)=\sin 45^{\circ}(1+x).$ Therefore we have the equation $x = \sin 45^{\circ}(1+x) \implies x = \sqrt{2}+1.$ Finishing, we have $\lfloor 100x \rfloor = \boxed{241}.$ | 241 |
6,715 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_11 | 7 | Let $x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}$ . What is the greatest integer that does not exceed $100x$ | We can pair the terms of the summations as below.
\[\dfrac{(\cos{1} + \cos{44}) + (\cos{2} + \cos{43}) + (\cos{3} + \cos{42}) + \cdots + (\cos{22} + \cos{23})}{(\sin{1} + \sin{44}) + (\sin{2} + \sin{43}) + (\sin{3} + \sin{42}) + \cdots + (\sin{22} + \sin{23})}.\]
From here, we use the cosine and sine subtraction formulas as shown.
\begin{align*}
&\dfrac{(\cos(45-44) + \cos(45-1)) + (\cos(45-43) + \cos(45-2))+ \cdots (\cos(45-23) + \cos(45-22))}{(\sin(45-44) + \sin(45-1)) + (\sin(45-43) + \sin(45-2))+ \cdots (\sin(45-23) + \sin(45-22))} \\
&= \dfrac{(\cos{45}\cos{44} +\sin{45}\sin{44} + \cos{45}\cos{1} + \sin{45}\sin{1})+ \cdots + (\cos{45}\cos{23} + \sin{45}\sin{23} + \cos{45}\cos{22} + \sin{45}\sin{22})}{(\sin{45}\cos{44}-\cos{45}\sin{44} + \sin{45}\cos{1} - \cos{45}\sin{1}) + \cdots + (\sin{45}\cos{23} -\cos{45}\sin{23} + \sin{45}\cos{22} - \cos{45}\sin{22})} \\
&= \dfrac{\sqrt{2}/2(\cos{44} + \sin{44} + \cos{1}+\sin{1} +\cos{43} + \sin{43} + \cos{2} + \sin{2} + \cdots + \cos{23} + \sin{23} + \cos{22} + \sin{22})}{\sqrt{2}/2(\cos{44} -\sin{44} +\cos{1} - \sin{1} + \cos{43}-\sin{43} + \cos{2} -\sin{2} +\cdots + \cos{23}-\sin{23} + \cos{22} - \sin{22})} \\
&=\dfrac{\sum\limits_{n=1}^{44} \cos n^\circ + \sum\limits_{n=1}^{44} \sin n^\circ}{\sum\limits_{n=1}^{44} \cos n^\circ - \sum\limits_{n=1}^{44} \sin n^\circ}.
\end{align*}
Since all of these operations have been performed to ensure equality, we can set the final line of the above mess equal to our original expression.
\[\dfrac{\sum\limits_{n=1}^{44} \cos n^\circ + \sum\limits_{n=1}^{44} \sin n^\circ}{\sum\limits_{n=1}^{44} \cos n^\circ - \sum\limits_{n=1}^{44} \sin n^\circ} = \frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ}.\]
For the sake of clarity, let $\sum\limits_{n=1}^{44} \cos n^\circ = C$ and $\sum\limits_{n=1}^{44} \sin n^\circ = S$ . Then, we have
\[\dfrac{C+S}{C-S} = \dfrac{C}{S} \implies CS+S^2 = C^2-CS.\]
Finishing, we have $S^2+2CS=C^2$ . Adding $C^2$ to both sides gives $(C+S)^2 = 2C^2$ , or $C+S = \pm C\sqrt{2}$ . Taking the positive case gives $S= C(\sqrt{2}-1)$ . Finally,
\[x=\frac{\sum\limits_{n=1}^{44} \cos n^\circ}{\sum\limits_{n=1}^{44} \sin n^\circ} = \dfrac{C}{S} = \dfrac{1}{\sqrt{2}-1} = \sqrt{2} +1 \implies \lfloor{100x\rfloor} = \boxed{241}.\] | 241 |
6,716 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_12 | 2 | The function $f$ defined by $f(x)= \frac{ax+b}{cx+d}$ , where $a$ $b$ $c$ and $d$ are nonzero real numbers, has the properties $f(19)=19$ $f(97)=97$ and $f(f(x))=x$ for all values except $\frac{-d}{c}$ . Find the unique number that is not in the range of $f$ | Begin by finding the inverse function of $f(x)$ , which turns out to be $f^{-1}(x)=\frac{19d-b}{a-19c}$ . Since $f(f(x))=x$ $f(x)=f^{-1}(x)$ , so substituting 19 and 97 yields the system, $\begin{array}{lcl} \frac{19a+b}{19c+d} & = & \frac{19d-b}{a-19c} \\ \frac{97a+b}{97c+d} & = & \frac{97d-b}{a-97c} \end{array}$ , and after multiplying each equation out and subtracting equation 1 from 2, and after simplifying, you will get $116c=a-d$ . Coincidentally, then $116c+d=a$ , which is familiar because $f(116)=\frac{116a+b}{116c+d}$ , and since $116c+d=a$ $f(116)=\frac{116a+b}{a}$ . Also, $f(f(116))=\frac{a(\frac{116a+b}{a})+b}{c(\frac{116a+b}{a})+d}=116$ , due to $f(f(x))=x$ . This simplifies to $\frac{116a+2b}{c(\frac{116a+b}{a})+d}=116$ $116a+2b=116(c(\frac{116a+b}{a})+d)$ $116a+2b=116(c(116+\frac{b}{a})+d)$ $116a+2b=116c(116+\frac{b}{a})+116d$ , and substituting $116c+d=a$ and simplifying, you get $2b=116c(\frac{b}{a})$ , then $\frac{a}{c}=58$ . Looking at $116c=a-d$ one more time, we get $116=\frac{a}{c}+\frac{-d}{c}$ , and substituting, we get $\frac{-d}{c}=\boxed{58}$ , and we are done. | 58 |
6,717 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_12 | 3 | The function $f$ defined by $f(x)= \frac{ax+b}{cx+d}$ , where $a$ $b$ $c$ and $d$ are nonzero real numbers, has the properties $f(19)=19$ $f(97)=97$ and $f(f(x))=x$ for all values except $\frac{-d}{c}$ . Find the unique number that is not in the range of $f$ | Because there are no other special numbers other than $19$ and $97$ , take the average to get $\boxed{58}$ . (Note I solved this problem the solution one way but noticed this and this probably generalizes to all $f(x)=x, f(y)=y$ questions like these) | 58 |
6,718 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_12 | 5 | The function $f$ defined by $f(x)= \frac{ax+b}{cx+d}$ , where $a$ $b$ $c$ and $d$ are nonzero real numbers, has the properties $f(19)=19$ $f(97)=97$ and $f(f(x))=x$ for all values except $\frac{-d}{c}$ . Find the unique number that is not in the range of $f$ | Notice that the function is just an involution on the real number line. Since the involution has two fixed points, namely $19$ and $97$ , we know that the involution is an inversion with respect to a circle with a diameter from $19$ to $97$ . The only point that is undefined under an inversion is the center of the circle, which we know is $\frac{19+97}{2}=\boxed{58}$ in both $x$ and $y$ dimensions. | 58 |
6,719 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_14 | 1 | Let $v$ and $w$ be distinct, randomly chosen roots of the equation $z^{1997}-1=0$ . Let $\frac{m}{n}$ be the probability that $\sqrt{2+\sqrt{3}}\le\left|v+w\right|$ , where $m$ and $n$ are relatively prime positive integers . Find $m+n$ | Define $\theta = 2\pi/1997$ . By De Moivre's Theorem the roots are given by
Now, let $v$ be the root corresponding to $m\theta=2m\pi/1997$ , and let $w$ be the root corresponding to $n\theta=2n\pi/ 1997$ . Then \begin{align*} |v+w|^2 &= \left(\cos(m\theta) + \cos(n\theta)\right)^2 + \left(\sin(m\theta) + \sin(n\theta)\right)^2 \\ &= 2 + 2\cos\left(m\theta\right)\cos\left(n\theta\right) + 2\sin\left(m\theta\right)\sin\left(n\theta\right) \end{align*} The cosine difference identity simplifies that to \[|v+w|^2 = 2+2\cos((m-n)\theta)\]
We need $|v+w|^2 \ge 2+\sqrt{3}$ , which simplifies to \[\cos((m-n)\theta) \ge \frac{\sqrt{3}}{2}\] Thus, \[|m - n| \le \frac{\pi}{6} \cdot \frac{1997}{2 \pi} = \left\lfloor \frac{1997}{12} \right\rfloor =166\]
Therefore, $m$ and $n$ cannot be more than $166$ away from each other. This means that for a given value of $m$ , there are $332$ values for $n$ that satisfy the inequality; $166$ of them $> m$ , and $166$ of them $< m$ . Since $m$ and $n$ must be distinct, $n$ can have $1996$ possible values. Therefore, the probability is $\frac{332}{1996}=\frac{83}{499}$ . The answer is then $499+83=\boxed{582}$ | 582 |
6,720 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_14 | 2 | Let $v$ and $w$ be distinct, randomly chosen roots of the equation $z^{1997}-1=0$ . Let $\frac{m}{n}$ be the probability that $\sqrt{2+\sqrt{3}}\le\left|v+w\right|$ , where $m$ and $n$ are relatively prime positive integers . Find $m+n$ | The solutions of the equation $z^{1997} = 1$ are the $1997$ th roots of unity and are equal to $\text{cis}(\theta_k)$ , where $\theta_k = \tfrac {2\pi k}{1997}$ for $k = 0,1,\ldots,1996.$ Thus, they are located at uniform intervals on the unit circle in the complex plane.
The quantity $|v+w|$ is unchanged upon rotation around the origin, so, WLOG, we can assume $v=1$ after rotating the axis till $v$ lies on the real axis. Let $w=\text{cis}(\theta_k)$ . Since $w\cdot \overline{w}=|w|^2=1$ and $w+\overline{w}=2\text{Re}(w) = 2\cos\theta_k$ , we have \[|v + w|^2 = (1+w)(1+\overline{w}) = 2+2\cos\theta_k\] We want $|v + w|^2\ge 2 + \sqrt {3}.$ From what we just obtained, this is equivalent to \[\cos\theta_k\ge \frac {\sqrt {3}}2 \qquad \Leftrightarrow \qquad -\frac {\pi}6\le \theta_k \le \frac {\pi}6\] which is satisfied by $k = 166,165,\ldots, - 165, - 166$ (we don't include 0 because that corresponds to $v$ ). So out of the $1996$ possible $k$ $332$ work. Thus, $m/n = 332/1996 = 83/499.$ So our answer is $83 + 499 = \boxed{582}.$ | 582 |
6,721 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_14 | 3 | Let $v$ and $w$ be distinct, randomly chosen roots of the equation $z^{1997}-1=0$ . Let $\frac{m}{n}$ be the probability that $\sqrt{2+\sqrt{3}}\le\left|v+w\right|$ , where $m$ and $n$ are relatively prime positive integers . Find $m+n$ | We can solve a geometrical interpretation of this problem.
Without loss of generality, let $u = 1$ . We are now looking for a point exactly one unit away from $u$ such that the point is at least $\sqrt{2 + \sqrt{3}}$ units away from the origin. Note that the "boundary" condition is when the point will be exactly $\sqrt{2+\sqrt{3}}$ units away from the origin; these points will be the intersections of the circle centered at $(1,0)$ with radius $1$ and the circle centered at $(0,0)$ with radius $\sqrt{2+\sqrt{3}}$ . The equations of these circles are $(x-1)^2 = 1$ and $x^2 + y^2 = 2 + \sqrt{3}$ . Solving for $x$ yields $x = \frac{\sqrt{3}}{2}$ . Clearly, this means that the real part of $v$ is greater than $\frac{\sqrt{3}}{2}$ . Solving, we note that $332$ possible $v$ s exist, meaning that $\frac{m}{n} = \frac{332}{1996} = \frac{83}{499}$ . Therefore, the answer is $83 + 499 = \boxed{582}$ | 582 |
6,722 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_14 | 4 | Let $v$ and $w$ be distinct, randomly chosen roots of the equation $z^{1997}-1=0$ . Let $\frac{m}{n}$ be the probability that $\sqrt{2+\sqrt{3}}\le\left|v+w\right|$ , where $m$ and $n$ are relatively prime positive integers . Find $m+n$ | Since $z^{1997}=1$ , the roots will have magnitude $1$ . Thus, the roots can be written as $\cos(\theta)+i\sin(\theta)$ and $\cos(\omega)+i\sin(\omega)$ for some angles $\theta$ and $\omega$ . We rewrite the requirement as $\sqrt{2+\sqrt3}\le|\cos(\theta)+\cos(\omega)+i\sin(\theta)+i\sin(\omega)|$ , which can now be easily manipulated to $2+\sqrt{3}\le(\cos(\theta)+\cos(\omega))^2+(\sin(\theta)+\sin(\omega))^2$
WLOG, let $\theta = 0$ . Thus, our inequality becomes $2+\sqrt{3}\le(1+\cos(\omega))^2+(\sin(\omega))^2$ $2+\sqrt{3}\le2+2\cos(\omega)$ , and finally $\cos(\omega)\ge\frac{\sqrt{3}}{2}$ . Obviously, $\cos(\frac{\pi}{6})=\frac{\sqrt{3}}{2}$ , and thus it follows that, on either side of a given point, $\frac{1997}{12}\approx166$ points will work. The probability is $\frac{166\times2}{1996} = \frac{83}{499}$ , and thus our requested sum is $\boxed{582}$ ~SigmaPiE | 582 |
6,723 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_15 | 1 | The sides of rectangle $ABCD$ have lengths $10$ and $11$ . An equilateral triangle is drawn so that no point of the triangle lies outside $ABCD$ . The maximum possible area of such a triangle can be written in the form $p\sqrt{q}-r$ , where $p$ $q$ , and $r$ are positive integers, and $q$ is not divisible by the square of any prime number. Find $p+q+r$ | Consider points on the complex plane $A (0,0),\ B (11,0),\ C (11,10),\ D (0,10)$ . Since the rectangle is quite close to a square, we figure that the area of the equilateral triangle is maximized when a vertex of the triangle coincides with that of the rectangle. Set one vertex of the triangle at $A$ , and the other two points $E$ and $F$ on $BC$ and $CD$ , respectively. Let $E (11,a)$ and $F (b, 10)$ . Since it's equilateral, then $E\cdot\text{cis}60^{\circ} = F$ , so $(11 + ai)\left(\frac {1}{2} + \frac {\sqrt {3}}{2}i\right) = b + 10i$ , and expanding we get $\left(\frac {11}{2} - \frac {a\sqrt {3}}{2}\right) + \left(\frac {11\sqrt {3}}{2} + \frac {a}{2}\right)i = b + 10i$
We can then set the real and imaginary parts equal, and solve for $(a,b) = (20 - 11\sqrt {3},22 - 10\sqrt {3})$ . Hence a side $s$ of the equilateral triangle can be found by $s^2 = AE^2 = a^2 + AB^2 = 884 - 440\sqrt{3}$ . Using the area formula $\frac{s^2\sqrt{3}}{4}$ , the area of the equilateral triangle is $\frac{(884-440\sqrt{3})\sqrt{3}}{4} = 221\sqrt{3} - 330$ . Thus $p + q + r = 221 + 3 + 330 = \boxed{554}$ | 554 |
6,724 | https://artofproblemsolving.com/wiki/index.php/1997_AIME_Problems/Problem_15 | 2 | The sides of rectangle $ABCD$ have lengths $10$ and $11$ . An equilateral triangle is drawn so that no point of the triangle lies outside $ABCD$ . The maximum possible area of such a triangle can be written in the form $p\sqrt{q}-r$ , where $p$ $q$ , and $r$ are positive integers, and $q$ is not divisible by the square of any prime number. Find $p+q+r$ | Since $\angle{BAD}=90$ and $\angle{EAF}=60$ , it follows that $\angle{DAF}+\angle{BAE}=90-60=30$ . Rotate triangle $ADF$ $60$ degrees clockwise. Note that the image of $AF$ is $AE$ . Let the image of $D$ be $D'$ . Since angles are preserved under rotation, $\angle{DAF}=\angle{D'AE}$ . It follows that $\angle{D'AE}+\angle{BAE}=\angle{D'AB}=30$ . Since $\angle{ADF}=\angle{ABE}=90$ , it follows that quadrilateral $ABED'$ is cyclic with circumdiameter $AE=s$ and thus circumradius $\frac{s}{2}$ . Let $O$ be its circumcenter. By Inscribed Angles, $\angle{BOD'}=2\angle{BAD'}=60$ . By the definition of circle, $OB=OD'$ . It follows that triangle $OBD'$ is equilateral. Therefore, $BD'=r=\frac{s}{2}$ . Applying the Law of Cosines to triangle $ABD'$ $\frac{s}{2}=\sqrt{10^2+11^2-(2)(10)(11)(\cos{30})}$ . Squaring and multiplying by $\sqrt{3}$ yields $\frac{s^2\sqrt{3}}{4}=221\sqrt{3}-330\implies{p+q+r=221+3+330=\boxed{554}$ | 554 |
6,725 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_1 | 1 | In a magic square , the sum of the three entries in any row, column, or diagonal is the same value. The figure shows four of the entries of a magic square. Find $x$ | Let's make a table.
\[\begin{array}{|c|c|c|} \multicolumn{3}{c}{\text{Table}}\\\hline x&19&96\\\hline 1&a&b\\\hline c&d&e\\\hline \end{array}\]
\begin{eqnarray*} x+19+96=x+1+c\Rightarrow c=19+96-1=114,\\ 114+96+a=x+1+114\Rightarrow a=x-95 \end{eqnarray*}
\[\begin{array}{|c|c|c|} \multicolumn{3}{c}{\text{Table in progress}}\\\hline x&19&96\\\hline 1&x-95&b\\\hline 114&d&e\\\hline \end{array}\]
\begin{eqnarray*}19+x-95+d=x+d-76=115+x\Rightarrow d=191,\\ 114+191+e=x+115\Rightarrow e=x-190 \end{eqnarray*} \[\begin{array}{|c|c|c|} \multicolumn{3}{c}{\text{Table in progress}}\\\hline x&19&96\\\hline 1&x-95&b\\\hline 114&191&x-190\\\hline \end{array}\]
\[3x-285=x+115\Rightarrow 2x=400\Rightarrow x=\boxed{200}\] | 200 |
6,726 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_1 | 2 | In a magic square , the sum of the three entries in any row, column, or diagonal is the same value. The figure shows four of the entries of a magic square. Find $x$ | Use the table from above. Obviously $c = 114$ . Hence $a+e = 115$ . Similarly, $1+a = 96 + e \Rightarrow a = 95+e$
Substitute that into the first to get $2e = 20 \Rightarrow e=10$ , so $a=105$ , and so the value of $x$ is just $115+x = 210 + 105 \Rightarrow x = \boxed{200}$ | 200 |
6,727 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_1 | 3 | In a magic square , the sum of the three entries in any row, column, or diagonal is the same value. The figure shows four of the entries of a magic square. Find $x$ | \[\begin{array}{|c|c|c|} \multicolumn{3}{c}{\text{Table}}\\\hline x&19&96\\\hline 1&a&b\\\hline c&d&e\\\hline \end{array}\] The formula \[e=\frac{1+19}{2}\] can be used. Therefore, $e=10$ . Similarly, \[96=\frac{1+d}{2}\] So $d=191$
Now we have this table: \[\begin{array}{|c|c|c|} \multicolumn{3}{c}{\text{Table}}\\\hline x&19&96\\\hline 1&a&b\\\hline c&191&10\\\hline \end{array}\] By property of magic squares, observe that \[x+a+10=19+a+191\] The $a$ 's cancel! We now have \[x+10=19+191\] Thus $x=\boxed{200}.$ | 200 |
6,728 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_2 | 1 | For each real number $x$ , let $\lfloor x \rfloor$ denote the greatest integer that does not exceed x. For how many positive integers $n$ is it true that $n<1000$ and that $\lfloor \log_{2} n \rfloor$ is a positive even integer? | For integers $k$ , we want $\lfloor \log_2 n\rfloor = 2k$ , or $2k \le \log_2 n < 2k+1 \Longrightarrow 2^{2k} \le n < 2^{2k+1}$ . Thus, $n$ must satisfy these inequalities (since $n < 1000$ ):
There are $4$ for the first inequality, $16$ for the second, $64$ for the third, and $256$ for the fourth, so the answer is $4+16+64+256=\boxed{340}$ | 340 |
6,729 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_4 | 1 | A wooden cube , whose edges are one centimeter long, rests on a horizontal surface. Illuminated by a point source of light that is $x$ centimeters directly above an upper vertex , the cube casts a shadow on the horizontal surface. The area of the shadow, which does not include the area beneath the cube is 48 square centimeters. Find the greatest integer that does not exceed $1000x$ | [asy] import three; size(250);defaultpen(0.7+fontsize(9)); real unit = 0.5; real r = 2.8; triple O=(0,0,0), P=(0,0,unit+unit/(r-1)); dot(P); draw(O--P); draw(O--(unit,0,0)--(unit,0,unit)--(0,0,unit)); draw(O--(0,unit,0)--(0,unit,unit)--(0,0,unit)); draw((unit,0,0)--(unit,unit,0)--(unit,unit,unit)--(unit,0,unit)); draw((0,unit,0)--(unit,unit,0)--(unit,unit,unit)--(0,unit,unit)); draw(P--(r*unit,0,0)--(r*unit,r*unit,0)--(0,r*unit,0)--P); draw(P--(r*unit,r*unit,0)); draw((r*unit,0,0)--(0,0,0)--(0,r*unit,0)); draw(P--(0,0,unit)--(unit,0,unit)--(unit,0,0)--(r*unit,0,0)--P,dashed+blue+linewidth(0.8)); label("$x$",(0,0,unit+unit/(r-1)/2),WSW); label("$1$",(unit/2,0,unit),N); label("$1$",(unit,0,unit/2),W); label("$1$",(unit/2,0,0),N); label("$6$",(unit*(r+1)/2,0,0),N); label("$7$",(unit*r,unit*r/2,0),SW); [/asy] (Figure not to scale) The area of the square shadow base is $48 + 1 = 49$ , and so the sides of the shadow are $7$ . Using the similar triangles in blue, $\frac {x}{1} = \frac {1}{6}$ , and $\left\lfloor 1000x \right\rfloor = \boxed{166}$ | 166 |
6,730 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_7 | 2 | Two squares of a $7\times 7$ checkerboard are painted yellow, and the rest are painted green. Two color schemes are equivalent if one can be obtained from the other by applying a rotation in the plane board. How many inequivalent color schemes are possible? | There are 4 cases:
1. The center square is occupied, in which there are $12$ cases.
2. The center square isn't occupied and the two squares that are opposite to each other with respect to the center square, in which there are $12$ cases.
3. The center square isn't occupied and the two squares can rotate to each other with a $90^{\circ}$ rotation with each other and with respect to the center square, in which case there are $12$ cases.
4. And finally, the two squares can't rotate to each other with respect to the center square in which case there are $\dbinom{12}{2} \cdot \frac{16}{4} = 264$ cases.
Add up all the values for each case to get $\boxed{300}$ as your answer. | 300 |
6,731 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_8 | 1 | The harmonic mean of two positive integers is the reciprocal of the arithmetic mean of their reciprocals. For how many ordered pairs of positive integers $(x,y)$ with $x<y$ is the harmonic mean of $x$ and $y$ equal to $6^{20}$ | The harmonic mean of $x$ and $y$ is equal to $\frac{1}{\frac{\frac{1}{x}+\frac{1}{y}}2} = \frac{2xy}{x+y}$ , so we have $xy=(x+y)(3^{20}\cdot2^{19})$ , and by SFFT $(x-3^{20}\cdot2^{19})(y-3^{20}\cdot2^{19})=3^{40}\cdot2^{38}$ . Now, $3^{40}\cdot2^{38}$ has $41\cdot39=1599$ factors, one of which is the square root ( $3^{20}2^{19}$ ). Since $x<y$ , the answer is half of the remaining number of factors, which is $\frac{1599-1}{2}= \boxed{799}$ | 799 |
6,732 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_9 | 1 | A bored student walks down a hall that contains a row of closed lockers, numbered $1$ to $1024$ . He opens the locker numbered 1, and then alternates between skipping and opening each locker thereafter. When he reaches the end of the hall, the student turns around and starts back. He opens the first closed locker he encounters, and then alternates between skipping and opening each closed locker thereafter. The student continues wandering back and forth in this manner until every locker is open. What is the number of the last locker he opens? | On his first pass, he opens all of the odd lockers. So there are only even lockers closed. Then he opens the lockers that are multiples of $4$ , leaving only lockers $2 \pmod{8}$ and $6 \pmod{8}$ . Then he goes ahead and opens all lockers $2 \pmod {8}$ , leaving lockers either $6 \pmod {16}$ or $14 \pmod {16}$ . He then goes ahead and opens all lockers $14 \pmod {16}$ , leaving the lockers either $6 \pmod {32}$ or $22 \pmod {32}$ . He then goes ahead and opens all lockers $6 \pmod {32}$ , leaving $22 \pmod {64}$ or $54 \pmod {64}$ . He then opens $54 \pmod {64}$ , leaving $22 \pmod {128}$ or $86 \pmod {128}$ . He then opens $22 \pmod {128}$ and leaves $86 \pmod {256}$ and $214 \pmod {256}$ . He then opens all $214 \pmod {256}$ , so we have $86 \pmod {512}$ and $342 \pmod {512}$ , leaving lockers $86, 342, 598$ , and $854$ , and he is at where he started again. He then opens $86$ and $598$ , and then goes back and opens locker number $854$ , leaving locker number $\boxed{342}$ untouched. He opens that locker. | 342 |
6,733 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_9 | 2 | A bored student walks down a hall that contains a row of closed lockers, numbered $1$ to $1024$ . He opens the locker numbered 1, and then alternates between skipping and opening each locker thereafter. When he reaches the end of the hall, the student turns around and starts back. He opens the first closed locker he encounters, and then alternates between skipping and opening each closed locker thereafter. The student continues wandering back and forth in this manner until every locker is open. What is the number of the last locker he opens? | We can also solve this with recursion. Let $L_n$ be the last locker he opens given that he started with $2^n$ lockers. Let there be $2^n$ lockers. After he first reaches the end of the hallway, there are $2^{n-1}$ lockers remaining. There is a correspondence between these unopened lockers and if he began with $2^{n-1}$ lockers. The locker $y$ (if he started with $2^{n-1}$ lockers) corresponds to the locker $2^n+2-2y$ (if he started with $2^n$ lockers). It follows that $L_{n} = 2^{n} +2 -2L_{n-1}$ as they are corresponding lockers. We can compute $L_1=2$ and use the recursion to find $L_{10}=\boxed{342}$ | 342 |
6,734 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_9 | 3 | A bored student walks down a hall that contains a row of closed lockers, numbered $1$ to $1024$ . He opens the locker numbered 1, and then alternates between skipping and opening each locker thereafter. When he reaches the end of the hall, the student turns around and starts back. He opens the first closed locker he encounters, and then alternates between skipping and opening each closed locker thereafter. The student continues wandering back and forth in this manner until every locker is open. What is the number of the last locker he opens? | List all the numbers from $1$ through $1024$ , then do the process yourself!!! It will take about 25 minutes (if you don't start to see the pattern), but that's okay, eventually, you will get $\boxed{342}$ | 342 |
6,735 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_10 | 1 | Find the smallest positive integer solution to $\tan{19x^{\circ}}=\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}}$ | $\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}} =$ $\dfrac{\sin{186^{\circ}}+\sin{96^{\circ}}}{\sin{186^{\circ}}-\sin{96^{\circ}}} =$ $\dfrac{\sin{(141^{\circ}+45^{\circ})}+\sin{(141^{\circ}-45^{\circ})}}{\sin{(141^{\circ}+45^{\circ})}-\sin{(141^{\circ}-45^{\circ})}} =$ $\dfrac{2\sin{141^{\circ}}\cos{45^{\circ}}}{2\cos{141^{\circ}}\sin{45^{\circ}}} = \tan{141^{\circ}}$
The period of the tangent function is $180^\circ$ , and the tangent function is one-to-one over each period of its domain.
Thus, $19x \equiv 141 \pmod{180}$
Since $19^2 \equiv 361 \equiv 1 \pmod{180}$ , multiplying both sides by $19$ yields $x \equiv 141 \cdot 19 \equiv (140+1)(18+1) \equiv 0+140+18+1 \equiv 159 \pmod{180}$
Therefore, the smallest positive solution is $x = \boxed{159}$ | 159 |
6,736 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_10 | 2 | Find the smallest positive integer solution to $\tan{19x^{\circ}}=\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}}$ | $\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}} = \dfrac{1 + \tan{96^{\circ}}}{1-\tan{96^{\circ}}}$ which is the same as $\dfrac{\tan{45^{\circ}} + \tan{96^{\circ}}}{1-\tan{45^{\circ}}\tan{96^{\circ}}} = \tan{141{^\circ}}$
So $19x = 141 +180n$ , for some integer $n$ .
Multiplying by $19$ gives $x \equiv 141 \cdot 19 \equiv 2679 \equiv 159 \pmod{180}$ .
The smallest positive solution of this is $x = \boxed{159}$ | 159 |
6,737 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_10 | 3 | Find the smallest positive integer solution to $\tan{19x^{\circ}}=\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}}$ | It seems reasonable to assume that $\dfrac{\cos{96^{\circ}}+\sin{96^{\circ}}}{\cos{96^{\circ}}-\sin{96^{\circ}}} = \tan{\theta}$ for some angle $\theta$ . This means \[\dfrac{\alpha (\cos{96^{\circ}}+\sin{96^{\circ}})}{\alpha (\cos{96^{\circ}}-\sin{96^{\circ}})} = \frac{\sin{\theta}}{\cos{\theta}}\] for some constant $\alpha$ . We can set $\alpha (\cos{96^{\circ}}+\sin{96^{\circ}}) = \sin{\theta}$ .Note that if we have $\alpha$ equal to both the sine and cosine of an angle, we can use the sine sum formula (and the cosine sum formula on the denominator). So, since $\sin{45^{\circ}} = \cos{45^{\circ}} = \tfrac{\sqrt{2}}{2}$ , if $\alpha = \tfrac{\sqrt{2}}{2}$ we have \[\alpha (\cos{96^{\circ}} + \sin{96^{\circ}}) = \cos{96^{\circ}} \frac{\sqrt{2}}{2} + \sin{96^{\circ}} \frac{\sqrt{2}}{2} = \cos{96^{\circ}} \sin{45^{\circ}} + \sin{96^{\circ}} \cos{45^{\circ}} = \sin({45^{\circ} + 96^{\circ}}) = \sin{141^{\circ}}\] from the sine sum formula. For the denominator, from the cosine sum formula, we have \[\alpha (\cos{96^{\circ}} - \sin{96^{\circ}}) = \cos{96^{\circ}} \frac{\sqrt{2}}{2} + \sin{96^{\circ}} \frac{\sqrt{2}}{2} = \cos{96^{\circ}} \cos{45^{\circ}} + \sin{96^{\circ}} \sin{45^{\circ}} = \cos({96^{\circ} + 45^{\circ}}) = \cos{141^{\circ}}.\] This means $\theta = 141^{\circ},$ so $19x = 141 + 180k$ for some positive integer $k$ (since the period of tangent is $180^{\circ}$ ), or $19 x \equiv 141 \pmod{180}$ . Note that the inverse of $19$ modulo $180$ is itself as $19^2 \equiv 361 \equiv 1 \pmod {180}$ , so multiplying this congruence by $19$ on both sides gives $x \equiv 2679 \equiv 159 \pmod{180}.$ For the smallest possible $x$ , we take $x = \boxed{159}.$ | 159 |
6,738 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_11 | 1 | Let $\mathrm {P}$ be the product of the roots of $z^6+z^4+z^3+z^2+1=0$ that have a positive imaginary part, and suppose that $\mathrm {P}=r(\cos{\theta^{\circ}}+i\sin{\theta^{\circ}})$ , where $0<r$ and $0\leq \theta <360$ . Find $\theta$ | \begin{eqnarray*} 0 &=& z^6 - z + z^4 + z^3 + z^2 + z + 1 = z(z^5 - 1) + \frac{z^5-1}{z-1}\\ 0 &=& \frac{(z^5 - 1)(z(z-1)+1)}{z-1} = \frac{(z^2-z+1)(z^5-1)}{z-1} \end{eqnarray*}
Thus $z^5 = 1, z \neq 1 \Longrightarrow z = \mathrm{cis}\ 72, 144, 216, 288$
or $z^2 - z + 1 = 0 \Longrightarrow z = \frac{1 \pm \sqrt{-3}}{2} = \mathrm{cis}\ 60, 300$
(see cis ).
Discarding the roots with negative imaginary parts (leaving us with $\mathrm{cis} \theta,\ 0 < \theta < 180$ ), we are left with $\mathrm{cis}\ 60, 72, 144$ ; their product is $P = \mathrm{cis} (60 + 72 + 144) = \mathrm{cis} \boxed{276}$ | 276 |
6,739 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_11 | 2 | Let $\mathrm {P}$ be the product of the roots of $z^6+z^4+z^3+z^2+1=0$ that have a positive imaginary part, and suppose that $\mathrm {P}=r(\cos{\theta^{\circ}}+i\sin{\theta^{\circ}})$ , where $0<r$ and $0\leq \theta <360$ . Find $\theta$ | Divide through by $z^3$ . We get the equation $z^3 + \frac {1}{z^3} + z + \frac {1}{z} + 1 = 0$ . Let $x = z + \frac {1}{z}$ . Then $z^3 + \frac {1}{z^3} = x^3 - 3x$ . Our equation is then $x^3 - 3x + x + 1 = x^3 - 2x + 1 = (x - 1)(x^2 + x - 1) = 0$ , with solutions $x = 1, \frac { - 1\pm\sqrt {5}}{2}$ . For $x = 1$ , we get $z = \text{cis}60,\text{cis}300$ . For $x = \frac { - 1 + \sqrt {5}}{2}$ , we get $z = \text{cis}{72},\text{cis}{292}$ (using exponential form of $\cos$ ). For $x = \frac { - 1 - \sqrt {5}}{2}$ , we get $z = \text{cis}144,\text{cis}216$ . The ones with positive imaginary parts are ones where $0\le\theta\le180$ , so we have $60 + 72 + 144 = \boxed{276}$ | 276 |
6,740 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_11 | 3 | Let $\mathrm {P}$ be the product of the roots of $z^6+z^4+z^3+z^2+1=0$ that have a positive imaginary part, and suppose that $\mathrm {P}=r(\cos{\theta^{\circ}}+i\sin{\theta^{\circ}})$ , where $0<r$ and $0\leq \theta <360$ . Find $\theta$ | We recognize that $z^6+z^5+z^4+z^3+z^2+z+1=\frac{z^7-1}{z-1}$ and strongly wish for the equation to turn into so. Thankfully, we can do this by simultaneously adding and subtracting $z^5$ and $z$ as shown below. $z^6+z^5+z^4+z^3+z^2+z+1-(z^5+z)=0\implies \frac{z^7-1}{z-1}-(z^5+z)=0$
Now, knowing that $z=1$ is not a root, we multiply by $z-1$ to obtain $z^7-1-(z-1)(z^5+z)=0\implies z^7-1-(z^6+z^2-z^5-z)=0\implies z^7-z^6+z^5-z^2+z-1=0$ Now, we see the $z^2+z-1$ and it reminds us of the sum of two cubes. Cleverly factoring, we obtain that.. $z^5(z^2-z)+z^5-(z^2-z+1)=0\implies z^5(z^2-z+1)-(z^2-z+1)=0\implies (z^5-1)(z^2-z+1)=0$
Now, it is clear that we have two cases to consider.
Case $1$ $z^5-1=0$ We obtain that $z^5=1$ or $z^5=e^{2\pi{n}{i}}$ Obviously, the answers to this case are $e^{ia}, a\in{\frac{2\pi}{5}, \frac{4\pi}{5}}$
Case $2$ $z^2-z+1=0$ Completing the square and then algebra allows us to find that $z=\frac{1}{2}\pm\frac{i\sqrt{3}}{2}$ which has $\arg$ $\frac{\pi}{3}$
Hence, the answer is $\frac{18\pi}{15}+\frac{5\pi}{15}=\frac{23\pi}{15}\cdot\frac{180}{\pi}=\boxed{276}$ | 276 |
6,741 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_11 | 4 | Let $\mathrm {P}$ be the product of the roots of $z^6+z^4+z^3+z^2+1=0$ that have a positive imaginary part, and suppose that $\mathrm {P}=r(\cos{\theta^{\circ}}+i\sin{\theta^{\circ}})$ , where $0<r$ and $0\leq \theta <360$ . Find $\theta$ | Add 1 to both sides of the equation to get $x^6+x^4+x^3+x^2+1+1=1$ . We can rearrange to find that $(x^6+x^3+1)+(x^4+x^2+1)=1$ . Then, using sum of a geometric series, $\frac{x^9-1}{x^3-1}+\frac{x^6-1}{x^2-1}=1$
Combining the two terms of the LHS, we get that $\frac{x^{11}-x^9-x^2+1+x^9-x^6-x^3+1}{x^5-x^3-x^2+1}=1$ , so $x^{11}-x^6-x^3-x^2+2=x^5-x^3-x^2+1$ , and simplifying, we see that $x^{11}-x^6-x^5+1=0$ , so by SFFT, $(x^6-1)(x^5-1)=0$ . Then, the roots of our polynomial are the fifth and sixth roots of unity. However, looking back at our expression when it had fractions, we realize that if $x$ is a second or third root of unity, it would cause a denominator to be zero, so the roots of our polynomial are the fifth and sixth roots of unity that are not the second or third roots of unity. The only roots in this category are $\mathrm{cis} (60, 72, 144)$ , so our desired sum is $\boxed{276}$ , and we are done. | 276 |
6,742 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_14 | 1 | $150\times 324\times 375$ rectangular solid is made by gluing together $1\times 1\times 1$ cubes. An internal diagonal of this solid passes through the interiors of how many of the $1\times 1\times 1$ cubes | Place one corner of the solid at $(0,0,0)$ and let $(a,b,c)$ be the general coordinates of the diagonally opposite corner of the rectangle, where $a, b, c \in \mathbb{Z_{+}}$
We consider the vector equation of the diagonal segment represented by: $(x, y, z) =m (a, b, c)$ , where $m \in \mathbb{R}, 0 < m \le 1$
Consider a point on the diagonal with coordinates $(ma, mb, mc)$ . We have 3 key observations as this point moves from $(0,0,0)$ towards $(a,b,c)$
The number of cubes the diagonal passes is equal to the number of points on the diagonal that has one or more positive integers as coordinates.
If we slice the solid up by the $x$ -planes defined by $x=1,2,3,4, \ldots, a$ , the diagonal will cut these $x$ -planes exactly $a$ times (plane of $x=0$ is not considered since $m \ne 0$ ). Similar arguments for slices along $y$ -planes and $z$ -planes give diagonal cuts of $b$ , and $c$ times respectively. The total cuts by the diagonal is therefore $a+b+c$ , if we can ensure that no more than $1$ positive integer is present in the x, y, or z coordinate in all points $(ma,mb,mc)$ on the diagonal. Note that point $(a,b,c)$ is already one such exception.
But for each diagonal point $(ma,mb,mc)$ with 2 (or more) positive integers occurring at the same time, $a+b+c$ counts the number of cube passes as $2$ instead of $1$ for each such point. There are $\gcd(a,b)+\gcd(b,c)+\gcd(c,a)$ points in such over-counting. We therefore subtract one time such over-counting from $a+b+c$
And for each diagonal point $(ma,mb,mc)$ with exactly $3$ integers occurring at the same time, $a+b+c$ counts the number of cube passes as $3$ instead of $1$ ; ie $a+b+c$ over-counts each of such points by $2$ . But since $\gcd(a,b)+\gcd(b,c)+\gcd(c,a)$ already subtracted three times for the case of $3$ integers occurring at the same time (since there are $3$ of these gcd terms that represent all combinations of 3 edges of a cube meeting at a vertex), we have the final count for each such point as $1 = 3-3+k \Rightarrow k=1$ , where $k$ is our correction term. That is, we need to add $k=1$ time $\gcd(a,b,c)$ back to account for the case of 3 simultaneous integers.
Therefore, the total diagonal cube passes is: $D = a+b+c-\left[ \gcd(a,b)+\gcd(b,c)+\gcd(c,a) \right]+\gcd(a,b,c)$
For $(a,b,c) = (150, 324, 375)$ , we have: $\gcd(150,324)=6$ $\gcd(324,375)=3$ $\gcd(150,375)=75$ $\gcd(150,324,375)=3$
Therefore $D = 150+324+375-(6+3+75)+3 = \boxed{768}$ | 768 |
6,743 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_14 | 2 | $150\times 324\times 375$ rectangular solid is made by gluing together $1\times 1\times 1$ cubes. An internal diagonal of this solid passes through the interiors of how many of the $1\times 1\times 1$ cubes | Consider a point travelling across the internal diagonal, and let the internal diagonal have a length of $d$ . The point enters a new unit cube in the $x,y,z$ dimensions at multiples of $\frac{d}{150}, \frac{d}{324}, \frac{d}{375}$ respectively. We proceed by using PIE.
The point enters a new cube in the $x$ dimension $150$ times, in the $y$ dimension $324$ times and in the $z$ dimension, $375$ times.
The point enters a new cube in the $x$ and $y$ dimensions whenever a multiple of $\frac{d}{150}$ equals a multiple of $\frac{d}{324}$ . This occurs $\gcd(150, 324)$ times. Similarly, a point enters a new cube in the $y,z$ dimensions $\gcd(324, 375)$ times and a point enters a new cube in the $z,x$ dimensions $\gcd(375, 150)$ times.
The point enters a new cube in the $x,y$ and $z$ dimensions whenever some multiples of $\frac{d}{150}, \frac{d}{324}, \frac{d}{375}$ are equal. This occurs $\gcd(150, 324, 375)$ times.
The total number of unit cubes entered is then $150+324+375-[\gcd(150, 324)+\gcd(324, 375)+\gcd(375, 150)] + \gcd(150, 324, 375) = \boxed{768}$ | 768 |
6,744 | https://artofproblemsolving.com/wiki/index.php/1996_AIME_Problems/Problem_15 | 1 | In parallelogram $ABCD$ , let $O$ be the intersection of diagonals $\overline{AC}$ and $\overline{BD}$ . Angles $CAB$ and $DBC$ are each twice as large as angle $DBA$ , and angle $ACB$ is $r$ times as large as angle $AOB$ . Find $\lfloor 1000r \rfloor$ | Let $\theta = \angle DBA$ . Then $\angle CAB = \angle DBC = 2\theta$ $\angle AOB = 180 - 3\theta$ , and $\angle ACB = 180 - 5\theta$ . Since $ABCD$ is a parallelogram, it follows that $OA = OC$ . By the Law of Sines on $\triangle ABO,\, \triangle BCO$
Dividing the two equalities yields
\[\frac{\sin 2\theta}{\sin \theta} = \frac{\sin (180 - 5\theta)}{\sin 2\theta} \Longrightarrow \sin^2 2\theta = \sin 5\theta \sin \theta.\]
Pythagorean and product-to-sum identities yield
\[1 - \cos^2 2 \theta = \frac{\cos 4\theta - \cos 6 \theta}{2},\]
and the double and triple angle ( $\cos 3x = 4\cos^3 x - 3\cos x$ ) formulas further simplify this to
\[4\cos^3 2\theta - 4\cos^2 2\theta - 3\cos 2\theta + 3 = (4\cos^2 2\theta - 3)(\cos 2\theta - 1) = 0\]
The only value of $\theta$ that fits in this context comes from $4 \cos^2 2\theta - 3 = 0 \Longrightarrow \cos 2\theta = \frac{\sqrt{3}}{2} \Longrightarrow \theta = 15^{\circ}$ . The answer is $\lfloor 1000r \rfloor = \left\lfloor 1000 \cdot \frac{180 - 5\theta}{180 - 3\theta} \right\rfloor = \left \lfloor \frac{7000}{9} \right \rfloor = \boxed{777}$ | 777 |
6,745 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_1 | 1 | Square $S_{1}$ is $1\times 1.$ For $i\ge 1,$ the lengths of the sides of square $S_{i+1}$ are half the lengths of the sides of square $S_{i},$ two adjacent sides of square $S_{i}$ are perpendicular bisectors of two adjacent sides of square $S_{i+1},$ and the other two sides of square $S_{i+1},$ are the perpendicular bisectors of two adjacent sides of square $S_{i+2}.$ The total area enclosed by at least one of $S_{1}, S_{2}, S_{3}, S_{4}, S_{5}$ can be written in the form $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m-n.$
AIME 1995 Problem 1.png | The sum of the areas of the squares if they were not interconnected is a geometric sequence
Then subtract the areas of the intersections, which is $\left(\frac{1}{4}\right)^2 + \ldots + \left(\frac{1}{32}\right)^2$
The majority of the terms cancel, leaving $1 + \frac{1}{4} - \frac{1}{1024}$ , which simplifies down to $\frac{1024 + \left(256 - 1\right)}{1024}$ . Thus, $m-n = \boxed{255}$ | 255 |
6,746 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_4 | 1 | Circles of radius $3$ and $6$ are externally tangent to each other and are internally tangent to a circle of radius $9$ . The circle of radius $9$ has a chord that is a common external tangent of the other two circles. Find the square of the length of this chord. | We label the points as following: the centers of the circles of radii $3,6,9$ are $O_3,O_6,O_9$ respectively, and the endpoints of the chord are $P,Q$ . Let $A_3,A_6,A_9$ be the feet of the perpendiculars from $O_3,O_6,O_9$ to $\overline{PQ}$ (so $A_3,A_6$ are the points of tangency ). Then we note that $\overline{O_3A_3} \parallel \overline{O_6A_6} \parallel \overline{O_9A_9}$ , and $O_6O_9 : O_9O_3 = 3:6 = 1:2$ . Thus, $O_9A_9 = \frac{2 \cdot O_6A_6 + 1 \cdot O_3A_3}{3} = 5$ (consider similar triangles). Applying the Pythagorean Theorem to $\triangle O_9A_9P$ , we find that \[PQ^2 = 4(A_9P)^2 = 4[(O_9P)^2-(O_9A_9)^2] = 4[9^2-5^2] = \boxed{224}\] | 224 |
6,747 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_6 | 2 | Let $n=2^{31}3^{19}.$ How many positive integer divisors of $n^2$ are less than $n_{}$ but do not divide $n_{}$ | Let $n=p_1^{k_1}p_2^{k_2}$ for some prime $p_1,p_2$ . Then $n^2$ has $\frac{(2k_1+1)(2k_2+1)-1}{2}$ factors less than $n$
This simplifies to $\frac{4k_1k_2+2k_1+2k_2}{2}=2k_1k_2+k_1+k_2$
The number of factors of $n$ less than $n$ is equal to $(k_1+1)(k_2+1)-1=k_1k_2+k_1+k_2$
Thus, our general formula for $n=p_1^{k_1}p_2^{k_2}$ is
Number of factors that satisfy the above $=(2k_1k_2+k_1+k_2)-(k_1k_2+k_1+k_2)=k_1k_2$
Incorporating this into our problem gives $19\times31=\boxed{589}$ | 589 |
6,748 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_6 | 3 | Let $n=2^{31}3^{19}.$ How many positive integer divisors of $n^2$ are less than $n_{}$ but do not divide $n_{}$ | Consider divisors of $n^2: a,b$ such that $ab=n^2$ .
WLOG, let $b\ge{a}$ and $b=\frac{n}{a}$
Then, it is easy to see that $a$ will always be less than $b$ as we go down the divisor list of $n^2$ until we hit $n$
Therefore, the median divisor of $n^2$ is $n$
Then, there are $(63)(39)=2457$ divisors of $n^2$ . Exactly $\frac{2457-1}{2}=1228$ of these divisors are $<n$
There are $(32)(20)-1=639$ divisors of $n$ that are $<n$
Therefore, the answer is $1228-639=\boxed{589}$ | 589 |
6,749 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_9 | 1 | Triangle $ABC$ is isosceles , with $AB=AC$ and altitude $AM=11.$ Suppose that there is a point $D$ on $\overline{AM}$ with $AD=10$ and $\angle BDC=3\angle BAC.$ Then the perimeter of $\triangle ABC$ may be written in the form $a+\sqrt{b},$ where $a$ and $b$ are integers. Find $a+b.$
[asy] import graph; size(5cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-1.55,xmax=7.95,ymin=-4.41,ymax=5.3; draw((1,3)--(0,0)); draw((0,0)--(2,0)); draw((2,0)--(1,3)); draw((1,3)--(1,0)); draw((1,0.7)--(0,0)); draw((1,0.7)--(2,0)); label("$11$",(1,1.63),W); dot((1,3),ds); label("$A$",(1,3),N); dot((0,0),ds); label("$B$",(0,0),SW); dot((2,0),ds); label("$C$",(2,0),SE); dot((1,0),ds); label("$M$",(1,0),S); dot((1,0.7),ds); label("$D$",(1,0.7),NE); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] | Let $x=\angle CAM$ , so $3x=\angle CDM$ . Then, $\frac{\tan 3x}{\tan x}=\frac{CM/1}{CM/11}=11$ . Expanding $\tan 3x$ using the angle sum identity gives \[\tan 3x=\tan(2x+x)=\frac{3\tan x-\tan^3x}{1-3\tan^2x}.\] Thus, $\frac{3-\tan^2x}{1-3\tan^2x}=11$ . Solving, we get $\tan x= \frac 12$ . Hence, $CM=\frac{11}2$ and $AC= \frac{11\sqrt{5}}2$ by the Pythagorean Theorem . The total perimeter is $2(AC + CM) = \sqrt{605}+11$ . The answer is thus $a+b=\boxed{616}$ | 616 |
6,750 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_9 | 2 | Triangle $ABC$ is isosceles , with $AB=AC$ and altitude $AM=11.$ Suppose that there is a point $D$ on $\overline{AM}$ with $AD=10$ and $\angle BDC=3\angle BAC.$ Then the perimeter of $\triangle ABC$ may be written in the form $a+\sqrt{b},$ where $a$ and $b$ are integers. Find $a+b.$
[asy] import graph; size(5cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-1.55,xmax=7.95,ymin=-4.41,ymax=5.3; draw((1,3)--(0,0)); draw((0,0)--(2,0)); draw((2,0)--(1,3)); draw((1,3)--(1,0)); draw((1,0.7)--(0,0)); draw((1,0.7)--(2,0)); label("$11$",(1,1.63),W); dot((1,3),ds); label("$A$",(1,3),N); dot((0,0),ds); label("$B$",(0,0),SW); dot((2,0),ds); label("$C$",(2,0),SE); dot((1,0),ds); label("$M$",(1,0),S); dot((1,0.7),ds); label("$D$",(1,0.7),NE); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] | In a similar fashion, we encode the angles as complex numbers, so if $BM=x$ , then $\angle BAD=\text{Arg}(11+xi)$ and $\angle BDM=\text{Arg}(1+xi)$ . So we need only find $x$ such that $\text{Arg}((11+xi)^3)=\text{Arg}(1331-33x^2+(363x-x^3)i)=\text{Arg}(1+xi)$ . This will happen when $\frac{363x-x^3}{1331-33x^2}=x$ , which simplifies to $121x-4x^3=0$ . Therefore, $x=\frac{11}{2}$ . By the Pythagorean Theorem, $AB=\frac{11\sqrt{5}}{2}$ , so the perimeter is $11+11\sqrt{5}=11+\sqrt{605}$ , giving us our answer, $\boxed{616}$ | 616 |
6,751 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_9 | 3 | Triangle $ABC$ is isosceles , with $AB=AC$ and altitude $AM=11.$ Suppose that there is a point $D$ on $\overline{AM}$ with $AD=10$ and $\angle BDC=3\angle BAC.$ Then the perimeter of $\triangle ABC$ may be written in the form $a+\sqrt{b},$ where $a$ and $b$ are integers. Find $a+b.$
[asy] import graph; size(5cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-1.55,xmax=7.95,ymin=-4.41,ymax=5.3; draw((1,3)--(0,0)); draw((0,0)--(2,0)); draw((2,0)--(1,3)); draw((1,3)--(1,0)); draw((1,0.7)--(0,0)); draw((1,0.7)--(2,0)); label("$11$",(1,1.63),W); dot((1,3),ds); label("$A$",(1,3),N); dot((0,0),ds); label("$B$",(0,0),SW); dot((2,0),ds); label("$C$",(2,0),SE); dot((1,0),ds); label("$M$",(1,0),S); dot((1,0.7),ds); label("$D$",(1,0.7),NE); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] | Let $\angle BAD=\alpha$ , so $\angle BDM=3\alpha$ $\angle BDA=180-3\alpha$ , and thus $\angle ABD=2\alpha.$ We can then draw the angle bisector of $\angle ABD$ , and let it intersect $\overline{AM}$ at $E.$ Since $\angle BAE=\angle ABE$ $AE=BE.$ Let $AE=x$ . Then we see by the Pythagorean Theorem, $BM=\sqrt{BE^2-ME^2}=\sqrt{x^2-(11-x)^2}=\sqrt{22x-121}$ $BD=\sqrt{BM^2+1}=\sqrt{22x-120}$ $BA=\sqrt{BM^2+121}=\sqrt{22x}$ , and $DE=10-x.$ By the angle bisector theorem, $BA/BD=EA/ED.$ Substituting in what we know for the lengths of those segments, we see that \[\frac{\sqrt{22x}}{\sqrt{22x-120}}=\frac{x}{10-x}.\] multiplying by both denominators and squaring both sides yields \[22x(10-x)^2=x^2(22x-120)\] which simplifies to $x=\frac{55}{8}.$ Substituting this in for x in the equations for $BA$ and $BM$ yields $BA=\frac{\sqrt{605}}{2}$ and $BM=\frac{11}{2}.$ Thus the perimeter is $11+\sqrt{605}$ , and the answer is $\boxed{616}$ | 616 |
6,752 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_9 | 4 | Triangle $ABC$ is isosceles , with $AB=AC$ and altitude $AM=11.$ Suppose that there is a point $D$ on $\overline{AM}$ with $AD=10$ and $\angle BDC=3\angle BAC.$ Then the perimeter of $\triangle ABC$ may be written in the form $a+\sqrt{b},$ where $a$ and $b$ are integers. Find $a+b.$
[asy] import graph; size(5cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-1.55,xmax=7.95,ymin=-4.41,ymax=5.3; draw((1,3)--(0,0)); draw((0,0)--(2,0)); draw((2,0)--(1,3)); draw((1,3)--(1,0)); draw((1,0.7)--(0,0)); draw((1,0.7)--(2,0)); label("$11$",(1,1.63),W); dot((1,3),ds); label("$A$",(1,3),N); dot((0,0),ds); label("$B$",(0,0),SW); dot((2,0),ds); label("$C$",(2,0),SE); dot((1,0),ds); label("$M$",(1,0),S); dot((1,0.7),ds); label("$D$",(1,0.7),NE); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] | The triangle is symmetrical so we can split it in half ( $\triangle ABM$ and $\triangle ACM$ ).
Let $\angle BAM = y$ and $\angle BDM = 3y$ . By the Law of Sines on triangle $BAD$ $\frac{10}{\sin 2y} = \frac{BD}{\sin y}$ . Using $\sin 2y = 2\sin y\cos y$ we can get $BD = \frac{5}{\cos y}$ . We can use this information to relate $BD$ to $DM$ by using the Law of Sines on triangle $BMD$
\[\frac{\frac{5}{\cos y}}{\sin BMD} = \frac{1}{\sin 90^\circ - 3y}\]
$\sin BMD = 1$ (as $\angle BMD$ is a right angle), so $\frac{1}{\sin 90^\circ - 3y} = \frac{5}{\cos y}$ . Using the identity $\sin 90^\circ - x = \cos x$ , we can turn the equation into::
\[\frac{1}{\cos 3y} = \frac{5}{\cos y}\]
\[5\cos 3y = \cos y\]
\[5(4\cos ^3 y - 3\cos y) = \cos y\]
\[20\cos ^3 y = 16 \cos y\]
\[5\cos ^3 y = 4\cos y\]
\[5\cos ^2 y = 4\]
\[\cos ^2 y = \frac{4}{5}\]
Now that we've found $\cos y$ , we can look at the side lengths of $BM$ and $AB$ (since they are symmetrical, the perimeter of $\triangle ABC$ is $2(BM + AB)$
We note that $BM = 11\tan y$ and $AB = 11\sec y$
\[\sin ^2 y = 1 - \cos ^2 y\]
\[\sin ^2 y = \frac{1}{5}\]
\[\tan ^2 y = \frac{1}{4}\]
\[\tan y = \frac{1}{2}\]
(Note it is positive since $BM > 0$ ).
\[\sec ^2 y = \frac{5}{4}\]
\[\sec y = \frac{\sqrt{5}}{2}\]
\[BM + AB = 11\frac{\sqrt{5}+1}{2}\]
\[2(BM + AB) = 11(\sqrt{5} + 1)\]
\[2(BM + AB) = 11\sqrt{5} + 11\]
\[2(BM + AB) = \sqrt{605} + 11\]
The answer is $\boxed{616}$ | 616 |
6,753 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_9 | 5 | Triangle $ABC$ is isosceles , with $AB=AC$ and altitude $AM=11.$ Suppose that there is a point $D$ on $\overline{AM}$ with $AD=10$ and $\angle BDC=3\angle BAC.$ Then the perimeter of $\triangle ABC$ may be written in the form $a+\sqrt{b},$ where $a$ and $b$ are integers. Find $a+b.$
[asy] import graph; size(5cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-1.55,xmax=7.95,ymin=-4.41,ymax=5.3; draw((1,3)--(0,0)); draw((0,0)--(2,0)); draw((2,0)--(1,3)); draw((1,3)--(1,0)); draw((1,0.7)--(0,0)); draw((1,0.7)--(2,0)); label("$11$",(1,1.63),W); dot((1,3),ds); label("$A$",(1,3),N); dot((0,0),ds); label("$B$",(0,0),SW); dot((2,0),ds); label("$C$",(2,0),SE); dot((1,0),ds); label("$M$",(1,0),S); dot((1,0.7),ds); label("$D$",(1,0.7),NE); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);[/asy] | Suppose $\angle BAM=\angle CAM =x$ , since $\angle BDC=3\angle BAC$ , we have $\angle BDM=\angle MDC = 3x$ . Therefore, $\angle DBC=\angle DCB = 90^\circ -3x$ and $\angle ABD=\angle DCA=2x$ . As a result, $\triangle KAC$ is isosceles, $KC=KA$
Let $H$ be a point on the extension of $CD$ through $D$ such that $\overline{HB}\perp\overline{BC}$ and denote the intersection of $\overline{HC}$ and $\overline{AB}$ as $K$ . Then, $BH=2DM=2, \overline{HB}\parallel\overline{DM}$ , and $HD=DC$ by the Midpoint Theorem. So, $\angle HBA=x$ and $\angle CDM=\angle CHB=\angle HDA= 3x$
Consequently, $\triangle HBK\sim \triangle DAK$ \[\frac{BK}{KA}=\frac{HK}{KD}=\frac{1}{5}\] Assume $BK=a$ and $HK=b$ , then $KA=5a$ and $KD = 5b$ . Since $KC=KA, KC=5a$ , and since $HD=DC$ $KC=11b$ . Therefore, $a=\frac{11}{5}b$
In $\triangle BDM$ , by the Pythagorean Theorem $BM=\sqrt{36b^2-1}$ . Similarly in $\triangle BAM$ $BM=\sqrt{36a^2-121}$ . So \[\sqrt{36a^2-121}=\sqrt{36b^2-1}\] Since $a=\frac{11}{5}b$ , we have $b=\frac{5\sqrt{5}}{12}$ and $a=\frac{11\sqrt{5}}{12}$ . Consequently, $BM=\frac{11}{2}$ and $AB=\frac{11\sqrt{5}}{2}$ . Thus, the perimeter of $\triangle ABC$ is $11+\sqrt{605}$ , and the answer is $\boxed{616}$ | 616 |
6,754 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_10 | 1 | What is the largest positive integer that is not the sum of a positive integral multiple of $42$ and a positive composite integer? | Let our answer be $n$ . Write $n = 42a + b$ , where $a, b$ are positive integers and $0 \leq b < 42$ . Then note that $b, b + 42, ... , b + 42(a-1)$ are all primes.
If $b$ is $0\mod{5}$ , then $b = 5$ because $5$ is the only prime divisible by $5$ . We get $n = 215$ as our largest possibility in this case.
If $b$ is $1\mod{5}$ , then $b + 2 \times 42$ is divisible by $5$ and thus $a \leq 2$ . Thus, $n \leq 3 \times 42 = 126 < 215$
If $b$ is $2\mod{5}$ , then $b + 4 \times 42$ is divisible by $5$ and thus $a \leq 4$ . Thus, $n \leq 5 \times 42 = 210 < 215$
If $b$ is $3\mod{5}$ , then $b + 1 \times 42$ is divisible by $5$ and thus $a = 1$ . Thus, $n \leq 2 \times 42 = 84 < 215$
If $b$ is $4\mod{5}$ , then $b + 3 \times 42$ is divisible by $5$ and thus $a \leq 3$ . Thus, $n \leq 4 \times 42 = 168 < 215$
Our answer is $\boxed{215}$ | 215 |
6,755 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_13 | 1 | Let $f(n)$ be the integer closest to $\sqrt[4]{n}.$ Find $\sum_{k=1}^{1995}\frac 1{f(k)}.$ | This is a pretty easy problem just to bash. Since the max number we can get is $7$ , we just need to test $n$ values for $1.5,2.5,3.5,4.5,5.5$ and $6.5$ . Then just do how many numbers there are times $\frac{1}{\lfloor n \rfloor}$ , which should be $5+17+37+65+101+145+30 = \boxed{400}$ | 400 |
6,756 | https://artofproblemsolving.com/wiki/index.php/1995_AIME_Problems/Problem_14 | 1 | In a circle of radius $42$ , two chords of length $78$ intersect at a point whose distance from the center is $18$ . The two chords divide the interior of the circle into four regions. Two of these regions are bordered by segments of unequal lengths, and the area of either of them can be expressed uniquely in the form $m\pi-n\sqrt{d},$ where $m, n,$ and $d_{}$ are positive integers and $d_{}$ is not divisible by the square of any prime number. Find $m+n+d.$ | Let the center of the circle be $O$ , and the two chords be $\overline{AB}, \overline{CD}$ and intersecting at $E$ , such that $AE = CE < BE = DE$ . Let $F$ be the midpoint of $\overline{AB}$ . Then $\overline{OF} \perp \overline{AB}$
By the Pythagorean Theorem $OF = \sqrt{OB^2 - BF^2} = \sqrt{42^2 - 39^2} = 9\sqrt{3}$ , and $EF = \sqrt{OE^2 - OF^2} = 9$ . Then $OEF$ is a $30-60-90$ right triangle , so $\angle OEB = \angle OED = 60^{\circ}$ . Thus $\angle BEC = 60^{\circ}$ , and by the Law of Cosines
It follows that $\triangle BCO$ is an equilateral triangle , so $\angle BOC = 60^{\circ}$ . The desired area can be broken up into two regions, $\triangle BCE$ and the region bounded by $\overline{BC}$ and minor arc $\stackrel{\frown}{BC}$ . The former can be found by Heron's formula to be $[BCE] = \sqrt{60(60-48)(60-42)(60-30)} = 360\sqrt{3}$ . The latter is the difference between the area of sector $BOC$ and the equilateral $\triangle BOC$ , or $\frac{1}{6}\pi (42)^2 - \frac{42^2 \sqrt{3}}{4} = 294\pi - 441\sqrt{3}$
Thus, the desired area is $360\sqrt{3} + 294\pi - 441\sqrt{3} = 294\pi - 81\sqrt{3}$ , and $m+n+d = \boxed{378}$ | 378 |
6,757 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_2 | 1 | A circle with diameter $\overline{PQ}$ of length 10 is internally tangent at $P$ to a circle of radius 20. Square $ABCD$ is constructed with $A$ and $B$ on the larger circle, $\overline{CD}$ tangent at $Q$ to the smaller circle, and the smaller circle outside $ABCD$ . The length of $\overline{AB}$ can be written in the form $m + \sqrt{n}$ , where $m$ and $n$ are integers. Find $m + n$
1994 AIME Problem 2.png
Note: The diagram was not given during the actual contest. | 1994 AIME Problem 2 - Solution.png
Call the center of the larger circle $O$ . Extend the diameter $\overline{PQ}$ to the other side of the square (at point $E$ ), and draw $\overline{AO}$ . We now have a right triangle , with hypotenuse of length $20$ . Since $OQ = OP - PQ = 20 - 10 = 10$ , we know that $OE = AB - OQ = AB - 10$ . The other leg, $AE$ , is just $\frac 12 AB$
Apply the Pythagorean Theorem
The quadratic formula shows that the answer is $\frac{16 \pm \sqrt{16^2 + 4 \cdot 240}}{2} = 8 \pm \sqrt{304}$ . Discard the negative root, so our answer is $8 + 304 = \boxed{312}$ | 312 |
6,758 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_3 | 1 | The function $f_{}^{}$ has the property that, for each real number $x,\,$
If $f(19)=94,\,$ what is the remainder when $f(94)\,$ is divided by $1000$ | \begin{align*}f(94)&=94^2-f(93)=94^2-93^2+f(92)=94^2-93^2+92^2-f(91)=\cdots \\ &= (94^2-93^2) + (92^2-91^2) +\cdots+ (22^2-21^2)+ 20^2-f(19) \\ &= 94+93+\cdots+21+400-94 \\ &= 4561 \end{align*}
So, the remainder is $\boxed{561}$ | 561 |
6,759 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_3 | 2 | The function $f_{}^{}$ has the property that, for each real number $x,\,$
If $f(19)=94,\,$ what is the remainder when $f(94)\,$ is divided by $1000$ | Those familiar with triangular numbers and some of their properties will quickly recognize the equation given in the problem. It is well-known (and easy to show) that the sum of two consecutive triangular numbers is a perfect square; that is, \[T_{n-1} + T_n = n^2,\] where $T_n = 1+2+...+n = \frac{n(n+1)}{2}$ is the $n$ th triangular number.
Using this, as well as using the fact that the value of $f(x)$ directly determines the value of $f(x+1)$ and $f(x-1),$ we conclude that $f(n) = T_n + K$ for all odd $n$ and $f(n) = T_n - K$ for all even $n,$ where $K$ is a constant real number.
Since $f(19) = 94$ and $T_{19} = 190,$ we see that $K = -96.$ It follows that $f(94) = T_{94} - (-96) = \frac{94\cdot 95}{2} + 96 = 4561,$ so the answer is $\boxed{561}$ | 561 |
6,760 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_4 | 1 | Find the positive integer $n\,$ for which \[\lfloor\log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor=1994\] (For real $x\,$ $\lfloor x\rfloor\,$ is the greatest integer $\le x.\,$ | Note that if $2^x \le a<2^{x+1}$ for some $x\in\mathbb{Z}$ , then $\lfloor\log_2{a}\rfloor=\log_2{2^{x}}=x$
Thus, there are $2^{x+1}-2^{x}=2^{x}$ integers $a$ such that $\lfloor\log_2{a}\rfloor=x$ . So the sum of $\lfloor\log_2{a}\rfloor$ for all such $a$ is $x\cdot2^x$
Let $k$ be the integer such that $2^k \le n<2^{k+1}$ . So for each integer $j<k$ , there are $2^j$ integers $a\le n$ such that $\lfloor\log_2{a}\rfloor=j$ , and there are $n-2^k+1$ such integers such that $\lfloor\log_2{a}\rfloor=k$
Therefore, $\lfloor\log_2{1}\rfloor+\lfloor\log_2{2}\rfloor+\lfloor\log_2{3}\rfloor+\cdots+\lfloor\log_2{n}\rfloor= \sum_{j=0}^{k-1}(j\cdot2^j) + k(n-2^k+1) = 1994$
Through computation: $\sum_{j=0}^{7}(j\cdot2^j)=1538<1994$ and $\sum_{j=0}^{8}(j\cdot2^j)=3586>1994$ . Thus, $k=8$
So, $\sum_{j=0}^{k-1}(j\cdot2^j) + k(n-2^k+1) = 1538+8(n-2^8+1)=1994 \Rightarrow n = \boxed{312}$ | 312 |
6,761 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_5 | 1 | Given a positive integer $n\,$ , let $p(n)\,$ be the product of the non-zero digits of $n\,$ . (If $n\,$ has only one digits, then $p(n)\,$ is equal to that digit.) Let
What is the largest prime factor of $S\,$ | Suppose we write each number in the form of a three-digit number (so $5 \equiv 005$ ), and since our $p(n)$ ignores all of the zero-digits, replace all of the $0$ s with $1$ s. Now note that in the expansion of
we cover every permutation of every product of $3$ digits, including the case where that first $1$ represents the replaced $0$ s. However, since our list does not include $000$ , we have to subtract $1$ . Thus, our answer is the largest prime factor of $(1+1+2+3+\cdots +9)^3 - 1 = 46^3 - 1 = (46-1)(46^2 + 46 + 1) = 3^3 \cdot 5 \cdot 7 \cdot \boxed{103}$ | 103 |
6,762 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_5 | 2 | Given a positive integer $n\,$ , let $p(n)\,$ be the product of the non-zero digits of $n\,$ . (If $n\,$ has only one digits, then $p(n)\,$ is equal to that digit.) Let
What is the largest prime factor of $S\,$ | Note that $p(1)=p(11), p(2)=p(12), p(3)=p(13), \cdots p(19)=p(9)$ , and $p(37)=3p(7)$ . So $p(10)+p(11)+p(12)+\cdots +p(19)=46$ $p(10)+p(11)+\cdots +p(99)=46*45=2070$ . We add $p(1)+p(2)+p(3)+\cdots +p(10)=45$ to get 2115. When we add a digit we multiply the sum by that digit. Thus $2115\cdot (1+1+2+3+4+5+6+7+8+9)=2115\cdot 46=47\cdot 45\cdot 46$ . But we didn't count 100, 200, 300, ..., 900. We add another 45 to get $45\cdot 2163$ . The largest prime factor of that is $\boxed{103}$ | 103 |
6,763 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_6 | 1 | The graphs of the equations
are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.\,$ These 63 lines cut part of the plane into equilateral triangles of side length $\tfrac{2}{\sqrt{3}}.\,$ How many such triangles are formed? | We note that the lines partition the hexagon of the six extremal lines into disjoint unit regular triangles, and forms a series of unit regular triangles along the edge of the hexagon.
[asy] size(200); picture pica, picb, picc; int i; for(i=-10;i<=10;++i){ if((i%10) == 0){draw(pica,(-20/sqrt(3)-abs((0,i))/sqrt(3),i)--(20/sqrt(3)+abs((0,i))/sqrt(3),i),black+0.7);} else{draw(pica,(-20/sqrt(3)-abs((0,i))/sqrt(3),i)--(20/sqrt(3)+abs((0,i))/sqrt(3),i));} } picb = rotate(120,origin)*pica; picc = rotate(240,origin)*pica; add(pica);add(picb);add(picc); [/asy]
Solving the above equations for $k=\pm 10$ , we see that the hexagon in question is regular, with side length $\frac{20}{\sqrt{3}}$ . Then, the number of triangles within the hexagon is simply the ratio of the area of the hexagon to the area of a regular triangle. Since the ratio of the area of two similar figures is the square of the ratio of their side lengths, we see that the ratio of the area of one of the six equilateral triangles composing the regular hexagon to the area of a unit regular triangle is just $\left(\frac{20/\sqrt{3}}{2/\sqrt{3}}\right)^2 = 100$ . Thus, the total number of unit triangles is $6 \times 100 = 600$
There are $6 \cdot 10$ equilateral triangles formed by lines on the edges of the hexagon. Thus, our answer is $600+60 = \boxed{660}$ | 660 |
6,764 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_6 | 2 | The graphs of the equations
are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.\,$ These 63 lines cut part of the plane into equilateral triangles of side length $\tfrac{2}{\sqrt{3}}.\,$ How many such triangles are formed? | There are three types of lines: horizontal, upward-slanting diagonal, and downward-slanting diagonal. There are $21$ of each type of line, and a unit equilateral triangle is determined by exactly one of each type of line. Given an upward-slanting diagonal and a downward-slanting diagonal, they determine exactly two unit equilateral triangles as shown below. [asy] size(60); pair u=rotate(60)*(1,0),d=rotate(-60)*(1,0),h=(1,0); draw((0,0)--4*u^^-2*h+4*u--(-2*h+4*u+4*d)); draw(u--2*u+d,dotted); draw(3*u--3*u-h,dotted); [/asy] Therefore, if all horizontal lines are drawn, there will be a total of $2\cdot 21^2=882$ unit equilateral triangles. Of course, we only draw $21$ horizontal lines, so we are overcounting the triangles that are caused by the undrawn horizontal lines. In the below diagram, we draw the diagonal lines and the highest and lowest horizontal lines. [asy] size(200); pair u=rotate(60)*(2/sqrt(3),0),d=rotate(-60)*(2/sqrt(3),0),h=(2/sqrt(3),0); for (int i=0;i<21;++i) {path v=(-20/sqrt(3),0)-2*u+i*u--(0,20)--(20/sqrt(3),0)+2*d-i*d;draw(shift(0,-2*i)*v);} for (int i=0;i<21;++i) {path v=rotate(180)*((-20/sqrt(3),0)-2*u+i*u--(0,20)--(20/sqrt(3),0)+2*d-i*d);draw(shift(0,2*i)*v);} draw((-15,-10)--(15,-10)); draw((-15,10)--(15,10)); [/asy]
We see that the lines $y=-21,-20,\dots, -11$ and $y=11,12,\dots,21$ would complete several of the $882$ unit equilateral triangles. In fact, we can see that the lines $y=-21,-20,\dots,-11$ complete $1,2,(1+3),(2+4),(3+5),(4+6),\dots,(9+11)$ triangles, or $111$ triangles. The positive horizontal lines complete the same number of triangles, hence the answer is $882-2\cdot 111=\boxed{660}$ | 660 |
6,765 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_6 | 3 | The graphs of the equations
are drawn in the coordinate plane for $k=-10,-9,-8,\ldots,9,10.\,$ These 63 lines cut part of the plane into equilateral triangles of side length $\tfrac{2}{\sqrt{3}}.\,$ How many such triangles are formed? | Picturing the diagram in your head should give you an illustration similar to the one above. The distance from parallel sides of the center hexagon is 20 units, and by extending horizontal lines to the sides of the hexagon. This shows that for every side of the hexagon there are 10 spaces. Therefore the side length of the biggest triangle (imagine one of the overlapping triangles in the Star of David) is 30. The total number of triangles in the hexagon can be found by finding the number of triangles in the extended triangle and subtracting the 3 corner triangles. This gives us $30^2 - 10^2 - 10^2- 10^2 = 600$ . That is the number of triangles in the hexagon. The remaining triangles form in groups of 10 on the exterior of each side. $600 + 6 * 10 = \boxed{660}$ | 660 |
6,766 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_7 | 1 | For certain ordered pairs $(a,b)\,$ of real numbers , the system of equations
has at least one solution, and each solution is an ordered pair $(x,y)\,$ of integers. How many such ordered pairs $(a,b)\,$ are there? | The equation $x^2+y^2=50$ is that of a circle of radius $\sqrt{50}$ , centered at the origin. By testing integers until the left side becomes too big, we see that the lattice points on this circle are $(\pm1,\pm7)$ $(\pm5,\pm5)$ , and $(\pm7,\pm1)$ where the signs are all independent of each other, for a total of $3\cdot 2\cdot 2=12$ lattice points. They are indicated by the blue dots below.
[asy] size(150); draw(circle((0,0),sqrt(50))); draw((1,7)--(-1,-7),red); draw((7,1)--(5,-5), green); dot((0,0)); dot((1,7),blue); dot((1,-7),blue); dot((-1,7),blue); dot((-1,-7),blue); dot((5,5),blue); dot((5,-5),blue); dot((-5,5),blue); dot((-5,-5),blue); dot((7,1),blue); dot((7,-1),blue); dot((-7,1),blue); dot((-7,-1),blue); [/asy]
Since $(x,y)=(0,0)$ yields $a\cdot 0+b\cdot 0=0 \neq 1$ , we know that $ax+by=1$ is the equation of a line that does not pass through the origin. So, we are looking for the number of lines which pass through at least one of the $12$ lattice points on the circle, but do not pass through the origin or through any non-lattice point on the circle. An example is the green line above. It is straightforward to show that a line passes through the origin precisely when there exist two opposite points $(p,q)$ and $(-p,-q)$ through which it passes. And example is the red line above.
There are $\binom{12}{2}=66$ ways to pick two distinct lattice points, and subsequently $66$ distinct lines which pass through two distinct lattice points on the circle. Then we subtract the lines which pass through the origin by noting that the lattice points on the circle can be grouped into opposite pairs $(p,q)$ and $(-p,-q)$ , for a total of $\frac{12}{2}=6$ lines. Finally, we add the $12$ unique tangent lines to the circle at each of the lattice points.
Therefore, our final count of distinct lines which pass through one or two of the lattice points on the circle, but do not pass through the origin, is \[66-6+12=\boxed{72}.\] | 72 |
6,767 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_8 | 1 | The points $(0,0)\,$ $(a,11)\,$ , and $(b,37)\,$ are the vertices of an equilateral triangle. Find the value of $ab\,$ | Consider the points on the complex plane . The point $b+37i$ is then a rotation of $60$ degrees of $a+11i$ about the origin, so:
\[(a+11i)\left(\mathrm{cis}\,60^{\circ}\right) = (a+11i)\left(\frac 12+\frac{\sqrt{3}i}2\right)=b+37i.\]
Equating the real and imaginary parts, we have:
\begin{align*}b&=\frac{a}{2}-\frac{11\sqrt{3}}{2}\\37&=\frac{11}{2}+\frac{a\sqrt{3}}{2} \end{align*}
Solving this system, we find that $a=21\sqrt{3}, b=5\sqrt{3}$ . Thus, the answer is $\boxed{315}$ | 315 |
6,768 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_8 | 2 | The points $(0,0)\,$ $(a,11)\,$ , and $(b,37)\,$ are the vertices of an equilateral triangle. Find the value of $ab\,$ | Using the Pythagorean theorem with these beastly numbers doesn't seem promising. How about properties of equilateral triangles? $\sqrt{3}$ and perpendiculars inspires this solution:
First, drop a perpendicular from $O$ to $AB$ . Call this midpoint of $AB M$ . Thus, $M=\left(\frac{a+b}{2}, 24\right)$ . The vector from $O$ to $M$ is $\left[\frac{a+b}{2}, 24\right]$ . Meanwhile from point $M$ we can use a vector with $\frac{\sqrt{3}}{3}$ the distance; we have to switch the $x$ and $y$ and our displacement is $\left[8\sqrt{3}, \frac{(a+b)\sqrt{3}}{6}\right]$ . (Do you see why we switched $x$ and $y$ due to the rotation of 90 degrees?)
We see this displacement from $M$ to $A$ is $\left[\frac{a-b}{2}, 13\right]$ as well. Equating the two vectors, we get $a+b=26\sqrt{3}$ and $a-b=16\sqrt{3}$ . Therefore, $a=21\sqrt{3}$ and $b=5\sqrt{3}$ . And the answer is $\boxed{315}$ | 315 |
6,769 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_8 | 3 | The points $(0,0)\,$ $(a,11)\,$ , and $(b,37)\,$ are the vertices of an equilateral triangle. Find the value of $ab\,$ | Plot this equilateral triangle on the complex plane.
Translate the equilateral triangle so that its centroid is located at the origin. (The centroid can be found by taking the average of the three vertices of the triangle, which gives $\left(\frac{a+b}{3}, 16i\right)$ . The new coordinates of the equilateral triangle are $\left(-\frac{a+b}{3}-16i\right), \left(a-\frac{a+b}{3}-5i\right), \left(b-\frac{a+b}{3}+21i\right)$ . These three vertices are solutions of a cubic polynomial of form $x^3 + C$ . By Vieta's Formulas, the sum of the paired roots of the cubic polynomial are zero. (Or for the three roots $r_1, r_2,$ and $r_3,$ $\, r_1r_2 + r_2r_3 + r_3r_1 = 0$ .) The vertices of the equilateral triangle represent the roots of a polynomial, so the vertices can be plugged into the above equation. Because both the real and complex components of the equation have to sum to zero, you really have two equations. Multiply out the equation given by Vieta's Formulas and isolate the ones with imaginary components. Simplify that equation, and that gives the equation $5a = 21b.$ Now use the equation with only real parts. This should give you a quadratic $a^2 - ab + b^2 = 1083$ . Use your previously obtained equation to plug in for $a$ and solve for $b$ , which should yield $5\sqrt{3}$ $a$ is then $\frac{21}{5}\sqrt{3}$ . Multiplying $a$ and $b$ yields $\boxed{315}$ | 315 |
6,770 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_8 | 4 | The points $(0,0)\,$ $(a,11)\,$ , and $(b,37)\,$ are the vertices of an equilateral triangle. Find the value of $ab\,$ | Just using the Pythagorean Theorem, we get that $a^2 + 11^2 = (b-a)^2 + 26^2 = b^2 = 37^2$
$a^2 + 121 = b^2 + 1369 ==> a^2 = b^2 + 1248$ . Expanding the second and subtracting the first equation from it we get $b^2 = 2ab - 555$ $b^2 = 2ab - 555 ==> a^2 = 2ab + 693$
We have $b^2 + 1248 = 2b\sqrt{b^2+1248} + 693$
Moving the square root to one side and non square roots to the other we eventually get $b^4 + 1110b^2 + 308025 = 4b^4 + 4992b^2$
$3b^4 + 3882b^2 - 308025 = 0$
This factors to $(3b^2-225)(b^2+1369)$ , so $3b^2 = 225, b = 5\sqrt 3$
Plugging it back in, we find that a = $\sqrt{1323}$ which is $21\sqrt3$ , so the product $ab$ is $\boxed{315}$ | 315 |
6,771 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_9 | 1 | A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,\,$ where $p\,$ and $q\,$ are relatively prime positive integers. Find $p+q.\,$ | Let $P_k$ be the probability of emptying the bag when it has $k$ pairs in it. Let's consider the possible draws for the first three cards:
Therefore, we obtain the recursion $P_k = \frac {3}{2k - 1}P_{k - 1}$ . Iterating this for $k = 6,5,4,3,2$ (obviously $P_1 = 1$ ), we get $\frac {3^5}{11*9*7*5*3} = \frac {9}{385}$ , and $p+q=\boxed{394}$ | 394 |
6,772 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_9 | 2 | A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is $p/q,\,$ where $p\,$ and $q\,$ are relatively prime positive integers. Find $p+q.\,$ | Call the case that we begin with [ABCDEF]. It doesn't matter what letter we choose at first, so WLOG assume we choose A. Now there is BCDEFABCDEF remaining in the bag. We have two cases to consider here.
1. We pick the other A. There's a $\frac{1}{11}$ chance for this to happen. We remain with the case [BCDEF] if this is the case.
2. We pick any other letter that is not an A. There's a $\frac{10}{11}$ chance for this to happen. WLOG, assume we pick the letter B. Now in order for us to continue the game, we must choose either the other A or B. There's a $\frac{2}{10}$ chance for this to happen. WLOG, assume we choose A. Now we have BCDEFCDEF left.
Notice however that in the first case, the probability of emptying the bag with [BCDEF] is the same thing as with BCDEFCDEF, as the only difference is you've removed one of the letters (and it doesn't matter which you chose).
Hence for this case, there is a $\frac{1}{11} + \frac{10}{11}*\frac{2}{10} = \frac{3}{11}$ * [BCDEF] chance to empty the bag.
Continuing this process, we get that:
[BCDEF] = $\frac{3}{9}$ * [CDEF]
[CDEF] = $\frac{3}{7}$ * [DEF]
[DEF] = $\frac{3}{5}$ * [EF]
[EF] = 1 (clearly, since if we are only left with EFEF then we are going to empty the bag).
And hence [ABCDEF] = $1*\frac{3}{5}*\frac{3}{7}*\frac{3}{9}*\frac{3}{11} = \frac{9}{385}$ so our answer is $9+385=\boxed{394}$ | 394 |
6,773 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_10 | 1 | In triangle $ABC,\,$ angle $C$ is a right angle and the altitude from $C\,$ meets $\overline{AB}\,$ at $D.\,$ The lengths of the sides of $\triangle ABC\,$ are integers, $BD=29^3,\,$ and $\cos B=m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. Find $m+n.\,$ | Since $\triangle ABC \sim \triangle CBD$ , we have $\frac{BC}{AB} = \frac{29^3}{BC} \Longrightarrow BC^2 = 29^3 AB$ . It follows that $29^2 | BC$ and $29 | AB$ , so $BC$ and $AB$ are in the form $29^2 x$ and $29 x^2$ , respectively, where x is an integer.
By the Pythagorean Theorem , we find that $AC^2 + BC^2 = AB^2 \Longrightarrow (29^2x)^2 + AC^2 = (29 x^2)^2$ , so $29x | AC$ . Letting $y = AC / 29x$ , we obtain after dividing through by $(29x)^2$ $29^2 = x^2 - y^2 = (x-y)(x+y)$ . As $x,y \in \mathbb{Z}$ , the pairs of factors of $29^2$ are $(1,29^2)(29,29)$ ; clearly $y = \frac{AC}{29x} \neq 0$ , so $x-y = 1, x+y= 29^2$ . Then, $x = \frac{1+29^2}{2} = 421$
Thus, $\cos B = \frac{BC}{AB} = \frac{29^2 x}{29x^2} = \frac{29}{421}$ , and $m+n = \boxed{450}$ | 450 |
6,774 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_10 | 2 | In triangle $ABC,\,$ angle $C$ is a right angle and the altitude from $C\,$ meets $\overline{AB}\,$ at $D.\,$ The lengths of the sides of $\triangle ABC\,$ are integers, $BD=29^3,\,$ and $\cos B=m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. Find $m+n.\,$ | We will solve for $\cos B$ using $\triangle CBD$ , which gives us $\cos B = \frac{29^3}{BC}$ . By the Pythagorean Theorem on $\triangle CBD$ , we have $BC^2 - DC^2 = (BC + DC)(BC - DC) = 29^6$ . Trying out factors of $29^6$ , we can either guess and check or just guess to find that $BC + DC = 29^4$ and $BC - DC = 29^2$ (The other pairs give answers over 999). Adding these, we have $2BC = 29^4 + 29^2$ and $\frac{29^3}{BC} = \frac{2*29^3}{29^2 (29^2 +1)} = \frac{58}{842} = \frac{29}{421}$ , and our answer is $\boxed{450}$ | 450 |
6,775 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_10 | 3 | In triangle $ABC,\,$ angle $C$ is a right angle and the altitude from $C\,$ meets $\overline{AB}\,$ at $D.\,$ The lengths of the sides of $\triangle ABC\,$ are integers, $BD=29^3,\,$ and $\cos B=m/n\,$ , where $m\,$ and $n\,$ are relatively prime positive integers. Find $m+n.\,$ | Using similar right triangles, we identify that $CD = \sqrt{AD \cdot BD}$ . Let $AD$ be $29 \cdot k^2$ , to avoid too many radicals, getting $CD = k \cdot 29^2$ . Next we know that $AC = \sqrt{AB \cdot AD}$ and that $BC = \sqrt{AB \cdot BD}$ . Applying the logic with the established values of k, we get $AC = 29k \cdot \sqrt{29^2 + k^2}$ and $BC = 29^2 \cdot \sqrt{29^2 + k^2}$ . Next we look to the integer requirement. Since $k$ is both outside and inside square roots, we know it must be an integer to keep all sides as integers. Let $y$ be $\sqrt{29^2 + k^2}$ , thus $29^2 = y^2 - k^2$ , and $29^2 = (y + k)(y - k)$ . Since $29$ is prime, and $k$ cannot be zero, we find $k = 420$ and $y = 421$ as the smallest integers satisfying this quadratic Diophantine equation. Then, since $cos B$ $\frac{29}{\sqrt{29^2 + k^2}}$ . Plugging in we get $cos B = \frac{29}{421}$ , thus our answer is $\boxed{450}$ | 450 |
6,776 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_11 | 2 | Ninety-four bricks, each measuring $4''\times10''\times19'',$ are to be stacked one on top of another to form a tower 94 bricks tall. Each brick can be oriented so it contributes $4''\,$ or $10''\,$ or $19''\,$ to the total height of the tower. How many different tower heights can be achieved using all ninety-four of the bricks? | Using bricks of dimensions $4''\times10''\times19''$ is comparable to using bricks of dimensions $0''\times6''\times15''$ which is comparable to using bricks of dimensions $0''\times2''\times5''$ . Using 5 bricks of height $2''$ can be replaced by using 2 bricks of height $5''$ and 3 bricks of height $0''$
It follows that all tower heights can be made by using 4 or fewer bricks of height $2''$ . There are $95+94+93+92+91=465$ ways to build a tower using 4 or fewer bricks of height $2''$ . Taking the heights $\mod 5$ , we see that towers using a different number of bricks of height $2''$ have unequal heights. Thus, all of the $\boxed{465}$ tower heights are different. | 465 |
6,777 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_12 | 1 | A fenced, rectangular field measures $24$ meters by $52$ meters. An agricultural researcher has 1994 meters of fence that can be used for internal fencing to partition the field into congruent, square test plots. The entire field must be partitioned, and the sides of the squares must be parallel to the edges of the field. What is the largest number of square test plots into which the field can be partitioned using all or some of the 1994 meters of fence? | Suppose there are $n$ squares in every column of the grid, so there are $\frac{52}{24}n = \frac {13}6n$ squares in every row. Then $6|n$ , and our goal is to maximize the value of $n$
Each vertical fence has length $24$ , and there are $\frac{13}{6}n - 1$ vertical fences; each horizontal fence has length $52$ , and there are $n-1$ such fences. Then the total length of the internal fencing is $24\left(\frac{13n}{6}-1\right) + 52(n-1) = 104n - 76 \le 1994 \Longrightarrow n \le \frac{1035}{52} \approx 19.9$ , so $n \le 19$ . The largest multiple of $6$ that is $\le 19$ is $n = 18$ , which we can easily verify works, and the answer is $\frac{13}{6}n^2 = \boxed{702}$ | 702 |
6,778 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_12 | 2 | A fenced, rectangular field measures $24$ meters by $52$ meters. An agricultural researcher has 1994 meters of fence that can be used for internal fencing to partition the field into congruent, square test plots. The entire field must be partitioned, and the sides of the squares must be parallel to the edges of the field. What is the largest number of square test plots into which the field can be partitioned using all or some of the 1994 meters of fence? | Assume each partitioned square has a side length of $1$ (just so we can get a clear image of what the formula will look like). The amount of internal fencing that is required to partition the field is clearly $52*(24+1) + 24(52+1)$ . (If you are confused, just draw the square out). This is clearly greater than $1994$ , so the actual side length that we are looking for is greater than $1$
Now we can convert this into an equation. The equation is simply $(\frac{52}{x})(\frac{24}{x}+1) + (\frac{24}{x})(\frac{52}{x}+1)$ (The intutition comes from considering partioning the field into side lengths of $1$ and then partitioning those squares). This is equivalent to $\frac{2496}{x^2} + \frac{76}{x}$ , which should be less than or equal to $1994$
Now we can just find possible lengths of the square that are greater than $1$ and test them out. A viable side length would mean that $\frac{24}{x}, \frac{52}{x} \in$ N. Since $\gcd(24,52) = 4$ , then the smallest value greater than $1$ that we satisfies the conditions has $4$ in the numerator, and hence $3$ in the denominator. Test out $x=\frac{4}{3}$ . This will equate to something less than $1994$ , and hence the smallest square length that is plausible is $\frac{4}{3}$
Now the rest is elementary, we do $\frac{52}{\frac{4}{3}} * \frac{24}{\frac{4}{3}} \Rightarrow 39*18 = \boxed{702}$ | 702 |
6,779 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_13 | 1 | The equation
has 10 complex roots $r_1, \overline{r_1}, r_2, \overline{r_2}, r_3, \overline{r_3}, r_4, \overline{r_4}, r_5, \overline{r_5},\,$ where the bar denotes complex conjugation. Find the value of | Let $t = 1/x$ . After multiplying the equation by $t^{10}$ $1 + (13 - t)^{10} = 0\Rightarrow (13 - t)^{10} = - 1$
Using DeMoivre, $13 - t = \text{cis}\left(\frac {(2k + 1)\pi}{10}\right)$ where $k$ is an integer between $0$ and $9$
$t = 13 - \text{cis}\left(\frac {(2k + 1)\pi}{10}\right) \Rightarrow \bar{t} = 13 - \text{cis}\left(-\frac {(2k + 1)\pi}{10}\right)$
Since $\text{cis}(\theta) + \text{cis}(-\theta) = 2\cos(\theta)$ $t\bar{t} = 170 - 26\cos \left(\frac {(2k + 1)\pi}{10}\right)$ after expanding. Here $k$ ranges from 0 to 4 because two angles which sum to $2\pi$ are involved in the product.
The expression to find is $\sum t\bar{t} = 850 - 26\sum_{k = 0}^4 \cos \frac {(2k + 1)\pi}{10}$
But $\cos \frac {\pi}{10} + \cos \frac {9\pi}{10} = \cos \frac {3\pi}{10} + \cos \frac {7\pi}{10} = \cos \frac {\pi}{2} = 0$ so the sum is $\boxed{850}$ | 850 |
6,780 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_13 | 2 | The equation
has 10 complex roots $r_1, \overline{r_1}, r_2, \overline{r_2}, r_3, \overline{r_3}, r_4, \overline{r_4}, r_5, \overline{r_5},\,$ where the bar denotes complex conjugation. Find the value of | Divide both sides by $x^{10}$ to get \[1 + \left(13-\dfrac{1}{x}\right)^{10}=0\]
Rearranging: \[\left(13-\dfrac{1}{x}\right)^{10} = -1\]
Thus, $13-\dfrac{1}{x} = \omega$ where $\omega = e^{i(\pi n/5+\pi/10)}$ where $n$ is an integer.
We see that $\dfrac{1}{x}=13-\omega$ . Thus, \[\dfrac{1}{x\overline{x}}=(13\, -\, \omega)(13\, -\, \overline{\omega})=169-13(\omega\, +\, \overline{\omega})\, +\, \omega\overline{\omega}=170\, -\, 13(\omega\, +\, \overline{\omega})\]
Summing over all terms: \[\dfrac{1}{r_1\overline{r_1}}+\cdots + \dfrac{1}{r_5\overline{r_5}} = 5\cdot 170 - 13(e^{i\pi/10}+\cdots +e^{i(9\pi/5+\pi/10)})\]
However, note that $e^{i\pi/10}+\cdots +e^{i(9\pi/5+\pi/10)}=0$ from drawing the numbers on the complex plane, our answer is just \[5\cdot 170=\boxed{850}\] | 850 |
6,781 | https://artofproblemsolving.com/wiki/index.php/1994_AIME_Problems/Problem_15 | 1 | Given a point $P^{}_{}$ on a triangular piece of paper $ABC,\,$ consider the creases that are formed in the paper when $A, B,\,$ and $C\,$ are folded onto $P.\,$ Let us call $P_{}^{}$ a fold point of $\triangle ABC\,$ if these creases, which number three unless $P^{}_{}$ is one of the vertices, do not intersect. Suppose that $AB=36, AC=72,\,$ and $\angle B=90^\circ.\,$ Then the area of the set of all fold points of $\triangle ABC\,$ can be written in the form $q\pi-r\sqrt{s},\,$ where $q, r,\,$ and $s\,$ are positive integers and $s\,$ is not divisible by the square of any prime. What is $q+r+s\,$ | Let $O_{AB}$ be the intersection of the perpendicular bisectors (in other words, the intersections of the creases) of $\overline{PA}$ and $\overline{PB}$ , and so forth. Then $O_{AB}, O_{BC}, O_{CA}$ are, respectively, the circumcenters of $\triangle PAB, PBC, PCA$ . According to the problem statement, the circumcenters of the triangles cannot lie within the interior of the respective triangles, since they are not on the paper. It follows that $\angle APB, \angle BPC, \angle CPA > 90^{\circ}$ ; the locus of each of the respective conditions for $P$ is the region inside the (semi)circles with diameters $\overline{AB}, \overline{BC}, \overline{CA}$
We note that the circle with diameter $AC$ covers the entire triangle because it is the circumcircle of $\triangle ABC$ , so it suffices to take the intersection of the circles about $AB, BC$ . We note that their intersection lies entirely within $\triangle ABC$ (the chord connecting the endpoints of the region is in fact the altitude of $\triangle ABC$ from $B$ ). Thus, the area of the locus of $P$ (shaded region below) is simply the sum of two segments of the circles. If we construct the midpoints of $M_1, M_2 = \overline{AB}, \overline{BC}$ and note that $\triangle M_1BM_2 \sim \triangle ABC$ , we see that thse segments respectively cut a $120^{\circ}$ arc in the circle with radius $18$ and $60^{\circ}$ arc in the circle with radius $18\sqrt{3}$
[asy] pair project(pair X, pair Y, real r){return X+r*(Y-X);} path endptproject(pair X, pair Y, real a, real b){return project(X,Y,a)--project(X,Y,b);} pathpen = linewidth(1); size(250); pen dots = linetype("2 3") + linewidth(0.7), dashes = linetype("8 6")+linewidth(0.7)+blue, bluedots = linetype("1 4") + linewidth(0.7) + blue; pair B = (0,0), A=(36,0), C=(0,36*3^.5), P=D(MP("P",(6,25), NE)), F = D(foot(B,A,C)); D(D(MP("A",A)) -- D(MP("B",B)) -- D(MP("C",C,N)) -- cycle); fill(arc((A+B)/2,18,60,180) -- arc((B+C)/2,18*3^.5,-90,-30) -- cycle, rgb(0.8,0.8,0.8)); D(arc((A+B)/2,18,0,180),dots); D(arc((B+C)/2,18*3^.5,-90,90),dots); D(arc((A+C)/2,36,120,300),dots); D(B--F,dots); D(D((B+C)/2)--F--D((A+B)/2),dots); D(C--P--B,dashes);D(P--A,dashes); pair Fa = bisectorpoint(P,A), Fb = bisectorpoint(P,B), Fc = bisectorpoint(P,C); path La = endptproject((A+P)/2,Fa,20,-30), Lb = endptproject((B+P)/2,Fb,12,-35); D(La,bluedots);D(Lb,bluedots);D(endptproject((C+P)/2,Fc,18,-15),bluedots);D(IP(La,Lb),blue); [/asy]
The diagram shows $P$ outside of the grayed locus; notice that the creases [the dotted blue] intersect within the triangle, which is against the problem conditions. The area of the locus is the sum of two segments of two circles; these segments cut out $120^{\circ}, 60^{\circ}$ angles by simple similarity relations and angle-chasing.
Hence, the answer is, using the $\frac 12 ab\sin C$ definition of triangle area, $\left[\frac{\pi}{3} \cdot 18^2 - \frac{1}{2} \cdot 18^2 \sin \frac{2\pi}{3} \right] + \left[\frac{\pi}{6} \cdot \left(18\sqrt{3}\right)^2 - \frac{1}{2} \cdot (18\sqrt{3})^2 \sin \frac{\pi}{3}\right] = 270\pi - 324\sqrt{3}$ , and $q+r+s = \boxed{597}$ | 597 |
6,782 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_1 | 1 | How many even integers between 4000 and 7000 have four different digits? | The thousands digit is $\in \{4,5,6\}$
Case $1$ : Thousands digit is even
$4, 6$ , two possibilities, then there are only $\frac{10}{2} - 1 = 4$ possibilities for the units digit. This leaves $8$ possible digits for the hundreds and $7$ for the tens places, yielding a total of $2 \cdot 8 \cdot 7 \cdot 4 = 448$
Case $2$ : Thousands digit is odd
$5$ , one possibility, then there are $5$ choices for the units digit, with $8$ digits for the hundreds and $7$ for the tens place. This gives $1 \cdot 8 \cdot 7 \cdot 5= 280$ possibilities.
Together, the solution is $448 + 280 = \boxed{728}$ | 728 |
6,783 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_1 | 2 | How many even integers between 4000 and 7000 have four different digits? | Firstly, we notice that the thousands digit could be $4$ $5$ or $6$ .
Since the parity of the possibilities are different, we cannot cover all cases in one operation. Therefore, we must do casework.
Case $1$
Here we let thousands digit be $4$
4 _ _ _
We take care of restrictions first, and realize that there are 4 choices for the last digit, namely $2$ $6$ $8$ and $0$ .
Now that there are no restrictions we proceed to find that there are $8$ choices for the hundreds digit and $7$ choices for the tens digit. Therefore we have $8 \cdot 7 \cdot 4 = 224$ numbers that satisfy the conditions posed by the problem.
Case $2$
Here we let thousands digit be $5$
5 _ _ _
Again, we take care of restrictions first. This time there are 5 choices for the last digit, which are all the even numbers because 5 is odd.
Now that there are no restrictions we proceed to find that there are $8$ choices for the hundreds digit and $7$ choices for the tens digit. Therefore we have $8 \cdot 7 \cdot 5 = 280$ numbers that satisfy the conditions posed by the problem.
Case $3$
Here we let thousands digit be $6$
6 _ _ _
Once again, we take care of restrictions first. Since 6 is even, there are 4 choices for the last digit, namely $2$ $6$ $8$ and $0$
Now we proceed to find that there are $8$ choices for the hundreds digit and $7$ choices for the tens digit. Therefore we have $8 \cdot 7 \cdot 4 = 224$ numbers that satisfy the conditions posed by the problem.
Now that we have our answers for each possible thousands place digit, we add up our answers and get $224+280+224$ $\boxed{728}$ ~PEKKA | 728 |
6,784 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_2 | 1 | During a recent campaign for office, a candidate made a tour of a country which we assume lies in a plane. On the first day of the tour he went east, on the second day he went north, on the third day west, on the fourth day south, on the fifth day east, etc. If the candidate went $n^{2}_{}/2$ miles on the $n^{\mbox{th}}_{}$ day of this tour, how many miles was he from his starting point at the end of the $40^{\mbox{th}}_{}$ day? | On the first day, the candidate moves $[4(0) + 1]^2/2\ \text{east},\, [4(0) + 2]^2/2\ \text{north},\, [4(0) + 3]^2/2\ \text{west},\, [4(0) + 4]^2/2\ \text{south}$ , and so on. The E/W displacement is thus $1^2 - 3^2 + 5^2 \ldots +37^2 - 39^2 = \left|\sum_{i=0}^9 \frac{(4i+1)^2}{2} - \sum_{i=0}^9 \frac{(4i+3)^2}{2}\right|$ . Applying difference of squares , we see that \begin{align*} \left|\sum_{i=0}^9 \frac{(4i+1)^2 - (4i+3)^2}{2}\right| &= \left|\sum_{i=0}^9 \frac{(4i+1+4i+3)(4i+1-(4i+3))}{2}\right|\\ &= \left|\sum_{i=0}^9 -(8i+4) \right|. \end{align*} The N/S displacement is \[\left|\sum_{i=0}^9 \frac{(4i+2)^2}{2} - \sum_{i=0}^9 \frac{(4i+4)^2}{2}\right| = \left|\sum_{i=0}^9 -(8i+6) \right|.\] Since $\sum_{i=0}^{9} i = \frac{9(10)}{2} = 45$ , the two distances evaluate to $8(45) + 10\cdot 4 = 400$ and $8(45) + 10\cdot 6 = 420$ . By the Pythagorean Theorem , the answer is $\sqrt{400^2 + 420^2} = 29 \cdot 20 = \boxed{580}$ | 580 |
6,785 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_3 | 1 | The table below displays some of the results of last summer's Frostbite Falls Fishing Festival, showing how many contestants caught $n\,$ fish for various values of $n\,$
In the newspaper story covering the event, it was reported that
What was the total number of fish caught during the festival? | Suppose that the number of fish is $x$ and the number of contestants is $y$ . The $y-(9+5+7)=y-21$ fishers that caught $3$ or more fish caught a total of $x - \left(0\cdot(9) + 1\cdot(5) + 2\cdot(7)\right) = x - 19$ fish. Since they averaged $6$ fish,
Similarily, those who caught $12$ or fewer fish averaged $5$ fish per person, so
Solving the two equation system, we find that $y = 175$ and $x = \boxed{943}$ , the answer. | 943 |
6,786 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_3 | 2 | The table below displays some of the results of last summer's Frostbite Falls Fishing Festival, showing how many contestants caught $n\,$ fish for various values of $n\,$
In the newspaper story covering the event, it was reported that
What was the total number of fish caught during the festival? | Let $f$ be the total number of fish caught by the contestants who didn't catch $0, 1, 2, 3, 13, 14$ , or $15$ fish and let $a$ be the number of contestants who didn't catch $0, 1, 2, 3, 13, 14$ , or $15$ fish. From $\text{(b)}$ , we know that $\frac{69+f+65+28+15}{a+31}=6\implies f=6a+9$ . From $\text{(c)}$ we have $\frac{f+69+14+5}{a+44}=5\implies f=5a+132$ . Using these two equations gets us $a=123$ . Plug this back into the equation to get $f=747$ . Thus, the total number of fish caught is $5+14+69+f+65+28+15=\boxed{943}$ - Heavytoothpaste | 943 |
6,787 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 1 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Let $k = a + d = b + c$ so $d = k-a, b=k-c$ . It follows that $(k-c)c - a(k-a) = (a-c)(a+c-k) = (c-a)(d-c) = 93$ . Hence $(c - a,d - c) = (1,93),(3,31),(31,3),(93,1)$
Solve them in terms of $c$ to get $(a,b,c,d) = (c - 93,c - 92,c,c + 1),$ $(c - 31,c - 28,c,c + 3),$ $(c - 1,c + 92,c,c + 93),$ $(c - 3,c + 28,c,c + 31)$ . The last two solutions don't follow $a < b < c < d$ , so we only need to consider the first two solutions.
The first solution gives us $c - 93\geq 1$ and $c + 1\leq 499$ $\implies 94\leq c\leq 498$ , and the second one gives us $32\leq c\leq 496$
So the total number of such quadruples is $405 + 465 = \boxed{870}$ | 870 |
6,788 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 2 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Let $b = a + m$ and $c = a + m + n$ . From $a + d = b + c$ $d = b + c - a = a + 2m + n$
Substituting $b = a + m$ $c = a + m + n$ , and $d = b + c - a = a + 2m + n$ into $bc - ad = 93$ \[bc - ad = (a + m)(a + m + n) - a(a + 2m + n) = m(m + n). = 93 = 3(31)\] Hence, $(m,n) = (1,92)$ or $(3,28)$
For $(m,n) = (1,92)$ , we know that $0 < a < a + 1 < a + 93 < a + 94 < 500$ , so there are $405$ four-tuples. For $(m,n) = (3,28)$ $0 < a < a + 3 < a + 31 < a + 34 < 500$ , and there are $465$ four-tuples. In total, we have $405 + 465 = \boxed{870}$ four-tuples. | 870 |
6,789 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 3 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Square both sides of the first equation in order to get $bc$ and $ad$ terms, which we can plug $93$ in for. \begin{align*} (a+d)^2 = (b+c)^2 &\implies a^2 + 2ad + d^2 = b^2 + 2bc + c^2 \\ &\implies 2bc-2ad = a^2-b^2 + d^2-c^2 \\ &\implies 2(bc-ad) = (a-b)(a+b)+(d-c)(d+c) \end{align*} We can plug $93$ in for $bc - ad$ to get $186$ on the left side, and also observe that $a-b = c-d$ after rearranging the first equation. Plug in $c-d$ for $a-b$
$186 = (c-d)(a+b) + (d-c)(d+c) \implies 186 = -(d-c)(a+b) + (d-c)(d+c) \implies 186 = (d-c)(d+c-a-b)$
Now observe the possible factors of $186$ , which are $1 \cdot 186, 2\cdot 93, 3 \cdot 62, 6\cdot 31$ $(d-c)$ and $(d+c-a-b)$ must be factors of $186$ , and $(d+c-a-b)$ must be greater than $(d-c)$
$1 \cdot 186$ work, and yields $405$ possible solutions. $2 \cdot 93$ does not work, because if $c-d = 2$ , then $a+b$ must differ by 2 as well, but an odd number $93$ can only result from two numbers of different parity. $c-d$ will be even, and $a+b$ will be even, so $c+d - (a+b)$ must be even. $3 \cdot 62$ works, and yields $465$ possible solutions, while $6 \cdot 31$ fails for the same reasoning above.
Thus, the answer is $405 + 465 = \boxed{870}$ | 870 |
6,790 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 4 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Add the two conditions together to get $a+d+ad+93=b+c+bc$ . Rearranging and factorising with SFFT, $(a+1)(d+1)+93=(b+1)(c+1)$ . This implies that for every quadruple $(a,b,c,d)$ , we can replace $a\longrightarrow a+1$ $b\longrightarrow b+1$ , etc. and this will still produce a valid quadruple. This means, that we can fix $a=1$ , and then just repeatedly add $1$ to get the other quadruples.
Now, our conditions are $b+c=d+1$ and $bc=d+93$ . Replacing $d$ in the first equation, we get $bc-b-c=92$ . Factorising again with SFFT gives $(b-1)(c-1)=93$ . Since $b<c$ , we have two possible cases to consider.
Case 1: $b=2$ $c=94$ . This produces the quadruple $(1,2,94,95)$ , which indeed works.
Case 2: $b=4$ $c=32$ . This produces the quadruple $(1,4,32,35)$ , which indeed works.
Now, for case 1, we can add $1$ to each term exactly $404$ times (until we get the quadruple $(405,406,498,499)$ ), until we violate $d<500$ . This gives $405$ quadruples for case 1.
For case 2, we can add $1$ to each term exactly $464$ times (until we get the quadruple $(465,468,496,499)$ ). this gives $465$ quadruples for case 2.
In conclusion, having exhausted all cases, we can finish. There are hence $405+465=\boxed{870}$ possible quadruples. | 870 |
6,791 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 5 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Let $r = d-c$ . From the equation $a+d = b+c$ , we have \[r = d-c = b-a ,\] so $b = a+r$ and $c = d-r$ . We then have \[93 = (a+r)(d-r) - ad = rd - ra - r^2 = r(d-a-r) .\] Since $c > b$ $d-r > a+r$ , or $d-a-r > r$ . Since the prime factorization of 93 is $3 \cdot 31$ , we must either have $r=1$ and $d-a-r = 93$ , or $r=3$ and $d-a-r = 31$ . We consider these cases separately.
If $r=1$ , then $d-a = 94$ $b= a+1$ , and $c = d-1$ . Thus $d$ can be any integer between 95 and 499, inclusive, and our choice of $d$ determines the four-tuple $(a,b,c,d)$ . We therefore have $499-95+1 = 405$ possibilities in this case.
If $r=3$ , then $d-a = 34$ $b = a+3$ , and $c=d-3$ . Thus $d$ can be any integer between 35 and 499, inclusive, and our choice of $d$ determines the four-tuple $(a,b,c,d)$ , as before. We therefore have $499-35+1 = 465$ possibilities in this case.
Since there are 405 possibilities in the first case and 465 possibilities in the second case, in total there are $405 + 465 = \boxed{870}$ four-tuples. | 870 |
6,792 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_4 | 6 | How many ordered four-tuples of integers $(a,b,c,d)\,$ with $0 < a < b < c < d < 500\,$ satisfy $a + d = b + c\,$ and $bc - ad = 93\,$ | Assume $d = x+m, a = x-m, c = x+n$ , and $b = x-n$ . This clearly satisfies the condition that $a+d = b+c$ since ( $2x = 2x$ ) . Now plug this into $bc-ad = 93$ . You get $(x+n)(x-n) - (x+m)(x-m) = 93 \Rightarrow m^2 - n^2 = 93 \Rightarrow (m-n)(m+n) = 93$
Since $m>n$ (as given by the condition that $a<b<c<d$ ), $m+n>m-n$ and $m$ and $n$ are integers, there are two cases we have to consider since $93 = 3\cdot 31$ . We first have to consider $m-n = 1, m+n = 93$ , and then consider $m-n=3, m+n = 31$
In the first case, we get $m=47, n=46$ and in the second case we get $m=17, n=14$ . Now plug these values (in separate cases) back into $a,b,c,d$ . Since the only restriction is that all numbers have to be greater than $0$ or less than $500$ , we can write two inequalities. Either $x+47 < 500, x-47 > 0$ , or $x+17 < 500, x-17 > 0$ (using the inequalities given by $d$ and $a$ , and since $b$ and $c$ are squeezed in between $d$ and $a$ , we only have to consider these two inequalities).
This gives us either $47 < x < 453$ or $17 < x < 483$ , and using simple counting, there are $405$ values for $x$ in the first case and $465$ values for $x$ in the second case, and hence our answer is $405+465 = \boxed{870}$ | 870 |
6,793 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_5 | 1 | Let $P_0(x) = x^3 + 313x^2 - 77x - 8\,$ . For integers $n \ge 1\,$ , define $P_n(x) = P_{n - 1}(x - n)\,$ . What is the coefficient of $x\,$ in $P_{20}(x)\,$ | Notice that \begin{align*}P_{20}(x) &= P_{19}(x - 20)\\ &= P_{18}((x - 20) - 19)\\ &= P_{17}(((x - 20) - 19) - 18)\\ &= \cdots\\ &= P_0(x - (20 + 19 + 18 + \ldots + 2 + 1)).\end{align*}
Using the formula for the sum of the first $n$ numbers, $1 + 2 + \cdots + 20 = \frac{20(20+1)}{2} = 210$ . Therefore, \[P_{20}(x) = P_0(x - 210).\]
Substituting $x - 210$ into the function definition, we get $P_0(x-210) = (x - 210)^3 + 313(x - 210)^2 - 77(x - 210) - 8$ . We only need the coefficients of the linear terms, which we can find by the binomial theorem
Adding up the coefficients, we get $630 \cdot 210 - 626 \cdot 210 - 77 = \boxed{763}$ | 763 |
6,794 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_5 | 2 | Let $P_0(x) = x^3 + 313x^2 - 77x - 8\,$ . For integers $n \ge 1\,$ , define $P_n(x) = P_{n - 1}(x - n)\,$ . What is the coefficient of $x\,$ in $P_{20}(x)\,$ | Notice the transformation of $P_{n-1}(x)\to P_n(x)$ adds $n$ to the roots. Thus, all these transformations will take the roots and add $1+2+\cdots+20=210$ to them. (Indeed, this is very easy to check in general.)
Let the roots be $r_1,r_2,r_3.$ Then $P_{20}(x)=(x-r_1-210)(x-r_2-210)(x-r_3-210).$ By Vieta's/expanding/common sense, you see the coefficient of $x$ is $(r_1+210)(r_2+210)+(r_2+210)(r_3+210)+(r_3+210)(r_1+210).$ Expanding yields $r_1r_2+r_2r_3+r_3r_1+210\cdot 2(r_1+r_2+r_3)+3\cdot 210^2.$ Using Vieta's (again) and plugging stuff in yields $-77+210\cdot 2\cdot -313+3\cdot 210^2=\boxed{763}.$ | 763 |
6,795 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_6 | 1 | What is the smallest positive integer that can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers? | Let the desired integer be $n$ . From the information given, it can be determined that, for positive integers $a, \ b, \ c$
$n = 9a + 36 = 10b + 45 = 11c + 55$
This can be rewritten as the following congruences:
$n \equiv 0 \pmod{9}$
$n \equiv 5 \pmod{10}$
$n \equiv 0 \pmod{11}$
Since 9 and 11 are relatively prime, n is a multiple of 99. It can then easily be determined that the smallest multiple of 99 with a units digit 5 (this can be interpreted from the 2nd congruence) is $\boxed{495}$ | 495 |
6,796 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_6 | 2 | What is the smallest positive integer that can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers? | Let $n$ be the desired integer. From the given information, we have \begin{align*}9x &= a \\ 11y &= a \\ 10z + 5 &= a, \end{align*} here, $x,$ and $y$ are the middle terms of the sequence of 9 and 11 numbers, respectively. Similarly, we have $z$ as the 4th term of the sequence. Since, $a$ is a multiple of $9$ and $11,$ it is also a multiple of $\text{lcm}[9,11]=99.$ Hence, $a=99m,$ for some $m.$ So, we have $10z + 5 = 99m.$ It follows that $99(5) = \boxed{495}$ is the smallest integer that can be represented in such a way. | 495 |
6,797 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_6 | 3 | What is the smallest positive integer that can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers? | By the method in Solution 1, we find that the number $n$ can be written as $9a+36=10b+45=11c+55$ for some integers $a,b,c$ . From this, we can see that $n$ must be divisible by 9, 5, and 11. This means $n$ must be divisible by 495. The only multiples of 495 that are small enough to be AIME answers are 495 and 990. From the second of the three expressions above, we can see that $n$ cannot be divisible by 10, so $n$ must equal $\boxed{495}$ . Solution by Zeroman. | 495 |
6,798 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_6 | 4 | What is the smallest positive integer that can be expressed as the sum of nine consecutive integers, the sum of ten consecutive integers, and the sum of eleven consecutive integers? | First note that the integer clearly must be divisible by $9$ and $11$ since we can use the "let the middle number be x" trick. Let the number be $99k$ for some integer $k.$ Now let the $10$ numbers be $x,x+1, \cdots x+9.$ We have $10x+45 = 99k.$ Taking mod $5$ yields $k \equiv 0 \pmod{5}.$ Since $k$ is positive, we take $k=5$ thus obtaining $99 \cdot 5 = \boxed{495}$ as our answer. | 495 |
6,799 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_8 | 1 | Let $S\,$ be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of $S\,$ so that the union of the two subsets is $S\,$ ? The order of selection does not matter; for example, the pair of subsets $\{a, c\},\{b, c, d, e, f\}$ represents the same selection as the pair $\{b, c, d, e, f\},\{a, c\}.$ | Call the two subsets $m$ and $n.$ For each of the elements in $S,$ we can assign it to either $m,n,$ or both. This gives us $3^6$ possible methods of selection. However, because the order of the subsets does not matter, each possible selection is double counted, except the case where both $m$ and $n$ contain all $6$ elements of $S.$ So our final answer is then $\frac {3^6 - 1}{2} + 1 = \boxed{365}.$ | 365 |
6,800 | https://artofproblemsolving.com/wiki/index.php/1993_AIME_Problems/Problem_8 | 2 | Let $S\,$ be a set with six elements. In how many different ways can one select two not necessarily distinct subsets of $S\,$ so that the union of the two subsets is $S\,$ ? The order of selection does not matter; for example, the pair of subsets $\{a, c\},\{b, c, d, e, f\}$ represents the same selection as the pair $\{b, c, d, e, f\},\{a, c\}.$ | Given one of ${6 \choose k}$ subsets with $k$ elements, the other also has $2^k$ possibilities; this is because it must contain all of the "missing" $n - k$ elements and thus has a choice over the remaining $k.$ We want $\sum_{k = 0}^6 {6 \choose k}2^k = (2 + 1)^6 = 729$ by the Binomial Theorem. But the order of the sets doesn't matter, so we get $\dfrac{729 - 1}{2} + 1 = \boxed{365}.$ | 365 |
Subsets and Splits