id
int64 1
7.14k
| link
stringlengths 75
84
| no
int64 1
14
| problem
stringlengths 14
5.33k
| solution
stringlengths 21
6.43k
| answer
int64 0
999
|
|---|---|---|---|---|---|
5,601
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 2
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
Similar to the previous solution, we plot the triangle and cut it in half. Then, we find the number of boundary points, which is $101+51+51-3$ , or just $200$ . Using Pick's theorem, we know that the area of the half-triangle, which is $2500$ , is just $I+100-1$ . That means that there are $2401$ interior points, plus $200$ boundary points, which is $2601$ . However, $(0,0)$ does not work, so the answer is \[\boxed{600}.\]
| 600
|
5,602
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 3
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
Notice that for $x^2+ax+b$ to be true, for every $a$ $b$ will always be the product of the possibilities of how to add two integers to $a$ . For example, if $a=3$ $b$ will be the product of $(3,0)$ and $(2,1)$ , as those two sets are the only possibilities of adding two integers to $a$ . Note that order does not matter. If we just do some simple casework, we find out that:
if $a$ is odd, there will always be $\left\lceil\frac{a}{2}\right\rceil$ $\left(\text{which is also }\frac{a+1}{2}\right)$ possibilities of adding two integers to $a$
if $a$ is even, there will always be $\frac{a}{2}+1$ possibilities of adding two integers to $a$
Using the casework, we have $1+2+2+3+3+...50+50+51$ possibilities. This will mean that the answer is \[\frac{(1+51)\cdot100}{2}\Rightarrow52\cdot50=2600\] possibilities.
Thus, our solution is $2600\bmod {1000}\equiv\boxed{600}$
| 600
|
5,603
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 4
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
We see the pattern $1, 2; 2, 3; 3, 4; ...$ . There are 50 pairs of $i, i+1$ in this pattern, and each pair sums to $2i+1$ . So the pattern condenses to $3, 5, 7, ...$ for 50 terms. This is just $1+3+5+...$ for 51 terms, minus $1$ , or $51^2-1=2601-1=2600\implies\boxed{600}$
| 600
|
5,604
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 5
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
The following link is the URL to the graph I drew showing the relationship between a-values and b-values http://artofproblemsolving.com/wiki/index.php?title=File:Screen_Shot_2018-04-30_at_8.15.00_PM.png#file
The pattern continues until $a=100$ , and in total, there are $49$ pairs of a-value with the same amount of b-values. The two lone a-values without a pair are, the ( $a=1$ , amount of b-values=1) in the beginning, and ( $a=100$ , amount of b-values=51) in the end.
Then, we add numbers from the opposite ends of the spectrum, and quickly notice that there are $50$ pairs each with a sum of $52$ $52\cdot50$ gives $2600$ ordered pairs:
$1+51, 2+50, 2+50, 3+49, 3+49, 4+48, 4+48…$
When divided by $1000$ , it gives the remainder $\boxed{600}$ , the answer.
| 600
|
5,605
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 6
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
Let's say that the quadratic $x^2 + ax + b$ can be factored into $(x+c)(x+d)$ where $c$ and $d$ are non-negative numbers. We can't have both of them zero because $a$ would not be within bounds. Also, $c+d \leq 100$ . Assume that $c < d$ $d$ can be written as $c + x$ where $x \geq 0$ . Therefore, $c + d = 2c + x \leq 100$ . To find the amount of ordered pairs, we must consider how many values of $x$ are possible for each value of $c$ . The amount of possible values of $x$ is given by $100 - 2c + 1$ . The $+1$ is the case where $c = d$ . We don't include the case where $c = d = 0$ , so we must subtract a case from our total. The amount of ordered pairs of $(a,b)$ is: \[\left(\sum_{c=0}^{50} (100 - 2c + 1)\right) - 1\] This is an arithmetic progression. \[\frac{(101 + 1)(51)}{2} - 1 = 2601 - 1 = 2600\] When divided by $1000$ , it gives the remainder $\boxed{600}$
| 600
|
5,606
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 7
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
By Vietas, the sum of the roots is $-a$ and the product is $b$ . Therefore, both roots are nonpositive. For each value of $a$ from $1$ to $100$ , the number of $b$ values is the number of ways to sum two numbers between $0$ and $a-1$ inclusive to $a$ . This is just $1 + 2 + 2 + 3 + 3 +... 50 + 50 + 51 = 2600$ . Thus, the answer is $\boxed{600}$
| 600
|
5,607
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_1
| 8
|
Let $S$ be the number of ordered pairs of integers $(a,b)$ with $1 \leq a \leq 100$ and $b \geq 0$ such that the polynomial $x^2+ax+b$ can be factored into the product of two (not necessarily distinct) linear factors with integer coefficients. Find the remainder when $S$ is divided by $1000$
|
Similar to solution 1 we plot the triangle and half it. From dividing the triangle in half we are removing the other half of answers that are just flipped coordinates. We notice that we can measure the length of the longest side of the half triangle which is just from $0$ to $100$ , so the number of points on that line is is $101$ . The next row has length $99$ , the one after that has length $97$ , and so on. We simply add this arithmetic series of odd integers $101+99+97+...+1$ .
This is \[\frac{(101+1)(51)}{2} = 2601\] Or you can notice that this is the sum of the first $51$ odd terms, which is just $51^2 = 2601$ .
However, $(0,0)$ is the singular coordinate that does not work, so the answer is $(2601-1)\bmod {1000}\equiv\boxed{600}$
| 600
|
5,608
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_2
| 1
|
The number $n$ can be written in base $14$ as $\underline{a}\text{ }\underline{b}\text{ }\underline{c}$ , can be written in base $15$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{b}$ , and can be written in base $6$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{a}\text{ }\underline{c}\text{ }$ , where $a > 0$ . Find the base- $10$ representation of $n$
|
We have these equations: $196a+14b+c=225a+15c+b=222a+37c$ .
Taking the last two we get $3a+b=22c$ . Because $c \neq 0$ otherwise $a \ngtr 0$ , and $a \leq 5$ $c=1$
Then we know $3a+b=22$ .
Taking the first two equations we see that $29a+14c=13b$ . Combining the two gives $a=4, b=10, c=1$ . Then we see that $222 \times 4+37 \times1=\boxed{925}$
| 925
|
5,609
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_2
| 2
|
The number $n$ can be written in base $14$ as $\underline{a}\text{ }\underline{b}\text{ }\underline{c}$ , can be written in base $15$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{b}$ , and can be written in base $6$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{a}\text{ }\underline{c}\text{ }$ , where $a > 0$ . Find the base- $10$ representation of $n$
|
We know that $196a+14b+c=225a+15c+b=222a+37c$ . Combining the first and third equations give that $196a+14b+c=222a+37c$ , or \[7b=13a+18c\] The second and third gives $222a+37c=225a+15c+b$ , or \[22c-3a=b\] \[154c-21a=7b=13a+18c\] \[4c=a\] We can have $a=4,8,12$ , but only $a=4$ falls within the possible digits of base $6$ . Thus $a=4$ $c=1$ , and thus you can find $b$ which equals $10$ . Thus, our answer is $4\cdot225+1\cdot15+10=\boxed{925}$
| 925
|
5,610
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_2
| 3
|
The number $n$ can be written in base $14$ as $\underline{a}\text{ }\underline{b}\text{ }\underline{c}$ , can be written in base $15$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{b}$ , and can be written in base $6$ as $\underline{a}\text{ }\underline{c}\text{ }\underline{a}\text{ }\underline{c}\text{ }$ , where $a > 0$ . Find the base- $10$ representation of $n$
|
We're given that $196a+14b+c=225a+15c+b=222a+37c.$ By taking the difference of the first $2$ equalities, we receive $29a+14c=13b.$ Taking $\pmod{13}$ , we receive $3a+c \equiv 0 \pmod{13}.$ We receive the following cases: $(a,c)=(4,1)$ or $(3,4).$ (Note that $(2,7)$ doesn't work since $a,c<6$ by third condition). We can just check these two, and find that $(a,b,c)=(4,10,1),$ and just plugging in $(a,c)$ into the third expression we receive $888+37=\boxed{925}.$
| 925
|
5,611
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_3
| 2
|
Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
Our probability will be $\dfrac{\text{number of "happy" configurations of cards}}{\text{total number of configurations of cards}}.$
First of all, we have $10$ choices for the first card, $9$ choices for the second card, $8$ choices for the third card, $7$ choices for the fourth card, and $6$ choices for the last card. This gives a total of $10\cdot 9\cdot 8\cdot 7\cdot 6$ possible ways for five cards to be chosen.
Finding the number of configurations that make Kathy happy is a more difficult task, however, and we will resort to casework to do it.
First, let's look at the appearances of the "happy configurations" that Kathy likes. Based on the premise of the problem, we can realize that there are ten cases for the appearance of the configurations: \[\text{RRRRR},\] \[\text{GGGGG},\] \[\text{RRRRG},\] \[\text{GGGGR},\] \[\text{RRRGG},\] \[\text{GGGRR},\] \[\text{RRGGG},\] \[\text{GGRRR},\] \[\text{RGGGG},\] \[\text{GRRRR}.\] But this doesn't mean there are 10 "happy configurations" in total-- remember that we've been treating these cards as distinguishable, so we must continue to do so.
To lighten the load of 10 cases on the human brain, we can note that in the eyes of what we will soon do, $RRRRR$ and $GGGGG$ are effectively equivalent, and therefore may be treated in the same case. We will have to multiply by 2 at the end, though.
Similarly, we can equate $RRRRG,$ $GGGGR,$ $RGGGG,$ and $GRRRR,$ as well as $RRRGG,$ $GGGRR,$ $RRGGG,$ and $GGRRR,$ so that we just have three cases. We can approach each of these cases with constructive counting.
Case 1: $RRRRR$ -type.
For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $2$ for the fourth card, and $1$ for the last card. This leads to a total of $5\cdot 4\cdot 3\cdot 2\cdot 1=120$ configurations for this case. There are $2$ cases of this type.
Case 2: $RRRRG$ -type.
For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $2$ for the fourth card, and $5$ choices for the last card (not $1$ , because we're doing a new color). This leads to a total of $5\cdot 4\cdot 3\cdot 2\cdot 5=600$ configurations for this case. There are $4$ cases of this type.
Case 3: $RRRGG$ -type.
For this case, there are $5$ available choices for the first card, $4$ available choices for the second card, $3$ for the third card, $5$ for the fourth card, and $4$ choices for the last card. This leads to a total of $5\cdot 4\cdot 3\cdot 5\cdot 4=1200$ configurations for this case. There are $4$ cases of this type.
Adding the cases up gives $2\cdot 120+4\cdot 600+4\cdot 1200=7440$ "happy" configurations in total.
This means that the probability that Kathy is happy will be $\dfrac{7440}{10\cdot 9\cdot 8\cdot 7\cdot 6},$ which simplifies to $\dfrac{31}{126}.$
So the answer is $31+126=\boxed{157}$
| 157
|
5,612
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_3
| 3
|
Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
As the problem states, some examples of valid are $RRGGG$ $GGGGR$ , and $RRRRR$ . Let's use each of these as more general cases.
Let $RRGGG$ be the case when there are 2 adjacents of one color, and 3 adjacents of the other color. This yields $4$ combinations ( $RRGGG$ $GGRRR$ $RRRGG$ , and $GGGRR$ ). The probability of each of these is equal, equating to $\frac{5}{10}\cdot \frac{4}{9}\cdot \frac{5}{8}\cdot \frac{4}{7}\cdot \frac{3}{6}=\frac{5}{126}$ , and since there are $4$ combinations, the probability of this case is $4\cdot \frac{5}{126}=\frac{10}{63}$
Next case is $GGGGR$ . Let this be when there are 4 adjacents of one color, and 1 individual color. Once again, this yields $4$ combinations ( $GGGGR$ $RRRRG$ $RGGGG$ , and $GRRRR$ ). The probability of each is the same, equating to $\frac{5}{10}\cdot \frac{4}{9}\cdot \frac{3}{8}\cdot \frac{2}{7}\cdot \frac{5}{6}=\frac{5}{252}$ , and since there are $4$ combinations, the probability of this case is $4\cdot \frac{5}{252}=\frac{5}{63}$
The final case is $RRRRR$ , in which there is just an adjacent block of $5$ colors. There are only $2$ combinations this time, each equating to the probability $\frac{5}{10}\cdot \frac{4}{9}\cdot \frac{3}{8}\cdot \frac{2}{7}\cdot \frac{1}{6}=\frac{1}{252}$ , and since there are $2$ combinations, the probability of this case is $2\cdot \frac{1}{252}=\frac{1}{126}$
Thus, the total probability is $\frac{10}{63}+\frac{5}{63}+\frac{1}{126}=\frac{31}{126} \implies m+n=\boxed{157}$
| 157
|
5,613
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_3
| 4
|
Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
Kathy will draw the 10 cards in some order, but the restriction of having all greens in a row and all reds in a row only applies to the first 5 cards drawn. The total number of ways the 10 cards can be drawn is simply 10 choose 5 which is 252. Now we just count the number of possible successful configurations of the ten cards. The first 5 cards can start either be $GRRRR$ $GGRRR$ $GGGRR$ $GGGGR$ $GGGGG$ or the same thing except starting with a red. The number of ways to order $GRRRR$ is the number of ways to order the last 5 cards, which is 5C1. Doing all of the other cases, the total is $(\binom{5}{1}+\binom{5}{2}+\binom{5}{3}+\binom{5}{4}+\binom{5}{5})*2 = 62$ $\frac{62}{252} = \frac{31}{126},$ so the solution is $31 + 126 = \boxed{157}$
| 157
|
5,614
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_3
| 5
|
Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the cards in a row in a random order. She will be happy if and only if all the red cards laid out are adjacent and all the green cards laid out are adjacent. For example, card orders RRGGG, GGGGR, or RRRRR will make Kathy happy, but RRRGR will not. The probability that Kathy will be happy is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
Assume without loss of generality that the first card laid out is red. Then the arrangements that satisfy Kathy’s requirements are RRRRR, RRRRG, RRRGG, RRGGG, and RGGGG. The probability that Kathy will lay out one of these
arrangements is \[\frac49\cdot\frac38\cdot\frac27\cdot\frac16\] \[\frac49\cdot\frac38\cdot\frac27\cdot\frac56\] \[\frac49\cdot\frac38\cdot\frac57\cdot\frac46\] \[\frac49\cdot\frac58\cdot\frac47\cdot\frac36\] \[+\frac59\cdot\frac48\cdot\frac37\cdot\frac26\] \[\overline{..........................}\] \[\frac{31}{126}\] The requested sum is $31+126=\boxed{157}.$
| 157
|
5,615
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 1
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
By the Law of Cosines on $\triangle ABC$ , we have: \[\cos(A) = \frac{10^2+10^2-12^2}{2*10*10} = \frac{7}{25}\] By the Law of Cosines on $\triangle ADE$ , then \[\frac{7}{25} = \frac{10-x}{2x} \iff x =\frac{250}{39}\] So, our answer is $250+39=\boxed{289}$
| 289
|
5,616
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 2
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
We draw the altitude from $B$ to $\overline{AC}$ to get point $F$ . We notice that the triangle's height from $A$ to $\overline{BC}$ is 8 because it is a $3-4-5$ Right Triangle. To find the length of $\overline{BF}$ , we let $h$ represent $\overline{BF}$ and set up an equation by finding two ways to express the area. The equation is $(8)(12)=(10)(h)$ , which leaves us with $h=9.6$ . We then solve for the length $\overline{AF}$ , which is done through pythagorean theorm and get $\overline{AF}$ $2.8$ . We can now see that $\triangle AFB$ is a $7-24-25$ Right Triangle. Thus, we set $\overline{AG}$ as $5-$ $\tfrac{x}{2}$ , and yield that $\overline{AD}$ $=$ $($ $5-$ $\tfrac{x}{2}$ $)$ $($ $\tfrac{25}{7}$ $)$ . Now, we can see $x$ $($ $5-$ $\tfrac{x}{2}$ $)$ $($ $\tfrac{25}{7}$ $)$ . Solving this equation, we yield $39x=250$ , or $x=$ $\tfrac{250}{39}$ . Thus, our final answer is $250+39=\boxed{289}$
| 289
|
5,617
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 3
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
We start by adding a few points to the diagram. Call $F$ the midpoint of $AE$ , and $G$ the midpoint of $BC$ . (Note that $DF$ and $AG$ are altitudes of their respective triangles). We also call $\angle BAC = \theta$ . Since triangle $ADE$ is isosceles, $\angle AED = \theta$ , and $\angle ADF = \angle EDF = 90 - \theta$ . Since $\angle DEA = \theta$ $\angle DEC = 180 - \theta$ and $\angle EDC = \angle ECD = \frac{\theta}{2}$ . Since $FDC$ is a right triangle, $\angle FDC = 180 - 90 - \frac{\theta}{2} = \frac{180-m}{2}$
Since $\angle BAG = \frac{\theta}{2}$ and $\angle ABG = \frac{180-m}{2}$ , triangles $ABG$ and $CDF$ are similar by Angle-Angle similarity. Using similar triangle ratios, we have $\frac{AG}{BG} = \frac{CF}{DF}$ $AG = 8$ and $BG = 6$ because there are $2$ $6-8-10$ triangles in the problem. Call $AD = x$ . Then $CE = x$ $AE = 10-x$ , and $EF = \frac{10-x}{2}$ . Thus $CF = x + \frac{10-x}{2}$ . Our ratio now becomes $\frac{8}{6} = \frac{x+ \frac{10-x}{2}}{DF}$ . Solving for $DF$ gives us $DF = \frac{30+3x}{8}$ . Since $DF$ is a height of the triangle $ADE$ $FE^2 + DF^2 = x^2$ , or $DF = \sqrt{x^2 - (\frac{10-x}{2})^2}$ . Solving the equation $\frac{30+3x}{8} = \sqrt{x^2 - (\frac{10-x}{2})^2}$ gives us $x = \frac{250}{39}$ , so our answer is $250+39 = \boxed{289}$
| 289
|
5,618
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 4
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
As in the diagram, let $DE = x$ . Consider point $G$ on the diagram shown above. Our goal is to be able to perform Pythagorean Theorem on $DG, GC$ , and $DC$ . Let $GE = \frac{10-x}{2}$ . Therefore, it is trivial to see that $GC^2 = \Big(x + \frac{10-x}{2}\Big)^2$ (leave everything squared so that it cancels nicely at the end). By Pythagorean Theorem on Triangle $DGE$ , we know that $DG^2 = x^2 - \Big(\frac{10-x}{2}\Big)^2$ . Finally, we apply Law of Cosines on Triangle $DBC$ . We know that $\cos(\angle DBC) = \frac{3}{5}$ . Therefore, we get that $DC^2 = (10-x)^2 + 12^2 - 2(12)(10-x)\frac{3}{5}$ . We can now do our final calculation: \[DG^2 + GC^2 = DC^2 \implies x^2 - \Big(\frac{10-x}{2}\Big)^2 + \Big(x + \frac{10-x}{2}\Big)^2 = (10-x)^2 + 12^2 - 2(12)(10-x)\frac{3}{5}\] After some quick cleaning up, we get \[30x = \frac{72}{5} + 100 \implies x = \frac{250}{39}\] Therefore, our answer is $250+39=\boxed{289}$
| 289
|
5,619
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 7
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
In isosceles triangle, draw the altitude from $D$ onto $\overline{AD}$ . Let the point of intersection be $X$ . Clearly, $AE=10-AD$ , and hence $AX=\frac{10-AD}{2}$
Now, we recognise that the perpendicular from $A$ onto $\overline{AD}$ gives us two $6$ $8$ $10$ triangles. So, we calculate $\sin \angle ABC=\frac{4}{5}$ and $\cos \angle ABC=\frac{3}{5}$
$\angle BAC = 180-2\cdot\angle ABC$ . And hence,
$\cos \angle BAC = \cos \angle (180-2\cdot\angle ABC) = -\cos (2\cdot\angle ABC) = \sin^2 \angle ABC - \cos^2 \angle ABC = 2\cos^2 \angle ABC - 1 = \frac{32}{25}-\frac{25}{25}=\frac{7}{25}$
Inspecting $\triangle ADX$ gives us $\cos \angle BAC = \frac{\frac{10-x}{2}}{x} = \frac{10-x}{2x}$ Solving the equation $\frac{10-x}{2x}=\frac{7}{25}$ gives $x= \frac{250}{39} \implies\boxed{289}$
| 289
|
5,620
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 8
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
We can have 2 Law of Cosines applied on $\angle A$ (one from $\triangle ADE$ and one from $\triangle ABC$ ),
$x^2=x^2+(10-x)^2-2(x)(10-x)\cdot \cos{A}$ and $12^2=10^2+10^2-2(10)(10)\cdot \cos{A}$
Solving for $\cos{A}$ in both equations, we get
$\cos{A} = \frac{(10-x)^2}{(2)(10-x)(x)}$ and $cos A = \frac{7}{25} \implies \frac{(10-x)^2}{(2)(10-x)(x)} = \frac{7}{25} \implies x = \frac{250}{39}$ , so the answer is $\boxed{289}$
| 289
|
5,621
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 9
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
Let $B=(0, 0)$ , and $C=(12, 0)$ . From there, we know that $A=(6, 8)$ , so line $AB$ is $y=\frac{4}{3}x$ . Hence, $D=(a, \frac{4}{3}a)$ for some $a$ , and $BD=\frac{5}{3}a$ so $AD=10-\frac{5}{3}a$ . Now, notice that by symmetry, $E=(6+a, 8-\frac{4}{3}a)$ , so $ED^2=6^2+(8-\frac{8}{3}a)^2$ . Because $AD=ED$ , we now have $(10-\frac{5}{3})^2=6^2+(8-\frac{8}{3}a)^2$ , which simplifies to $\frac{64}{9}a^2-\frac{128}{3}a+100=\frac{25}{9}a^2-\frac{100}{3}a+100$ , so $\frac{39}{9}a=\frac{13}{3}a=\frac{28}{3}$ , and $a=\frac{28}{13}$ .
It follows that $AD=10-\frac{5}{3}\times\frac{28}{13}=10-\frac{140}{39}=\frac{390-140}{39}=\frac{250}{39}$ , and our answer is $250+39=\boxed{289}$
| 289
|
5,622
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 10
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
Let's label $\angle A = \theta$ and $\angle ECD = \alpha$ . Using isosceles triangle properties and the triangle angle sum equation, we get \[180-(180-2\theta+\alpha) + \frac{180-\theta}{2} + \left(\frac{180-\theta}{2} - \alpha\right) = 180.\] Solving, we find $\theta = 2 \alpha$
Relabelling our triangle, we get $\angle ABC = 90 - \alpha$ . Dropping an altitude from $A$ to $BC$ and using the Pythagorean theorem, we find $[ABC] = 48$ . Using the sine area formula, we see $\frac12 \cdot 10 \cdot 12 \cdot \sin(90-\alpha) = 48$ . Plugging in our sine angle cofunction identity, $\sin(90-\alpha) = \cos(\alpha)$ , we get $\alpha = \cos{^{-1}}{\frac45}$
Now, using the Law of Sines on $\triangle ADE$ , we get \[\frac{\sin{2\alpha}}{\frac{p}{q}} = \frac{\sin{(180-4\alpha)}}{10-\frac{p}{q}}.\] After applying numerous trigonometric and algebraic tricks, identities, and simplifications, such as $\sin{(180-4\alpha)}=\sin{4\alpha}$ and $\sin{\left(\cos{^{-1}}{\frac45}\right)} = \frac35$ , we find $\frac{p}{q} = \frac{10\sin{2\alpha}}{\sin{4\alpha}+\sin{2\alpha}} = \frac{250}{39}$
Therefore, our answer is $250 + 39 = \boxed{289}$
| 289
|
5,623
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_4
| 11
|
In $\triangle ABC, AB = AC = 10$ and $BC = 12$ . Point $D$ lies strictly between $A$ and $B$ on $\overline{AB}$ and point $E$ lies strictly between $A$ and $C$ on $\overline{AC}$ so that $AD = DE = EC$ . Then $AD$ can be expressed in the form $\dfrac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$
|
We start by labelling a few angles (all of them in degrees). Let $\angle{BAC}=2\alpha = \angle{AED}, \angle{EDC}=\angle{ECD}=\alpha, \angle{DEC}=180-2\alpha, \angle{BDC}=3\alpha, \angle{DCB}=90-2\alpha, \angle{DBC}=90-\alpha$ . Also let $AD=a$ . By sine rule in $\triangle{ADE},$ we get $\frac{a}{\sin{2\alpha}}=\frac{10-a}{\sin{4\alpha}} \implies \cos{2\alpha}=\frac{5}{a}-\frac{1}{2}$ Using sine rule in $\triangle{ABC}$ , we get $\sin{\alpha}=\frac{3}{5}$ . Hence we get $\cos{2\alpha}=1-2\sin^2{\alpha}=1-\frac{18}{25}=\frac{7}{25}$ . Hence $\frac{5}{a}=\frac{1}{2}+\frac{7}{25}=\frac{39}{50} \implies a=\frac{250}{39}$ . Therefore, our answer is $\boxed{289}$
| 289
|
5,624
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_5
| 1
|
For each ordered pair of real numbers $(x,y)$ satisfying \[\log_2(2x+y) = \log_4(x^2+xy+7y^2)\] there is a real number $K$ such that \[\log_3(3x+y) = \log_9(3x^2+4xy+Ky^2).\] Find the product of all possible values of $K$
|
Using the logarithmic property $\log_{a^n}b^n = \log_{a}b$ , we note that \[(2x+y)^2 = x^2+xy+7y^2\] That gives \[x^2+xy-2y^2=0\] upon simplification and division by $3$ . Factoring $x^2+xy-2y^2=0$ gives \[(x+2y)(x-y)=0\] Then, \[x=y \text{ or }x=-2y\] From the second equation, \[9x^2+6xy+y^2=3x^2+4xy+Ky^2\] If we take $x=y$ , we see that $K=9$ . If we take $x=-2y$ , we see that $K=21$ . The product is $\boxed{189}$
| 189
|
5,625
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_5
| 2
|
For each ordered pair of real numbers $(x,y)$ satisfying \[\log_2(2x+y) = \log_4(x^2+xy+7y^2)\] there is a real number $K$ such that \[\log_3(3x+y) = \log_9(3x^2+4xy+Ky^2).\] Find the product of all possible values of $K$
|
Do as done in Solution 1 to get \[x^2+xy-2y^2=0\] \[\implies (\frac{x}{y})^2+\frac{x}{y}-2=0\] \[\implies \frac{x}{y}=\frac{-1\pm\sqrt{1+8}}{2}=1,-2\] Do as done in Solution 1 to get \[9x^2+6xy+y^2=3x^2+4xy+Ky^2\] \[\implies 6x^2+2xy+(1-K)y^2=0\] \[\implies 6(\frac{x}{y})^2+2\frac{x}{y}+(1-K)=0\] \[\implies \frac{x}{y}=\frac{-2\pm \sqrt{4-24(1-K)}}{12}\] \[\implies \frac{x}{y}=\frac{-2\pm 2\sqrt{6K-5}}{12}=\frac{-1\pm \sqrt{6K-5}}{6}\] If $\frac{x}{y}=1$ then \[1=\frac{-1\pm \sqrt{6K-5}}{6}\] \[\implies 6=-1\pm \sqrt{6K-5}\] \[\implies 7=\pm \sqrt{6K-5}\] \[\implies 49=6K-5\] \[\implies K=9\] If $\frac{x}{y}=-2$ then \[-2=\frac{-1\pm \sqrt{6K-5}}{6}\] \[\implies -12=-1\pm \sqrt{6K-5}\] \[\implies -11=\sqrt{6K-5}\] \[\implies 121=6K-5\] \[\implies 126=6K\] \[\implies K=21\] Hence our final answer is $21\cdot 9=\boxed{189}$ -vsamc $\newline$ -minor edit:einsteinstudent
| 189
|
5,626
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_6
| 1
|
Let $N$ be the number of complex numbers $z$ with the properties that $|z|=1$ and $z^{6!}-z^{5!}$ is a real number. Find the remainder when $N$ is divided by $1000$
|
Let $a=z^{120}$ . This simplifies the problem constraint to $a^6-a \in \mathbb{R}$ . This is true if $\text{Im}(a^6)=\text{Im}(a)$ . Let $\theta$ be the angle $a$ makes with the positive x-axis. Note that there is exactly one $a$ for each angle $0\le\theta<2\pi$ . We are given $\sin\theta = \sin{6\theta}$ . Note that $\sin \theta = \sin (\pi - \theta)$ and $\sin \theta = \sin (\theta + 2\pi)$ . We can use these facts to create two types of solutions:
\[\sin \theta = \sin ((2m + 1)\pi - \theta)\]
which implies that $(2m+1)\pi-\theta = 6\theta$ and reduces to $\frac{(2m + 1)\pi}{7} = \theta$ . There are 7 solutions for this.
\[\sin \theta = \sin (2n\pi + \theta)\]
which implies that $2n\pi+\theta=6\theta$ and reduces to $\frac{2n\pi}{5} = \theta$ . There are 5 solutions for this, totaling 12 values of $a$
For each of these solutions for $a$ , there are necessarily $120$ solutions for $z$ . Thus, there are $12\cdot 120=1440$ solutions for $z$ , yielding an answer of $\boxed{440}$
| 440
|
5,627
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_6
| 2
|
Let $N$ be the number of complex numbers $z$ with the properties that $|z|=1$ and $z^{6!}-z^{5!}$ is a real number. Find the remainder when $N$ is divided by $1000$
|
The constraint mentioned in the problem is equivalent to the requirement that the imaginary part is equal to $0$ . Since $|z|=1$ , let $z=\cos \theta + i\sin \theta$ , then we can write the imaginary part of $\Im(z^{6!}-z^{5!})=\Im(z^{720}-z^{120})=\sin\left(720\theta\right)-\sin\left(120\theta\right)=0$ . Using the sum-to-product formula, we get $\sin\left(720\theta\right)-\sin\left(120\theta\right)=2\cos\left(\frac{720\theta+120\theta}{2}\right)\sin\left(\frac{720\theta-120\theta}{2}\right)=2\cos\left(\frac{840\theta}{2}\right)\sin\left(\frac{600\theta}{2}\right)\implies \cos\left(\frac{840\theta}{2}\right)=0$ or $\sin\left(\frac{600\theta}{2}\right)=0$ . The former yields $840$ solutions, and the latter yields $600$ solutions, giving a total of $840+600=1440$ solution, so our answer is $\boxed{440}$
| 440
|
5,628
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_6
| 3
|
Let $N$ be the number of complex numbers $z$ with the properties that $|z|=1$ and $z^{6!}-z^{5!}$ is a real number. Find the remainder when $N$ is divided by $1000$
|
As mentioned in solution one, for the difference of two complex numbers to be real, their imaginary parts must be equal. We use exponential form of complex numbers. Let $z = e^{i \theta}$ . We have two cases to consider. Either $z^{6!} = z^{5!}$ , or $z^{6!}$ and $z^{5!}$ are reflections across the imaginary axis.
If $z^{6!} = z^{5!}$ , then $e^{6! \theta i} = e^{5! \theta i}$ . Thus, $720 \theta = 120 \theta$ or $600\theta = 0$ , giving us 600 solutions. (Equalities are taken modulo $2 \pi$ )
For the second case, $e^{6! \theta i} = e^{(\pi - 5!\theta)i}$ . This means $840 \theta = \pi$ , giving us 840 solutions.
Our total count is thus $1440$ , yielding a final answer of $\boxed{440}$
| 440
|
5,629
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_6
| 4
|
Let $N$ be the number of complex numbers $z$ with the properties that $|z|=1$ and $z^{6!}-z^{5!}$ is a real number. Find the remainder when $N$ is divided by $1000$
|
Because $|z| = 1,$ we know that $z\overline{z} = 1^2 = 1.$ Hence $\overline{z} = \frac 1 {z}.$ Because $z^{6!}-z^{5!}$ is real, it is equal to its complex conjugate. Hence $z^{6!}-z^{5!} = \overline{z^{6!}}-\overline{z^{5!}}.$ Substituting the expression we that we derived earlier, we get $z^{720}-z^{120} = \frac 1{z^{720}} - \frac 1{z^{120}}.$ This leaves us with a polynomial whose leading term is $z^{1440}.$ Hence our answer is $\boxed{440}$
| 440
|
5,630
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_9
| 1
|
Find the number of four-element subsets of $\{1,2,3,4,\dots, 20\}$ with the property that two distinct elements of a subset have a sum of $16$ , and two distinct elements of a subset have a sum of $24$ . For example, $\{3,5,13,19\}$ and $\{6,10,20,18\}$ are two such subsets.
|
This problem is tricky because it is the capital of a few "bashy" calculations. Nevertheless, the process is straightforward. Call the set $\{a, b, c, d\}$
Note that there are only two cases: 1 where $a + b = 16$ and $c + d = 24$ or 2 where $a + b = 16$ and $a + c = 24$ . Also note that there is no overlap between the two situations! This is because if they overlapped, adding the two equations of both cases and canceling out gives you $a=d$ , which cannot be true.
Case 1.
This is probably the simplest: just make a list of possible combinations for $\{a, b\}$ and $\{c, d\}$ . We get $\{1, 15\}\dots\{7, 9\}$ for the first and $\{4, 20\}\dots\{11, 13\}$ for the second. That appears to give us $7*8=56$ solutions, right? NO. Because elements can't repeat, take out the supposed sets \[\{1, 15, 9, 15\}, \{2, 14, 10, 14\}, \{3, 13, 11, 13\}, \{4, 12, 4, 20\}, \{5, 11, 5, 19\},\] \[\{5, 11, 11, 13\}, \{6, 10, 6, 18\}, \{6, 10, 10, 14\}, \{7, 9, 9, 15\}, \{7, 9, 7, 17\}\] That's ten cases gone. So $46$ for Case 1.
Case 2.
We can look for solutions by listing possible $a$ values and filling in the blanks. Start with $a=4$ , as that is the minimum. We find $\{4, 12, 20, ?\}$ , and likewise up to $a=15$ . But we can't have $a=8$ or $a=12$ because $a=b$ or $a=c$ , respectively! Now, it would seem like there are $10$ values for $a$ and $17$ unique values for each $?$ , giving a total of $170$ , but that is once again not true because there are some repeated values!
There are two cases of overcounting:
case 1) (5,11,13,19) & (5.11.19.13)
The same is for (6,10,14,18) and (7,9,15,17)
case 2) those that have the same b and c values
this case includes:
(1,15,9,7) and (7,9,15,1)
(2,14,10,6) and (6,10,14,2)
(3,13,11,5) and (5,11,13,3)
So we need to subtract 6 overcounts.
So, that's $164$ for Case 2.
Total gives $\boxed{210}$
| 210
|
5,631
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_9
| 2
|
Find the number of four-element subsets of $\{1,2,3,4,\dots, 20\}$ with the property that two distinct elements of a subset have a sum of $16$ , and two distinct elements of a subset have a sum of $24$ . For example, $\{3,5,13,19\}$ and $\{6,10,20,18\}$ are two such subsets.
|
Let's say our four elements in our subset are $a,b,c,d$ . We have two cases. Note that the order of the elements / the element letters themselves don't matter since they are all on equal grounds at the start.
$\textrm{Case } 1 \textrm{:}$ $a+b = 16$ and $c+d = 24$
List out possibilities for $a+b$ $(\text{i.e. } 1+15, 2+14, 3+13 \text{ etc.})$ but don't list $8+8$ because those are the same elements and that is restricted.
Then list out the possibilities for $c+d \text{ }(\text{i.e. } 4+20, 5+19, 6+18, \text{ etc.})$ but don't list $12+12$ because they are the same elements.
This will give you $7 \cdot 8$ elements, which is $56$ . However, as stated above, we have overlap. Just count starting from $a+b$ $15,14,13,11,10,9,7,6,5,4$ all overlap once, which is $10$ , thus $56 - 10 = 46$ cases in this case. Note that $12$ wasn't included because again, if $c+d = 24$ $c$ and $d$ cannot be $12$
$\textrm{Case } 2 \textrm{:}$ $a+b = 16$ and $b+c = 24$
Here, $b$ is included in both equations. We can easily see that $a, b, c$ will never equal each other.
Furthermore, there are 17 choices for $d$ $20 - 3$ included elements) for each $b$ . Listing out the possible $b$ s, we go from $15,14,13,11,10,9,7,6,5,4$ . Do not include $8$ or $12$ because if they are included, then $a/c$ will be the same as $b$ , which is restricted.
There are $10$ options there, and thus $10 \cdot 17 = 170$ . But, note that if $d = b+8$ $a+d = a+b+8 = 24$ , and so we have a double-counted set. Starting with $b=15$ , we have $15, 14, 13, 11, 10, 9$ (where $d$ is $7, 6, 5, 3, 2, 1)$ . That means there are $6$ double-counted cases. Thus $170 - 6 = 164$ cases in this case.
Adding these up, we get $46+164 = \boxed{210}.$
| 210
|
5,632
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 1
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
Note that the given condition is equivalent to $3^n \equiv 1 \pmod{143^2}$ and $143=11\cdot 13$ . Because $\gcd(11^2, 13^2) = 1$ , the desired condition is equivalent to $3^n \equiv 1 \pmod{121}$ and $3^n \equiv 1 \pmod{169}$
If $3^n \equiv 1 \pmod{121}$ , one can see the sequence $1, 3, 9, 27, 81, 1, 3, 9...$ so $5|n$
Now if $3^n \equiv 1 \pmod{169}$ , it is harder. But we do observe that $3^3 \equiv 1 \pmod{13}$ , therefore $3^3 = 13a + 1$ for some integer $a$ . So our goal is to find the first number $p_1$ such that $(13a+1)^ {p_1} \equiv 1 \pmod{169}$ . Then, $p_1 \equiv 0 \pmod{13},$ which follows from the binomial theorem. It is not difficult to see that the smallest $p_1=13$ , so ultimately $3^{39} \equiv 1 \pmod{169}$ . Therefore, $39|n$
The first $n$ satisfying both criteria is thus $5\cdot 39=\boxed{195}$
| 195
|
5,633
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 2
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
Note that Euler's Totient Theorem would not necessarily lead to the smallest $n$ and that in this case that $n$ is greater than $1000$
We wish to find the least $n$ such that $3^n \equiv 1 \pmod{143^2}$ . This factors as $143^2=11^{2}*13^{2}$ . Because $\gcd(121, 169) = 1$ , we can simply find the least $n$ such that $3^n \equiv 1 \pmod{121}$ and $3^n \equiv 1 \pmod{169}$
Quick inspection yields $3^5 \equiv 1 \pmod{121}$ and $3^3 \equiv 1 \pmod{13}$ . Now we must find the smallest $k$ such that $3^{3k} \equiv 1 \pmod{169}$ . Euler's gives $3^{156} \equiv 1 \pmod{169}$ . So $3k$ is a factor of $156$ . This gives $k=1,2, 4, 13, 26, 52$ . Some more inspection yields $k=13$ is the smallest valid $k$ . So $3^5 \equiv 1 \pmod{121}$ and $3^{39} \equiv 1 \pmod{169}$ . The least $n$ satisfying both is $lcm(5, 39)=\boxed{195}$ . (RegularHexagon)
| 195
|
5,634
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 3
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
Listing out the powers of $3$ , modulo $169$ and modulo $121$ , we have: \[\begin{array}{c|c|c} n & 3^n\mod{169} & 3^n\mod{121}\\ \hline 0 & 1 & 1\\ 1 & 3 & 3\\ 2 & 9 & 9\\ 3 & 27 & 27\\ 4 & 81 & 81\\ 5 & 74 & 1\\ 6 & 53\\ 7 & 159\\ 8 & 139\\ 9 & 79\\ 10 & 68\\ 11 & 35\\ 12 & 105\\ 13 & 146\\ 14 & 100\\ 15 & 131\\ 16 & 55\\ 17 & 165\\ 18 & 157\\ 19 & 133\\ 20 & 61\\ 21 & 14\\ 22 & 42\\ 23 & 126\\ 24 & 40\\ 25 & 120\\ 26 & 22\\ 27 & 66\\ 28 & 29\\ 29 & 87\\ 30 & 92\\ 31 & 107\\ 32 & 152\\ 33 & 118\\ 34 & 16\\ 35 & 48\\ 36 & 144\\ 37 & 94\\ 38 & 113\\ 39 & 1\\ \end{array}\]
The powers of $3$ repeat in cycles of $5$ and $39$ in modulo $121$ and modulo $169$ , respectively. The answer is $\text{lcm}(5, 39) = \boxed{195}$
| 195
|
5,635
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 4
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
We have that \[3^n \equiv 1 \pmod{143^2}.\] Now, $3^{110} \equiv 1 \pmod{11^2}$ so by the Fundamental Theorem of Orders, $\text{ord}_{11^2}(3)|110$ and with some bashing, we get that it is $5$ . Similarly, we get that $\text{ord}_{13^2}(3)=39$ . Now, $\text{lcm}(39,5)=\boxed{195}$ which is our desired solution.
| 195
|
5,636
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 6
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
We can see that $3^n-1 = 143^2*x$ , which means that $v_{11}(3^n-1) \geq 2$ $v_{13}(3^n-1) \geq 2$ $v_{11}(3^n-1) = v_{11}(242) + v_{11}(\frac{n}{5})$ $v_{13}(3^n-1) = v_{13}(26) + v_{13}(\frac{n}{3})$ by the Lifting the Exponent lemma. From the first equation we gather that 5 divides n, while from the second equation we gather that both 13 and 3 divide n as $v_{13}(3^n-1) \geq 2$ . Therefore the minimum possible value of n is $3\times5\times13=\boxed{195}$
| 195
|
5,637
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 7
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
Note that the problem is basically asking for the least positive integer $n$ such that $11^2 \cdot 13^2 | 3^n - 1.$ It is easy to see that $n = \text{lcm } (a, b),$ where $a$ is the least positive integer satisfying $11^2 | 3^a - 1$ and $b$ the least positive integer satisfying $13^2 | 3^b - 1$ . Luckily, finding $a$ is a relatively trivial task, as one can simply notice that $3^5 = 243 \equiv 1 \mod 121$ . However, finding $b$ is slightly more nontrivial. The order of $3^k$ modulo $13$ (which is $3$ ) is trivial to find, as one can either bash out a pattern of remainders upon dividing powers of $3$ by $13$ , or one can notice that $3^3 = 27 \equiv 1 \mod 13$ (the latter which is the definition of period/orders by FLT). We can thus rewrite $3^3$ as $(2 \cdot 13 + 1) \mod 13^2$ . Now suppose that \[3^{3k} \equiv (13n + 1) \mod 13^2.\] I claim that $3^{3(k+1)} \equiv (13(n+2) + 1) \mod 13^2.$
Proof:
To find $3^{3(k+1)},$ we can simply multiply $3^{3k}$ by $3^3,$ which is congruent to $2 \cdot 13 + 1$ modulo $13^2$ .
By expanding the product out, we obtain \[3^{3(k+1)} \equiv (13n + 1)(2 \cdot 13 + 1) = 13^2 \cdot 2n + 13n + 2 \cdot 13 + 1 \mod 13^2,\] and since the $13^2$ on the LHS cancels out, we're left with \[13n + 2 \cdot 13 + 1 \mod 13^2 \implies 13(n+2) + 1 \mod 13^2\] . Thus, our claim is proven.
Let $f(n)$ be the second to last digit when $3^{3k}$ is written in base $13^2$ .
Using our proof, it is easy to see that $f(n)$ satisfies the recurrence $f(1) = 2$ and $f(n+1) = f(n) + 2$ . Since this implies $f(n) = 2n,$ we just have to find the least positive integer $n$ such that $2n$ is a multiple of $13$ , which is trivially obtained as $13$ .
The least integer $n$ such that $3^n - 1$ is divisible by $13^2$ is $3 \cdot 13 = 39,$ so our final answer is $\text{lcm } (5, 39) = \boxed{195}.$
| 195
|
5,638
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 8
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
The requested positive integer is the least value of $n>0$ such that $3^n\equiv 1\pmod{143^2}.$ Note that $143=11\cdot 13.$ The least power of $3$ that is congruent to $1$ modulo $11^2$ is $3^5=243=2\cdot 11^2+1.$ It follows that. $3^n\equiv 1\pmod {11^2}$ if and only if $n=5j$ for some positive integer $j$
The least power of $3$ that is congruent to $1$ modulo $13$ is $3^3=27=2\cdot 13+1.$ It follows that $3^n\equiv 1\pmod{13}$ if and only if $n=3k$ for some positive integer $k$ . Additionally, for some positive integer $k$ , the Binomial Theorem shows that $3^{3k}=(26+1)^k=26\cdot k+1 \pmod{13^2}$ . In particular, $3^n=3^{3k}\equiv 1\pmod {13^2}$ if and only if $k=13m$ for some positive integer $m$ , that is, if and only if $n=39m.$
Because $11^2$ and $13^2$ are relatively prime, $3^n\equiv 1\pmod {143^2}$ if and only if $3^n\equiv 1\pmod{11^2}$ and $3^n \equiv 1\pmod {13^2}$ . This occurs if and only if $n$ is a multiple of both of the relatively prime integers $5$ and $39$ , so the least possible value of $n$ is $5\cdot 39=\boxed{195}.$
| 195
|
5,639
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_11
| 9
|
Find the least positive integer $n$ such that when $3^n$ is written in base $143$ , its two right-most digits in base $143$ are $01$
|
We first note that we wish to find $3^n \equiv 1 \pmod{11^2}$ and $3^n \equiv 1 \pmod{13^2}.$ Not thinking of anything else, we try a few numbers for the first condition to get that $5 \mid n.$ For the second condition, upon testing up to 729, we find that it doesn't yield a solution readily, so we use Lifting the Exponent from our toolkit to get that \[v_{13}(27^m-1^m)=v_{13}(26)+v(m)=1+v(m), 3m = n\] which clearly implies $m=13$ and $39 | n.$ Our answer is then obviously $39 \cdot 5 = \boxed{195}.$
| 195
|
5,640
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 1
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
The question asks us for the probability that a randomly chosen subset of the set of the first 18 positive integers has the property that the sum of its elements is divisible by 3. Note that the total number of subsets is $2^{18}$ because each element can either be in or not in the subset. To find the probability, we will find the total numbers of ways the problem can occur and divide by $2^{18}$
To simplify the problem, let’s convert the set to mod 3:
\[U' = \{1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0\}\]
Note that there are six elements congruent to 0 mod 3, 6 congruent to 1 mod 3, and 6 congruent to 2 mod 3. After conversion to mod three, the problem is the same but we’re dealing with much simpler numbers. Let’s apply casework on this converted set based on $S = s(T')$ , the sum of the elements of a subset $T'$ of $U'$
$\textbf{Case 1: }S=0$
In this case, we can restrict the subsets to subsets that only contain 0. There are six 0’s and each one can be in or out of the subset, for a total of $2^{6} = 64$ subsets. In fact, for every case we will have, we can always add a sequence of 0’s and the total sum will not change, so we will have to multiply by 64 for each case. Therefore, let’s just calculate the total number of ways we can have each case and remember to multiply it in after summing up the cases. This is equivalent to finding the number of ways you can choose such subsets without including the 0's. Therefore this case gives us $\boxed{1}$ way.
| 1
|
5,641
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 2
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Consider the elements of $U$ modulo $3.$
Ignore the $0$ 's because we're gonna multiply $\binom{6}{0}+..+\binom{6}{6}=2^6$ at the end. Let $a$ be the $1's$ and $b$ be the $2's$ . The key here is that $2 \equiv -1 \pmod{3}$ so the difference between the number of $a$ and $b$ is a multiple of $3$
1. Counted twice because $a$ and $b$ can be switched:
$6a$
$6a,3b$
$5a,2b$
$4a,b$
$3a$
2. Counted once:
$6a,6b$ ... $0a,0b$
By Vandermonde's Identity on the second case, this is $2^6 \left( 2\left(1+20+90+90+20\right) + \binom{12}{6} \right)\implies \boxed{683}$
| 683
|
5,642
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 3
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Elements $0 \pmod{3}$ can either be included or excluded, for a total of $2^6$ . Then, like the previous solution, let $a$ be the number of elements $1 \pmod{3}$ and $b$ be the number of elements $2 \pmod{3}$ . Then, $a + 2b \equiv 0 \pmod{3} \implies a - b \equiv 0 \pmod{3}$ . Since $0 \le a, b \le 6$ , there are 3 cases:
$\>\>\>\> 1. \> a - b = 0$
Then, we have, \[\binom{6}{0}\binom{6}{0} + \binom{6}{1}\binom{6}{1} + \cdots + \binom{6}{6} \binom{6}{6}\]
Using the substitution $\binom{6}{k} = \binom{6}{6-k}$ on every second binomial coefficient, it is clear that the bottom numbers sum to $6$ , and the ones above sum to $12$ . Apply Vandermonde's, we obtain $\binom{12}{6}$
$\>\>\>\> 2. \> a - b = \pm 3$
For $a - b = 3$ , using the same substitution and applying Vandermonde's, we get: \[\binom{6}{3} \binom{6}{0} + \binom{6}{4} \binom{6}{1} + \cdots + \binom{6}{6} \binom{6}{3} = \binom{12}{3}\]
Then, for $a - b = -3$ , it is completely symmetric with $a - b = 3$ . We get $\binom{12}{3}$
$\>\>\>\> 3. \> a - b = \pm 6$
We have $\binom{6}{6} \binom{6}{0} + \binom{6}{0} \binom{6}{6} = 2$
We get $\frac{2^6 (\binom{12}{6} + 2 \binom{12}{3} + 2)}{2^{18}} = \frac{683}{2^{11}} \implies m = \boxed{683}$
| 683
|
5,643
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 4
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Note that in general, the answer will be around $1/3$ of $2^{18}$ . We will use this to our advantage. Partition $U$ into disjoint subsets $\{1,2,3\}, \{4,5,6\}, \cdots, \{16,17,18\}$ . Within each of these subsets, there are 3 possible remainders $\mod 3$ depending on what elements we choose to include into $T$ : (Using set $\{1,2,3\}$ for demonstration purposes)
Remainder of zero: Include $\{3\}, \{1,2\}, \{\}, \{1,2,3\}$
Remainder of one: Include $\{1\}, \{1,3\}$
Remainder of two: Include $\{2\}, \{2,3\}$
Suppose all subsets are of the form $\{\}, \{1,2,3\}$ . Then, since both choices are $0 \pmod{3}$ , we can choose either one for all six subsets, giving us $2^6$ combinations.
On the other hand, suppose there exists a subset $V$ that isn't of the form $\{\}, \{1,2,3\}$ . Then, for $V$ , it is equally likely that a remainder of zero, one, or two is chosen, since each remainder has $2$ ways to be achieved, i.e. there is a $1/3$ chance for each. Consider the sum of the other subsets $T \setminus V$ . The sum is either $0, 1, 2 \pmod{3}$ . Whatever that remainder $r$ might be, we can always choose $3-r$ as the remainder for our set $V$ , giving us a total of $r + 3 - r \equiv 0 \pmod{3}$ . The probability we choose remainder $3-r$ is $1/3$ as previously mentioned. So, we get $\frac{1}{3}(2^{18} - 2^6)$ total combinations.
Therefore, we get $\frac{2^6 + \frac{1}{3}(2^{18} - 2^6)}{2^{18}} = \frac{683}{2^{11}} \implies m = \boxed{683}$
| 683
|
5,644
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 5
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Rewrite the set after mod 3 as above
1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0
All 0s can be omitted
Case 1
No 1 No 2 $1$
Case 2 $222$ $20$
Case 3 $222222$ $1$
Case 4 $12$ $6*6=36$
Case 5 $12222$ $6*15=90$
Case 6 $1122$ $15*15=225$
Case 7 $1122222$ $15*6=90$
Case 8 $111$ $20$
Case 9 $111222$ $20*20=400$
Case 10 $111222222$ $20$
Case 11 $11112$ $15*6=90$
Case 12 $11112222$ $15*15=225$
Case 13 $1111122$ $6*15=90$
Case 14 $1111122222$ $6*6=36$
Case 15 $111111$ $1$
Case 16 $111111222$ $20$
Case 17 $111111222222$ $1$
Total $1+20+1+36+90+225+90+20+400+20+90+225+90+36+1+20+1=484+360+450+72=1366$
$P=\frac{1366}{2^{12}}=\frac{683}{2^{11}}$
ANS= $\boxed{683}$
| 683
|
5,645
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 6
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Notice that six numbers are $0\pmod3$ , six are $1\pmod3$ , and six are $2\pmod3$ . Having numbers $0\pmod3$ will not change the remainder when $s(T)$ is divided by $3$ , so we can choose any number of these in our subset. We ignore these for now. The number of numbers that are $1\pmod3$ , minus the number of numbers that are $2\pmod3$ , must be a multiple of $3$ , possibly zero or negative. We can now split into cases based on how many numbers that are $1\pmod3$ are in the set.
CASE 1- $0$ $3$ , or $6$ integers: There can be $0$ $3$ , or $6$ integers that are $2\pmod3$ . We can choose these in \[\left(\binom60+\binom63+\binom66\right)\cdot\left(\binom60+\binom63+\binom66\right)=(1+20+1)^2=484.\]
CASE 2- $1$ or $4$ integers: There can be $2$ or $5$ integers that are $2\pmod3$ . We can choose these in \[\left(\binom61+\binom64\right)\cdot\left(\binom62+\binom65\right)=(6+15)^2=441.\]
CASE 3- $2$ or $5$ integers: There can be $1$ or $4$ integers that are $2\pmod3$ . We can choose these in \[\left(\binom62+\binom65\right)\cdot\left(\binom61+\binom64\right)=(15+6)^2=441.\]
Adding these up, we get that there are $1366$ ways to choose the numbers such that their sum is a multiple of three. Putting back in the possibility that there can be multiples of $3$ in our set, we have that there are \[1366\cdot\left(\binom60+\binom61+\binom62+\binom63+\binom64+\binom65+\binom66\right)=1366\cdot2^6\] subsets $T$ with a sum that is a multiple of $3$ . Since there are $2^{18}$ total subsets, the probability is \[\frac{1366\cdot2^6}{2^{18}}=\frac{683}{2^{11}},\] so the answer is $\boxed{683}$
| 683
|
5,646
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 7
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
We use generating functions. Each element of $U$ has two choices that occur with equal probability--either it is in the set or out of the set. Therefore, given $n\in U$ , the probability generating function is \[\frac{1}{2}+\frac{1}{2}x^n.\] Therefore, in the generating function \[\frac{1}{2^{18}}(1+x)(1+x^2)(1+x^3)\cdots (1+x^{18}),\] the coefficient of $x^k$ represents the probability of obtaining a sum of $k$ . We wish to find the sum of the coefficients of all terms of the form $x^{3k}$ (where $k \in \mathbb{Z}_{\geq0}$ ). If $\omega=e^{2\pi i/3}$ is a cube root of unity, then it is well know that for a polynomial $P(x)$ \[\frac{P(1)+P(\omega)+P(\omega^2)}{3}\] will yield the sum of the coefficients of the terms of the form $x^{3k}$ . (This is known as the third Roots of Unity Filter.) Then we find \begin{align*} \frac{1}{2^{18}}(1+1)(1+1^2)(1+1^3)\cdots (1+1^{18})&=1\\\frac{1}{2^{18}}(1+\omega)(1+\omega^2)(1+\omega^3)\cdots (1+\omega^{18})&=\frac{1}{2^{12}}\\\frac{1}{2^{18}}(1+\omega^2)(1+\omega^4)(1+\omega^6)\cdots (1+\omega^{36})&=\frac{1}{2^{12}}. \end{align*} To evaluate the last two products, we utilized the facts that $\omega^3=1$ and $1+\omega+\omega^2=0$ . Therefore, the desired probability is \[\frac{1+1/2^{12}+1/2^{12}}{3}=\frac{683}{2^{11}}.\] Thus the answer is $\boxed{683}$
| 683
|
5,647
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 8
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Define a set that "works" to be a set for which the sum of the terms is $0$ mod $3$ . The given set mod $3$ is \[\{1,2,0,1,2,0,1,2,0,1,2,0,1,2,0,1,2,0\}.\] Let $w(N)$ be the number of subsets of the first $N$ terms of this set that "work."
Consider just the first $3$ terms: \[\{1,2,0\}.\] There are $2^3=8$ total subsets, and $w(3)=4$ (the subsets are $\emptyset, \{0\}, \{1,2\},$ and $\{1,2,0\}$ ). Now consider the first $6$ terms: \[\{1,2,0,1,2,0\}.\] To find $w(6)$ , we set aside the last $3$ terms as a "reserve" that we can pair with subsets of the first $3$ terms (which we looked at earlier).
First, all $2^3$ subsets of the first $3$ terms can either be paired with a $1$ or a $2$ (or nothing) from the "reserve" terms so that they "work," creating $2^3$ subsets that "work" already. But for each of these, we have the option to add a $0$ from the reserve, so we now have $2\cdot2^3$ subsets that "work." For each of the $w(3)=4$ subsets of the first $3$ terms that "work", we can also add on a $\{1,2\}$ or a $\{1,2,0\}$ from the reserves, creating $2w(3)$ new subsets that "work." And that covers all of them. With all of this information, we can write $w(6)$ as \[w(6)=2\cdot2^3+2w(3)=2(2^3+w(3)).\] The same process can be used to calculate $w(9)$ then $w(12)$ etc. so we can generalize it to \[w(N)=2(2^{N-3}+w(N-3)).\] Thus, we calculate $w(18)$ with this formula: \[w(18)=2( 2^{15} + 2( 2^{12} + 2( 2^9 + 2( 2^6 + 2( 2^3 + 4 ) ) ) ) )=87424.\] Because there are $2^{18}$ total possible subsets, the desired probability is \[\frac{w(18)}{2^{18}}=\frac{87424}{2^{18}}=\frac{683}{2048},\] so the answer is $\boxed{683}.$
| 683
|
5,648
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 9
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
Try smaller cases and find a pattern. Using similar casework as in Solution 1, we can easily find the desired probability if $U$ is of a small size.
If $U = \{ 1,2,0\} \pmod 3$ , then $4$ out of $8$ subsets work, for a probability of $\tfrac12$
If $U = \{ 1,2,0,1,2,0\} \pmod 3$ , then $24$ out of $64$ subsets work, for a probability of $\tfrac38$
If $U = \{ 1,2,0,1,2,0,1,2,0\} \pmod 3$ , then $176$ out of $512$ subsets work, for a probability of $\tfrac{11}{32}$
Let $a_n$ be the numerator of the desired probability if $U$ is of size $3n$ . Then $a_1 = 1, a_2 = 3,$ and $a_3 = 11$ . Noticing that the denominators are multiplied by $4$ each time, we can conclude that the pattern of the numerators is $a_n = 4a_{n-1} - 1$ , so $a_6 = \boxed{683}$
| 683
|
5,649
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 10
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
The total number of subsets is simply $2^{18}.$ Now we need to find the number of subsets that have a sum divisible by $3.$
Ignore the 6 numbers in the list that are divisible by 3. We look only at the number of subsets of $\{1, 2, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17\}$ then multiply by $2^6$ at the end. This is because adding a multiple of $3$ to the sum will not change whether it is divisible by $3$ or not and for each of the $6$ multiples, we have two options of whether to add it to the subset or not.
Now, let $f(3k)$ be the number of subsets of $\{1, 2, 4, 5, \dots, 3k-2, 3k-1\}$ that have a sum divisible by $3$ . There are $2k$ numbers in the set. Let us look at the first $2k - 2$ numbers: all subsets of the first $2k - 2$ numbers will have a residue $0, 1,$ or $2$ mod $3.$ If it is $0,$ add both $3k-2$ and $3k-1$ to the subset. If it is $1$ add just $3k-1$ to the set, and if it is $2$ add just $3k-2.$ We don't have to compute all three cases separately; since there is a 1 to 1 correspondence, we only need the sum of the three cases (which we know is $2^{2k-2}$ ).
Now, this counts all the subsets except for those that include neither $3k-1$ nor $3k-2.$ However, this is just $f(3k - 3).$ Thus, $f(3k) = 2^{2k-2} + f(3k-3)$ and the base case is $f(0) = 1.$ We have,
$f(18) = 2^{10} + f(15) = 2^{10} + 2^{8} + f(12) = \dots = 2^{10} + 2^8 + 2^6 + 2^4 + 2^2 + 2^0 + f(0).$ $=2^{10} + 2^8 + \dots + 2^2 + 2.$
Multiplying this by $2^6$ we have, \[\frac{2^7(1 + 2^1 + 2^3 + 2^5 + 2^7 + 2^9)}{2^{18}} .\] The $2^7$ cancels out with the denominator. However, the second term in the product is obviously odd and so does not cancel further with the denominator, which is just a power of $2.$ Thus, we want to find $1 + 2 + 2^3 + 2^5 + 2^7 + 2^9,$ which equals $\boxed{683}.$
| 683
|
5,650
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_12
| 11
|
For every subset $T$ of $U = \{ 1,2,3,\ldots,18 \}$ , let $s(T)$ be the sum of the elements of $T$ , with $s(\emptyset)$ defined to be $0$ . If $T$ is chosen at random among all subsets of $U$ , the probability that $s(T)$ is divisible by $3$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m$
|
The total number of subsets is $\sum_{i=0}^{18}\tbinom{18}{i}=2^{18}$ . If $s(T)\equiv 0\bmod{3}$ , the sum of the elements divides 3. We can rewrite the set as 6 0s, 6 1s, and 6 2s. We can ignore the zeros for now, since they won't influence the sum so we focus on each configuration of the 6 1s and 6 2s such that the sum is divisible by 3 and then multiply by $\sum_{i=0}^{6}\tbinom{6}{i}=2^6$ at the end. We proceed with casework on the number of values that are equivalent to $2\pmod{3}$ as follows:
Case 1: There are zero elements:
Then, there are only configurations of the values congruent to 1 mod 3. There are $\tbinom{6}{0}+\tbinom{6}{3}+\tbinom{6}{6}$ ways to assign values in the set that are congruent to 1 mod 3 such that the sum of those values divides 3. Therefore there are $22$ configurations for this case.
Case 2: There is one element:
There are $6$ ways to choose which element is included in the subset and $\tbinom{6}{1}+\tbinom{6}{4}$ ways to assign values to the numbers congruent to 1 mod 3 in the set. Therefore there are $6\cdot21=126$ configurations for this case.
Case 3: There are two elements:
There are $\tbinom{6}{2}=12$ ways to choose the 2 elements in the set that are congruent to 2 mod 3 and $\tbinom{6}{2}+\tbinom{6}{5}$ possible ways to assign values to the numbers congruent to 1 mod 3. Therefore there are $15\cdot21=315$ configurations for this case.
Case 4: There are three elements:
There are $\tbinom{6}{3}=20$ ways to choose three elements in the set that are congruent to 2 mod 3. There are $\tbinom{6}{0}+\tbinom{6}{3}+\tbinom{6}{6}$ ways to assign values to the numbers congruent to 1 mod 3. Therefore, there are $20\cdot22=440$ configurations for this case.
Case 5, Case 6, and Case 7 are symmetric to Case 3, Case 2, and Case 1 respectively so we can multiply by 2 for those cases.
Putting all the cases together we obtain $2(22+126+315) + 440=1366$ . Multiplying by $2^6$ gives $2^6\cdot1366=2^7\cdot683$ . Since $n=2^{18}$ $\frac{m}{n}=\frac{683}{2^{11}}$ . Therefore, $m=\boxed{683}$
| 683
|
5,651
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_13
| 1
|
Let $\triangle ABC$ have side lengths $AB=30$ $BC=32$ , and $AC=34$ . Point $X$ lies in the interior of $\overline{BC}$ , and points $I_1$ and $I_2$ are the incenters of $\triangle ABX$ and $\triangle ACX$ , respectively. Find the minimum possible area of $\triangle AI_1I_2$ as $X$ varies along $\overline{BC}$
|
First note that \[\angle I_1AI_2 = \angle I_1AX + \angle XAI_2 = \frac{\angle BAX}2 + \frac{\angle CAX}2 = \frac{\angle A}2\] is a constant not depending on $X$ , so by $[AI_1I_2] = \tfrac12(AI_1)(AI_2)\sin\angle I_1AI_2$ it suffices to minimize $(AI_1)(AI_2)$ . Let $a = BC$ $b = AC$ $c = AB$ , and $\alpha = \angle AXB$ . Remark that \[\angle AI_1B = 180^\circ - (\angle I_1AB + \angle I_1BA) = 180^\circ - \tfrac12(180^\circ - \alpha) = 90^\circ + \tfrac\alpha 2.\] Applying the Law of Sines to $\triangle ABI_1$ gives \[\frac{AI_1}{AB} = \frac{\sin\angle ABI_1}{\sin\angle AI_1B}\qquad\Rightarrow\qquad AI_1 = \frac{c\sin\frac B2}{\cos\frac\alpha 2}.\] Analogously one can derive $AI_2 = \tfrac{b\sin\frac C2}{\sin\frac\alpha 2}$ , and so \[[AI_1I_2] = \frac{bc\sin\frac A2 \sin\frac B2\sin\frac C2}{2\cos\frac\alpha 2\sin\frac\alpha 2} = \frac{bc\sin\frac A2 \sin\frac B2\sin\frac C2}{\sin\alpha}\geq bc\sin\frac A2 \sin\frac B2\sin\frac C2,\] with equality when $\alpha = 90^\circ$ , that is, when $X$ is the foot of the perpendicular from $A$ to $\overline{BC}$ . In this case the desired area is $bc\sin\tfrac A2\sin\tfrac B2\sin\tfrac C2$ . To make this feasible to compute, note that \[\sin\frac A2=\sqrt{\frac{1-\cos A}2}=\sqrt{\frac{1-\frac{b^2+c^2-a^2}{2bc}}2} = \sqrt{\dfrac{(a-b+c)(a+b-c)}{4bc}}.\] Applying similar logic to $\sin \tfrac B2$ and $\sin\tfrac C2$ and simplifying yields a final answer of \begin{align*}bc\sin\frac A2\sin\frac B2\sin\frac C2&=bc\cdot\dfrac{(a-b+c)(b-c+a)(c-a+b)}{8abc}\\&=\dfrac{(30-32+34)(32-34+30)(34-30+32)}{8\cdot 32}=\boxed{126}
| 126
|
5,652
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_13
| 2
|
Let $\triangle ABC$ have side lengths $AB=30$ $BC=32$ , and $AC=34$ . Point $X$ lies in the interior of $\overline{BC}$ , and points $I_1$ and $I_2$ are the incenters of $\triangle ABX$ and $\triangle ACX$ , respectively. Find the minimum possible area of $\triangle AI_1I_2$ as $X$ varies along $\overline{BC}$
|
It's clear that $\angle I_{1}AI_{2}=\frac{1}{2}\angle BAX+\frac{1}{2}\angle CAX=\frac{1}{2}\angle A$ . Thus \begin{align*} AI_{1}I_{2}&=\frac{1}{2}\cdot AI_{1}\cdot AI_{2}\cdot\sin\angle I_{1}AI_{2} \\ &=\frac{1}{2}\cdot AI_{1}\cdot AI_{2}\cdot\sin\left(\frac{1}{2}\angle A\right).\end{align*} By the Law of Sines on $\triangle AI_{1}B$ \[\frac{AI_{1}}{\sin\left(\frac{1}{2}\angle B\right)}=\frac{AB}{\sin\angle AI_{1}B}.\] Similarly, \[\frac{AI_{2}}{\sin\left(\frac{1}{2}\angle C\right)}=\frac{AC}{\sin\angle AI_{2}C}.\] It is well known that \[\angle AI_{1}B=90+\frac{1}{2}\angle AXB~~~\text{and}~~~\angle AI_{2}C=90+\frac{1}{2}\angle AXC.\] Denote $\alpha=\frac{1}{2}\angle AXB$ and $\theta=\frac{1}{2}\angle AXC$ , with $\alpha+\theta=90^{\circ}$ . Thus $\sin\alpha=\cos\theta$ and \begin{align*}\frac{AI_{1}}{\sin\left(\frac{1}{2}\angle B\right)}=\frac{AB}{\sin\angle AI_{1}B}\Longrightarrow\frac{AB}{\sin\left(90^{\circ}+\alpha\right)}\Longrightarrow\frac{AB}{\cos\alpha} \\\frac{AI_{2}}{\sin\left(\frac{1}{2}\angle C\right)}=\frac{AC}{\sin\angle AI_{2}C}\Longrightarrow\frac{AC}{\sin\left(90^{\circ}+\theta\right)}\Longrightarrow\frac{AC}{\cos\theta}\Longrightarrow\frac{AC}{\sin\alpha}.\end{align*} Thus \[AI_{1}=\frac{AB\sin\left(\frac{1}{2}\angle B\right)}{\cos\alpha}~~~\text{and}~~~AI_{2}=\frac{AC\sin\left(\frac{1}{2}\angle C\right)}{\sin\alpha}\] so \begin{align*}[AI_{1}I_{2}]&=\frac{1}{2}\cdot AI_{1}\cdot AI_{2}\cdot\sin\left(\frac{1}{2}\angle A\right) \\ &=\frac{AB\sin\left(\frac{1}{2}\angle B\right)\cdot AC\sin\left(\frac{1}{2}\angle C\right)\cdot\sin\left(\frac{1}{2}\angle A\right)}{2\sin\alpha\cos\alpha} \\ &=\frac{AB\sin\left(\frac{1}{2}\angle B\right)\cdot AC\sin\left(\frac{1}{2}\angle C\right)\cdot\sin\left(\frac{1}{2}\angle A\right)}{\sin(2\alpha)}.\end{align*} We intend to minimize this expression, which is equivalent to maximizing $\sin(2\alpha)$ , and that occurs when $\alpha=45^{\circ}$ , or $\angle AXB=90^{\circ}$ . Ergo, $X$ is the foot of the altitude from $A$ to $\overline{BC}$ . In that case, we intend to compute \[AB\cdot AC\cdot\sin\left(\frac{1}{2}\angle B\right)\cdot\sin\left(\frac{1}{2}\angle C\right)\cdot\sin\left(\frac{1}{2}\angle A\right).\] Recall that \[\sin\left(\frac{1}{2}\angle B\right)=\sqrt{\frac{1-\cos\angle B}{2}}\] and similarly for angles $C$ and $A$ . Applying the Law of Cosines to each angle of $\triangle ABC$ gives \begin{align*}\angle B&:\cos\angle B=\frac{30^{2}+32^{2}-34^{2}}{2\cdot 30\cdot 32}=\frac{2}{5} \\ \angle C&:\cos\angle C=\frac{32^{2}+34^{2}-30^{2}}{2\cdot 32\cdot 34}=\frac{10}{17} \\ \angle A&:\cos\angle A=\frac{30^{2}+34^{2}-32^{2}}{2\cdot 30\cdot 34}=\frac{43}{85}.\end{align*} Thus \begin{align*}\sin\left(\frac{1}{2}\angle B\right)=\sqrt{\frac{1-\tfrac{2}{5}}{2}}=\sqrt{\frac{3}{10}} \\ \sin\left(\frac{1}{2}\angle C\right)=\sqrt{\frac{1-\tfrac{10}{17}}{2}}=\sqrt{\frac{7}{34}} \\ \sin\left(\frac{1}{2}\angle A\right)=\sqrt{\frac{1-\tfrac{43}{85}}{2}}=\sqrt{\frac{21}{85}}.\end{align*} Thus the answer is \begin{align*} & 30\cdot 34\cdot\sqrt{\frac{3}{10}\cdot\frac{7}{34}\cdot\frac{21}{85}} \\ =&~30\cdot 34\cdot\sqrt{\frac{3}{2\cdot 5}\cdot\frac{7}{2\cdot 17}\cdot\frac{3\cdot 7}{5\cdot 17}} \\ =&~30\cdot 34\cdot\frac{3\cdot 7}{2\cdot 5\cdot 17} \\ =&~(2\cdot 3\cdot 5)\cdot(2\cdot 17)\cdot\frac{3\cdot 7}{2\cdot 5\cdot 17} \\ =&~2\cdot 3^{2}\cdot 7 \\ =&~\boxed{126}
| 126
|
5,653
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_13
| 3
|
Let $\triangle ABC$ have side lengths $AB=30$ $BC=32$ , and $AC=34$ . Point $X$ lies in the interior of $\overline{BC}$ , and points $I_1$ and $I_2$ are the incenters of $\triangle ABX$ and $\triangle ACX$ , respectively. Find the minimum possible area of $\triangle AI_1I_2$ as $X$ varies along $\overline{BC}$
|
First, instead of using angles to find $[AI_1I_2]$ , let's try to find the area of other, simpler figures, and subtract that from $[ABC]$ . However, to do this, we need to be able to figure out the length of the inradii, and so, we need to find $AX$
To minimize $[AI_1I_2]$ , intuitively, we should try to minimize the length of $AX$ , since, after using the $rs=A$ formula for the area of a triangle, we'll be able to minimize the inradii lengths, and thus, eventually minimize the area of $[AI_1I_2]$ . (Proof needed here).
We need to minimize $AX$ . Let $AX=d$ $BX=s$ , and $CX=32-s$ . After an application of Stewart's Theorem, we will get that \[d=\sqrt{s^2-24s+900}\] To minimize this quadratic, $s=12$ whereby we conclude that $d=6\sqrt{21}$
From here, draw perpendiculars down from $I_1$ and $I_2$ to $AB$ and $AC$ respectively, and label the foot of these perpendiculars $D$ and $E$ respectively. After, draw the inradii from $I_1$ to $BX$ , and from $I_2$ to $CX$ , and draw in $I_1I_2$
Label the foot of the inradii to $BX$ and $CX$ $F$ and $G$ , respectively. From here, we see that to find $[AI_1I_2]$ , we need to find $[ABC]$ , and subtract off the sum of $[DBCEI_2I_1], [ADI_1],$ and $[AEI_2]$
$[DBCEI_2I_1]$ can be found by finding the area of two quadrilaterals $[DBFI_1]+[ECGI_2]$ as well as the area of a trapezoid $[FGI_2I_1]$ . If we let the inradius of $ABX$ be $r_1$ and if we let the inradius of $ACX$ be $r_2$ , we'll find, after an application of basic geometry and careful calculations on paper, that $[DBCEI_2I_1]=13r_1+19r_2$
The area of two triangles can be found in a similar fashion, however, we must use $XYZ$ substitution to solve for $AD$ as well as $AE$ . After doing this, we'll get a similar sum in terms of $r_1$ and $r_2$ for the area of those two triangles which is equal to \[\frac{(9+3\sqrt{21})(r_1)}{2} + \frac{(7+3\sqrt{21})(r_2)}{2}.\]
Now we're set. Summing up the area of the Hexagon and the two triangles and simplifying, we get that the formula for $[AI_1I_2]$ is just \[[ABC]-\left(\frac{(35+3\sqrt{21})(r_1)}{2}+\frac{(45+3r_2\sqrt{21})(r_2)}{2}\right).\]
Using Heron's formula, $[ABC]=96\sqrt{21}$ . Solving for $r_1$ and $r_2$ using Heron's in $ABX$ and $ACX$ , we get that $r_1=3\sqrt{21}-9$ and $r_2=3\sqrt{21}-7$ . From here, we just have to plug into our above equation and solve.
Doing so gets us that the minimum area of $AI_1I_2=\boxed{126}.$
| 126
|
5,654
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_14
| 1
|
Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$ . From any vertex of the heptagon except $E$ , the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$ , the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$
|
This is easily solved by recursion/dynamic programming. To simplify the problem somewhat, let us imagine the seven vertices on a line $E \leftrightarrow P_4 \leftrightarrow P_5 \leftrightarrow S \leftrightarrow P_1 \leftrightarrow P_2 \leftrightarrow P_3 \leftrightarrow E$ . We can count the number of left/right (L/R) paths of length $\le 11$ that start at $S$ and end at either $P_4$ or $P_3$
We can visualize the paths using the common grid counting method by starting at the origin $(0,0)$ , so that a right (R) move corresponds to moving 1 in the positive $x$ direction, and a left (L) move corresponds to moving 1 in the positive $y$ direction. Because we don't want to move more than 2 units left or more than 3 units right, our path must not cross the lines $y = x+2$ or $y = x-3$ . Letting $p(x,y)$ be the number of such paths from $(0,0)$ to $(x,y)$ under these constraints, we have the following base cases:
$p(x,0) = \begin{cases} 1 & x \le 3 \\ 0 & x > 3 \end{cases} \qquad p(0,y) = \begin{cases} 1 & y \le 2 \\ 0 & y > 2 \end{cases}$
and recursive step $p(x,y) = p(x-1,y) + p(x,y-1)$ for $x,y \ge 1$
The filled in grid will look something like this, where the lower-left $1$ corresponds to the origin:
$\begin{tabular}{|c|c|c|c|c|c|c|c|} \hline 0 & 0 & 0 & 0 & \textbf{89} & & & \\ \hline 0 & 0 & 0 & \textbf{28} & 89 & & & \\ \hline 0 & 0 & \textbf{9} & 28 & 61 & 108 & 155 & \textbf{155} \\ \hline 0 & \textbf{3} & 9 & 19 & 33 & 47 & \textbf{47} & 0 \\ \hline \textbf{1} & 3 & 6 & 10 & 14 & \textbf{14} & 0 & 0 \\ \hline 1 & 2 & 3 & 4 & \textbf{4} & 0 & 0 & 0 \\ \hline 1 & 1 & 1 & \textbf{1} & 0 & 0 & 0 & 0 \\ \hline \end{tabular}$
The bolded numbers on the top diagonal represent the number of paths from $S$ to $P_4$ in 2, 4, 6, 8, 10 moves, and the numbers on the bottom diagonal represent the number of paths from $S$ to $P_3$ in 3, 5, 7, 9, 11 moves. We don't care about the blank entries or entries above the line $x+y = 11$ . The total number of ways is $1+3+9+28+89+1+4+14+47+155 = \boxed{351}$
| 351
|
5,655
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_I_Problems/Problem_14
| 2
|
Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$ . From any vertex of the heptagon except $E$ , the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$ , the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$
|
Let $E_n$ denotes the number of sequences with length $n$ that ends at $E$ . Define similarly for the other vertices. We seek for a recursive formula for $E_n$ \begin{align*} E_n&=P_{3_{n-1}}+P_{4_{n-1}} \\ &=P_{2_{n-2}}+P_{5_{n-2}} \\ &=P_{1_{n-3}}+P_{3_{n-3}}+S_{n-3}+P_{4_{n-3}} \\ &=(P_{3_{n-3}}+P_{4_{n-3}})+S_{n-3}+P_{1_{n-3}} \\ &=E_{n-2}+S_{n-3}+P_{1_{n-3}} \\ &=E_{n-2}+P_{1_{n-4}}+P_{5_{n-4}}+S_{n-4}+P_{2_{n-4}} \\ &=E_{n-2}+(S_{n-4}+P_{1_{n-4}})+P_{5_{n-4}}+P_{2_{n-4}} \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+S_{n-5}+P_{4_{n-5}}+P_{1_{n-5}}+P_{3_{n-5}} \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+(S_{n-5}+P_{1_{n-5}})+(P_{4_{n-5}}+P_{3_{n-5}}) \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+(E_{n-2}-E_{n-4})+E_{n-4} \\ &=E_{n-1}+2E_{n-2}-E_{n-3} \\ \end{align*} Computing a few terms we have $E_0=0$ $E_1=0$ $E_2=0$ $E_3=1$ , and $E_4=1$
Using the formula yields $E_5=3$ $E_6=4$ $E_7=9$ $E_8=14$ $E_9=28$ $E_{10}=47$ $E_{11}=89$ , and $E_{12}=155$
Finally adding yields $\sum_{k=0}^{12}E_k=\boxed{351}$
| 351
|
5,656
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_1
| 1
|
Points $A$ $B$ , and $C$ lie in that order along a straight path where the distance from $A$ to $C$ is $1800$ meters. Ina runs twice as fast as Eve, and Paul runs twice as fast as Ina. The three runners start running at the same time with Ina starting at $A$ and running toward $C$ , Paul starting at $B$ and running toward $C$ , and Eve starting at $C$ and running toward $A$ . When Paul meets Eve, he turns around and runs toward $A$ . Paul and Ina both arrive at $B$ at the same time. Find the number of meters from $A$ to $B$
|
We know that in the same amount of time given, Ina will run twice the distance of Eve, and Paul would run quadruple the distance of Eve. Let's consider the time it takes for Paul to meet Eve: Paul would've run 4 times the distance of Eve, which we can denote as $d$ . Thus, the distance between $B$ and $C$ is $4d+d=5d$ . In that given time, Ina would've run twice the distance $d$ , or $2d$ units.
Now, when Paul starts running back towards $A$ , the same amount of time would pass since he will meet Ina at his starting point. Thus, we know that he travels another $4d$ units and Ina travels another $2d$ units.
Therefore, drawing out the diagram, we find that $2d+2d+4d+d=9d=1800 \implies d=200$ , and distance between $A$ and $B$ is the distance Ina traveled, or $4d=4(200)=\boxed{800}$
| 800
|
5,657
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_1
| 2
|
Points $A$ $B$ , and $C$ lie in that order along a straight path where the distance from $A$ to $C$ is $1800$ meters. Ina runs twice as fast as Eve, and Paul runs twice as fast as Ina. The three runners start running at the same time with Ina starting at $A$ and running toward $C$ , Paul starting at $B$ and running toward $C$ , and Eve starting at $C$ and running toward $A$ . When Paul meets Eve, he turns around and runs toward $A$ . Paul and Ina both arrive at $B$ at the same time. Find the number of meters from $A$ to $B$
|
Let $x$ be the distance from $A$ to $B$ . Then the distance from $B$ to $C$ is $1800-x$ . Since Eve is the slowest, we can call her speed $v$ , so that Ina's speed is $2v$ and Paul's speed is $4v$
For Paul and Eve to meet, they must cover a total distance of $1800-x$ which takes them a time of $\frac{1800-x}{4v+v}$ . Paul must run the same distance back to $B$ , so his total time is $\frac{2(1800-x)}{5v}$
For Ina to reach $B$ , she must run a distance of $x$ at a speed of $2v$ , taking her a time of $\frac{x}{2v}$
Since Paul and Ina reach $B$ at the same time, we know that $\frac{2(1800-x)}{5v} = \frac{x}{2v}$ (notice that $v$ cancels out on both sides). Solving the equation gives $x = \boxed{800}$
| 800
|
5,658
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_2
| 1
|
Let $a_{0} = 2$ $a_{1} = 5$ , and $a_{2} = 8$ , and for $n > 2$ define $a_{n}$ recursively to be the remainder when $4$ $a_{n-1}$ $+$ $a_{n-2}$ $+$ $a_{n-3}$ ) is divided by $11$ . Find $a_{2018} \cdot a_{2020} \cdot a_{2022}$
|
When given a sequence problem, one good thing to do is to check if the sequence repeats itself or if there is a pattern.
After computing more values of the sequence, it can be observed that the sequence repeats itself every 10 terms starting at $a_{0}$
$a_{0} = 2$ $a_{1} = 5$ $a_{2} = 8$ $a_{3} = 5$ $a_{4} = 6$ $a_{5} = 10$ $a_{6} = 7$ $a_{7} = 4$ $a_{8} = 7$ $a_{9} = 6$ $a_{10} = 2$ $a_{11} = 5$ $a_{12} = 8$ $a_{13} = 5$
We can simplify the expression we need to solve to $a_{8}\cdot a_{10} \cdot a_{2}$
Our answer is $7 \cdot 2 \cdot 8$ $= \boxed{112}$
| 112
|
5,659
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_2
| 2
|
Let $a_{0} = 2$ $a_{1} = 5$ , and $a_{2} = 8$ , and for $n > 2$ define $a_{n}$ recursively to be the remainder when $4$ $a_{n-1}$ $+$ $a_{n-2}$ $+$ $a_{n-3}$ ) is divided by $11$ . Find $a_{2018} \cdot a_{2020} \cdot a_{2022}$
|
Notice that the characteristic polynomial of this is $x^3-4x^2-4x-4\equiv 0\pmod{11}$
Then since $x\equiv1$ is a root, using Vieta's formula, the other two roots $r,s$ satisfy $r+s\equiv3$ and $rs\equiv4$
Let $r=7+d$ and $s=7-d$
We have $49-d^2\equiv4$ so $d\equiv1$ . We found that the three roots of the characteristic polynomial are $1,6,8$
Now we want to express $a_n$ in an explicit form as $a(1^n)+b(6^n)+c(8^n)\pmod{11}$
Plugging in $n=0,1,2$ we get
$(*)$ $a+b+c\equiv2,$
$(**)$ $a+6b+8c\equiv5,$
$(***)$ $a+3b+9c\equiv8$
$\frac{(***)-(*)}{2}$ $\implies b+4c\equiv3$ and $(***)-(**)$ $\implies -3b+c\equiv3$
so $a\equiv6,$ $b\equiv1,$ and $c\equiv6$
Hence, $a_n\equiv 6+(6^n)+6(8^n)\equiv(2)^{-n\pmod{10}}+(2)^{3n-1\pmod{10}}-5\pmod{11}$
Therefore
$a_{2018}\equiv4+8-5=7$
$a_{2020}\equiv1+6-5=2$
$a_{2022}\equiv3+10-5=8$
And the answer is $7\times2\times8=\boxed{112}$
| 112
|
5,660
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_3
| 1
|
Find the sum of all positive integers $b < 1000$ such that the base- $b$ integer $36_{b}$ is a perfect square and the base- $b$ integer $27_{b}$ is a perfect cube.
|
The first step is to convert $36_{b}$ and $27_{b}$ into base-10 numbers. Then, we can write \[36_{b} = 3b + 6\] and \[27_{b} = 2b + 7\] . It should also be noted that $8 \leq b < 1000$
Because there are less perfect cubes than perfect squares for the restriction we are given on $b$ , it is best to list out all the perfect cubes. Since the maximum $b$ can be is 1000 and $2$ $1000 + 7 = 2007$ , we can list all the perfect cubes less than 2007.
Now, $2b + 7$ must be one of \[3^3, 4^3, ... , 12^3\] . However, $2b + 7$ will always be odd, so we can eliminate the cubes of the even numbers and change our list of potential cubes to \[3^3, 5^3, 7^3, 9^3\text{, and }11^3\]
Because $3b + 6$ is a perfect square and is clearly divisible by 3, it must be divisible by 9, so $b + 2$ is divisible by 3. Thus the cube, which is \[2b + 7 = 2(b + 2) + 3\] , must also be divisible by 3. Therefore, the only cubes that $2b + 7$ could potentially be now are $3^3$ and $9^3$
We need to test both of these cubes to make sure $3b + 6$ is a perfect square.
$\textbf{Case 1:}$ If we set \[3^3 = 2b + 7\] so \[b = 10\] . If we plug this value of b into $3b + 6$ , the expression equals $36$ , which is indeed a perfect square.
$\textbf{Case 2:}$ If we set \[9^3 = 2b + 7\] so \[b = 361\] . If we plug this value of b into $3b + 6$ , the expression equals $1089$ , which is $33^2$
We have proven that both $b = 10$ and $b = 361$ are the only solutions, so \[10 + 361 = \boxed{371}\]
| 371
|
5,661
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_3
| 3
|
Find the sum of all positive integers $b < 1000$ such that the base- $b$ integer $36_{b}$ is a perfect square and the base- $b$ integer $27_{b}$ is a perfect cube.
|
As shown above, let \[3b+6 = n^2\] \[2b+7 = m^3\] such that \[6b+12=2n^2\] \[6b+21=3m^3\]
Subtracting the equations we have \[3m^3-2n^2=9 \implies 3m^3-2n^2-9=0.\]
We know that $m$ and $n$ both have to be integers, because then the base wouldn't be an integer. Furthermore, any integer solution $m$ must divide $9$ by the Rational Root Theorem.
We can instantly know $m \neq -9,-3,-1,1$ since those will have negative solutions.
When $m=3$ we have $n=6$ , so then $b=10$
When $m=9$ we have $n=33$ , so then $b=361$
Therefore, the sum of all possible values of $b$ is \[10+361=\boxed{371}.\]
| 371
|
5,662
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_5
| 4
|
Suppose that $x$ $y$ , and $z$ are complex numbers such that $xy = -80 - 320i$ $yz = 60$ , and $zx = -96 + 24i$ , where $i$ $=$ $\sqrt{-1}$ . Then there are real numbers $a$ and $b$ such that $x + y + z = a + bi$ . Find $a^2 + b^2$
|
Dividing the first equation by the second equation given, we find that $\frac{xy}{yz}=\frac{x}{z}=\frac{-80-320i}{60}=-\frac{4}{3}-\frac{16}{3}i \implies x=z\left(-\frac{4}{3}-\frac{16}{3}i\right)$ . Substituting this into the third equation, we get $z^2=\frac{-96+24i}{-\frac{4}{3}-\frac{16}{3}i}=3\cdot \frac{-24+6i}{-1-4i}=3\cdot \frac{(-24+6i)(-1+4i)}{1+16}=3\cdot \frac{-102i}{17}=-18i$ . Taking the square root of this is equivalent to halving the argument and taking the square root of the magnitude. Furthermore, the second equation given tells us that the argument of $y$ is the negative of that of $z$ , and their magnitudes multiply to $60$ . Thus, we have $z=\sqrt{-18i}=3-3i$ and $3\sqrt{2}\cdot |y|=60 \implies |y|=10\sqrt{2} \implies y=10+10i$ . To find $x$ , we can use the previous substitution we made to find that $x=z\left(-\frac{4}{3}-\frac{16}{3}i\right)=-\frac{4}{3}\cdot (3-3i)(1+4i)=-4(1-i)(1+4i)=-4(5+3i)=-20-12i$ .
Therefore, $x+y+z=(-20+10+3)+(-12+10-3)i=-7-5i \implies a^2+b^2=(-7)^2+(-5)^2=49+25=\boxed{74}$
| 74
|
5,663
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_5
| 7
|
Suppose that $x$ $y$ , and $z$ are complex numbers such that $xy = -80 - 320i$ $yz = 60$ , and $zx = -96 + 24i$ , where $i$ $=$ $\sqrt{-1}$ . Then there are real numbers $a$ and $b$ such that $x + y + z = a + bi$ . Find $a^2 + b^2$
|
We can turn the expression $x+y+z$ into $\sqrt{x^2+y^2+z^2+2xy+2yz+2xz}$ , and this would allow us to plug in the values after some computations.
Based off of the given products, we have
$xy^2z=60(-80-320i)$
$xyz^2=60(-96+24i)$
$x^2yz=(-96+24i)(-80-320i)$
Dividing by the given products, we have
$y^2=\frac{60(-80-320i)}{-96+24i}$
$z^2=\frac{60(-96+24i)}{-80-320i}$
$x^2=\frac{(-96+24i)(-80-320i)}{60}$
Simplifying, we get that this expression becomes $\sqrt{24+70i}$ . This equals $\pm{(7+5i)}$ , so the answer is $7^2+5^2=\boxed{74}$
| 74
|
5,664
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_8
| 1
|
A frog is positioned at the origin of the coordinate plane. From the point $(x, y)$ , the frog can jump to any of the points $(x + 1, y)$ $(x + 2, y)$ $(x, y + 1)$ , or $(x, y + 2)$ . Find the number of distinct sequences of jumps in which the frog begins at $(0, 0)$ and ends at $(4, 4)$
|
We solve this problem by working backwards. Notice, the only points the frog can be on to jump to $(4,4)$ in one move are $(2,4),(3,4),(4,2),$ and $(4,3)$ . This applies to any other point, thus we can work our way from $(0,0)$ to $(4,4)$ , recording down the number of ways to get to each point recursively.
$(0,0): 1$
$(1,0)=(0,1)=1$
$(2,0)=(0, 2)=2$
$(3,0)=(0, 3)=3$
$(4,0)=(0, 4)=5$
$(1,1)=2$ $(1,2)=(2,1)=5$ $(1,3)=(3,1)=10$ $(1,4)=(4,1)= 20$
$(2,2)=14, (2,3)=(3,2)=32, (2,4)=(4,2)=71$
$(3,3)=84, (3,4)=(4,3)=207$
$(4,4)=2\cdot \left( (4,2)+(4,3)\right) = 2\cdot \left( 207+71\right)=2\cdot 278=\boxed{556}$
| 556
|
5,665
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_8
| 2
|
A frog is positioned at the origin of the coordinate plane. From the point $(x, y)$ , the frog can jump to any of the points $(x + 1, y)$ $(x + 2, y)$ $(x, y + 1)$ , or $(x, y + 2)$ . Find the number of distinct sequences of jumps in which the frog begins at $(0, 0)$ and ends at $(4, 4)$
|
We'll refer to the moves $(x + 1, y)$ $(x + 2, y)$ $(x, y + 1)$ , and $(x, y + 2)$ as $R_1$ $R_2$ $U_1$ , and $U_2$ , respectively. Then the possible sequences of moves that will take the frog from $(0,0)$ to $(4,4)$ are all the permutations of $U_1U_1U_1U_1R_1R_1R_1R_1$ $U_2U_1U_1R_1R_1R_1R_1$ $U_1U_1U_1U_1R_2R_1R_1$ $U_2U_1U_1R_2R_1R_1$ $U_2U_2R_1R_1R_1R_1$ $U_1U_1U_1U_1R_2R_2$ $U_2U_2R_2R_1R_1$ $U_2U_1U_1R_2R_2$ , and $U_2U_2R_2R_2$ . We can reduce the number of cases using symmetry.
Case 1: $U_1U_1U_1U_1R_1R_1R_1R_1$
There are $\frac{8!}{4!4!} = 70$ possibilities for this case.
Case 2: $U_2U_1U_1R_1R_1R_1R_1$ or $U_1U_1U_1U_1R_2R_1R_1$
There are $2 \cdot \frac{7!}{4!2!} = 210$ possibilities for this case.
Case 3: $U_2U_1U_1R_2R_1R_1$
There are $\frac{6!}{2!2!} = 180$ possibilities for this case.
Case 4: $U_2U_2R_1R_1R_1R_1$ or $U_1U_1U_1U_1R_2R_2$
There are $2 \cdot \frac{6!}{2!4!} = 30$ possibilities for this case.
Case 5: $U_2U_2R_2R_1R_1$ or $U_2U_1U_1R_2R_2$
There are $2 \cdot \frac{5!}{2!2!} = 60$ possibilities for this case.
Case 6: $U_2U_2R_2R_2$
There are $\frac{4!}{2!2!} = 6$ possibilities for this case.
Adding up all these cases gives us $70+210+180+30+60+6=\boxed{556}$ ways.
| 556
|
5,666
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_9
| 1
|
Octagon $ABCDEFGH$ with side lengths $AB = CD = EF = GH = 10$ and $BC = DE = FG = HA = 11$ is formed by removing 6-8-10 triangles from the corners of a $23$ $\times$ $27$ rectangle with side $\overline{AH}$ on a short side of the rectangle, as shown. Let $J$ be the midpoint of $\overline{AH}$ , and partition the octagon into 7 triangles by drawing segments $\overline{JB}$ $\overline{JC}$ $\overline{JD}$ $\overline{JE}$ $\overline{JF}$ , and $\overline{JG}$ . Find the area of the convex polygon whose vertices are the centroids of these 7 triangles.
[asy] unitsize(6); pair P = (0, 0), Q = (0, 23), R = (27, 23), SS = (27, 0); pair A = (0, 6), B = (8, 0), C = (19, 0), D = (27, 6), EE = (27, 17), F = (19, 23), G = (8, 23), J = (0, 23/2), H = (0, 17); draw(P--Q--R--SS--cycle); draw(J--B); draw(J--C); draw(J--D); draw(J--EE); draw(J--F); draw(J--G); draw(A--B); draw(H--G); real dark = 0.6; filldraw(A--B--P--cycle, gray(dark)); filldraw(H--G--Q--cycle, gray(dark)); filldraw(F--EE--R--cycle, gray(dark)); filldraw(D--C--SS--cycle, gray(dark)); dot(A); dot(B); dot(C); dot(D); dot(EE); dot(F); dot(G); dot(H); dot(J); dot(H); defaultpen(fontsize(10pt)); real r = 1.3; label("$A$", A, W*r); label("$B$", B, S*r); label("$C$", C, S*r); label("$D$", D, E*r); label("$E$", EE, E*r); label("$F$", F, N*r); label("$G$", G, N*r); label("$H$", H, W*r); label("$J$", J, W*r); [/asy]
|
We represent octagon $ABCDEFGH$ in the coordinate plane with the upper left corner of the rectangle being the origin. Then it follows that $A=(0,-6), B=(8, 0), C=(19,0), D=(27, -6), E=(27, -17), F=(19, -23), G=(8, -23), H=(0, -17), J=(0, -\frac{23}{2})$ . Recall that the centroid is $\frac{1}{3}$ way up each median in the triangle. Thus, we can find the centroids easily by finding the midpoint of the side opposite of point $J$ . Furthermore, we can take advantage of the reflective symmetry across the line parallel to $BC$ going through $J$ by dealing with less coordinates and ommiting the $\frac{1}{2}$ in the shoelace formula.
By doing some basic algebra, we find that the coordinates of the centroids of $\bigtriangleup JAB, \bigtriangleup JBC, \bigtriangleup JCD, \bigtriangleup JDE$ are $\left(\frac{8}{3}, -\frac{35}{6}\right), \left(9, -\frac{23}{6}\right), \left(\frac{46}{3}, -\frac{35}{6}\right),$ and $\left(18, -\frac{23}{2}\right)$ , respectively. We'll have to throw in the projection of the centroid of $\bigtriangleup JAB$ to the line of reflection to apply shoelace, and that point is $\left( \frac{8}{3}, -\frac{23}{2}\right)$
Finally, applying Shoelace, we get: $\left|\left(\frac{8}{3}\cdot (-\frac{23}{6})+9\cdot (-\frac{35}{6})+\frac{46}{3}\cdot (-\frac{23}{2})+18\cdot (\frac{-23}{2})+\frac{8}{3}\cdot (-\frac{35}{6})\right) - \left((-\frac{35}{6}\cdot 9) +\\(-\frac{23}{6}\cdot \frac{46}{3})+ (-\frac{35}{6}\cdot 18)+(\frac{-23}{2}\cdot \frac{8}{3})+(-\frac{23}{2}\cdot \frac{8}{3})\right)\right|$ $=\left|\left(-\frac{92}{9}-\frac{105}{2}-\frac{529}{3}-207-\frac{140}{9}\right)-\left(-\frac{105}{2}-\frac{529}{9}-105-\frac{92}{3}-\frac{92}{3}\right)\right|$ $=\left|-\frac{232}{9}-\frac{1373}{6}-207+\frac{529}{9}+\frac{184}{3}+105+\frac{105}{2}\right|$ $=\left|\frac{297}{9}-\frac{690}{6}-102\right|=\left| 33-115-102\right|=\left|-184\right|=\boxed{184}$
| 184
|
5,667
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_10
| 1
|
Find the number of functions $f(x)$ from $\{1, 2, 3, 4, 5\}$ to $\{1, 2, 3, 4, 5\}$ that satisfy $f(f(x)) = f(f(f(x)))$ for all $x$ in $\{1, 2, 3, 4, 5\}$
|
We perform casework on the number of fixed points (the number of points where $f(x) = x$ ). To better visualize this, use the grid from Solution 1.
Case 1: 5 fixed points
Case 2: 4 fixed points
Case 3: 3 fixed points
Case 4: 2 fixed points
Case 5: 1 fixed point
Therefore, the answer is $1+20+150+380+205 = \boxed{756}$
| 756
|
5,668
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 1
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
If the first number is $6$ , then there are no restrictions. There are $5!$ , or $120$ ways to place the other $5$ numbers.
If the first number is $5$ $6$ can go in four places, and there are $4!$ ways to place the other $4$ numbers. $4 \cdot 4! = 96$ ways.
If the first number is $4$ , ....
4 6 _ _ _ _ $\implies$ 24 ways
4 _ 6 _ _ _ $\implies$ 24 ways
4 _ _ 6 _ _ $\implies$ 24 ways
4 _ _ _ 6 _ $\implies$ 5 must go between $4$ and $6$ , so there are $3 \cdot 3! = 18$ ways.
$24 + 24 + 24 + 18 = 90$ ways if 4 is first.
If the first number is $3$ , ....
3 6 _ _ _ _ $\implies$ 24 ways
3 _ 6 _ _ _ $\implies$ 24 ways
3 1 _ 6 _ _ $\implies$ 4 ways
3 2 _ 6 _ _ $\implies$ 4 ways
3 4 _ 6 _ _ $\implies$ 6 ways
3 5 _ 6 _ _ $\implies$ 6 ways
3 5 _ _ 6 _ $\implies$ 6 ways
3 _ 5 _ 6 _ $\implies$ 6 ways
3 _ _ 5 6 _ $\implies$ 4 ways
$24 + 24 + 4 + 4 + 6 + 6 + 6 + 6 + 4 = 84$ ways
If the first number is $2$ , ....
2 6 _ _ _ _ $\implies$ 24 ways
2 _ 6 _ _ _ $\implies$ 18 ways
2 3 _ 6 _ _ $\implies$ 4 ways
2 4 _ 6 _ _ $\implies$ 6 ways
2 5 _ 6 _ _ $\implies$ 6 ways
2 5 _ _ 6 _ $\implies$ 6 ways
2 _ 5 _ 6 _ $\implies$ 4 ways
2 4 _ 5 6 _ $\implies$ 2 ways
2 3 4 5 6 1 $\implies$ 1 way
$24 + 18 + 4 + 6 + 6 + 6 + 4 + 2 + 1 = 71$ ways
Grand Total : $120 + 96 + 90 + 84 + 71 = \boxed{461}$
| 461
|
5,669
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 2
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
If $6$ is the first number, then there are no restrictions. There are $5!$ , or $120$ ways to place the other $5$ numbers.
If $6$ is the second number, then the first number can be $2, 3, 4,$ or $5$ , and there are $4!$ ways to place the other $4$ numbers. $4 \cdot 4! = 96$ ways.
If $6$ is the third number, then we cannot have the following:
1 _ 6 _ _ _ $\implies$ 24 ways
2 1 6 _ _ _ $\implies$ 6 ways
$120 - 24 - 6 = 90$ ways
If $6$ is the fourth number, then we cannot have the following:
1 _ _ 6 _ _ $\implies$ 24 ways
2 1 _ 6 _ _ $\implies$ 6 ways
2 3 1 6 _ _ $\implies$ 2 ways
3 1 2 6 _ _ $\implies$ 2 ways
3 2 1 6 _ _ $\implies$ 2 ways
$120 - 24 - 6 - 2 - 2 - 2 = 84$ ways
If $6$ is the fifth number, then we cannot have the following:
_ _ _ _ 6 5 $\implies$ 24 ways
1 5 _ _ 6 _ $\implies$ 6 ways
1 _ 5 _ 6 _ $\implies$ 6 ways
2 1 5 _ 6 _ $\implies$ 2 ways
1 _ _ 5 6 _ $\implies$ 6 ways
2 1 _ 5 6 _ $\implies$ 2 ways
2 3 1 5 6 4, 3 1 2 5 6 4, 3 2 1 5 6 4 $\implies$ 3 ways
$120 - 24 - 6 - 6 - 2 - 6 - 2 - 3 = 71$ ways
Grand Total : $120 + 96 + 90 + 84 + 71 = \boxed{461}$
| 461
|
5,670
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 3
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
Note the condition in the problem is equivalent to the following condition: for each $k$ with $1 \le k \le 5$ , the first $k$ terms is not a permutation $(1, 2, \ldots, k)$ (since it would mean there must be some integer $x$ in the first $k$ terms such that $x \not \in \{1, 2, \ldots, k\} \implies x > k$ ). Then, let $a_n$ denote the number of permutations of $(1, 2, \ldots, n)$ satisfying the condition in the problem. We use complementary counting to find $a_n$ . Notice that in order to not satisfy the condition in the problem, there are $n-1$ cases: the first $1 \le k \le n-1$ (we don't include $k = n$ since the condition in the problem only holds up to $n-1$ ) terms are a permutation of $(1, 2, \ldots, k)$ , and for all $k+1 \le i \le n-1$ , the condition in the problem still holds. Then, for each of these cases, there are $k!$ ways to arrange the first $k$ terms, and then $a_{n-k}$ ways to arrange the $k + 1$ to $n$ terms (assume by contradiction that terms from $k+1$ to $i$ is a permutation of $(k+1, k+2, \ldots, i)$ . Then, since the first $k$ terms are already a permutation of $(1, 2, \ldots, k)$ , the first $i$ terms form a permutation of $(1, 2, \ldots, i)$ . This contradicts our assumption that for all $k+1 \le i \le n-1$ , the condition still holds. Thus, we can only include the $a_{n-k}$ permutations of these terms). Now, summing the cases up and subtracting from $n!$ , we have: $a_n = n! - \sum_{k=1}^{n-1} a_{n-k} k!$ . From this recursion, we derive that $a_1 = 1$ $a_2 = 1$ $a_3 = 3$ $a_4 = 13$ $a_5 = 71$ , and finally $a_6 = \boxed{461}$
| 461
|
5,671
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 4
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
Let $A_i$ be the set of permutations such that there is no number greater than $i$ in the first $i$ places. Note that $\bigcap^{k}_{i=0}{A_{b_i}}=\prod^k_{i=1}{(b_i-b_{i-1})!}$ for all $1\le b_0 < b_1\cdots < b_k \le 5$ and that the set of restricted permutations is $A_1 \cup A_2 \cup A_3 \cup A_4 \cup A_5$
We will compute the cardinality of this set with PIE. \begin{align*} &|A_1| + |A_2| + |A_3| + |A_4| + |A_5|\\ = &120 + 48 + 36 + 48 + 120 = 372\\ \\ &|A_1 \cap A_2| + |A_1 \cap A_3| + |A_1 \cap A_4| + |A_1 \cap A_5| + |A_2 \cap A_3|\\ + &|A_2 \cap A_4| + |A_2 \cap A_5| + |A_3 \cap A_4| + |A_3 \cap A_5| + |A_4 \cap A_5|\\=&24+12+12+24+12+8+12+12+12+24=152\\ \\ &|A_1 \cap A_2 \cap A_3| + |A_1 \cap A_2 \cap A_4| + |A_1 \cap A_2 \cap A_5| + |A_1 \cap A_3 \cap A_4| + |A_1 \cap A_3 \cap A_5|\\ +& |A_1 \cap A_4 \cap A_5| + |A_2 \cap A_3 \cap A_4| + |A_2 \cap A_3 \cap A_5| + |A_2 \cap A_4 \cap A_5| + |A_3 \cap A_4 \cap A_5|\\=&6 + 4 + 6 + 4 + 4 + 6 + 4 + 4 + 4 + 6 = 48\\ \\ &|A_1 \cap A_2 \cap A_3 \cap A_4| + |A_1 \cap A_2 \cap A_3 \cap A_5| + |A_1 \cap A_2 \cap A_4 \cap A_5| + |A_1 \cap A_3 \cap A_4 \cap A_5| + |A_2 \cap A_3 \cap A_4 \cap A_5|\\=&2 + 2 + 2 + 2 + 2 = 10\\ \\ &|A_1 \cap A_2 \cap A_3 \cap A_4 \cap A_5| = 1 \end{align*} To finish, $720 - 372 + 152 - 48 + 10 - 1 = \boxed{461}$
| 461
|
5,672
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 5
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
Define the function $f(p,q)$ as the amount of permutations with maximum digit $q$ and string length $p$ that satisfy the condition within bounds. For example, $f(4,5)$ would be the amount of ways to make a string with length $4$ with the highest digit being $5$ . We wish to obtain $f(6,6)=f(5,6)$
To generate recursion, consider how we would get to $f(p,q)$ from $f(p-1,a)$ for all $a$ such that $p\le{a}\le6$ . We could either jump from the old maximum $a$ to the new $q$ by concatenating the old string and the new digit $q$ , or one could retain the maximum, in which case $a=q$ . To retain the maximum, one would have to pick a new available digit not exceeding $q$
In the first case, there is only one way to pick the new digit, namely picking $q$ . For the second case, there are $q-p+1$ digits left to choose, because there are $q$ digits between 1 and $q$ total and there are $p-1$ digits already chosen below or equal to $q$ . Thus, $f(p,q)=[\sum^{q-1}_{n=p}f(p-1,n)] + (q-p+1)f(p-1,q)$ . Now that we have the recursive function, we can start evaluating the values of $f(p,q)$ until we get to $f(6,6)=f(5,6)$
\[f(2,3)=3, f(2,4)=5, f(2,5)=7, f(2,6)=9\] \[f(3,4)=13, f(3,5)=29, f(3,6)=51\] \[f(4,5)=71, f(4,6)=195\] \[f(5,6)=461\] Our requested answer is thus $\boxed{461}$ ~sigma
| 461
|
5,673
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_11
| 6
|
Find the number of permutations of $1, 2, 3, 4, 5, 6$ such that for each $k$ with $1$ $\leq$ $k$ $\leq$ $5$ , at least one of the first $k$ terms of the permutation is greater than $k$
|
We can also solve this problem by counting the number of permutations that do NOT satisfy the given conditions; namely, these permutations must satisfy the condition that none of the first $k$ terms is greater than $k$ for $1\leq$ $k$ $\leq$ $5$ . We can further simplify this method by approaching it through casework on the first $k$ terms.
Case 1: None of the first one terms is greater than 1
The first term must obviously be one. Since there are five spaces left for numbers, there are a total of $5!=120$ permutations for this case.
Case 2: None of the first two terms is greater than 2
The first two terms must be 1 and 2 in some order. However, we already counted all cases starting with 1 in the previous case, so all of the permutations in this case must begin with $12\cdots$ . Since there are four spaces left, there are a total of $4!=24$ permutations for this case.
Case 3: None of the first three terms is greater than 3
The first three terms must be 1, 2, and 3 in some order. However, the cases beginning with 1__ and 21_ have already been accounted for. There are now $3!-3 = 3$ ways to order the first three numbers of the permutation, and $3!$ ways to order the last three numbers, for a total of $3\times6 = 18$ permutations.
Case 4: None of the first four terms is greater than 4
You can see where the pattern is going - the first four terms must be 1, 2, 3, and 4 in some order. All cases starting with 1 (there are $3!=6$ ), the cases starting with 21 (there are $2!=2$ ), and the 3 cases from case 3 (there are $3\times 1! = 3$ ) have been accounted for, so there are a total of $(4!-6-2-3)2!=26$ permutations for this case.
Case 5: None of the first five terms is greater than 5
This is perhaps the hardest case to work with, simply because there are so many subcases, so keeping track is crucial here. Obviously, the first five terms must be 1, 2, 3, 4, and 5, meaning there are 120 ways to order them. Now, we count the permutations we have already counted in previous cases. $4!$ start with 1, $3!$ start with 2, $3\times2!=6$ start with 3, and $13\times1!=13$ start with 4. Subtracting, we get a total of $120-24-6-6-13=71$ permutations.
Now, we subtract the total number of permutations from our cases from the total number of permutations, which is $6!$ $720 - 120 - 24 - 18 - 26 - 71 = \boxed{461}$
| 461
|
5,674
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 1
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
For reference, $2\sqrt{65} \approx 16$ , so $\overline{AD}$ is the longest of the four sides of $ABCD$ . Let $h_1$ be the length of the altitude from $B$ to $\overline{AC}$ , and let $h_2$ be the length of the altitude from $D$ to $\overline{AC}$ . Then, the triangle area equation becomes
\[\frac{h_1}{2}AP + \frac{h_2}{2}CP = \frac{h_1}{2}CP + \frac{h_2}{2}AP \rightarrow \left(h_1 - h_2\right)AP = \left(h_1 - h_2\right)CP \rightarrow AP = CP\]
What an important finding! Note that the opposite sides $\overline{AB}$ and $\overline{CD}$ have equal length, and note that diagonal $\overline{DB}$ bisects diagonal $\overline{AC}$ . This is very similar to what happens if $ABCD$ were a parallelogram with $AB = CD = 10$ , so let's extend $\overline{DB}$ to point $E$ , such that $AECD$ is a parallelogram. In other words, \[AE = CD = 10\] and \[EC = DA = 2\sqrt{65}\] Now, let's examine $\triangle ABE$ . Since $AB = AE = 10$ , the triangle is isosceles, and $\angle ABE \cong \angle AEB$ . Note that in parallelogram $AECD$ $\angle AED$ and $\angle CDE$ are congruent, so $\angle ABE \cong \angle CDE$ and thus \[\text{m}\angle ABD = 180^\circ - \text{m}\angle CDB\] Define $\alpha := \text{m}\angle CDB$ , so $180^\circ - \alpha = \text{m}\angle ABD$
We use the Law of Cosines on $\triangle DAB$ and $\triangle CDB$
\[\left(2\sqrt{65}\right)^2 = 10^2 + BD^2 - 20BD\cos\left(180^\circ - \alpha\right) = 100 + BD^2 + 20BD\cos\alpha\]
\[14^2 = 10^2 + BD^2 - 20BD\cos\alpha\]
Subtracting the second equation from the first yields
\[260 - 196 = 40BD\cos\alpha \rightarrow BD\cos\alpha = \frac{8}{5}\]
This means that dropping an altitude from $B$ to some foot $Q$ on $\overline{CD}$ gives $DQ = \frac{8}{5}$ and therefore $CQ = \frac{42}{5}$ . Seeing that $CQ = \frac{3}{5}\cdot BC$ , we conclude that $\triangle QCB$ is a 3-4-5 right triangle, so $BQ = \frac{56}{5}$ . Then, the area of $\triangle BCD$ is $\frac{1}{2}\cdot 10 \cdot \frac{56}{5} = 56$ . Since $AP = CP$ , points $A$ and $C$ are equidistant from $\overline{BD}$ , so \[\left[\triangle ABD\right] = \left[\triangle CBD\right] = 56\] and hence \[\left[ABCD\right] = 56 + 56 = \boxed{112}\] -kgator
| 112
|
5,675
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 2
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Denote $\angle APB$ by $\alpha$ . Then $\sin(\angle APB)=\sin \alpha = \sin(\angle APD)$ .
Using the formula for the area of a triangle, we get \[\frac{1}{2} (AP\cdot BP+ CP\cdot DP)\sin\alpha=\frac{1}{2}(AP\cdot DP+ CP\cdot BP)\sin\alpha ,\] so \[(AP-CP)(BP-DP)=0\] Hence $AP=CP$ (note that $BP=DP$ makes no difference here).
Now, assume that $AP=CP=x$ $BP=y$ , and $DP=z$ . Using the cosine rule for $\triangle APB$ and $\triangle BPC$ , it is clear that \[x^2+y^2-100=2 xy \cdot \cos{APB}=-(2 xy \cdot \cos{(\pi-CPB)})=-(x^2+y^2-196)\] or \begin{align}x^2+y^2=148\end{align}. Likewise, using the cosine rule for triangles $APD$ and $CPD$ \begin{align}\tag{2}x^2+z^2=180\end{align}. It follows that \begin{align}\tag{3}z^2-y^2=32\end{align}. Since $\sin\alpha=\sqrt{1-\cos^2\alpha}$ \[\sqrt{1-\frac{(x^2+y^2-100)^2}{4x^2y^2}}=\sqrt{1-\frac{(x^2+z^2-260)^2}{4x^2z^2}}\] which simplifies to \[\frac{48^2}{y^2}=\frac{80^2}{z^2} \qquad \Longrightarrow \qquad 5y=3z.\] Plugging this back to equations $(1)$ $(2)$ , and $(3)$ , it can be solved that $x=\sqrt{130},y=3\sqrt{2},z=5\sqrt{2}$ . Then, the area of the quadrilateral is \[x(y+z)\sin\alpha=\sqrt{130}\cdot8\sqrt{2}\cdot\frac{14}{\sqrt{260}}=\boxed{112}\] --Solution by MicGu
| 112
|
5,676
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 3
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
As in all other solutions, we can first find that either $AP=CP$ or $BP=DP$ , but it's an AIME problem, we can take $AP=CP$ , and assume the other choice will lead to the same result (which is true).
From $AP=CP$ , we have $[DAP]=[DCP]$ , and $[BAP]=[BCP] \implies [ABD] = [CBD]$ , therefore, \begin{align} \nonumber \frac 12 \cdot AB\cdot AD\sin A &= \frac 12 \cdot BC\cdot CD\sin C \\ \Longrightarrow \hspace{1in} 7\sin C &= \sqrt{65}\sin A \end{align} By Law of Cosines, \begin{align} \nonumber 10^2+14^2-2\cdot 10\cdot 14\cos C &= 10^2+4\cdot 65-2\cdot 10\cdot 2\sqrt{65}\cos A \\ \Longrightarrow \hspace{1in} -\frac 85 - 7\cos C &= \sqrt{65}\cos A \tag{2} \end{align} Square $(1)$ and $(2)$ , and add them, to get \[\left(\frac 85\right)^2 + 2\cdot \frac 85 \cdot 7\cos C + 7^2 = 65\] Solve, $\cos C = 3/5 \implies \sin C = 4/5$ \[[ABCD] = 2[BCD] = BC\cdot CD\cdot \sin C = 14\cdot 10\cdot \frac 45 = \boxed{112}\] -Mathdummy
| 112
|
5,677
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 4
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Either $PA=PC$ or $PD=PB$ . Let $PD=PB=s$ . Applying Stewart's Theorem on $\triangle ABD$ and $\triangle BCD$ , dividing by $2s$ and rearranging, \[\tag{1}CP^2+s^2=148\] \[\tag{2}AP^2+s^2=180\] Applying Stewart on $\triangle CAB$ and $\triangle CAD$ \[\tag{3} 5CP^2=3AP^2\] Substituting equations 1 and 2 into 3 and rearranging, $s=BP=PD\sqrt{130}, CP=3\sqrt{2}, PA=5\sqrt{2}$ . By Law of Cosines on $\triangle APB$ $\cos(\angle APB)=\frac{4\sqrt{65}}{65}$ so $\sin(\angle APB)=\sin(\angle BPC)=\sin(\angle CPD)=\sin(\angle DPA)=\frac{7\sqrt{65}}{65}$ . Using $[\triangle ABC]=\frac{ab\sin(\angle C)}{2}$ to find unknown areas, $[ABCD]=[\triangle APB]+[\triangle BPC]+[\triangle CPD]+[\triangle DPA]=\boxed{112}$
| 112
|
5,678
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 5
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Now we prove P is the midpoint of $BD$ . Denote the height from $B$ to $AC$ as $h_1$ , height from $D$ to $AC$ as $h_2$ .According to the problem, $AP* h_1 +CP* h_2 =CP* h_1 +AP* h_2$ implies $h_1 (AP-CP)= h_2 (AP-CP), h_1 = h_2$ . Then according to basic congruent triangles we get $BP=DP$ Firstly, denote that $CP=a,BP=b,CP=c,AP=d$ . Applying Stewart theorem, getting that $100c+196b=(b+c)(bc+a^2); 100b+260c=(b+c)(bc+c^2); 100c+196b=100b+260c, 3b=5c$ , denote $b=5x,c=3x$ Applying Stewart Theorem, getting $260a+100a=2a(a^2+25x^2); 196a+100a=2a(9x^2+a^2)$ solve for a, getting $a=\sqrt{130},AP=5\sqrt{2}; CP=3\sqrt{2}$ Now everything is clear, we can find $cos\angle{BPA}=\frac{4}{\sqrt{65}}$ using LOC, $sin\angle{BPA}=\frac{7\sqrt{65}}{65}$ , the whole area is $\sqrt{130}*8\sqrt{2}*\frac{7\sqrt{65}}{65}=\boxed{112}$
| 112
|
5,679
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 6
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
$BP = PD$ as in another solutions.
Let $D'$ be the reflection of $D$ across $C$ .
Let points $E, E',$ and $H$ be the foot of perpendiculars on $AC$ from $D,D'$ , and $B$ respectively. \begin{align*} &\qquad AB = CD = CD', \quad \textrm{and} \quad BH = DE = D'E' \\ \Rightarrow &\qquad \triangle ABH = \triangle CDE = \triangle CD'E' \\ \Rightarrow &\qquad \angle BAC = \angle ACD' \\ \Rightarrow &\qquad \triangle ABC = \triangle AD'C \\ \Rightarrow &\qquad BC = AD'. \end{align*} The area of quadrilateral $ABCD$ is equal to the area of triangle $ADD'$ with sides $AD' = 14, AD = 2\sqrt{65}, DD' = 2 \cdot 10 = 20$ .
The semiperimeter is $s = 17 + \sqrt{65},$ the area \[[ADD'] = \sqrt {(17 + \sqrt{65}) (17 - \sqrt{65})(3 + \sqrt{65})(\sqrt{65}-3)} = \sqrt{(289 – 65)\cdot(65-9)} =\sqrt{56 \cdot 4 \cdot 56} = \boxed{112}.\]
| 112
|
5,680
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 7
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Use your favorite method to get that $P$ is the midpoint of one of the two diagonals (suppose it's the midpoint of $\overline{AC}$ ). From here, let $x=AP=PC, y=BP, z=PD, a=\cos\theta$ where $\theta$ is the angle that the diagonals make. Then we have a system of four equations:
\begin{align*} x^2+y^2+2xya &= 100 \\ z^2+x^2+2xza &= 100 \\ x^2+y^2-2xya &= 196 \\ x^2+z^2-2xza &= 260 \\ \end{align*}
From these equations we get that \begin{align*} xya &= -24 \\ xza &= -40 \\ x^2+y^2-48 &= 10 \\ x^2+z^2-80 &= 10 \end{align*}
From here we can see that $\frac{z}{y}={5}{3}, z^2-y^2=32,$ so $z=5\sqrt{2}, y=3\sqrt{2}.$ Furthermore, this implies $x=\sqrt{130}$ and $xa=-4\sqrt{2},$ which implies $a=\cos\theta=\frac{4}{\sqrt{65}}.$ Then note that the area of the quadrilateral is \[\frac{1}{2}\sin\theta (xy+xz+xz+xy)=\sin\theta (\sqrt{130}\cdot 3\sqrt{2}+\sqrt{130} \cdot 5\sqrt{2})=7\cdot (3\cdot 2+5\cdot 2)=7(6+10)=7\cdot 16=\boxed{112}.\]
| 112
|
5,681
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 8
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Note that $\angle APB = \angle CPD = 180-\angle APD = 180-\angle BPC.$ (All angles are in degrees)
Since $\sin(\theta)=\sin(180-\theta),$ we can use sine area formula to get the following(after some simplifying steps): \begin{align*} BP \times AP + CP \times DP = BP \times PC + AP \times PD. \end{align*} For convenience, let $AP=a, BP=b, CP=c,DP=d.$ The above equation simplifies to: \begin{align*} ab + cd = bc + ad \\ab-ad+cd-bc=0 \\a(b-d)-c(b-d)=0 \\(a-c)(b-d)=0 \end{align*} From here, we see that $a=c$ or $b=d$ . Without loss of generality, let $a=c$ . Since triangles $ABP$ and $CDP$ are obviously not congruent, we see that one triangle is obtuse and the other one is acute.(Refer to the diagram) However, if we drop perpendiculars from $B$ to $AC$ and $D$ to $AC$ , we do get congruent triangles. If the foot of the perpendicular from $B$ is $M$ , and the foot of the perpendicular from $D$ is $N$ , then right triangle $BMP$ is congruent to right triangle $DNP$ .
From here, we see that the altitudes of triangles $ABC$ and $ADC$ to $AC$ are equal. Since they share base $AC$ , their areas are equal. We can use Heron's formula. To not have any fractions, let $AC=2x.$ \begin{align*} \sqrt{(12+x)(12-x)(x+2)(x-2)}=\sqrt{5+\sqrt{65}+x)(5+\sqrt{65}-x)(5-\sqrt{65}+x)(\sqrt{65}-5+x)} \end{align*} Even though this looks bad at first, it actually isn't too complicated to simplify. Expanding the differences of squares and simplifying completely, we get $x^2=32.$ Plugging this $x$ back into the Heron's formula, we get that the area of $ABC$ (or $ADC$ ) is $56$ . Since these triangles have equal area, the area of the quadrilateral is $2 \times 56 = \boxed{112}$ , and we are done. $\blacksquare$
| 112
|
5,682
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_12
| 9
|
Let $ABCD$ be a convex quadrilateral with $AB = CD = 10$ $BC = 14$ , and $AD = 2\sqrt{65}$ . Assume that the diagonals of $ABCD$ intersect at point $P$ , and that the sum of the areas of triangles $APB$ and $CPD$ equals the sum of the areas of triangles $BPC$ and $APD$ . Find the area of quadrilateral $ABCD$
|
Use any method to derive that $P$ is the midpoint of $A$ and $C$ . Now, either construct a parallelogram with as shown in the diagram to the right, or use law of sines. We will take the parallelogram route here, but the same thing can be done with law of sines on triangles $\triangle \textnormal{ABP}$ and $\triangle \textnormal{CPD}$ . Reflect $D$ across $P$ to get $D'$ . Since $CD = AD' = AB = 10$ $\triangle \textnormal{ABD'}$ is isosceles. Thus, $\angle AD'B = \angle ABD'$ , and because $ADCD'$ is a parallelogram (since $AP = PC$ and $DP = PD'$ ), $\angle AD'B = \angle BDC = \angle ABD'$ . So, $\angle ABD = 180 - \angle ABD' = 180 - \angle BDC$ . Now, apply law of cosines on $\triangle \textnormal{ABD}$ and $\triangle \textnormal{CDB}$ . We get:
\begin{align}
100 + BD^2 - 20BD \cos{\angle ABD} &= 100 + BD^2 - 20 BD \cos {(180 - \angle BDC)} = \\
100 + BD^2 + 20 BD \cos{\angle BDC} &= 260 \\
&\textnormal{and} \\
100 + BD^2 - 20 BD \cos{\angle BDC} &= 196 \\
\textnormal{summing }&\textnormal{and simplifying,} \\
BD &= 8\sqrt{2}
\end{align}
Then, applying law of cosines on $\triangle \textnormal{BCD}$ again, we obtain \[100 + 196 - 280 \cos{\angle BCD} = BD^2 = 128 \implies \cos{\angle BCD} = \frac{3}{5} \implies \sin{\angle BCD} = \frac{4}{5}\] Since $AP = PD$ $[ABD] = [BCD] \implies [ABCD] = [ABD] + [BCD] = 2[BCD]$ . Thus, $[ABCD] = 2[BCD] = 2 \cdot \frac{1}{2} \cdot 10 \cdot 14 \sin{\angle BCD} = 140 \cdot \frac{4}{5} = \boxed{112}$
| 112
|
5,683
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 1
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let $P_n$ be the probability of getting consecutive $1,2,3$ rolls in $n$ rolls and not rolling $1,2,3$ prior to the nth roll.
Let $x = P_3+P_5+...=1-(P_4+P_6+..)$ . Following Solution 2, one can see that \[P_{n+1}=P_{n}-\frac{P_{n-2}}{6^3}\] for all positive integers $n \ge 5$ . Summing for $n=5,7,...$ gives \[(1-x)-\frac{1}{6^3}=x-\frac{1}{6^3}-\frac{x}{6^3}\] \[\implies x = \frac{m}{n} = \frac{216}{431} \implies m+n=216+431= \boxed{647}\]
| 647
|
5,684
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 2
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let $P_{odd}=\frac{m}{n}$ , with the subscript indicating an odd number of rolls. Then $P_{even}=1-\frac{m}{n}$
The ratio of $\frac{P_{odd}}{P_{even}}$ is just $\frac{P_{odd}}{1-P_{odd}}$
We see that $P_{odd}$ is the sum of $P_3$ $P_5$ $P_7$ ,... , while $P_{even}$ is the sum of $P_4$ $P_6$ $P_8$ ,... .
$P_3$ , the probability of getting rolls of 1-2-3 in exactly 3 rolls, is obviously $\frac{1}{216}$
We set this probability of $P_3$ aside, meaning we totally remove the chance of getting 1-2-3 in 3 rolls. Now the ratio of $P_4+P_6+P_8+...$ to $P_5+P_7+P_9+...$ should be equal to the ratio of $\frac{P_{odd}}{P_{even}}$ , because in this case the 1st roll no longer matters, so we can disregard the very existence of it in counting how many times of rolls, and thus, 4 rolls, 6 rolls, 8 rolls... would become an odd number of rolls (while 5 rolls, 7 rolls, 9 rolls... would become even number of rolls).
Notice $P_4+P_6+P_8+...=P_{even}$ , and also $P_5+P_7+P_9+...=P_{odd}-P_3=P_{odd}-\frac{1}{216}$
So we have $\frac{P_{even}}{P_{odd}-\frac{1}{216}}=\frac{P_{odd}}{P_{even}}$
Finally, we get $P_{odd}=\frac{m}{n}=\frac{216}{431}$ .
Therefore, $m+n = \boxed{647}$
| 647
|
5,685
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 3
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Call the probability you win on a certain toss $f_n$ , where $n$ is the toss number.
Obviously, since the sequence has length 3, $f_1=0$ and $f_2=0$ .
Additionally, $f_3=\left(\frac{1}{6}\right)^3$ . We can call this value $x$ , to keep our further equations looking clean.
We can now write our general form for $f$ as $f_n=x\left(1-\sum_{i=1}^{n-3}f_i\right)$ . This factors the probability of the last 3 rolls being 1-2-3, and the important probability that the sequence has not been rolled in the past (because then the game would already be over).
Note that $\sum_{i=1}^{\infty}f_i=1$ since you'll win at some point.
An intermediate step here is figuring out $f_n-f_{n+1}$ . This is equal to $x\left(1-\sum_{i=1}^{n-3}f_i\right)-x\left(1-\sum_{i=1}^{n-2}f_i\right)=x\left(\sum_{i=1}^{n-2}f_i-\sum_{i=1}^{n-3}f_i\right)=xf_{n-2}$ .
Adding up all the differences, i.e. $\sum_{i=2}^{\infty}(f_{2n-1}-f_{2n})$ will give us the amount by which the odds probability exceeds the even probability. Since they sum to 1, that means the odds probability will be half of the difference above one-half. Subbing in our earlier result from the intermediate step, the odd probability is equal to $\frac{1}{2}+\frac{1}{2}x\sum_{i=2}^{\infty}f_{2n-3}$ .
Another way to find the odd probability is simply summing it up, which turns out to be $\sum_{i=1}^{\infty}f_{2n-1}$ . Note the infinite sums in both expressions are equal; let's call it $P$ . Equating them gives $\frac{1}{2}+\frac{1}{2}xP=P$ , or $P=\frac{1}{2-x}$ .
Finally, substituting $x=\frac{1}{216}$ , we find that $P=\frac{216}{431}$ , giving us a final answer of $216 + 431 = \boxed{647}$
| 647
|
5,686
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 4
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let $S(n)$ be the number of strings of length $n$ containing the digits $1$ through $6$ that do not contain the string $123$ . Then we have $S(n) = 6 \cdot S(n-1) - S(n-3)$ because we can add any digit to end of a string with length $n-1$ but we have to subtract all the strings that end in $123$ . We rewrite this as \begin{align*} S(n) &= 6 \cdot S(n-1) - S(n-3) \\ &= 6 \cdot (6 \cdot S(n-2) - S(n-4)) - (6 \cdot (S(n-4) - S(n-6)) \\ &= 36 \cdot S(n-2) - 12 \cdot S(n-4) + S(n-6) \end{align*} We wish to compute $P=\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}}$ since the last three rolls are $123$ for the game to end. Summing over the recursion, we obtain \[\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}} =36 \cdot \sum_{n=0}^\infty \frac{S(2n-2)}{6^{2n+3}} - 12 \cdot \sum_{n=0}^\infty \frac{S(2n-4)}{6^{2n+3}}+ \sum_{n=0}^\infty \frac{S(2n-6)}{6^{2n+3}}\] Now shift the indices so that the inside term is the same: \begin{align*} \sum_{n=3}^\infty \frac{S(2n)}{6^{2n+3}} &= \frac{36}{6^2} \cdot \sum_{n=2}^\infty \frac{S(2n)}{6^{2n+3}} - \frac{12}{6^4} \cdot \sum_{n=1}^\infty \frac{S(2n)}{6^{2n+3}} + \frac{1}{6^6} \cdot \sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}} \\ \left(P - \frac{S(0)}{6^3} - \frac{S(2)}{6^5} -\frac{S(4)}{6^7} \right) &= \frac{36}{6^2} \cdot \left( P - \frac{S(0)}{6^3} - \frac{S(2)}{6^5}\right) - \frac{12}{6^4} \cdot \left( P - \frac{S(0)}{6^3} \right) + \frac{1}{6^6} \cdot P \end{align*} Note that $S(0) = 1, S(2) = 36$ and $S(4) = 6^4 - 2 \cdot 6 = 1284$ . Therefore, \begin{align*} \left(P - \frac{1}{6^3} - \frac{36}{6^5} -\frac{1284}{6^7} \right) = \frac{36}{6^2} \cdot \left( P - \frac{1}{6^3} - \frac{36}{6^5}\right) - \frac{12}{6^4} \cdot \left( P - \frac{1}{6^3} \right) + \frac{1}{6^6} \cdot P \end{align*} Solving for $P$ , we obtain $P = \frac{216}{431} \implies m+n = \boxed{647}$
| 647
|
5,687
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 5
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let $A=\frac{1}{6} \begin{bmatrix} 5 & 1 & 0 & 0 \\ 4 & 1 & 1 & 0 \\ 4 & 1 & 0 & 1 \\ 0 & 0 & 0 & 0 \\ \end{bmatrix}$ $A$ is a transition matrix for the prefix of 1-2-3 matched so far. The state corresponding to a complete match has no outgoing probability mass. The probability that we roll the dice exactly $k$ times is $(A^k)_{1,4}$ . Thus the probability that we roll the dice an odd number of times is $1-\left(\sum_{k=0}^\infty A^{2k}\right)_{1,4} = 1-\left((I - A^2)^{-1}\right)_{1,4} = \frac{216}{431}$ . Thus the answer is $216+431=\boxed{647}$
| 647
|
5,688
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 6
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Consider it as a contest of Odd and Even. Let $P_o$ and $P_e$ be probability that Odd and Even wins, respectively. If we consider every 3 rolls as an atomic action, then we can have a simple solution. If the rolls is 1-2-3, Odd wins; otherwise, Odd and Even switch the odds of winning. Therefore, we have \[P_o = \frac{1}{216} + \frac{215}{216}P_e\] Plug in $P_e = 1 - P_o$ and we can easily solve for $Po=\frac{216}{431}$
$\boxed{647}$
| 647
|
5,689
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_13
| 7
|
Misha rolls a standard, fair six-sided die until she rolls $1-2-3$ in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let $P_o$ $P_e$ be the winning probabilities respectively. We call Odd "in position" when a new sequence of 1-2-3 starts at odd position, and likewise, call Even is "in position" when a new sequence starts at even position.
Now, consider the situation when the first roll is $1.$ The conditional probability for Odd or Even to eventually win out depends on whose is in position. So let's denote by $P_o(1), P_e(1)$ the probabilities of Odd and Even winning out, respectively, both when Odd is in position. Remember that the probabilities simply switch if Even is in position. Similarly, after 1-2 is rolled, we denote by $P_o(2), P_e(2)$ the conditional probabilities of Odd and Even winning out, when Odd is in position.
Consider the first roll. If it's not a 1, the sequence restarts, but Even is now in position; if it's a 1, then Odd's winning probability becomes $P_o(1)$ . So, \[P_o = \frac{1}{6}P_o(1) + \frac{5}{6}P_e\] In the next roll, there are 3 outcomes. If the roll is 2, then Odd's winning probability becomes $P_o(2)$ ; if the roll is 1, then we stay in the sequence, but Even is now in position, so the probability of Odd winning now becomes $P_e(1)$ ; if the rolls is any other number, then the sequence restarts, and Odd is still in position. So, \[P_o(1) = \frac{1}{6}P_o(2) + \frac{1}{6}P_e(1) + \frac{4}{6}P_o\] In the next roll after a 1-2 sequence, there are 3 outcomes. If the roll is a 3, Odd wins; if it's a 1, we go back to the state when 1 is just rolled, and Odd is in position; if it's any other number, then the sequence restarts, and Even is in position. So, \[P_o(2) = \frac{1}{6} + \frac{1}{6}P_o(1) + \frac{4}{6}P_e\]
Plug in $P_e = 1-P_o$ and $P_e(1) = 1 - P_o(1)$ , we have a 3-equation linear system which is not hard to solve. The final answer is $Po=\frac{216}{431}$ $\boxed{647}$ . (We want P_o because if it starts odd, it will also end odd)
| 647
|
5,690
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_14
| 1
|
The incircle $\omega$ of triangle $ABC$ is tangent to $\overline{BC}$ at $X$ . Let $Y \neq X$ be the other intersection of $\overline{AX}$ with $\omega$ . Points $P$ and $Q$ lie on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $\overline{PQ}$ is tangent to $\omega$ at $Y$ . Assume that $AP = 3$ $PB = 4$ $AC = 8$ , and $AQ = \dfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let the sides $\overline{AB}$ and $\overline{AC}$ be tangent to $\omega$ at $Z$ and $W$ , respectively. Let $\alpha = \angle BAX$ and $\beta = \angle AXC$ . Because $\overline{PQ}$ and $\overline{BC}$ are both tangent to $\omega$ and $\angle YXC$ and $\angle QYX$ subtend the same arc of $\omega$ , it follows that $\angle AYP = \angle QYX = \angle YXC = \beta$ . By equal tangents, $PZ = PY$ . Applying the Law of Sines to $\triangle APY$ yields \[\frac{AZ}{AP} = 1 + \frac{ZP}{AP} = 1 + \frac{PY}{AP} = 1 + \frac{\sin\alpha}{\sin\beta}.\] Similarly, applying the Law of Sines to $\triangle ABX$ gives \[\frac{AZ}{AB} = 1 - \frac{BZ}{AB} = 1 - \frac{BX}{AB} = 1 - \frac{\sin\alpha}{\sin\beta}.\] It follows that \[2 = \frac{AZ}{AP} + \frac{AZ}{AB} = \frac{AZ}3 + \frac{AZ}7,\] implying $AZ = \tfrac{21}5$ . Applying the same argument to $\triangle AQY$ yields \[2 = \frac{AW}{AQ} + \frac{AW}{AC} = \frac{AZ}{AQ} + \frac{AZ}{AC} = \frac{21}5\left(\frac{1}{AQ} + \frac 18\right),\] from which $AQ = \tfrac{168}{59}$ . The requested sum is $168 + 59 = \boxed{227}$
| 227
|
5,691
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_14
| 3
|
The incircle $\omega$ of triangle $ABC$ is tangent to $\overline{BC}$ at $X$ . Let $Y \neq X$ be the other intersection of $\overline{AX}$ with $\omega$ . Points $P$ and $Q$ lie on $\overline{AB}$ and $\overline{AC}$ , respectively, so that $\overline{PQ}$ is tangent to $\omega$ at $Y$ . Assume that $AP = 3$ $PB = 4$ $AC = 8$ , and $AQ = \dfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Let the center of the incircle of $\triangle ABC$ be $O$ . Link $OY$ and $OX$ . Then we have $\angle OYP=\angle OXB=90^{\circ}$
$\because$ $OY=OX$
$\therefore$ $\angle OYX=\angle OXY$
$\therefore$ $\angle PYX=\angle YXB$
$\therefore$ $\sin \angle PYX=\sin \angle YXB=\sin \angle YXC=\sin \angle PYA$
Let the incircle of $ABC$ be tangent to $AB$ and $AC$ at $M$ and $N$ , let $MP=YP=x$ and $NQ=YQ=y$
Use Law of Sine in $\triangle APY$ and $\triangle AXB$ , we have
$\frac{\sin \angle PAY}{PY}=\frac{\sin \angle PYA}{PA}$
$\frac{\sin \angle BAX}{BX}=\frac{\sin \angle AXB}{AB}$
therefore we have
$\frac{3}{x}=\frac{7}{4-x}$
Solve this equation, we have $x=\frac{6}{5}$
As a result, $MB=4-x=\frac{14}{5}=BX$ $AM=x+3=\frac{21}{5}=AN$ $NC=8-AN=\frac{19}{5}=XC$ $AQ=\frac{21}{5}-y$ $PQ=\frac{6}{5}+y$
So, $BC=\frac{14}{5}+\frac{19}{5}=\frac{33}{5}$
Use Law of Cosine in $\triangle BAC$ and $\triangle PAQ$ , we have
$\cos \angle BAC=\frac{AB^2+AC^2-BC^2}{2\cdot AB\cdot AC}=\frac{7^2+8^2-{(\frac{33}{5})}^2}{2\cdot 7\cdot 8}$
$\cos \angle PAQ=\frac{AP^2+AQ^2-PQ^2}{2\cdot AP\cdot AQ}=\frac{3^2+{(\frac{21}{5}-y)}^2-{(\frac{6}{5}+y)}^2}{2\cdot {(\frac{21}{5}-y)}\cdot 3}$
And we have
$\cos \angle BAC=\cos \angle PAQ$
So
$\frac{7^2+8^2-{(\frac{33}{5})}^2}{2\cdot 7\cdot 8}=\frac{3^2+{(\frac{21}{5}-y)}^2-{(\frac{6}{5}+y)}^2}{2\cdot {(\frac{21}{5}-y)}\cdot 3}$
Solve this equation, we have $y=\frac{399}{295}=QN$
As a result, $AQ=AN-QN=\frac{21}{5}-\frac{399}{295}=\frac{168}{59}$
So, the final answer of this question is $168+59=\boxed{227}$
| 227
|
5,692
|
https://artofproblemsolving.com/wiki/index.php/2018_AIME_II_Problems/Problem_15
| 1
|
Find the number of functions $f$ from $\{0, 1, 2, 3, 4, 5, 6\}$ to the integers such that $f(0) = 0$ $f(6) = 12$ , and \[|x - y| \leq |f(x) - f(y)| \leq 3|x - y|\] for all $x$ and $y$ in $\{0, 1, 2, 3, 4, 5, 6\}$
|
Because $f(n)$ and $f(n+1)$ can differ by at most 3 for $n=0,1,2,3,4,5$ $f$ can decrease at most once. This is because if $f$ decreases $2$ times (or more) then we get a contradiction: $12 = f(6) \le 3\cdot 4 + (-1)\cdot 2 = 10$
If $f$ never decreases, then $f(n+1)-f(n)\in \{1,2,3\}$ for all $n$ . Let $a, b$ , and $c$ denote the number of times this difference is $1, 2$ , and $3$ , respectively. Then $a+b+c=6$ and $a+2b+3c = 12$ . Subtracting the first equation from the second yields $b+2c=6$ , so $(b,c)=(6,0), (4,1), (2,2)$ , or $(0,3)$ . These yield $a=0,1,2$ , or $3$ , respectively, so the number of possibilities in this case is \[\binom{6}{0,6,0}+\binom{6}{1,4,1}+\binom{6}{2,2,2}+\binom{6}{3,0,3}=141.\] If $f$ decreases from $f(0)$ to $f(1)$ or from $f(5)$ to $f(6)$ , then $f(2)$ or $f(4)$ , respectively, is determined. The only solutions to $a+b+c=4$ and $a+2b+3c=10$ are $(a,b,c)=(1,0,3)$ and $(a,b,c)=(0,2,2)$ , so the number of functions is \[2\left[\binom{4}{1,0,3}+\binom{4}{0,2,2}\right]=20.\] Finally, suppose that $f(n+1)<f(n)$ for some $n=1,2,3,4$ . Note that the condition $|(n+1)-(n-1)|\le |f(n+1)-f(n-1)|$ implies that $f(n+1)-f(n-1)\ge 2$ , so it must be that $f(n)-f(n+1)=1$ and \[f(n+2)-f(n+1)=f(n)-f(n-1)=3.\] This means that $f(n-1)$ and $f(n+2)$ are uniquely determined by the value of $f(n)$ , and, in particular, that $f(n+2)-f(n-1)=5$ . As a result, there are three more values of $f$ to determine, and they must provide a total increase of $7$ . The only ways to do this are either to have two differences of $3$ and one difference of $1$ , which can be arranged in $3$ ways, or to have one difference of $3$ and two differences of $2$ , which can be arranged in $3$ ways. Thus for each of the $4$ possibilities for $n$ , there are $6$ ways to arrange the increases, giving a total of $24$ ways.
The total number of functions is $141+20+24=\boxed{185}$
| 185
|
5,693
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_1
| 1
|
Fifteen distinct points are designated on $\triangle ABC$ : the 3 vertices $A$ $B$ , and $C$ $3$ other points on side $\overline{AB}$ $4$ other points on side $\overline{BC}$ ; and $5$ other points on side $\overline{CA}$ . Find the number of triangles with positive area whose vertices are among these $15$ points.
|
Every triangle is uniquely determined by 3 points. There are $\binom{15}{3}=455$ ways to choose 3 points, but that counts the degenerate triangles formed by choosing three points on a line. There are $\binom{5}{3}$ invalid cases on segment $AB$ $\binom{6}{3}$ invalid cases on segment $BC$ , and $\binom{7}{3}$ invalid cases on segment $CA$ for a total of $65$ invalid cases. The answer is thus $455-65=\boxed{390}$
| 390
|
5,694
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_4
| 1
|
A pyramid has a triangular base with side lengths $20$ $20$ , and $24$ . The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$ . The volume of the pyramid is $m\sqrt{n}$ , where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$
|
Let the triangular base be $\triangle ABC$ , with $\overline {AB} = 24$ . We find that the altitude to side $\overline {AB}$ is $16$ , so the area of $\triangle ABC$ is $(24*16)/2 = 192$
Let the fourth vertex of the tetrahedron be $P$ , and let the midpoint of $\overline {AB}$ be $M$ . Since $P$ is equidistant from $A$ $B$ , and $C$ , the line through $P$ perpendicular to the plane of $\triangle ABC$ will pass through the circumcenter of $\triangle ABC$ , which we will call $O$ . Note that $O$ is equidistant from each of $A$ $B$ , and $C$ . Then,
\[\overline {OM} + \overline {OC} = \overline {CM} = 16\]
Let $\overline {OM} = d$ . Then $OC=OA=\sqrt{d^2+12^2}.$ Equation $(1)$ \[d + \sqrt {d^2 + 144} = 16\]
Squaring both sides, we have
\[d^2 + 144 + 2d\sqrt {d^2+144} + d^2 = 256\]
\[2d^2 + 2d\sqrt {d^2+144} = 112\]
\[2d(d + \sqrt {d^2+144}) = 112\]
Substituting with equation $(1)$
\[2d(16) = 112\]
\[d = 7/2\]
We now find that $\sqrt{d^2 + 144} = 25/2$
Let the distance $\overline {OP} = h$ . Using the Pythagorean Theorem on triangle $AOP$ $BOP$ , or $COP$ (all three are congruent by SSS):
\[25^2 = h^2 + (25/2)^2\]
\[625 = h^2 + 625/4\]
\[1875/4 = h^2\]
\[25\sqrt {3} / 2 = h\]
Finally, by the formula for volume of a pyramid,
\[V = Bh/3\]
\[V = (192)(25\sqrt{3}/2)/3\] This simplifies to $V = 800\sqrt {3}$ , so $m+n = \boxed{803}$
| 803
|
5,695
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_4
| 2
|
A pyramid has a triangular base with side lengths $20$ $20$ , and $24$ . The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$ . The volume of the pyramid is $m\sqrt{n}$ , where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$
|
We can place a three dimensional coordinate system on this pyramid. WLOG assume the vertex across from the line that has length $24$ is at the origin, or $(0, 0, 0)$ . Then, the two other vertices can be $(-12, -16, 0)$ and $(12, -16, 0)$ . Let the fourth vertex have coordinates of $(x, y, z)$ . We have the following $3$ equations from the distance formula.
\[x^2+y^2+z^2=625\]
\[(x+12)^2+(y+16)^2+z^2=625\]
\[(x-12)^2+(y+16)^2+z^2=625\]
Adding the last two equations and substituting in the first equation, we get that $y=-\frac{25}{2}$ . If you drew a good diagram, it should be obvious that $x=0$ . Now, solving for $z$ , we get that $z=\frac{25\sqrt{3}}{2}$ . So, the height of the pyramid is $\frac{25\sqrt{3}}{2}$ . The base is equal to the area of the triangle, which is $\frac{1}{2} \cdot 24 \cdot 16 = 192$ . The volume is $\frac{1}{3} \cdot 192 \cdot \frac{25\sqrt{3}}{2} = 800\sqrt{3}$ . Thus, the answer is $800+3 = \boxed{803}$
| 803
|
5,696
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_4
| 3
|
A pyramid has a triangular base with side lengths $20$ $20$ , and $24$ . The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$ . The volume of the pyramid is $m\sqrt{n}$ , where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$
|
Label the four vertices of the tetrahedron and the midpoint of $\overline {AB}$ , and notice that the area of the base of the tetrahedron, $\triangle ABC$ , equals $192$ , according to Solution 1.
Notice that the altitude of $\triangle CPM$ from $\overline {CM}$ to point $P$ is the height of the tetrahedron. Side $\overline {PM}$ is can be found using the Pythagorean Theorem on $\triangle APM$ , giving us $\overline {PM}=\sqrt{481}.$
Using Heron's Formula, the area of $\triangle CPM$ can be written as \[\sqrt{\frac{41+\sqrt{481}}{2}(\frac{41+\sqrt{481}}{2}-16)(\frac{41+\sqrt{481}}{2}-25)(\frac{41+\sqrt{481}}{2}-\sqrt{481})}\] \[=\frac{\sqrt{(41+\sqrt{481})(9+\sqrt{481})(-9+\sqrt{481})(41-\sqrt{481})}}{4}\]
Notice that both $(41+\sqrt{481})(41-\sqrt{481})$ and $(9+\sqrt{481})(-9+\sqrt{481})$ can be rewritten as differences of squares; thus, the expression can be written as \[\frac{\sqrt{(41^2-481)(481-9^2)}}{4}=\frac{\sqrt{480000}}{4}=100\sqrt{3}.\]
From this, we can determine the height of both $\triangle CPM$ and tetrahedron $ABCP$ to be $\frac{100\sqrt{3}}{8}$ ; therefore, the volume of the tetrahedron equals $\frac{100\sqrt{3}}{8} \cdot 192=800\sqrt{3}$ ; thus, $m+n=800+3=\boxed{803}.$
| 803
|
5,697
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_4
| 4
|
A pyramid has a triangular base with side lengths $20$ $20$ , and $24$ . The three edges of the pyramid from the three corners of the base to the fourth vertex of the pyramid all have length $25$ . The volume of the pyramid is $m\sqrt{n}$ , where $m$ and $n$ are positive integers, and $n$ is not divisible by the square of any prime. Find $m+n$
|
Notation is shown on diagram. \[AM = MB = c = 12, AC = BC = b = 20,\] \[DA = DB = DC = a = 25.\] \[CM = x + y = \sqrt{b^2-c^2} = 16,\] \[x^2 - y^2 = CD^2 – DM^2 = CD^2 – (BD^2 – BM^2) = c^2 = 144,\] \[x – y = \frac{x^2 – y^2}{x+y} = \frac {c^2} {16} = 9,\] \[x = \frac {16 + 9}{2} = \frac {a}{2},\] \[h = \sqrt{a^2 -\frac{ a^2}{4}} = a \frac {\sqrt{3}}{2},\] \[V = \frac{h\cdot CM \cdot c}{3}= \frac{16\cdot 25 \sqrt{3} \cdot 12}{3} = 800 \sqrt{3} \implies \boxed{803}.\] vladimir.shelomovskii@gmail.com, vvsss
| 803
|
5,698
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_5
| 1
|
A rational number written in base eight is $\underline{ab} . \underline{cd}$ , where all digits are nonzero. The same number in base twelve is $\underline{bb} . \underline{ba}$ . Find the base-ten number $\underline{abc}$
|
First, note that the first two digits will always be a positive number. We will start with base twelve because of its repetition. List all the positive numbers in base eight that have equal tens and ones digits in base 12.
$11_{12}=15_8$
$22_{12}=32_8$
$33_{12}=47_8$
$44_{12}=64_8$
$55_{12}=101_8$
We stop because we only can have two-digit numbers in base 8 and 101 is not a 2 digit number.
Compare the ones places to check if they are equal. We find that they are equal if $b=2$ or $b=4$ .
Evaluating the places to the right side of the decimal point gives us $22.23_{12}$ or $44.46_{12}$ .
When the numbers are converted into base 8, we get $32.14_8$ and $64.30_8$ . Since $d\neq0$ , the first value is correct. Compiling the necessary digits leaves us a final answer of $\boxed{321}$
| 321
|
5,699
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_5
| 2
|
A rational number written in base eight is $\underline{ab} . \underline{cd}$ , where all digits are nonzero. The same number in base twelve is $\underline{bb} . \underline{ba}$ . Find the base-ten number $\underline{abc}$
|
The parts before and after the decimal points must be equal. Therefore $8a + b = 12b + b$ and $c/8 + d/64 = b/12 + a/144$ . Simplifying the first equation gives $a = (3/2)b$ . Plugging this into the second equation gives $3b/32 = c/8 + d/64$ . Multiplying both sides by 64 gives $6b = 8c + d$ $a$ and $b$ are both digits between 1 and 7 (they must be a single non-zero digit in base eight) so using $a = 3/2b$ $(a,b) = (3,2)$ or $(6,4)$ . Testing these gives that $(6,4)$ doesn't work, and $(3,2)$ gives $a = 3, b = 2, c = 1$ , and $d = 4$ . Therefore $abc = \boxed{321}$
| 321
|
5,700
|
https://artofproblemsolving.com/wiki/index.php/2017_AIME_I_Problems/Problem_5
| 3
|
A rational number written in base eight is $\underline{ab} . \underline{cd}$ , where all digits are nonzero. The same number in base twelve is $\underline{bb} . \underline{ba}$ . Find the base-ten number $\underline{abc}$
|
Converting to base $10$ we get
$4604a+72c+9d=6960b$
Since $72c$ and $9d$ are much smaller than the other two terms, dividing by $100$ and approximating we get
$46a=70b$
Writing out the first few values of $a$ and $b$ , the first possible tuple is
$a=3, b=2, c=1, d=4$
and the second possible tuple is
$a=6, b=4, c=3, d=0$
Note that $d$ can not be $0$ , therefore the answer is $\boxed{321}$
| 321
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.