id
int64 1
7.14k
| link
stringlengths 75
84
| no
int64 1
14
| problem
stringlengths 14
5.33k
| solution
stringlengths 21
6.43k
| answer
int64 0
999
|
|---|---|---|---|---|---|
6,101
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_4
| 7
|
In triangle $ABC$ $AB=20$ and $AC=11$ . The angle bisector of $\angle A$ intersects $BC$ at point $D$ , and point $M$ is the midpoint of $AD$ . Let $P$ be the point of the intersection of $AC$ and $BM$ . The ratio of $CP$ to $PA$ can be expressed in the form $\dfrac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Assume $ABC$ is a right triangle at $A$ . Line $AD = x$ and $BC = \tfrac{-11}{20}x + 11$ . These two lines intersect at $D$ which have coordinates $(\frac{220}{31},\frac{220}{31})$ and thus $M$ has coordinates $(\frac{110}{31},\frac{110}{31})$ . Thus, the line $BM = \tfrac{11}{51} \cdot (20-x)$ . When $x = 0$ $P$ has $y$ coordinate equal to $\frac{11\cdot20}{51} \frac{AP + CP}{AP} = 1 + \frac{CP}{AP}$ $\tfrac{51}{20} = 1 + \frac{CP}{AP},$ which equals ${\tfrac{31}{20}},$ giving an answer of $\boxed{51}.$
| 51
|
6,102
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_5
| 1
|
The sum of the first $2011$ terms of a geometric sequence is $200$ . The sum of the first $4022$ terms is $380$ . Find the sum of the first $6033$ terms.
|
Since the sum of the first $2011$ terms is $200$ , and the sum of the first $4022$ terms is $380$ , the sum of the second $2011$ terms is $180$ .
This is decreasing from the first 2011, so the common ratio is less than one.
Because it is a geometric sequence and the sum of the first 2011 terms is $200$ , second $2011$ is $180$ , the ratio of the second $2011$ terms to the first $2011$ terms is $\frac{9}{10}$ . Following the same pattern, the sum of the third $2011$ terms is $\frac{9}{10}*180 = 162$
Thus, $200+180+162=542$ , so the sum of the first $6033$ terms is $\boxed{542}$
| 542
|
6,103
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_5
| 2
|
The sum of the first $2011$ terms of a geometric sequence is $200$ . The sum of the first $4022$ terms is $380$ . Find the sum of the first $6033$ terms.
|
Solution by e_power_pi_times_i
The sum of the first $2011$ terms can be written as $\dfrac{a_1(1-k^{2011})}{1-k}$ , and the first $4022$ terms can be written as $\dfrac{a_1(1-k^{4022})}{1-k}$ . Dividing these equations, we get $\dfrac{1-k^{2011}}{1-k^{4022}} = \dfrac{10}{19}$ . Noticing that $k^{4022}$ is just the square of $k^{2011}$ , we substitute $x = k^{2011}$ , so $\dfrac{1}{x+1} = \dfrac{10}{19}$ . That means that $k^{2011} = \dfrac{9}{10}$ . Since the sum of the first $6033$ terms can be written as $\dfrac{a_1(1-k^{6033})}{1-k}$ , dividing gives $\dfrac{1-k^{2011}}{1-k^{6033}}$ . Since $k^{6033} = \dfrac{729}{1000}$ , plugging all the values in gives $\boxed{542}$
| 542
|
6,104
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_5
| 3
|
The sum of the first $2011$ terms of a geometric sequence is $200$ . The sum of the first $4022$ terms is $380$ . Find the sum of the first $6033$ terms.
|
The sum of the first 2011 terms of the sequence is expressible as $a_1 + a_1r + a_1r^2 + a_1r^3$ .... until $a_1r^{2010}$ . The sum of the 2011 terms following the first 2011 is expressible as $a_1r^{2011} + a_1r^{2012} + a_1r^{2013}$ .... until $a_1r^{4021}$ . Notice that the latter sum of terms can be expressed as $(r^{2011})(a_1 + a_1r + a_1r^2 + a_1r^3...a_1r^{2010})$ . We also know that the latter sum of terms can be obtained by subtracting 200 from 380, which then means that $r^{2011} = 9/10$ . The terms from 4023 to 6033 can be expressed as $(r^{4022})(a_1 + a_1r + a_1r^2 + a_1r^3...a_1r^{2010})$ , which is equivalent to $((9/10)^2)(200) = 162$ . Adding 380 and 162 gives the answer of $\boxed{542}$
| 542
|
6,105
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_8
| 1
|
Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$ . For each $j$ , let $w_j$ be one of $z_j$ or $i z_j$ . Then the maximum possible value of the real part of $\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$
|
The twelve dots above represent the $12$ roots of the equation $z^{12}-2^{36}=0$ . If we write $z=a+bi$ , then the real part of $z$ is $a$ and the real part of $iz$ is $-b$ . The blue dots represent those roots $z$ for which the real part of $z$ is greater than the real part of $iz$ , and the red dots represent those roots $z$ for which the real part of $iz$ is greater than the real part of $z$ . Now, the sum of the real parts of the blue dots is easily seen to be $8+16\cos\frac{\pi}{6}=8+8\sqrt{3}$ and the negative of the sum of the imaginary parts of the red dots is easily seen to also be $8+8\sqrt{3}$ . Hence our desired sum is $16+16\sqrt{3}=16+\sqrt{768}$ , giving the answer $\boxed{784}.$
| 784
|
6,106
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_8
| 2
|
Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$ . For each $j$ , let $w_j$ be one of $z_j$ or $i z_j$ . Then the maximum possible value of the real part of $\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$
|
The equation $z^{12}-2^{36}=0$ can be factored as follows: \[(z^6-2^{18})(z^6+2^{18})=0\] \[(z^2-2^6)(z^2+2^6)({(z^2+2^6)}^2-z^2\cdot2^6)({(z^2-2^6)}^2+z^2\cdot2^6)=0\] \[(z^2-2^6)(z^2+2^6)(z^2+2^6-z\cdot2^3)(z^2+2^6+z\cdot2^3) (z^2-2^6-iz\cdot2^3)(z^2-2^6+i z\cdot2^3)=0\]
Since this is a 12th degree equation, there are 12 roots. Also, since each term in the equation is even, the positive or negative value of each root is another root. That would mean there are 6 roots that can be multiplied by $-1$ and since we have 6 factors, that’s 1 root per factor. We just need to solve for $z$ in each factor and pick whether or not to multiply by $i$ and $-1$ for each one depending on the one that yields the highest real value. After that process, we get $8+8+2((4\sqrt{3}+4)+(4\sqrt{3}-4))$ Adding the values up yields $16+16\sqrt{3}$ , or $16+\sqrt{768}$ , and $16+768=\boxed{784}$
| 784
|
6,107
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_8
| 3
|
Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$ . For each $j$ , let $w_j$ be one of $z_j$ or $i z_j$ . Then the maximum possible value of the real part of $\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$
|
Clearly, the roots are: $2^3*(\cos{\frac{k\pi}{12}}+i\sin{\frac{k\pi}{12}}), k\in{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}$
Now, realize for $z=a+bi$ $\operatorname{Re}(iz)=-b$ $\operatorname{Re}(z)=a$ $\operatorname{Re}(z)<\operatorname{Re}(iz)$ is true when $a<-b$
This means:
When $a>0$ $b<-a<0$
When $a<0$ $0<b<-a$
For the 12 roots of the polynomial in the original equation, $8\cos{k\pi/12}=\operatorname{Re}(z), k\in{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}$ $-8\sin{k\pi/12}=\operatorname{Im}(iz), k\in{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}$
So $8\cos{k\pi/12}<-8\sin{k\pi/12}$ $-\cos{k\pi/12}>\sin{k\pi/12}$ . This can be easily true for roots that are in the 3rd quadrant in the complex plane.
This cannot be true for roots in the 1st quadrant because that would yield a negative number bigger than a positive one.
Consider the roots in the 2nd and 4th quadrants. Calculate the roots, choose, and then add the ones up. You will get $\boxed{784}$
| 784
|
6,108
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_8
| 4
|
Let $z_1,z_2,z_3,\dots,z_{12}$ be the 12 zeroes of the polynomial $z^{12}-2^{36}$ . For each $j$ , let $w_j$ be one of $z_j$ or $i z_j$ . Then the maximum possible value of the real part of $\sum_{j=1}^{12} w_j$ can be written as $m+\sqrt{n}$ where $m$ and $n$ are positive integers. Find $m+n$
|
Use De Moivre's Theorem to brute force all the roots out. Then choose the greater value of $\operatorname{Re}(z), \operatorname{Re}(iz)$ . After adding everything up, you get $\boxed{784}$
| 784
|
6,109
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_10
| 4
|
circle with center $O$ has radius 25. Chord $\overline{AB}$ of length 30 and chord $\overline{CD}$ of length 14 intersect at point $P$ . The distance between the midpoints of the two chords is 12. The quantity $OP^2$ can be represented as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find the remainder when $m + n$ is divided by 1000.
|
Define $M$ and $N$ as the midpoints of $AB$ and $CD$ , respectively. Because $\angle OMP = \angle ONP = 90^{\circ}$ , we have that $ONPM$ is a cyclic quadrilateral. Hence, $\angle PNM = \angle POM.$ Then, let these two angles be denoted as $\alpha$ .
Now, assume WLOG that $PD = x < 7$ and $PB = y < 15$ (We can do this because one of $PD$ or $PC$ must be less than 7, and similarly for $PB$ and $PA$ ). Then, by Power of a Point on P with respect to the circle with center $O$ , we have that \[(14-x)x = (30-y)y\] \[(7-x)^{2}+176=(15-y)^{2}.\] Then, let $z = (7-x)^{2}$ . From Law of Cosines on $\triangle NMP$ , we have that \[\textrm{cos } \angle MNP = \frac{NP^{2}+MN^{2}-MP^{2}}{2 \cdot NP \cdot MN}\] \[\textrm{cos } \alpha = \frac{(7-x)^{2} + 12^{2} - (14-x)^{2}}{24 \cdot (7-x)}.\] Plugging in $z$ in gives \[\textrm{cos } \alpha = \frac{-32}{24 \cdot \sqrt{z}}\] \[\textrm{cos } \alpha = \frac{-4}{3\sqrt{z}}\] \[\textrm{cos }^{2} \alpha = \frac{16}{9z}.\] Hence, \[\textrm{tan }^{2} \alpha = \frac{\frac{9z-16}{9z}}{\frac{16}{9z}} = \frac{9z-16}{16}.\] Then, we also know that \[\textrm{tan } \alpha = \textrm{tan } \angle MOP = \frac{MP}{OM} = \frac{14-y}{20}.\] Squaring this, we get \[\textrm{tan }^{2} \alpha = \frac{z+176}{400}.\] Equating our expressions for $z$ , we get $\frac{z+176}{400} = \frac{9z-16}{16}.$ Solving gives us that $z = \frac{18}{7}$ .
Since $\angle ONP = 90^{\circ}$ , from the Pythagorean Theorem, $OP^{2} = ON^{2}+PN^{2} = 25^{2}-7^{2} + z = 576+z = \frac{4050}{7}$ ,
and thus the answer is $4050+7 = 4057$ , which when divided by a thousand leaves a remainder of $\boxed{57}.$
| 57
|
6,110
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_12
| 1
|
Nine delegates, three each from three different countries, randomly select chairs at a round table that seats nine people. Let the probability that each delegate sits next to at least one delegate from another country be $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
We use complementary counting.
We can order the $9$ people around a circle in $\frac{9!}{9} = 8!$ ways. Now we count when there is at least one delegate surrounded by people from only his/her country.
Let the countries be $A,B,C$ . Suppose that the group $XXX$ (for some country $X$ ) appears. To account for circular over counting we fix this group at the top. There are $6!$ ways to arrange the rest of the delegates and $3!$ ways to arrange inside the group. Since there are three countries this group can belong to, the total is $6!*3!*3$
But notice that when the group $XXX$ AND $YYY$ both appear is over counted. So, fix one group at the top. for the last country, we can insert $0,1,2,3$ people in between the two groups. Since we can choose two countries in $\binom{3}{2} = 3$ ways, the total is $3!*3!*3!*4*3$ ways.
Unfortunately, there is over count in the over count. If each country has their delegates together, this case must be added back. Think of these three groups as a whole, and there are $3!/3 = 2$ ways of arranging. In each group there is $3!$ ways of arrangements. So, $3!*3!*3!*2$ is the total for this case.
We now find the complementary probability total. This is \[\frac{6!*3!*3 - 3!*3!*3!*4*3 + 3!*3!*3!*2}{8!} = \frac{15}{56}\] so the actual probability is $1-\frac{15}{56} = \frac{41}{56}$ for an answer of $\boxed{97}$
| 97
|
6,111
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_12
| 2
|
Nine delegates, three each from three different countries, randomly select chairs at a round table that seats nine people. Let the probability that each delegate sits next to at least one delegate from another country be $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
$1680= \binom{9}{3} \binom{6}{3}$ is the total.
$540 = 3* 9* \binom{6}{3}$ is the case where one country has three people in a row. (Three is for selection of country and nine is for rotation of the seats.)
$108 = 3* 9* 4$ is the case where two countries has three people in a row. (Three and nine are for the same reasons above and four is for putting three people in a row for the remaining six seats.)
$18$ is the case where three countries has three people in a row.
$\frac{1680-540+108-18}{1680}=\frac{41}{56}$ so the answer is $\boxed{97}$
| 97
|
6,112
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_13
| 7
|
Point $P$ lies on the diagonal $AC$ of square $ABCD$ with $AP > CP$ . Let $O_{1}$ and $O_{2}$ be the circumcenters of triangles $ABP$ and $CDP$ respectively. Given that $AB = 12$ and $\angle O_{1}PO_{2} = 120^{\circ}$ , then $AP = \sqrt{a} + \sqrt{b}$ , where $a$ and $b$ are positive integers. Find $a + b$
|
Both $O_1$ and $O_2$ lie on the perpendicular bisector of $AB$
Claim: $O_1O_2=12$ and $O_1P=O_2P$
Proof. Translate $O_1$ and $P$ $12$ units down, and let their images be $O_1'$ and $P'$ , respectively. Note that $\triangle ABP\cong\triangle DCP'$ . Additionally, \[\angle CP'D = \angle BPA = 180^{\circ} - \angle BPC = 180^{\circ} - \angle CPD,\] so $CPDP'$ is cyclic. This means $O_1'$ and $O_2$ coincide, so $O_1O_2=12$ . This also means the circumradii of both triangles are equal, so $O_1P=O_2P$ $\blacksquare$
Let the perpendicular from $P$ intersect $O_1O_2$ at $X$ and $AD$ at $Y$ . Since $\triangle O_1XP$ is 30-60-90, $XP=\frac{6}{\sqrt{3}} = 2\sqrt3$ . Since $YX=6$ $PY=6+2\sqrt3$ , so $AP=6\sqrt2+2\sqrt6 = \sqrt{72}+\sqrt{24} \implies\boxed{96}$
| 96
|
6,113
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_14
| 1
|
There are $N$ permutations $(a_{1}, a_{2}, ... , a_{30})$ of $1, 2, \ldots, 30$ such that for $m \in \left\{{2, 3, 5}\right\}$ $m$ divides $a_{n+m} - a_{n}$ for all integers $n$ with $1 \leq n < n+m \leq 30$ . Find the remainder when $N$ is divided by $1000$
|
Be wary of "position" versus "number" in the solution!
Each POSITION in the 30-position permutation is uniquely defined by an ordered triple $(i, j, k)$ . The $n$ th position is defined by this ordered triple where $i$ is $n \mod 2$ $j$ is $n \mod 3$ , and $k$ is $n \mod 5$ . There are 2 choices for $i$ , 3 for $j$ , and 5 for $k$ , yielding $2 \cdot 3 \cdot 5=30$ possible triples. Because the least common multiple of 2, 3, and 5 is 30, none of these triples are repeated and all are used. By the conditions of the problem, if $i$ is the same in two different triples, then the two numbers in these positions must be equivalent mod 2. If $j$ is the same, then the two numbers must be equivalent $\mod 3$ , and if $k$ is the same, the two numbers must be equivalent mod 5. Take care to note that that doesn't mean that the number 1 has to have $1 \mod 2$ ! It's that the POSITION which NUMBER 1 occupies has $1 \mod 2$
The ordered triple (or position) in which 1 can be placed has 2 options for i, 3 for j, and 5 for k, resulting in 30 different positions of placement.
The ordered triple where 2 can be placed in is somewhat constrained by the placement of 1. Because 1 is not equivalent to 2 in terms of mod 2, 3, or 5, the i, j, and k in their ordered triples must be different. Thus, for the number 2, there are (2-1) choices for i, (3-1) choices for j, and (5-1) choices for k. Thus, there are 1*2*4=8 possible placements for the number two once the number one is placed.
Because 3 is equivalent to 1 mod 2, it must have the same i as the ordered triple of 1. Because 3 is not equivalent to 1 or 2 in terms of mod 3 or 5, it must have different j and k values. Thus, there is 1 choice for i, (2-1) choices for j, and (4-1) choices for k, for a total of $1\cdot 1 \cdot 3=3$ choices for the placement of 3.
As above, 4 is even, so it must have the same value of i as 2. It is also 1 mod 3, so it must have the same j value of 1. 4 is not equivalent to 1, 2, or 3 mod 5, so it must have a different k value than that of 1, 2, and 3. Thus, there is 1 choice for i, 1 choice for j, and (3-1) choices for k, yielding a total of $1 \cdot 1 \cdot 2=2$ possible placements for 4.
5 is odd and is equivalent to 2 mod 3, so it must have the same i value as 1 and the same j value of 2. 5 is not equivalent to 1, 2, 3, or 4 mod 5, so it must have a different k value from 1, 2, 3, and 4. However, 4 different values of k are held by these four numbers, so 5 must hold the one remaining value. Thus, only one possible triple is found for the placement of 5.
All numbers from 6 to 30 are also fixed in this manner. All values of i, j, and k have been used, so every one of these numbers will have a unique triple for placement, as above with the number five. Thus, after 1, 2, 3, and 4 have been placed, the rest of the permutation is fixed.
Thus, $N = 30 \cdot 8 \cdot 3 \cdot 2=30 \cdot 48=1440$ . Thus, the remainder when $N$ is divided by $1000$ is $\boxed{440}.$
| 440
|
6,114
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_14
| 2
|
There are $N$ permutations $(a_{1}, a_{2}, ... , a_{30})$ of $1, 2, \ldots, 30$ such that for $m \in \left\{{2, 3, 5}\right\}$ $m$ divides $a_{n+m} - a_{n}$ for all integers $n$ with $1 \leq n < n+m \leq 30$ . Find the remainder when $N$ is divided by $1000$
|
Note that $30=2\cdot 3\cdot 5$ . Since $\gcd(2, 3, 5)=1$ , by CRT, for each value $k=0\ldots 29$ modulo $30$ there exists a unique ordered triple of values $(a, b, c)$ such that $k\equiv a\pmod{2}$ $k\equiv b\pmod{3}$ , and $k\equiv c\pmod{5}$ . Therefore, we can independently assign the residues modulo $2, 3, 5$ , so $N=2!\cdot 3!\cdot 5!=1440$ , and the answer is $\boxed{440}$
| 440
|
6,115
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_14
| 3
|
There are $N$ permutations $(a_{1}, a_{2}, ... , a_{30})$ of $1, 2, \ldots, 30$ such that for $m \in \left\{{2, 3, 5}\right\}$ $m$ divides $a_{n+m} - a_{n}$ for all integers $n$ with $1 \leq n < n+m \leq 30$ . Find the remainder when $N$ is divided by $1000$
|
First let's look at the situation when $m$ is equal to 2. It isn't too difficult to see the given conditions are satisfied iff the sequences $S_1 = a_1,a_3,a_5,a_7...$ and $S_2 =a_2,a_4,a_6...$ each are assigned either $\equiv 0 \pmod 2$ or $\equiv 1 \pmod 2$ . Another way to say this is each element in the sequence $a_1,a_3,a_5,a_7...$ would be the same mod 2, and similarly for the other sequence. There are 2! = 2 ways to assign the mods to the sequences.
Now when $m$ is equal to 3, the sequences are $T_1 = a_1, a_4,a_7..$ $T_2 = a_2,a_5,a_8,a_11...$ , and $T_3 = a_3,a_6,a_9...$ . Again, for each sequence, all of its elements are congruent either $0$ $1$ , or $2$ mod $3$ . There are $3! = 6$ ways to assign the mods to the sequences.
Finally do the same thing for $m = 5$ . There are $5!$ ways. In total there are $2 * 6*120 = 1440$ and the answer is $\boxed{440}$
| 440
|
6,116
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_15
| 1
|
Let $P(x) = x^2 - 3x - 9$ . A real number $x$ is chosen at random from the interval $5 \le x \le 15$ . The probability that $\lfloor\sqrt{P(x)}\rfloor = \sqrt{P(\lfloor x \rfloor)}$ is equal to $\frac{\sqrt{a} + \sqrt{b} + \sqrt{c} - d}{e}$ , where $a$ $b$ $c$ $d$ , and $e$ are positive integers. Find $a + b + c + d + e$
|
Make the substitution $y=2x-3$ , so $P(x)=\frac{y^2-45}{4}.$ We're looking for solutions to \[\bigg\lfloor{\sqrt{\frac{y^2-45}{4}}\bigg\rfloor}=\sqrt{\frac{\lfloor{y\rfloor}^2-45}{4}}\] with the new bounds $y\in{[7,27]}$ . Since the left side is an integer, it must be that $\frac{\lfloor{y\rfloor}^2-45}{4}$ is a perfect square. For simplicity, write $\lfloor{y\rfloor}=a$ and \[a^2-45=4b^2\implies{(a-2b)(a+2b)=45}.\] Since $a-2b<a+2b$ , it must be that $(a-2b,a+2b)=(1,45),(3,15),(5,9)$ , which gives solutions $(23,11),(9,3),(7,1)$ , respectively. But this gives us three cases to check:
Case 1: $\bigg\lfloor{\sqrt{\frac{y^2-45}{4}}\bigg\rfloor}=11$
In this case, we have \[11\leq{\sqrt{\frac{y^2-45}{4}}}<12\implies{y\in{[23,\sqrt{621})}}.\] Case 2: $\bigg\lfloor{\sqrt{\frac{y^2-45}{4}}\bigg\rfloor}=3$
In this case, we have \[3\leq{\sqrt{\frac{y^2-45}{4}}}<4\implies{y\in{[9,\sqrt{109})}}.\] Case 3: $\bigg\lfloor{\sqrt{\frac{y^2-45}{4}}\bigg\rfloor}=1$
In this case, we have \[1\leq{\sqrt{\frac{y^2-45}{4}}}<2\implies{y\in{[7,\sqrt{61})}}.\] To finish, the total length of the interval from which we choose $y$ is $27-7=20$ . The total length of the success intervals is \[(\sqrt{61}-7)+(\sqrt{109}-9)+(\sqrt{621}-23)=\sqrt{61}+\sqrt{109}+\sqrt{621}-39,\] which means the probability is \[\frac{\sqrt{61}+\sqrt{109}+\sqrt{621}-39}{20}.\] The requested sum is $\boxed{850}$
| 850
|
6,117
|
https://artofproblemsolving.com/wiki/index.php/2011_AIME_II_Problems/Problem_15
| 2
|
Let $P(x) = x^2 - 3x - 9$ . A real number $x$ is chosen at random from the interval $5 \le x \le 15$ . The probability that $\lfloor\sqrt{P(x)}\rfloor = \sqrt{P(\lfloor x \rfloor)}$ is equal to $\frac{\sqrt{a} + \sqrt{b} + \sqrt{c} - d}{e}$ , where $a$ $b$ $c$ $d$ , and $e$ are positive integers. Find $a + b + c + d + e$
|
Note that all the "bounds" have to be less than the number+1, otherwise it wouldn't fit the answer format. Therefore, the answer is $\frac{3*3+\sqrt{9+4(4+9)}-10+\sqrt{9+4(16+9)}-12+\sqrt{9+4(144+9)}}{20} \implies \boxed{850}$
| 850
|
6,118
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_1
| 1
|
Maya lists all the positive divisors of $2010^2$ . She then randomly selects two distinct divisors from this list. Let $p$ be the probability that exactly one of the selected divisors is a perfect square . The probability $p$ can be expressed in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
$2010^2 = 2^2\cdot3^2\cdot5^2\cdot67^2$ . Thus there are $(2+1)^4$ divisors, $(1+1)^4$ of which are squares (the exponent of each prime factor must either be $0$ or $2$ ). Therefore the probability is \[\frac {2\cdot2^4\cdot(3^4 - 2^4)}{3^4(3^4 - 1)} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.\]
| 107
|
6,119
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_1
| 2
|
Maya lists all the positive divisors of $2010^2$ . She then randomly selects two distinct divisors from this list. Let $p$ be the probability that exactly one of the selected divisors is a perfect square . The probability $p$ can be expressed in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
The prime factorization of $2010^2$ is $67^2\cdot3^2\cdot2^2\cdot5^2$ . Therefore, the number of divisors of $2010^2$ is $3^4$ or $81$ $16$ of which are perfect squares. The number of ways we can choose $1$ perfect square from the two distinct divisors is $\binom{16}{1}\binom{81-16}{1}$ . The total number of ways to pick two divisors is $\binom{81}{2}$
Thus, the probability is \[\frac {\binom{16}{1}\binom{81-16}{1}}{\binom{81}{2}} = \frac {16\cdot65}{81\cdot40} = \frac {26}{81} \Longrightarrow 26+ 81 = \boxed{107}.\]
| 107
|
6,120
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_3
| 1
|
Suppose that $y = \frac34x$ and $x^y = y^x$ . The quantity $x + y$ can be expressed as a rational number $\frac {r}{s}$ , where $r$ and $s$ are relatively prime positive integers. Find $r + s$
|
Substitute $y = \frac34x$ into $x^y = y^x$ and solve. \[x^{\frac34x} = \left(\frac34x\right)^x\] \[x^{\frac34x} = \left(\frac34\right)^x \cdot x^x\] \[x^{-\frac14x} = \left(\frac34\right)^x\] \[x^{-\frac14} = \frac34\] \[x = \frac{256}{81}\] \[y = \frac34x = \frac{192}{81}\] \[x + y = \frac{448}{81}\] \[448 + 81 = \boxed{529}\]
| 529
|
6,121
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_3
| 2
|
Suppose that $y = \frac34x$ and $x^y = y^x$ . The quantity $x + y$ can be expressed as a rational number $\frac {r}{s}$ , where $r$ and $s$ are relatively prime positive integers. Find $r + s$
|
We solve in general using $c$ instead of $3/4$ . Substituting $y = cx$ , we have:
Dividing by $x^x$ , we get $(x^x)^{c - 1} = c^x$
Taking the $x$ th root, $x^{c - 1} = c$ , or $x = c^{1/(c - 1)}$
In the case $c = \frac34$ $x = \Bigg(\frac34\Bigg)^{ - 4} = \Bigg(\frac43\Bigg)^4 = \frac {256}{81}$ $y = \frac {64}{27}$ $x + y = \frac {256 + 192}{81} = \frac {448}{81}$ , yielding an answer of $448 + 81 = \boxed{529}$
| 529
|
6,122
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_3
| 3
|
Suppose that $y = \frac34x$ and $x^y = y^x$ . The quantity $x + y$ can be expressed as a rational number $\frac {r}{s}$ , where $r$ and $s$ are relatively prime positive integers. Find $r + s$
|
Taking the logarithm base $x$ of both sides, we arrive with: \[y = \log_x y^x \Longrightarrow \frac{y}{x} = \log_{x} y = \log_x \left(\frac{3}{4}x\right) = \frac{3}{4}\] Now we proceed by the logarithm rule $\log(ab)=\log a + \log b$ . The equation becomes: \[\log_x \frac{3}{4} + \log_x x = \frac{3}{4}\] \[\Longleftrightarrow \log_x \frac{3}{4} + 1 = \frac{3}{4}\] \[\Longleftrightarrow \log_x \frac{3}{4} = -\frac{1}{4}\] \[\Longleftrightarrow x^{-\frac{1}{4}} = \frac{3}{4}\] \[\Longleftrightarrow \frac{1}{x^{\frac{1}{4}}} = \frac{3}{4}\] \[\Longleftrightarrow x^{\frac{1}{4}} = \frac{4}{3}\] \[\Longleftrightarrow \sqrt[4]{x} = \frac{4}{3}\] \[\Longleftrightarrow x = \left(\frac{4}{3}\right)^4=\frac{256}{81}\] Then find $y$ as in solution 3, and we get $\boxed{529}$
| 529
|
6,123
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_4
| 1
|
Jackie and Phil have two fair coins and a third coin that comes up heads with probability $\frac47$ . Jackie flips the three coins, and then Phil flips the three coins. Let $\frac {m}{n}$ be the probability that Jackie gets the same number of heads as Phil, where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
This can be solved quickly and easily with generating functions
Let $x^n$ represent flipping $n$ heads.
The generating functions for these coins are $(1+x)$ $(1+x)$ ,and $(3+4x)$ in order.
The product is $3+10x+11x^2+4x^3$ . ( $ax^n$ means there are $a$ ways to get $n$ heads, eg there are $10$ ways to get $1$ head, and therefore $2$ tails, here.)
The sum of the coefficients squared (total number of possible outcomes, squared because the event is occurring twice) is $(4 + 11 + 10 + 3)^2 = 28^2 = 784$ and the sum of the squares of each coefficient (the sum of the number of ways that each coefficient can be chosen by the two people) is $4^2 + 11^2 + 10^2 + 3^2=246$ .
The probability is then $\frac{4^2 + 11^2 + 10^2 + 3^2}{28^2} = \frac{246}{784} = \frac{123}{392}$ .
(Notice the relationship between the addends of the numerator here and the cases in the following solution.)
$123 + 392 = \boxed{515}$
| 515
|
6,124
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_5
| 1
|
Positive integers $a$ $b$ $c$ , and $d$ satisfy $a > b > c > d$ $a + b + c + d = 2010$ , and $a^2 - b^2 + c^2 - d^2 = 2010$ . Find the number of possible values of $a$
|
Using the difference of squares $2010 = (a^2 - b^2) + (c^2 - d^2) = (a + b)(a - b) + (c + d)(c - d) \ge a + b + c + d = 2010$ , where equality must hold so $b = a - 1$ and $d = c - 1$ . Then we see $a = 1004$ is maximal and $a = 504$ is minimal, so the answer is $\boxed{501}$
| 501
|
6,125
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_5
| 2
|
Positive integers $a$ $b$ $c$ , and $d$ satisfy $a > b > c > d$ $a + b + c + d = 2010$ , and $a^2 - b^2 + c^2 - d^2 = 2010$ . Find the number of possible values of $a$
|
Since $a+b$ must be greater than $1005$ , it follows that the only possible value for $a-b$ is $1$ (otherwise the quantity $a^2 - b^2$ would be greater than $2010$ ). Therefore the only possible ordered pairs for $(a,b)$ are $(504, 503)$ $(505, 504)$ , ... , $(1004, 1003)$ , so $a$ has $\boxed{501}$ possible values.
| 501
|
6,126
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 1
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Let $Q(x) = x^2 - 2x + 2$ $R(x) = 2x^2 - 4x + 3$ Completing the square , we have $Q(x) = (x-1)^2 + 1$ , and $R(x) = 2(x-1)^2 + 1$ , so it follows that $P(x) \ge Q(x) \ge 1$ for all $x$ (by the Trivial Inequality ).
Also, $1 = Q(1) \le P(1) \le R(1) = 1$ , so $P(1) = 1$ , and $P$ obtains its minimum at the point $(1,1)$ . Then $P(x)$ must be of the form $c(x-1)^2 + 1$ for some constant $c$ ; substituting $P(11) = 181$ yields $c = \frac 95$ . Finally, $P(16) = \frac 95 \cdot (16 - 1)^2 + 1 = \boxed{406}$
| 406
|
6,127
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 2
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
It can be seen that the function $P(x)$ must be in the form $P(x) = ax^2 - 2ax + c$ for some real $a$ and $c$ . This is because the derivative of $P(x)$ is $2ax - 2a$ , and a global minimum occurs only at $x = 1$ (in addition, because of this derivative, the vertex of any quadratic polynomial occurs at $\frac{-b}{2a}$ ). Substituting $(1,1)$ and $(11, 181)$ we obtain two equations:
Solving, we get $a = \frac{9}{5}$ and $c = \frac{14}{5}$ , so $P(x) = \frac{9}{5}x^2 - \frac{18}{5}x + \frac {14}{5}$ . Therefore, $P(16) = \boxed{406}$
| 406
|
6,128
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 3
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Let $y = x^2 - 2x + 2$ ; note that $2y - 1 = 2x^2 - 4x + 3$ . Setting $y = 2y - 1$ , we find that equality holds when $y = 1$ and therefore when $x^2 - 2x + 2 = 1$ ; this is true iff $x = 1$ , so $P(1) = 1$
Let $Q(x) = P(x) - x$ ; clearly $Q(1) = 0$ , so we can write $Q(x) = (x - 1)Q'(x)$ , where $Q'(x)$ is some linear function. Plug $Q(x)$ into the given inequality:
$x^2 - 3x + 2 \le Q(x) \le 2x^2 - 5x + 3$
$(x - 1)(x - 2) \le (x - 1)Q'(x) \le (x - 1)(2x - 3)$ , and thus
$x - 2 \le Q'(x) \le 2x - 3$
For all $x > 1$ ; note that the inequality signs are flipped if $x < 1$ , and that the division is invalid for $x = 1$ . However,
$\lim_{x \to 1} x - 2 = \lim_{x \to 1} 2x - 3 = -1$
and thus by the sandwich theorem $\lim_{x \to 1} Q'(x) = -1$ ; by the definition of a continuous function, $Q'(1) = -1$ . Also, $Q(11) = 170$ , so $Q'(11) = 170/(11-1) = 17$ ; plugging in and solving, $Q'(x) = (9/5)(x - 1) - 1$ . Thus $Q(16) = 390$ , and so $P(16) = \boxed{406}$
| 406
|
6,129
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 4
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Let $Q(x) = P(x) - (x^2-2x+2)$ , then $0\le Q(x) \le (x-1)^2$ (note this is derived from the given inequality chain). Therefore, $0\le Q(x+1) \le x^2 \Rightarrow Q(x+1) = Ax^2$ for some real value A.
$Q(11) = 10^2A \Rightarrow P(11)-(11^2-22+2)=100A \Rightarrow 80=100A \Rightarrow A=\frac{4}{5}$
$Q(16)=15^2A=180 \Rightarrow P(16)-(16^2-32+2) = 180 \Rightarrow P(16)=180+226= \boxed{406}$
| 406
|
6,130
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 5
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Let $P(x) = ax^2 + bx + c$ . Plugging in $x = 1$ to the expressions on both sides of the inequality, we see that $a + b + c = 1$ . We see from the problem statement that $121a + 11b + c = 181$ . Since we know the vertex of $P(x)$ lies at $x = 1$ , by symmetry we get $81a -9b + c = 181$ as well. Since we now have three equations, we can solve this trivial system and get our answer of $\boxed{406}$
| 406
|
6,131
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 6
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Similar to Solution 5, let $P(x) = ax^2 + bx + c$ . Note that $(1,1)$ is a vertex of the polynomial. Additionally, this means that $b = -2a$ (since $\frac{-b}{2a}$ is the minimum $x$ point). Thus, we have $P(x) = ax^2 - 2ax + c$ . Therefore $a - 2a + c = 1$ . Moreover, $99a + c = 181$ . And so our polynomial is $\frac{9}{5}x^2 - \frac{18}{5}x + \frac{14}{5}$ . Plug in $x = 16$ to get $\boxed{406}$
| 406
|
6,132
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_6
| 7
|
Let $P(x)$ be a quadratic polynomial with real coefficients satisfying $x^2 - 2x + 2 \le P(x) \le 2x^2 - 4x + 3$ for all real numbers $x$ , and suppose $P(11) = 181$ . Find $P(16)$
|
Very similar to Solution 6, start by noticing that $P(x)$ is between two polynomials, we try to set them equal to find a point where the two polynomials intersect, meaning that $P(x)$ would also have to intersect that point (it must be between the two graphs). Setting $x^2 - 2x + 2 = 2x^2 - 4x + 3$ , we find that $x = 1$ . Note that both of these graphs have the same vertex (at $x = 1$ ), and so $P(x)$ must also have the same vertex $(1, 1)$ . Setting $P(x) = ax^2 - 2ax + a + 1$ (this is where we have a vertex at $(1, 1)$ ), we plug in $11$ and find that $a = 1.8$ . Evaluating $1.8x^2 - 3.6x + 2.8$ when $x = 16$ (our intended goal), we find that $P(16) = \boxed{406}$
| 406
|
6,133
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_8
| 1
|
For a real number $a$ , let $\lfloor a \rfloor$ denote the greatest integer less than or equal to $a$ . Let $\mathcal{R}$ denote the region in the coordinate plane consisting of points $(x,y)$ such that $\lfloor x \rfloor ^2 + \lfloor y \rfloor ^2 = 25$ . The region $\mathcal{R}$ is completely contained in a disk of radius $r$ (a disk is the union of a circle and its interior). The minimum value of $r$ can be written as $\frac {\sqrt {m}}{n}$ , where $m$ and $n$ are integers and $m$ is not divisible by the square of any prime. Find $m + n$
|
The desired region consists of 12 boxes, whose lower-left corners are integers solutions of $x^2 + y^2 = 25$ , namely $(\pm5,0), (0,\pm5), (\pm3,\pm4), (\pm4,\pm3).$ Since the points themselves are symmetric about $(0,0)$ , the boxes are symmetric about $\left(\frac12,\frac12\right)$ . The distance from $\left(\frac12,\frac12\right)$ to the furthest point on a box that lays on an axis, for instance $(6,1)$ , is $\sqrt {\frac {11}2^2 + \frac12^2} = \sqrt {\frac {122}4}.$ The distance from $\left(\frac12,\frac12\right)$ to the furthest point on a box in the middle of a quadrant, for instance $(5,4)$ , is $\sqrt {\frac92^2 + \frac72^2} = \sqrt {\frac {130}4}.$ The latter is the larger, and is $\frac {\sqrt {130}}2$ , giving an answer of $130 + 2 = \boxed{132}$
| 132
|
6,134
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_9
| 1
|
Let $(a,b,c)$ be the real solution of the system of equations $x^3 - xyz = 2$ $y^3 - xyz = 6$ $z^3 - xyz = 20$ . The greatest possible value of $a^3 + b^3 + c^3$ can be written in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
This is almost the same as solution 1. Note $a^3 + b^3 + c^3 = 28 + 3abc$ . Next, let $k = a^3$ . Note that $b = \sqrt [3]{k + 4}$ and $c = \sqrt [3]{k + 18}$ , so we have $28 + 3\sqrt [3]{k(k+4)(k+18)} = 28+3abc=a^3+b^3+c^3=3k+22$ . Move 28 over, divide both sides by 3, then cube to get $k^3-6k^2+12k-8 = k^3+22k^2+18k$ . The $k^3$ terms cancel out, so solve the quadratic to get $k = -2, -\frac{1}{7}$ . We maximize $abc$ by choosing $k = -\frac{1}{7}$ , which gives us $a^3+b^3+c^3 = 3k + 22 = \frac{151}{7}$ . Thus, our answer is $151+7=\boxed{158}$
| 158
|
6,135
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_10
| 2
|
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$
|
Note that $a_0 \equiv 2010\ (\textrm{mod}\ 10)$ and $a_1 \equiv 2010 - a_0\ (\textrm{mod}\ 100)$ . It's easy to see that exactly 10 values in $0 \leq a_0 \leq 99$ that satisfy our first congruence. Similarly, there are 10 possible values of $a_1$ for each choice of $a_0$ . Thus, there are $10 \times 10 = 100$ possible choices for $a_0$ and $a_1$ . We next note that if $a_0$ and $a_1$ are chosen, then a valid value of $a_3$ determines $a_2$ , so we dive into some simple casework:
Our answer is thus $6 + 0 + 196 = \boxed{202}$
| 202
|
6,136
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_10
| 3
|
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$
|
We immediately see that $a_3$ can only be $0$ $1$ or $2$ . We also note that the maximum possible value for $10a_1 + a_0$ is $990 + 99 = 1089$ . We then split into cases:
Case 1: $a_3 = 0$ .
We try to find possible values of $a_2$ . We plug in $a_3 = 0$ and $10a_1 + a_0 = 1089$ to our initial equation, which gives us $2010 = 0 + 100a_2 + 1089$ . Thus $a_2 \geq 10$ . We also see that $a_2 \leq 20$ . We now take these values of $a_2$ and find the number of pairs $(a_1, a_0)$ that work. If $a_2 = 10$ $10a_1 + a_0 = 1010$ . We see that there are $8$ possible pairs in this case. Using the same logic, there are $10$ ways for $a_2 = 11, 12 \ldots 19$ . For $a_2 = 20$ , we get the equation $10a_1 + a_0 = 10$ , for 2 ways. Thus, for $a_3 = 0$ , there are $8 + 10 \cdot 9 + 2 = 100$ ways.
Case 2: $a_3 = 1$ .
This case is almost identical to the one above, except $0 \leq a_2 \leq 10$ . We also get 100 ways.
Case 3: $a_3 = 2$ .
If $a_3 = 2$ , our initial equation becomes $100a_2 + 10a_1 + a_0 = 10$ . It is obvious that $a_2 = 0$ , and we are left with $10a_1 + a_0 = 10$ . We saw above that there are $2$ ways.
Totaling everything, we get that there are $100 + 100 + 2 = \boxed{202}$ ways.
| 202
|
6,137
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_10
| 4
|
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$
|
We will represent the problem using generating functions. Consider the generating function \[f(x) = (1+x^{1000}+x^{2000}+\cdots+x^{99000})(1+x^{100}+x^{200}+\cdots+x^{9900})(1+x^{10}+x^{20}+\cdots+x^{990})(1+x+x^2+\cdots+x^{99})\] where the first factor represents $a_3$ , the second factor $a_2$ , and so forth. We want to find the coefficient of $x^{2010}$ in the expansion of $f(x)$ . Now rewriting each factor using the geometric series yields \[f(x) = \frac{\cancel{x^{100}-1}}{x-1} \cdot \frac{\cancel{x^{1000}-1}}{x^{10}-1} \cdot \frac{x^{10000}-1}{\cancel{x^{100}-1}} \cdot \frac{x^{100000}-1}{\cancel{x^{1000}-1}}=\frac{x^{10000}-1}{x-1} \cdot \frac{x^{100000}-1}{x^{10}-1} = (1+x+x^2+\cdots + x^{9999})(1+x^{10}+x^{20}+\cdots+x^{99990})\] The coefficient of $x^{2010}$ in this is simply $\boxed{202}$ , as we can choose any of the first 202 terms from the second factor and pair it with exactly one term in the first factor.
| 202
|
6,138
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_10
| 5
|
Let $N$ be the number of ways to write $2010$ in the form $2010 = a_3 \cdot 10^3 + a_2 \cdot 10^2 + a_1 \cdot 10 + a_0$ , where the $a_i$ 's are integers, and $0 \le a_i \le 99$ . An example of such a representation is $1\cdot 10^3 + 3\cdot 10^2 + 67\cdot 10^1 + 40\cdot 10^0$ . Find $N$
|
First note that $a_3$ has to be a single-digit number( $0$ $1$ , or $2$ to be exact), and that $a_1$ has to be a two-digit multiple of ten.
Then, $a_3$ $a_2$ $a_1$ and $a_0$ can be represented as follows: \begin{align*} a_3 = a \\ a_2 = 10b+c \\ a_1= 10d+e \\ a_0 = 10f \end{align*} , where $a$ $b$ $c$ $d$ $e$ , and $f$ are all(not necessarily nonzero) digits.
Now, we can write our given equation as follows: \begin{align*} 2010 = 1000(a+b) + 100(c+d) + 10(e+f) \\ 201 = 100(a+b) + 10(c+d) + (e+f) \\ 201 = (100a + 10c + e) + (100b + d + f) \end{align*} Now, each integer between $0$ and $201$ inclusive can be represented in exactly one way as $100a + 10c + e$ , and this corresponds with one unique $100b + d + f$ , so it remains to count the number of integers between $0$ and $201$ inclusive. This is easily counted to be $\boxed{202}$ $\blacksquare$
| 202
|
6,139
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_11
| 1
|
Let $\mathcal{R}$ be the region consisting of the set of points in the coordinate plane that satisfy both $|8 - x| + y \le 10$ and $3y - x \ge 15$ . When $\mathcal{R}$ is revolved around the line whose equation is $3y - x = 15$ , the volume of the resulting solid is $\frac {m\pi}{n\sqrt {p}}$ , where $m$ $n$ , and $p$ are positive integers, $m$ and $n$ are relatively prime , and $p$ is not divisible by the square of any prime. Find $m + n + p$
|
The inequalities are equivalent to $y \ge x/3 + 5, y \le 10 - |x - 8|$ . We can set them equal to find the two points of intersection, $x/3 + 5 = 10 - |x - 8| \Longrightarrow |x - 8| = 5 - x/3$ . This implies that one of $x - 8, 8 - x = 5 - x/3$ , from which we find that $(x,y) = \left(\frac 92, \frac {13}2\right), \left(\frac{39}{4}, \frac{33}{4}\right)$ . The region $\mathcal{R}$ is a triangle , as shown above. When revolved about the line $y = x/3+5$ , the resulting solid is the union of two right cones that share the same base and axis.
Let $h_1,h_2$ denote the height of the left and right cones, respectively (so $h_1 > h_2$ ), and let $r$ denote their common radius. The volume of a cone is given by $\frac 13 Bh$ ; since both cones share the same base, then the desired volume is $\frac 13 \cdot \pi r^2 \cdot (h_1 + h_2)$ . The distance from the point $(8,10)$ to the line $x - 3y + 15 = 0$ is given by $\left|\frac{(8) - 3(10) + 15}{\sqrt{1^2 + (-3)^2}}\right| = \frac{7}{\sqrt{10}}$ . The distance between $\left(\frac 92, \frac {13}2\right)$ and $\left(\frac{39}{4}, \frac{33}{4}\right)$ is given by $h_1 + h_2 = \sqrt{\left(\frac{18}{4} - \frac{39}{4}\right)^2 + \left(\frac{26}{4} - \frac{33}{4}\right)^2} = \frac{7\sqrt{10}}{4}$ . Thus, the answer is $\frac{343\sqrt{10}\pi}{120} = \frac{343\pi}{12\sqrt{10}} \Longrightarrow 343 + 12 + 10 = \boxed{365}$ . (Note to MAA: Is it a coincidence that this is the number of days in a non-leap year?)
| 365
|
6,140
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_12
| 1
|
Let $m \ge 3$ be an integer and let $S = \{3,4,5,\ldots,m\}$ . Find the smallest value of $m$ such that for every partition of $S$ into two subsets, at least one of the subsets contains integers $a$ $b$ , and $c$ (not necessarily distinct) such that $ab = c$
Note : a partition of $S$ is a pair of sets $A$ $B$ such that $A \cap B = \emptyset$ $A \cup B = S$
|
We claim that $243$ is the minimal value of $m$ . Let the two partitioned sets be $A$ and $B$ ; we will try to partition $3, 9, 27, 81,$ and $243$ such that the $ab=c$ condition is not satisfied. Without loss of generality , we place $3$ in $A$ . Then $9$ must be placed in $B$ , so $81$ must be placed in $A$ , and $27$ must be placed in $B$ . Then $243$ cannot be placed in any set, so we know $m$ is less than or equal to $243$
For $m \le 242$ , we can partition $S$ into $S \cap \{3, 4, 5, 6, 7, 8, 81, 82, 83, 84 ... 242\}$ and $S \cap \{9, 10, 11 ... 80\}$ , and in neither set are there values where $ab=c$ (since $8 < (3\text{ to }8)^2 < 81$ and $81^2>242$ and $(9\text{ to }80)^2 > 80$ ). Thus $m = \boxed{243}$
| 243
|
6,141
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_14
| 1
|
For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$
|
Observe that $f$ is strictly increasing in $n$ . We realize that we need $100$ terms to add up to around $300$ , so we need some sequence of $2$ s, $3$ s, and then $4$ s.
It follows that $n \approx 100$ (alternatively, use binary search to get to this, with $n\le 1000$ ). Manually checking shows that $f(109) = 300$ and $f(110) > 300$ . Thus, our answer is $\boxed{109}$
| 109
|
6,142
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_14
| 2
|
For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$
|
Because we want the value for which $f(n)=300$ , the average value of the 100 terms of the sequence should be around $3$ . For the value of $\lfloor \log_{10} (kn) \rfloor$ to be $3$ $1000 \le kn < 10000$ . We want kn to be around the middle of that range, and for k to be in the middle of 0 and 100, let $k=50$ , so $50n=\frac{10000+1000}{2}=\frac{11000}{2}=5500$ , and $n = 110$ $f(110) = 301$ , so we want to lower $n$ . Testing $109$ yields $300$ , so our answer is still $\boxed{109}$
| 109
|
6,143
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_14
| 3
|
For each positive integer $n$ , let $f(n) = \sum_{k = 1}^{100} \lfloor \log_{10} (kn) \rfloor$ . Find the largest value of $n$ for which $f(n) \le 300$
Note: $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$
|
For any $n$ where the sum is close to $300$ , all the terms in the sum must be equal to $2$ $3$ or $4$ . Let $M$ be the number of terms less than or equal to $3$ and $N$ be the number of terms equal to $2$ (also counted in $M$ ). With this definition of $M$ and $N$ the total will be $400 - M - N \le 300$ , from which $M + N \ge 100$ . Now $M+1$ is the smallest integer $k$ for which $\log_{10}(kn) \ge 4$ or $kn \ge 10000$ , thus \[M = \left\lfloor\frac{9999}{n}\right\rfloor.\] Similarly, \[N = \left\lfloor\frac{999}{n}\right\rfloor = \left\lfloor\frac{M}{10}\right\rfloor.\]
Therefore, \[M + \left\lfloor \frac{M}{10} \right\rfloor \ge 100 \implies M \ge \left\lceil\frac{1000}{11}\right\rceil = 91 \implies n \le \left\lfloor\frac{9999}{91}\right\rfloor = 109.\] Since we want the largest possible $n$ , the answer is $\boxed{109}$
| 109
|
6,144
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_I_Problems/Problem_15
| 6
|
In $\triangle{ABC}$ with $AB = 12$ $BC = 13$ , and $AC = 15$ , let $M$ be a point on $\overline{AC}$ such that the incircles of $\triangle{ABM}$ and $\triangle{BCM}$ have equal radii . Then $\frac{AM}{CM} = \frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p + q$
|
Let $BM = d, AM = x, CM = 15 - x$ . Observe that we have the equation by the incircle formula: \[\frac{[ABM]}{12 + AM + MB} = \frac{[CBM]}{13 + CM + MB} \implies \frac{AM}{CM} = \frac{12 + MB}{13 + MB} \implies \frac{x}{15 - x} = \frac{12 + d}{13 + d}.\] Now let $X$ be the point of tangency between the incircle of $\triangle ABC$ and $AC$ . Additionally, let $P$ and $Q$ be the points of tangency between the incircles of $\triangle ABM$ and $\triangle CBM$ with $AC$ respectively. Some easy calculation yields $AX = 7, CX = 8$ . By homothety we have \[\frac{AP}{7} = \frac{CQ}{8} \implies 8(AP) = 7(CQ) \implies 8(12 + x - d) = 7(13 + 15 - x - d) \implies d = 15x - 100.\] Substituting into the first equation derived earlier it is left to solve \[\frac{x}{15 - x} = \frac{15x - 88}{15x - 87} \implies 3x^2 - 40x + 132 \implies (x - 6)(3x - 22) = 0.\] Now $x = 6$ yields $d = -10$ which is invalid, hence $x = \frac{22}{3}$ so $\frac{AM}{CM} = \frac{\frac{22}{3}}{15 - \frac{22}{3}} = \frac{22}{23}.$ The requested sum is $22 + 23 = \boxed{45}$ . ~blueprimes
| 45
|
6,145
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_2
| 1
|
A point $P$ is chosen at random in the interior of a unit square $S$ . Let $d(P)$ denote the distance from $P$ to the closest side of $S$ . The probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Any point outside the square with side length $\frac{1}{3}$ that has the same center and orientation as the unit square and inside the square with side length $\frac{3}{5}$ that has the same center and orientation as the unit square has $\frac{1}{5}\le d(P)\le\frac{1}{3}$
Since the area of the unit square is $1$ , the probability of a point $P$ with $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is the area of the shaded region, which is the difference of the area of two squares.
$\left(\frac{3}{5}\right)^2-\left(\frac{1}{3}\right)^2=\frac{9}{25}-\frac{1}{9}=\frac{56}{225}$
Thus, the answer is $56 + 225 = \boxed{281}.$
| 281
|
6,146
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_2
| 2
|
A point $P$ is chosen at random in the interior of a unit square $S$ . Let $d(P)$ denote the distance from $P$ to the closest side of $S$ . The probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
First, let's figure out $d(P) \geq \frac{1}{3}$ which is \[\left(\frac{3}{5}\right)^2=\frac{9}{25}.\] Then, $d(P) \geq \frac{1}{5}$ is a square inside $d(P) \geq \frac{1}{3}$ , so \[\left(\frac{1}{3}\right)^2=\frac{1}{9}.\] Therefore, the probability that $\frac{1}{5}\le d(P)\le\frac{1}{3}$ is \[\frac{9}{25}-\frac{1}{9}=\frac{56}{225}\] So, the answer is $56+225=\boxed{281}$
| 281
|
6,147
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_3
| 1
|
Let $K$ be the product of all factors $(b-a)$ (not necessarily distinct) where $a$ and $b$ are integers satisfying $1\le a < b \le 20$ . Find the greatest positive integer $n$ such that $2^n$ divides $K$
|
In general, there are $20-n$ pairs of integers $(a, b)$ that differ by $n$ because we can let $b$ be any integer from $n+1$ to $20$ and set $a$ equal to $b-n$ . Thus, the product is $(1^{19})(2^{18})\cdots(19^1)$ (or alternatively, $19! \cdot 18! \cdots 1!$ .)
When we count the number of factors of $2$ , we have 4 groups, factors that are divisible by $2$ at least once, twice, three times and four times.
Summing these give an answer of $\boxed{150}$
| 150
|
6,148
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_7
| 1
|
Let $P(z)=z^3+az^2+bz+c$ , where a, b, and c are real. There exists a complex number $w$ such that the three roots of $P(z)$ are $w+3i$ $w+9i$ , and $2w-4$ , where $i^2=-1$ . Find $|a+b+c|$
|
Set $w=x+yi$ , so $x_1 = x+(y+3)i$ $x_2 = x+(y+9)i$ $x_3 = 2x-4+2yi$
Since $a,b,c\in{R}$ , the imaginary part of $a,b,c$ must be $0$
Start with a, since it's the easiest one to do: $y+3+y+9+2y=0, y=-3$
and therefore: $x_1 = x$ $x_2 = x+6i$ $x_3 = 2x-4-6i$
Now, do the part where the imaginary part of c is 0 since it's the second easiest one to do: $x(x+6i)(2x-4-6i)$ . The imaginary part is $6x^2-24x$ , which is 0, and therefore $x=4$ , since $x=0$ doesn't work.
So now, $x_1 = 4, x_2 = 4+6i, x_3 = 4-6i$
and therefore: $a=-12, b=84, c=-208$ . Finally, we have $|a+b+c|=|-12+84-208|=\boxed{136}$
| 136
|
6,149
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_7
| 2
|
Let $P(z)=z^3+az^2+bz+c$ , where a, b, and c are real. There exists a complex number $w$ such that the three roots of $P(z)$ are $w+3i$ $w+9i$ , and $2w-4$ , where $i^2=-1$ . Find $|a+b+c|$
|
Note that at least one of $w+3i$ $w+9i$ , or $2w-4$ is real by complex conjugate roots. We now separate into casework based on which one.
Let $w=x+yi$ , where $x$ and $y$ are reals.
Case 1: $w+3i$ is real. This implies that $x+yi+3i$ is real, so by setting the imaginary part equal to zero we get $y=-3$ , so $w=x-3i$ . Now note that since $w+3i$ is real, $w+9i$ and $2w-4$ are complex conjugates. Thus $\overline{w+9i}=2w-4$ , so $\overline{x+6i}=2(x-3i)-4$ , implying that $x=4$ , so $w=4-3i$
Case 2: $w+9i$ is real. This means that $x+yi+9i$ is real, so again setting imaginary part to zero we get $y=-9$ , so $w=x-9i$ . Now by the same logic as above $w+3i$ and $2w-4$ are complex conjugates. Thus $\overline{w+3i}=2w-4$ , so $\overline{x-6i}=2(x-9i)-4$ , so $x+6i=2x-4-18i$ , which has no solution as $x$ is real.
Case 3: $2w-4$ is real. Going through the same steps, we get $y=0$ , so $w=x$ . Now $w+3i$ and $w+6i$ are complex conjugates, but $w=x$ , which means that $\overline{x+3i}=x+6i$ , so $x-3i=x+6i$ , which has no solutions.
Thus case 1 is the only one that works, so $w=4-3i$ and our polynomial is $(z-(4))(z-(4+6i))(z-(4-6i))$ . Note that instead of expanding this, we can save time by realizing that the answer format is $|a+b+c|$ , so we can plug in $z=1$ to our polynomial to get the sum of coefficients, which will give us $a+b+c+1$ . Plugging in $z=1$ into our polynomial, we get $(-3)(-3-6i)(-3+6i)$ which evaluates to $-135$ . Since this is $a+b+c+1$ , we subtract 1 from this to get $a+b+c=-136$ , so $|a+b+c|=\boxed{136}$
| 136
|
6,150
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_8
| 1
|
Let $N$ be the number of ordered pairs of nonempty sets $\mathcal{A}$ and $\mathcal{B}$ that have the following properties:
Find $N$
|
Let us partition the set $\{1,2,\cdots,12\}$ into $n$ numbers in $A$ and $12-n$ numbers in $B$
Since $n$ must be in $B$ and $12-n$ must be in $A$ $n\ne6$ , we cannot partition into two sets of 6 because $6$ needs to end up somewhere, $n\ne 0$ or $12$ either).
We have $\dbinom{10}{n-1}$ ways of picking the numbers to be in $A$
So the answer is $\left(\sum_{n=1}^{11} \dbinom{10}{n-1}\right) - \dbinom{10}{5}=2^{10}-252= \boxed{772}$
| 772
|
6,151
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_8
| 2
|
Let $N$ be the number of ordered pairs of nonempty sets $\mathcal{A}$ and $\mathcal{B}$ that have the following properties:
Find $N$
|
Regardless of the size $n$ of $A$ (ignoring the case when $n = 6$ ), $n$ must not be in $A$ and $12 - n$ must be in $A$
There are $10$ remaining elements whose placements have yet to be determined. Note that the actual value of $n$ does not matter; there is always $1$ necessary element, $1$ forbidden element, and $10$ other elements that need to be distributed. There are $2$ places to put each of these elements, for $2^{10}$ possibilities.
However, there is the edge case of $n = 6; 6$ is forced not the be in either set, so we must subtract the $\dbinom{10}{5}$ cases where $A$ and $B$ have size $6$
Thus, our answer is $2^{10} - \dbinom{10}{5} = 1024 - 252 = \boxed{772}$
| 772
|
6,152
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_8
| 3
|
Let $N$ be the number of ordered pairs of nonempty sets $\mathcal{A}$ and $\mathcal{B}$ that have the following properties:
Find $N$
|
The total number of possible subsets is $\sum_{i=1}^{11}\dbinom{12}{i}$ , which is $2^{12}-2$ . Note that picking a subset from the set leaves the rest of the set to be in the other subset. We exclude $i=0$ and $i=12$ since they leave a set empty. We proceed with complementary counting and casework:
We apply the Principle of Inclusion and Exclusion for casework on the complementary cases. We find the ways where $|A|$ is in $A$ , which violates the first condition. Then we find the ways where the elements $|B|$ and $12-|B|$ are in set $B$ , which violates only the second condition, and not the first. This ensures we do not overcount.
Case 1: $|A|$ is an element in $A$
There are $\sum_{i=1}^{11}\dbinom{11}{i-1}$ $2^{11}-1$ ways in this case.
Case 2: $|B|$ and $12-|B|$ are in $B$
We introduce a subcase where $|B|$ is not 6, since the other element would also be 6.
There are $B-2$ elements to choose from 10 elements. Therefore, $|B|$ can be from 2 to 11.
There are $\sum_{i=2}^{11}\dbinom{10}{i-2}-\dbinom{10}{4} = 2^{10}-211$ ways.
The other subcase is when $|B|$ is equal to 6. There are $\dbinom{11}{5}=462$ ways.
Adding the subcases gives us $2^{10}+251$
Adding this with case one gives us $2^{11}+2^{10}+250$ . Subtracting this from $2^{12}-2$ gives $1024-252=\boxed{772}$
| 772
|
6,153
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_10
| 1
|
Find the number of second-degree polynomials $f(x)$ with integer coefficients and integer zeros for which $f(0)=2010$
|
Let $f(x) = a(x-r)(x-s)$ . Then $ars=2010=2\cdot3\cdot5\cdot67$ . First consider the case where $r$ and $s$ (and thus $a$ ) are positive. There are $3^4 = 81$ ways to split up the prime factors between $a$ $r$ , and $s$ . However, $r$ and $s$ are indistinguishable. In one case, $(a,r,s) = (2010,1,1)$ , we have $r=s$ . The other $80$ cases are double counting, so there are $40$
We must now consider the various cases of signs. For the $40$ cases where $|r|\neq |s|$ , there are a total of four possibilities, For the case $|r|=|s|=1$ , there are only three possibilities, $(r,s) = (1,1); (1,-1); (-1,-1)$ as $(-1,1)$ is not distinguishable from the second of those three.
You may ask: How can one of ${r, s}$ be positive and the other negative? $a$ will be negative as a result. That way, it's still $+2010$ that gets multiplied.
Thus the grand total is $4\cdot40 + 3 = \boxed{163}$
| 163
|
6,154
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_10
| 3
|
Find the number of second-degree polynomials $f(x)$ with integer coefficients and integer zeros for which $f(0)=2010$
|
The equation can be written in the form of $k(x-a)(x-b)$ , where $|k|$ is a divisor of $2010$ . Factor $2010=2\cdot 3\cdot 5\cdot 67$ . We divide into few cases to study.
Firstly, if $|k|=1$ , the equation can be $-(x-a)(x+b)$ or $(x-a)(x-b)$ or $(x+a)(x+b)$ , there are $2^4+2^4=32$ ways
If $|k|\in \{2,3,5,67\}$ . Take $|k|=2$ as an example, follow the procedure above, there are $2^3+2^3=16$ ways, and there are $\binom {4}{1}=4$ ways to choose $|k|$ , so there are $16\cdot 4=64$ ways
If $|k|$ is the product of two factors of $2010$ , there are $8$ ways for each. Thus there are $\binom {4}{2}\cdot 8=48$ ways
If $|k|$ is the product of three factors of $2010$ , there are $\binom {4}{3}\cdot 4=16$ ways
In the end, $|k|=2010$ , only $2010(x-1)(x-1); 2010(x+1)(x+1); -2010(x-1)(x+1)$ work, there are $3$ ways
Thus, $32+64+48+16+3=\boxed{163}$
| 163
|
6,155
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_11
| 1
|
Define a T-grid to be a $3\times3$ matrix which satisfies the following two properties:
Find the number of distinct T-grids
|
The T-grid can be considered as a tic-tac-toe board: five $1$ 's (or X's) and four $0$ 's (or O's).
There are only $\dbinom{9}{5} = 126$ ways to fill the board with five $1$ 's and four $0$ 's. Now we just need to subtract the number of bad grids. Bad grids are ones with more than one person winning, or where someone has won twice.
Let three-in-a-row/column/diagonal be a "win" and let player $0$ be the one that fills in $0$ and player $1$ fills in $1$
Case $1$ Each player wins once.
If player X takes a diagonal, player Y cannot win. If either takes a row, all the columns are blocked, and visa versa. Therefore, they either both take a row or they both take a column.
Case $1$ $36$ cases
Case $2$ Player $1$ wins twice. (Player $0$ cannot win twice because he only has 4 moves.)
Case $2$ total: $22$
Thus, the answer is $126-22-36=\boxed{68}$
| 68
|
6,156
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_11
| 2
|
Define a T-grid to be a $3\times3$ matrix which satisfies the following two properties:
Find the number of distinct T-grids
|
We can use generating functions to compute the case that no row or column is completely filled with $1$ 's. Given a row, let $a$ $b$ $c$ be the events that the first, second, third respective squares are $1$ 's. Then the generating function representing the possible events that exclude a row of $1,1,1$ or $0,0,0$ from occuring is \[ab+bc+ca+a+b+c.\] Therefore, the generating function representing the possible grids where no row is filled with $0$ 's and $1$ 's is \[P(a,b,c)=((ab+bc+ca)+(a+b+c))^3.\] We expand this by the Binomial Theorem to find \[P(a,b,c)=(ab+bc+ca)^3+3(ab+bc+ca)^2(a+b+c)+3(ab+bc+ca)(a+b+c)^2+(a+b+c)^3.\] Recall that our grid has five $1$ 's, hence we only want terms where the sum of the exponents is $5$ . This is given by \[3(ab+bc+ca)^2(a+b+c).\] When we expand this, we find \[3(2abc(a+b+c)+a^2b^2+b^2c^2+c^2a^2)(a+b+c).\] We also want to make sure that each of $a$ $b$ $c$ appears at least once (so there is no column filled with $0$ 's) and the power of each of $a$ $b$ $c$ is not greater than or equal to $3$ (so there is no column filled with $1$ 's). The sum of the coefficients of the above polynomial is clearly $81$ (using $a,b,c=1$ ), and the sum of the coefficients of the terms $a^3bc$ $ab^3c$ , and $abc^3$ is $6+6+6+3+3+3+3+3+3=36$ , hence the sum of the coefficients of the desired terms is $81-36=45$ . This counts the number of grids where no column or row is filled with $0$ 's or $1$ 's. However, we could potentially have both diagonals filled with $1$ 's, but this is the only exception to our $45$ possibilities, hence the number of $T$ -grids with no row or column filled with the same digit is $44$
On the other hand, if a row (column) is filled with $0$ 's, then by the Pigeonhole Principle, another row (column) must be filled with $1$ 's. Hence this is impossible, so all other possible $T$ -grids have a row (column) filled with $1$ 's. If the top row is filled with $1$ 's, then we have two $1$ 's left to place. Clearly they cannot go in the same row, because then the other row is filled with $0$ 's. They also cannot appear in the same column. This leaves $3\cdot 2$ arrangements--3 choices for the location of the $1$ in the second row, and 2 choices for the location of the $1$ in the last row. However, two of these arrangements will fill a diagonal with $1$ 's. Hence there are only $4$ $T$ -grids where the top row is filled with $1$ 's. The same argument applies if any other row or column is filled with $1$ 's. Hence there are $4\cdot 6=24$ such $T$ -grids.
Thus the answer is $44+24=\boxed{68}$
| 68
|
6,157
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_12
| 1
|
Two noncongruent integer-sided isosceles triangles have the same perimeter and the same area. The ratio of the lengths of the bases of the two triangles is $8: 7$ . Find the minimum possible value of their common perimeter.
|
Let $s$ be the semiperimeter of the two triangles. Also, let the base of the longer triangle be $16x$ and the base of the shorter triangle be $14x$ for some arbitrary factor $x$ . Then, the dimensions of the two triangles must be $s-8x,s-8x,16x$ and $s-7x,s-7x,14x$ . By Heron's Formula, we have
Since $15$ and $338$ are coprime, to minimize, we must have $s=338$ and $x=15$ . However, we want the minimum perimeter. This means that we must multiply our minimum semiperimeter by $2$ , which gives us a final answer of $\boxed{676}$
| 676
|
6,158
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_12
| 2
|
Two noncongruent integer-sided isosceles triangles have the same perimeter and the same area. The ratio of the lengths of the bases of the two triangles is $8: 7$ . Find the minimum possible value of their common perimeter.
|
Let the first triangle have sides $16n,a,a$ , so the second has sides $14n,a+n,a+n$ . The height of the first triangle is $\frac{7}{8}$ the height of the second triangle. Therefore, we have \[a^2-64n^2=\frac{49}{64}((a+n)^2-49n^2).\] Multiplying this, we get \[64a^2-4096n^2=49a^2+98an-2352n^2,\] which simplifies to \[15a^2-98an-1744n^2=0.\] Solving this for $a$ , we get $a=n\cdot\frac{218}{15}$ , so $n=15$ and $a=218$ and the perimeter is $15\cdot16+218+218=\boxed{676}$
| 676
|
6,159
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_13
| 1
|
The $52$ cards in a deck are numbered $1, 2, \cdots, 52$ . Alex, Blair, Corey, and Dylan each picks a card from the deck without replacement and with each card being equally likely to be picked, The two persons with lower numbered cards form a team, and the two persons with higher numbered cards form another team. Let $p(a)$ be the probability that Alex and Dylan are on the same team, given that Alex picks one of the cards $a$ and $a+9$ , and Dylan picks the other of these two cards. The minimum value of $p(a)$ for which $p(a)\ge\frac{1}{2}$ can be written as $\frac{m}{n}$ . where $m$ and $n$ are relatively prime positive integers. Find $m+n$
|
Once the two cards are drawn, there are $\dbinom{50}{2} = 1225$ ways for the other two people to draw. Alex and Dylan are the team with higher numbers if Blair and Corey both draw below $a$ , which occurs in $\dbinom{a-1}{2}$ ways. Alex and Dylan are the team with lower numbers if Blair and Corey both draw above $a+9$ , which occurs in $\dbinom{43-a}{2}$ ways. Thus, \[p(a)=\frac{\dbinom{43-a}{2}+\dbinom{a-1}{2}}{1225}.\] Simplifying, we get $p(a)=\frac{(43-a)(42-a)+(a-1)(a-2)}{2\cdot1225}$ , so we need $(43-a)(42-a)+(a-1)(a-2)\ge (1225)$ . If $a=22+b$ , then \begin{align*}(43-a)(42-a)+(a-1)(a-2)&=(21-b)(20-b)+(21+b)(20+b)=2b^2+2(21)(20)\ge (1225) \\ b^2\ge \frac{385}{2} &= 192.5 >13^2 \end{align*} So $b> 13$ or $b< -13$ , and $a=22+b<9$ or $a>35$ , so $a=8$ or $a=36$ . Thus, $p(8) = \frac{616}{1225} = \frac{88}{175}$ , and the answer is $88+175 = \boxed{263}$
| 263
|
6,160
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_15
| 1
|
In triangle $ABC$ $AC = 13$ $BC = 14$ , and $AB=15$ . Points $M$ and $D$ lie on $AC$ with $AM=MC$ and $\angle ABD = \angle DBC$ . Points $N$ and $E$ lie on $AB$ with $AN=NB$ and $\angle ACE = \angle ECB$ . Let $P$ be the point, other than $A$ , of intersection of the circumcircles of $\triangle AMN$ and $\triangle ADE$ . Ray $AP$ meets $BC$ at $Q$ . The ratio $\frac{BQ}{CQ}$ can be written in the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m-n$
|
Define the function $f:\mathbb{R}^{2}\rightarrow\mathbb{R}$ by \[f(X)=\text{Pow}_{(AMN)}(X)-\text{Pow}_{(ADE)}(X)\] for points $X$ in the plane. Then $f$ is linear, so $\frac{BQ}{CQ}=\frac{f(B)-f(Q)}{f(Q)-f(C)}$ . But $f(Q)=0$ since $Q$ lies on the radical axis of $(AMN)$ $(ADE)$ thus \[\frac{BQ}{CQ}=-\frac{f(B)}{f(C)}=-\frac{BN\cdot BA-BE\cdot BA}{CM\cdot CA-CD\cdot CA}\] Let $AC=b$ $BC=a$ and $AB=c$ . Note that $BN=\tfrac{c}{2}$ and $CM=\tfrac{b}{2}$ because they are midpoints, while $BE=\frac{ac}{a+b}$ and $CD=\frac{ab}{a+c}$ by Angle Bisector Theorem. Thus we can rewrite this expression as \begin{align*}&-\frac{\tfrac{c^{2}}{2}-\tfrac{ac^{2}}{a+b}}{\tfrac{b^{2}}{2}-\tfrac{ab^{2}}{a+c}} \\ =&-\left(\frac{c^{2}}{b^{2}}\right)\left(\frac{\tfrac{1}{2}-\tfrac{a}{a+b}}{\tfrac{1}{2}-\tfrac{a}{a+c}}\right) \\ =&\left(\frac{c^{2}}{b^{2}}\right)\left(\frac{a+c}{a+b}\right) \\ =&\left(\frac{225}{169}\right)\left(\frac{29}{27}\right) \\ =&~\frac{725}{507}\end{align*} so $m-n=\boxed{218}$
| 218
|
6,161
|
https://artofproblemsolving.com/wiki/index.php/2010_AIME_II_Problems/Problem_15
| 2
|
In triangle $ABC$ $AC = 13$ $BC = 14$ , and $AB=15$ . Points $M$ and $D$ lie on $AC$ with $AM=MC$ and $\angle ABD = \angle DBC$ . Points $N$ and $E$ lie on $AB$ with $AN=NB$ and $\angle ACE = \angle ECB$ . Let $P$ be the point, other than $A$ , of intersection of the circumcircles of $\triangle AMN$ and $\triangle ADE$ . Ray $AP$ meets $BC$ at $Q$ . The ratio $\frac{BQ}{CQ}$ can be written in the form $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m-n$
|
Let $Y = MN \cap AQ$ $\frac {BQ}{QC} = \frac {NY}{MY}$ since $\triangle AMN \sim \triangle ACB$ . Since quadrilateral $AMPN$ is cyclic, $\triangle MYA \sim \triangle PYN$ and $\triangle MYP \sim \triangle AYN$ , yielding $\frac {YM}{YA} = \frac {MP}{AN}$ and $\frac {YA}{YN} = \frac {AM}{PN}$ . Multiplying these together yields * $\frac {YN}{YM} = \left(\frac {AN}{AM}\right) \left(\frac {PN}{PM}\right)$
$\frac {AN}{AM} = \frac {\frac {AB}{2}}{\frac {AC}{2}} = \frac {15}{13}$
Now we claim that $\triangle PMD \sim \triangle PNE$ . To prove this, we can use cyclic quadrilaterals.
From $AMPN$ $\angle PNY \cong \angle PAM$ and $\angle ANM \cong \angle APM$ . So, $m\angle PNA = m\angle PNY + m\angle ANM = m\angle PAM + m\angle APM = 180-m\angle PMA$ and $\angle PNA \cong \angle PMD$
From $ADPE$ $\angle PDE \cong \angle PAE$ and $\angle EDA \cong \angle EPA$ . Thus, $m\angle MDP = m\angle PDE + m\angle EDA = m\angle PAE + m\angle EPA = 180-m\angle PEA$ and $\angle PDM \cong \angle PEN$
Thus, from AA similarity, $\triangle PMD \sim \triangle PNE$
Therefore, $\frac {PN}{PM} = \frac {NE}{MD}$ , which can easily be computed by the angle bisector theorem to be $\frac {145}{117}$ . It follows that * $\frac {BQ}{CQ} = \frac {15}{13} \cdot \frac {145}{117} = \frac {725}{507}$ , giving us an answer of $725 - 507 = \boxed{218}$
| 218
|
6,162
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_1
| 1
|
Call a $3$ -digit number geometric if it has $3$ distinct digits which, when read from left to right, form a geometric sequence. Find the difference between the largest and smallest geometric numbers.
|
Assume that the largest geometric number starts with a $9$ . We know that the common ratio must be a rational of the form $k/3$ for some integer $k$ , because a whole number should be attained for the 3rd term as well. When $k = 1$ , the number is $931$ . When $k = 2$ , the number is $964$ . When $k = 3$ , we get $999$ , but the integers must be distinct. By the same logic, the smallest geometric number is $124$ . The largest geometric number is $964$ and the smallest is $124$ . Thus the difference is $964 - 124 = \boxed{840}$
| 840
|
6,163
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_1
| 2
|
Call a $3$ -digit number geometric if it has $3$ distinct digits which, when read from left to right, form a geometric sequence. Find the difference between the largest and smallest geometric numbers.
|
Consider the three-digit number $abc$ . If its digits form a geometric progression, we must have that ${a \over b} = {b \over c}$ , that is, $b^2 = ac$
The minimum and maximum geometric numbers occur when $a$ is minimized and maximized, respectively. The minimum occurs when $a = 1$ ; letting $b = 2$ and $c = 4$ achieves this, so the smallest possible geometric number is 124.
For the maximum, we have that $b^2 = 9c$ $b$ is maximized when $9c$ is the greatest possible perfect square; this happens when $c = 4$ , yielding $b = 6$ . Thus, the largest possible geometric number is 964.
Our answer is thus $964 - 124 = \boxed{840}$
| 840
|
6,164
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_1
| 3
|
Call a $3$ -digit number geometric if it has $3$ distinct digits which, when read from left to right, form a geometric sequence. Find the difference between the largest and smallest geometric numbers.
|
The smallest geometric number is $124$ because $123$ and any number containing a zero does not work. $964$ is the largest geometric number because the middle digit cannot be 8 or 7. Subtracting the numbers gives $\boxed{840}.$
| 840
|
6,165
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_2
| 1
|
There is a complex number $z$ with imaginary part $164$ and a positive integer $n$ such that
\[\frac {z}{z + n} = 4i.\]
Find $n$
|
Let $z = a + 164i$
Then \[\frac {a + 164i}{a + 164i + n} = 4i\] and \[a + 164i = \left (4i \right ) \left (a + n + 164i \right ) = 4i \left (a + n \right ) - 656.\]
By comparing coefficients, equating the real terms on the leftmost and rightmost side of the equation,
we conclude that \[a = -656.\]
By equating the imaginary terms on each side of the equation,
we conclude that \[164i = 4i \left (a + n \right ) = 4i \left (-656 + n \right ).\]
We now have an equation for $n$ \[4i \left (-656 + n \right ) = 164i,\]
and this equation shows that $n = \boxed{697}.$
| 697
|
6,166
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_2
| 2
|
There is a complex number $z$ with imaginary part $164$ and a positive integer $n$ such that
\[\frac {z}{z + n} = 4i.\]
Find $n$
|
\[\frac {z}{z+n}=4i\]
\[1-\frac {n}{z+n}=4i\]
\[1-4i=\frac {n}{z+n}\]
\[\frac {1}{1-4i}=\frac {z+n}{n}\]
\[\frac {1+4i}{17}=\frac {z}{n}+1\]
Since their imaginary part has to be equal,
\[\frac {4i}{17}=\frac {164i}{n}\]
\[n=\frac {(164)(17)}{4}=697\]
\[n = \boxed{697}.\]
| 697
|
6,167
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_2
| 3
|
There is a complex number $z$ with imaginary part $164$ and a positive integer $n$ such that
\[\frac {z}{z + n} = 4i.\]
Find $n$
|
Below is an image of the complex plane. Let $\operatorname{Im}(z)$ denote the imaginary part of a complex number $z$ [asy] unitsize(1cm); xaxis("Re",Arrows); yaxis("Im",Arrows); real f(real x) {return 164;} pair F(real x) {return (x,f(x));} draw(graph(f,-700,100),red,Arrows); label("Im$(z)=164$",F(-330),N); pair z = (-656,164); dot(Label("$z$",align=N),z); dot(Label("$z+n$",align=N),z+(697,0)); draw(Label("$4x$"),z--(0,0)); draw(Label("$x$"),(0,0)--z+(697,0)); markscalefactor=2; draw(rightanglemark(z,(0,0),z+(697,0))); [/asy] $z$ must lie on the line $\operatorname{Im}(z)=164$ $z+n$ must also lie on the same line, since $n$ is real and does not affect the imaginary part of $z$
Consider $z$ and $z+n$ in terms of their magnitude (distance from the origin) and phase (angle formed by the point, the origin, and the positive real axis, measured counterclockwise from said axis). When multiplying/dividing two complex numbers, you can multiply/divide their magnitudes and add/subtract their phases to get the magnitude and phase of the product/quotient. Expressed in a formula, we have $z_1z_2 = r_1\angle\theta_1 \cdot r_2\angle\theta_2 = r_1r_2\angle(\theta_1+\theta_2)$ and $\frac{z_1}{z_2} = \frac{r_1\angle\theta_1}{r_2\angle\theta_2} = \frac{r_1}{r_2}\angle(\theta_1-\theta_2)$ , where $r$ is the magnitude and $\theta$ is the phase, and $z_n=r_n\angle\theta_n$
Since $4i$ has magnitude $4$ and phase $90^\circ$ (since the positive imaginary axis points in a direction $90^\circ$ counterclockwise from the positive real axis), $z$ must have a magnitude $4$ times that of $z+n$ . We denote the length from the origin to $z+n$ with the value $x$ and the length from the origin to $z$ with the value $4x$ . Additionally, $z$ , the origin, and $z+n$ must form a right angle, with $z$ counterclockwise from $z+n$
This means that $z$ , the origin, and $z+n$ form a right triangle. The hypotenuse is the length from $z$ to $z+n$ and has length $n$ , since $n$ is defined to be a positive integer. The area of the triangle can be expressed using the two legs, as $\frac{x \cdot 4x}{2}$ , or using the hypotenuse and its corresponding altitude, as $\frac{164n}{2}$ , so $\frac{x \cdot 4x}{2} = \frac{164n}{2} \implies x^2 = 41n$ . By Pythagorean Theorem, $x^2+(4x)^2 = n^2 \implies 17x^2 = n^2$ . Substituting out $x^2$ using the earlier equation, we get $17\cdot41n = n^2 \implies n = \boxed{697}$ . ~ emerald_block
| 697
|
6,168
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_2
| 4
|
There is a complex number $z$ with imaginary part $164$ and a positive integer $n$ such that
\[\frac {z}{z + n} = 4i.\]
Find $n$
|
Taking the reciprocal of our equation gives us $1 + \frac{n}{z} = \frac{1}{4i}.$ Therefore, \[\frac{n}{z} = \frac{1-4i}{4i} = \frac{17}{-16+4i}.\] Since $z$ has an imaginary part of $164$ , we must multiply both sides of our RHS fraction by $\frac{164}{4} = 41$ so that its denominator's imaginary part matches the LHS fraction's denominator's imaginary part. That looks like this: \[\frac{n}{z} = \frac{697}{-656 + 164i}.\] Therefore, we can conclude the the real part of $z$ is $-656$ and $n = \boxed{697}.$ (it wasn't necessary to find the real part)
| 697
|
6,169
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_4
| 1
|
In parallelogram $ABCD$ , point $M$ is on $\overline{AB}$ so that $\frac {AM}{AB} = \frac {17}{1000}$ and point $N$ is on $\overline{AD}$ so that $\frac {AN}{AD} = \frac {17}{2009}$ . Let $P$ be the point of intersection of $\overline{AC}$ and $\overline{MN}$ . Find $\frac {AC}{AP}$
|
One of the ways to solve this problem is to make this parallelogram a straight line.
So the whole length of the line is $APC$ $AMC$ or $ANC$ ), and $ABC$ is $1000x+2009x=3009x.$
$AP$ $AM$ or $AN$ ) is $17x.$
So the answer is $3009x/17x = \boxed{177}$
| 177
|
6,170
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_4
| 2
|
In parallelogram $ABCD$ , point $M$ is on $\overline{AB}$ so that $\frac {AM}{AB} = \frac {17}{1000}$ and point $N$ is on $\overline{AD}$ so that $\frac {AN}{AD} = \frac {17}{2009}$ . Let $P$ be the point of intersection of $\overline{AC}$ and $\overline{MN}$ . Find $\frac {AC}{AP}$
|
Draw a diagram with all the given points and lines involved. Construct parallel lines $\overline{DF_2F_1}$ and $\overline{BB_1B_2}$ to $\overline{MN}$ , where for the lines the endpoints are on $\overline{AM}$ and $\overline{AN}$ , respectively, and each point refers to an intersection. Also, draw the median of quadrilateral $BB_2DF_1$ $\overline{E_1E_2E_3}$ where the points are in order from top to bottom. Clearly, by similar triangles, $BB_2 = \frac {1000}{17}MN$ and $DF_1 = \frac {2009}{17}MN$ . It is not difficult to see that $E_2$ is the center of quadrilateral $ABCD$ and thus the midpoint of $\overline{AC}$ as well as the midpoint of $\overline{B_1}{F_2}$ (all of this is easily proven with symmetry). From more triangle similarity, $E_1E_3 = \frac12\cdot\frac {3009}{17}MN\implies AE_2 = \frac12\cdot\frac {3009}{17}AP\implies AC = 2\cdot\frac12\cdot\frac {3009}{17}AP$ $= \boxed{177}AP$
| 177
|
6,171
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_4
| 3
|
In parallelogram $ABCD$ , point $M$ is on $\overline{AB}$ so that $\frac {AM}{AB} = \frac {17}{1000}$ and point $N$ is on $\overline{AD}$ so that $\frac {AN}{AD} = \frac {17}{2009}$ . Let $P$ be the point of intersection of $\overline{AC}$ and $\overline{MN}$ . Find $\frac {AC}{AP}$
|
Assume, for the ease of computation, that $AM=AN=17$ $AB=1000$ , and $AD=2009$ . Now, let line $MN$ intersect line $CD$ at point $X$ and let $Y$ be a point such that $XY\parallel AD$ and $AY\parallel DX$ . As a result, $ADXY$ is a parallelogram. By construction, $\triangle MAN\sim \triangle MYX$ so \[\frac{MY}{MA}=\frac{YX}{AN}=\frac{AD}{AN}=\frac{2009}{17}\implies MY=2009\] and $AY=DX=2009-17$ . Also, because $AM\parallel XC$ , we have $\triangle PAM\sim \triangle PCX$ so \[\frac{PC}{PA}=\frac{CX}{AM}=\frac{DX+CD}{AM}=\frac{2009-17+1000}{17}=176.\] Hence, $\frac{AC}{AP}=\frac{PC}{PA}+1=\boxed{177}.$
| 177
|
6,172
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_4
| 4
|
In parallelogram $ABCD$ , point $M$ is on $\overline{AB}$ so that $\frac {AM}{AB} = \frac {17}{1000}$ and point $N$ is on $\overline{AD}$ so that $\frac {AN}{AD} = \frac {17}{2009}$ . Let $P$ be the point of intersection of $\overline{AC}$ and $\overline{MN}$ . Find $\frac {AC}{AP}$
|
Assign $A = (0,0)$ . Since there are no constraints in the problem against this, assume $ABCD$ to be a rectangle with dimensions $1000 \times 2009.$ Now, we can assign \[A=(0,0)\] \[B=(1000, 0)\] \[C=(1000,-2009)\] \[D=(0,-2009).\]
Then, since $\frac{AM}{AB} = \frac{17}{1000}$ and $AB = 1000$ , we can place $M$ at $(17, 0).$ Similarly, place $AN$ at $(0, 17).$ Then, the equation of line $MN$ is $y=x-17,$ and the equation of $AC$ is $y=\frac{-2009}{1000}x.$ Solve to find point $P$ at $\left( \frac{1000}{177}, \frac{-2009}{177} \right)$
We can calculate vectors to represent the distances: \[\overrightarrow{AC}= <1000, -2009>\] \[\overrightarrow{AP}= \frac{1}{177}<1000, -2009>.\] In this way, we can see that \[AC:AP = 177:1,\] and our answer is $\boxed{177}.$
| 177
|
6,173
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_6
| 1
|
How many positive integers $N$ less than $1000$ are there such that the equation $x^{\lfloor x\rfloor} = N$ has a solution for $x$
|
First, $x$ must be less than $5$ , since otherwise $x^{\lfloor x\rfloor}$ would be at least $3125$ which is greater than $1000$
Because ${\lfloor x\rfloor}$ must be an integer, let’s do case work based on ${\lfloor x\rfloor}$
For ${\lfloor x\rfloor}=0$ $N=1$ as long as $x \neq 0$ . This gives us $1$ value of $N$
For ${\lfloor x\rfloor}=1$ $N$ can be anything between $1^1$ to $2^1$ excluding $2^1$
Therefore, $N=1$ . However, we got $N=1$ in case 1 so it got counted twice.
For ${\lfloor x\rfloor}=2$ $N$ can be anything between $2^2$ to $3^2$ excluding $3^2$
This gives us $3^2-2^2=5$ $N$ 's
For ${\lfloor x\rfloor}=3$ $N$ can be anything between $3^3$ to $4^3$ excluding $4^3$
This gives us $4^3-3^3=37$ $N$ 's
For ${\lfloor x\rfloor}=4$ $N$ can be anything between $4^4$ to $5^4$ excluding $5^4$
This gives us $5^4-4^4=369$ $N$ 's
Since $x$ must be less than $5$ , we can stop here and the answer is $1+5+37+369= \boxed{412}$ possible values for $N$
| 412
|
6,174
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_6
| 2
|
How many positive integers $N$ less than $1000$ are there such that the equation $x^{\lfloor x\rfloor} = N$ has a solution for $x$
|
For a positive integer $k$ , we find the number of positive integers $N$ such that $x^{\lfloor x\rfloor}=N$ has a solution with ${\lfloor x\rfloor}=k$ . Then $x=\sqrt[k]{N}$ , and because $k \le x < k+1$ , we have $k^k \le x^k < (k+1)^k$ , and because $(k+1)^k$ is an integer, we get $k^k \le x^k \le (k+1)^k-1$ . The number of possible values of $x^k$ is equal to the number of integers between $k^k$ and $(k+1)^k-1$ inclusive, which is equal to the larger number minus the smaller number plus one or $((k+1)^k-1)-(k^k)+1$ , and this is equal to $(k+1)^k-k^k$ . If $k>4$ , the value of $x^k$ exceeds $1000$ , so we only need to consider $k \le 4$ . The requested number of values of $N$ is the same as the number of values of $x^k$ , which is $\sum^{4}_{k=1} [(k+1)^k-k^k]=2-1+9-4+64-27+625-256=\boxed{412}$
| 412
|
6,175
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_7
| 2
|
The sequence $(a_n)$ satisfies $a_1 = 1$ and $5^{(a_{n + 1} - a_n)} - 1 = \frac {1}{n + \frac {2}{3}}$ for $n \geq 1$ . Let $k$ be the least integer greater than $1$ for which $a_k$ is an integer. Find $k$
|
We notice that by multiplying the equation from an arbitrary $a_n$ all the way to $a_1$ , we get: \[5^{a_n-a_1}=\dfrac{n+\tfrac23}{1+\tfrac23}\] This simplifies to \[5^{a_n}=3n+2.\] We can now test powers of $5$
$5$ - that gives us $n=1$ , which is useless.
$25$ - that gives a non-integer $n$
$125$ - that gives $n=\boxed{41}$
| 41
|
6,176
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_8
| 2
|
Let $S = \{2^0,2^1,2^2,\ldots,2^{10}\}$ . Consider all possible positive differences of pairs of elements of $S$ . Let $N$ be the sum of all of these differences. Find the remainder when $N$ is divided by $1000$
|
When computing $N$ , the number $2^x$ will be added $x$ times (for terms $2^x-2^0$ $2^x-2^1$ , ..., $2^x - 2^{x-1}$ ), and subtracted $10-x$ times. Hence $N$ can be computed as $N=10\cdot 2^{10} + 8\cdot 2^9 + 6\cdot 2^8 + \cdots - 8\cdot 2^1 - 10\cdot 2^0$ . Evaluating $N \bmod {1000}$ yields:
\begin{align*} N & = 10(2^{10}-1) + 8(2^9 - 2^1) + 6(2^8-2^2) + 4(2^7-2^3) + 2(2^6-2^4) \\ & = 10(1023) + 8(510) + 6(252) + 4(120) + 2(48) \\ & = 10(1000+23) + 8(500+10) + 6(250+2) + 480 + 96 \\ & \equiv (0 + 230) + (0 + 80) + (500 + 12) + 480 + 96 \\ & \equiv \boxed{398}
| 398
|
6,177
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_8
| 3
|
Let $S = \{2^0,2^1,2^2,\ldots,2^{10}\}$ . Consider all possible positive differences of pairs of elements of $S$ . Let $N$ be the sum of all of these differences. Find the remainder when $N$ is divided by $1000$
|
This solution can be generalized to apply when $10$ is replaced by other positive integers.
Extending from Solution 2, we get that the sum $N$ of all possible differences of pairs of elements in $S$ when $S = \{2^0,2^1,2^2,\ldots,2^{n}\}$ is equal to $\sum_{x=0}^{n} (2x-n) 2^x$ . Let $A = \sum_{x=0}^{n} x2^x$ $B=\sum_{x=0}^{n} 2^x$ . Then $N=2A - nB$
For $n = 10$ $B = 2^{11}-1 = 2047 \equiv 47 \pmod{1000}$ by the geometric sequence formula.
$2A = \sum_{x=1}^{n+1} (x-1)2^x$ , so $2A - A = A = n2^{n+1} - \sum_{x=1}^{n} 2^x$ . Hence, for $n = 10$ $A = 10 \cdot 2^{11} - 2^{11} + 2 = 9 \cdot 2^{11} + 2 \equiv 48 \cdot 9 + 2 =$
$434 \pmod{1000}$ , by the geometric sequence formula and the fact that $2^{10} = 1024 \equiv 24 \pmod{1000}$
Thus, for $n = 10$ $N = 2A - 10B \equiv 2\cdot 434 - 10\cdot 47 = 868 - 470 = \boxed{398}$
| 398
|
6,178
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_9
| 1
|
A game show offers a contestant three prizes A, B and C, each of which is worth a whole number of dollars from $$ 1$ to $$ 9999$ inclusive. The contestant wins the prizes by correctly guessing the price of each prize in the order A, B, C. As a hint, the digits of the three prices are given. On a particular day, the digits given were $1, 1, 1, 1, 3, 3, 3$ . Find the total number of possible guesses for all three prizes consistent with the hint.
|
[Clarification: You are supposed to find the number of all possible tuples of prices, $(A, B, C)$ , that could have been on that day.]
Since we have three numbers, consider the number of ways we can put these three numbers together in a string of 7 digits. For example, if $A=113, B=13, C=31$ , then the string is
\[1131331.\]
Since the strings have seven digits and three threes, there are $\binom{7}{3}=35$ arrangements of all such strings.
In order to obtain all combination of A,B,C, we partition all the possible strings into 3 groups.
Let's look at the example. We have to partition it into 3 groups with each group having at least 1 digit. In other words, we need to find the solution to
\[x+y+z=7, x,y,z>0.\]
This gives us
\[\binom{6}{2}=15\]
ways by balls and urns. But we have counted the one with 5 digit numbers; that is, $(5,1,1),(1,1,5),(1,5,1)$
Thus, each arrangement has \[\binom{6}{2}-3=12\] ways per arrangement, and there are $12\times35=\boxed{420}$ ways.
| 420
|
6,179
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_10
| 1
|
The Annual Interplanetary Mathematics Examination (AIME) is written by a committee of five Martians, five Venusians, and five Earthlings. At meetings, committee members sit at a round table with chairs numbered from $1$ to $15$ in clockwise order. Committee rules state that a Martian must occupy chair $1$ and an Earthling must occupy chair $15$ , Furthermore, no Earthling can sit immediately to the left of a Martian, no Martian can sit immediately to the left of a Venusian, and no Venusian can sit immediately to the left of an Earthling. The number of possible seating arrangements for the committee is $N \cdot (5!)^3$ . Find $N$
|
Since the 5 members of each planet committee are distinct we get that the number of arrangement of sittings is in the form $N*(5!)^3$ because for each $M, V, E$ sequence we have $5!$ arrangements within the Ms, Vs, and Es.
Pretend the table only seats $3$ "people", with $1$ "person" from each planet. Counting clockwise, only the arrangement M, V, E satisfies the given constraints. Therefore, in the actual problem, the members must sit in cycles of M, V, E, but not necessarily with one M, one V, and one E in each cycle(for example, MMVVVE, MVVVEEE, MMMVVVEE all count as cycles). These cycles of MVE must start at seat $1$ , since an M is at seat $1$ . We simply count the number of arrangements through casework.
1. The entire arrangement is one cycle- There is only one way to arrange this, MMMMMVVVVVEEEEE
2. Two cycles - There are 3 Ms, Vs and Es left to distribute among the existing MVEMVE. Using stars and bars, we get $\binom{4}{1}=4$ ways for the members of each planet. Therefore, there are $4^3=64$ ways in total.
3. Three cycles - 2 Ms, Vs, Es left, so $\binom{4}{2}=6$ , making there $6^3=216$ ways total.
4. Four cycles - 1 M, V, E left, each M can go to any of the four MVE cycles and likewise for V and E, $4^3=64$ ways total
5. Five cycles - MVEMVEMVEMVEMVE is the only possibility, so there is just $1$ way.
Combining all these cases, we get $1+1+64+64+216= \boxed{346}$
| 346
|
6,180
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_11
| 1
|
Consider the set of all triangles $OPQ$ where $O$ is the origin and $P$ and $Q$ are distinct points in the plane with nonnegative integer coordinates $(x,y)$ such that $41x + y = 2009$ . Find the number of such distinct triangles whose area is a positive integer.
|
Let the two points $P$ and $Q$ be defined with coordinates; $P=(x_1,y_1)$ and $Q=(x_2,y_2)$
We can calculate the area of the parallelogram with the determinant of the matrix of the coordinates of the two points(shoelace theorem).
$\det \left(\begin{array}{c} P \\ Q\end{array}\right)=\det \left(\begin{array}{cc}x_1 &y_1\\x_2&y_2\end{array}\right).$
Since the triangle has half the area of the parallelogram, we just need the determinant to be even.
The determinant is
\[(x_1)(y_2)-(x_2)(y_1)=(x_1)(2009-41(x_2))-(x_2)(2009-41(x_1))=2009(x_1)-41(x_1)(x_2)-2009(x_2)+41(x_1)(x_2)=2009((x_1)-(x_2))\]
Since $2009$ is not even, $((x_1)-(x_2))$ must be even, thus the two $x$ 's must be of the same parity. Also note that the maximum value for $x$ is $49$ and the minimum is $0$ . There are $25$ even and $25$ odd numbers available for use as coordinates and thus there are $(_{25}C_2)+(_{25}C_2)=\boxed{600}$ such triangles.
| 600
|
6,181
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_11
| 2
|
Consider the set of all triangles $OPQ$ where $O$ is the origin and $P$ and $Q$ are distinct points in the plane with nonnegative integer coordinates $(x,y)$ such that $41x + y = 2009$ . Find the number of such distinct triangles whose area is a positive integer.
|
As in the solution above, let the two points $P$ and $Q$ be defined with coordinates; $P=(x_1,y_1)$ and $Q=(x_2,y_2)$
If the coordinates of $P$ and $Q$ have nonnegative integer coordinates, $P$ and $Q$ must be lattice points either
We can calculate the y-intercept of the line $41x+y=2009$ to be $(0,2009)$ and the x-intercept to be $(49,0)$
Using the point-to-line distance formula, we can calculate the height of $\triangle OPQ$ from vertex $O$ (the origin) to be:
$\dfrac{|41(0) + 1(0) - 2009|}{\sqrt{41^2 + 1^2}} = \dfrac{2009}{\sqrt{1682}} = \dfrac{2009}{29\sqrt2}$
Let $b$ be the base of the triangle that is part of the line $41x+y=2009$
The area is calculated as: $\dfrac{1}{2}\times b \times \dfrac{2009}{29\sqrt2} = \dfrac{2009}{58\sqrt2}\times b$
Let the numerical area of the triangle be $k$
So, $k = \dfrac{2009}{58\sqrt2}\times b$
We know that $k$ is an integer. So, $b = 58\sqrt2 \times z$ , where $z$ is also an integer.
We defined the points $P$ and $Q$ as $P=(x_1,y_1)$ and $Q=(x_2,y_2)$
Changing the y-coordinates to be in terms of x, we get:
$P=(x_1,2009-41x_1)$ and $Q=(x_2,2009-41x_2)$
The distance between them equals $b$
Using the distance formula, we get
$PQ = b = \sqrt{(-41x_2+ 41x_1)^2 + (x_2 - x_1)^2} = 29\sqrt2 \times |x_2 - x_1| = 58\sqrt2\times z$ $(*)$
WLOG, we can assume that $x_2 > x_1$
Taking the last two equalities from the $(*)$ string of equalities and putting in our assumption that $x_2>x_1$ , we get
$29\sqrt2\times (x_2-x_1) = 58\sqrt2\times z$
Dividing both sides by $29\sqrt2$ , we get
$x_2-x_1 = 2z$
As we mentioned, $z$ is an integer, so $x_2-x_1$ is an even integer. Also, $x_2$ and $x_1$ are both positive integers. So, $x_2$ and $x_1$ are between 0 and 49, inclusive. Remember, $x_2>x_1$ as well.
...
Summing them up, we get that there are $2+4+\dots + 48 = \boxed{600}$ triangles.
| 600
|
6,182
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_12
| 5
|
In right $\triangle ABC$ with hypotenuse $\overline{AB}$ $AC = 12$ $BC = 35$ , and $\overline{CD}$ is the altitude to $\overline{AB}$ . Let $\omega$ be the circle having $\overline{CD}$ as a diameter. Let $I$ be a point outside $\triangle ABC$ such that $\overline{AI}$ and $\overline{BI}$ are both tangent to circle $\omega$ . The ratio of the perimeter of $\triangle ABI$ to the length $AB$ can be expressed in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
This solution is not a real solution and is solving the problem with a ruler and compass.
Draw $AC = 4.8, BC = 14, AB = 14.8$ . Then, drawing the tangents and intersecting them, we get that $IA$ is around $6.55$ and $IB$ is around $18.1$ . We then find the ratio to be around $\frac{39.45}{14.8}$ . Using long division, we find that this ratio is approximately 2.666, which you should recognize as $\frac{8}{3}$ . Since this seems reasonable, we find that the answer is $\boxed{11}$ ~ilp
| 11
|
6,183
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_12
| 6
|
In right $\triangle ABC$ with hypotenuse $\overline{AB}$ $AC = 12$ $BC = 35$ , and $\overline{CD}$ is the altitude to $\overline{AB}$ . Let $\omega$ be the circle having $\overline{CD}$ as a diameter. Let $I$ be a point outside $\triangle ABC$ such that $\overline{AI}$ and $\overline{BI}$ are both tangent to circle $\omega$ . The ratio of the perimeter of $\triangle ABI$ to the length $AB$ can be expressed in the form $\frac {m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$
|
Denoting three tangents has length $h_1,h_2,h_3$ while $h_1,h_3$ lies on $AB$ with $h_1>h_3$ .The area of $ABC$ is $1/2*12*35 = 1/2*37*CD$ , so $CD=\frac{420}{37}$ and the inradius of $\triangle ABI$ is $r=\frac{210}{37}$ .As we know that the diameter of the circle is the height of $\triangle ACB$ from $C$ to $AB$ . Assume that $\tan\alpha=\frac{h_1}{r}$ and $\tan\beta=\frac{h_3}{r}$ and $\tan\omega=\frac{h_2}{r}$ . But we know that $\tan(\alpha+\beta)=-\tan(180-\alpha-\beta)=-\tan\omega$ According to the basic computation, we can get that $\tan(\alpha)=\frac{35}{6}$ $\tan(\beta)=\frac{24}{35}$ So we know that $\tan(\omega)=\frac{1369}{630}$ according to the tangent addition formula. Hence, it is not hard to find that the length of $h_2$ is $\frac{37}{3}$ . According to basic addition and division, we get the answer is $\frac{8}{3}$ which leads to $8+3=\boxed{11}$ ~bluesoul
| 11
|
6,184
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_13
| 3
|
The terms of the sequence $(a_i)$ defined by $a_{n + 2} = \frac {a_n + 2009} {1 + a_{n + 1}}$ for $n \ge 1$ are positive integers. Find the minimum possible value of $a_1 + a_2$
|
Essentially you see that it must be an integer for infinite numbers, which doesn't quite seem probable. The most logical explanation is that the sequence repeats, and the numbers in the sequence that repeat are integers. We list out some terms. \begin{align*} a_{1} &= a \\ a_{2} &= b \\ a_{3} &=\frac{a+2009}{1+b} \\ a_{4} &=\frac{(b+1)(b+2009)}{a+b+2010} \\ \end{align*} The terms get more and more wacky, so we just solve for $a,b$ such that $a_{1}=a_{3}$ and $a_{2}=a_{4}.$
Solving we find both equations end up to the equation $ab=2009$ in which we see to minimize we see that $a = 49$ and $b=41$ or vice versa for an answer of $\boxed{90}.$ This solution is VERY non rigorous and not recommended.
| 90
|
6,185
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_14
| 1
|
For $t = 1, 2, 3, 4$ , define $S_t = \sum_{i = 1}^{350}a_i^t$ , where $a_i \in \{1,2,3,4\}$ . If $S_1 = 513$ and $S_4 = 4745$ , find the minimum possible value for $S_2$
|
Because the order of the $a$ 's doesn't matter, we simply need to find the number of $1$ $2$ $3$ s and $4$ s that minimize $S_2$ . So let $w, x, y,$ and $z$ represent the number of $1$ s, $2$ s, $3$ s, and $4$ s respectively. Then we can write three equations based on these variables. Since there are a total of $350$ $a$ s, we know that $w + x + y + z = 350$ . We also know that $w + 2x + 3y + 4z = 513$ and $w + 16x + 81y + 256z = 4745$ . We can now solve these down to two variables: \[w = 350 - x - y - z\] Substituting this into the second and third equations, we get \[x + 2y + 3z = 163\] and \[15x + 80y + 255z = 4395.\] The second of these can be reduced to \[3x + 16y + 51z = 879.\] Now we substitute $x$ from the first new equation into the other new equation. \[x = 163 - 2y - 3z\] \[3(163 - 2y - 3z) + 16y + 51z = 879\] \[489 + 10y + 42z = 879\] \[5y + 21z = 195\] Since $y$ and $z$ are integers, the two solutions to this are $(y,z) = (39,0)$ or $(18,5)$ .
If you plug both these solutions in to $S_2$ it is apparent that the second one returns a smaller value. It turns out that $w = 215$ $x = 112$ $y = 18$ , and $z = 5$ , so $S_2 = 215 + 4*112 + 9*18 + 16*5 = 215 + 448 + 162 + 80 = \boxed{905}$
| 905
|
6,186
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_15
| 1
|
In triangle $ABC$ $AB = 10$ $BC = 14$ , and $CA = 16$ . Let $D$ be a point in the interior of $\overline{BC}$ . Let points $I_B$ and $I_C$ denote the incenters of triangles $ABD$ and $ACD$ , respectively. The circumcircles of triangles $BI_BD$ and $CI_CD$ meet at distinct points $P$ and $D$ . The maximum possible area of $\triangle BPC$ can be expressed in the form $a - b\sqrt {c}$ , where $a$ $b$ , and $c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a + b + c$
|
First, by the Law of Cosines , we have \[\cos BAC = \frac {16^2 + 10^2 - 14^2}{2\cdot 10 \cdot 16} = \frac {256+100-196}{320} = \frac {1}{2},\] so $\angle BAC = 60^\circ$
Let $O_1$ and $O_2$ be the circumcenters of triangles $BI_BD$ and $CI_CD$ , respectively. We first compute \[\angle BO_1D = \angle BO_1I_B + \angle I_BO_1D = 2\angle BDI_B + 2\angle I_BBD.\] Because $\angle BDI_B$ and $\angle I_BBD$ are half of $\angle BDA$ and $\angle ABD$ , respectively, the above expression can be simplified to \[\angle BO_1D = \angle BO_1I_B + \angle I_BO_1D = 2\angle BDI_B + 2\angle I_BBD = \angle ABD + \angle BDA.\] Similarly, $\angle CO_2D = \angle ACD + \angle CDA$ . As a result
\begin{align*}\angle CPB &= \angle CPD + \angle BPD \\&= \frac {1}{2} \cdot \angle CO_2D + \frac {1}{2} \cdot \angle BO_1D \\&= \frac {1}{2}(\angle ABD + \angle BDA + \angle ACD + \angle CDA) \\&= \frac {1}{2} (2 \cdot 180^\circ - \angle BAC) \\&= \frac {1}{2} \cdot 300^\circ = 150^\circ.\end{align*}
Therefore $\angle CPB$ is constant ( $150^\circ$ ). Also, $P$ is $B$ or $C$ when $D$ is $B$ or $C$ . Let point $L$ be on the same side of $\overline{BC}$ as $A$ with $LC = LB = BC = 14$ $P$ is on the circle with $L$ as the center and $\overline{LC}$ as the radius, which is $14$ . The shortest (and only) distance from $L$ to $\overline{BC}$ is $7\sqrt {3}$
When the area of $\triangle BPC$ is the maximum, the distance from $P$ to $\overline{BC}$ has to be the greatest. In this case, it's $14 - 7\sqrt {3}$ . The maximum area of $\triangle BPC$ is \[\frac {1}{2} \cdot 14 \cdot (14 - 7\sqrt {3}) = 98 - 49 \sqrt {3}\] and the requested answer is $98 + 49 + 3 = \boxed{150}$
| 150
|
6,187
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_15
| 2
|
In triangle $ABC$ $AB = 10$ $BC = 14$ , and $CA = 16$ . Let $D$ be a point in the interior of $\overline{BC}$ . Let points $I_B$ and $I_C$ denote the incenters of triangles $ABD$ and $ACD$ , respectively. The circumcircles of triangles $BI_BD$ and $CI_CD$ meet at distinct points $P$ and $D$ . The maximum possible area of $\triangle BPC$ can be expressed in the form $a - b\sqrt {c}$ , where $a$ $b$ , and $c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a + b + c$
|
From Law of Cosines on $\triangle{ABC}$ \[\cos{A}=\frac{16^2+10^2-14^2}{2\cdot 10\cdot 16}=\frac{1}{2}\implies\angle{A}=60^\circ.\] Now, \[\angle{CI_CD}+\angle{BI_BD}=180^\circ+\frac{\angle{A}}{2}=210^\circ.\] Since $CI_CDP$ and $BI_BDP$ are cyclic quadrilaterals, it follows that \[\angle{BPC}=\angle{CPD}+\angle{DPB}=(180^\circ-\angle{CI_CD})+(180^\circ-\angle{BI_BD})=360^\circ-210^\circ=150^\circ.\] Next, applying Law of Cosines on $\triangle{CPB}$ \begin{align*} & BC^2=14^2=PC^2+PB^2+2\cdot PB\cdot PC\cdot\frac{\sqrt{3}}{2} \\ & \implies \frac{PC^2+PB^2-196}{PC\cdot PB}=-\sqrt{3} \\ & \implies \frac{PC}{PB}+\frac{PB}{PC}-\frac{196}{PC\cdot PB}=-\sqrt{3} \\ & \implies PC\cdot PB = 196\left(\frac{1}{\frac{PC}{PB}+\frac{PB}{PC}+\sqrt{3}}\right). \end{align*} By AM-GM, $\frac{PC}{PB}+\frac{PB}{PC}\geq{2}$ , so \[PB\cdot PC\leq 196\left(\frac{1}{2+\sqrt{3}}\right)=196(2-\sqrt{3}).\] Finally, \[[\triangle{BPC}]=\frac12 \cdot PB\cdot PC\cdot\sin{150^\circ}=\frac14 \cdot PB\cdot PC,\] and the maximum area would be $49(2-\sqrt{3})=98-49\sqrt{3},$ so the answer is $\boxed{150}$
| 150
|
6,188
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_I_Problems/Problem_15
| 3
|
In triangle $ABC$ $AB = 10$ $BC = 14$ , and $CA = 16$ . Let $D$ be a point in the interior of $\overline{BC}$ . Let points $I_B$ and $I_C$ denote the incenters of triangles $ABD$ and $ACD$ , respectively. The circumcircles of triangles $BI_BD$ and $CI_CD$ meet at distinct points $P$ and $D$ . The maximum possible area of $\triangle BPC$ can be expressed in the form $a - b\sqrt {c}$ , where $a$ $b$ , and $c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a + b + c$
|
Proceed as in Solution 2 until you find $\angle CPB = 150$ . The locus of points $P$ that give $\angle CPB = 150$ is a fixed arc from $B$ to $C$ $P$ will move along this arc as $D$ moves along $BC$ ) and we want to maximise the area of [ $\triangle BPC$ ]. This means we want $P$ to be farthest distance away from $BC$ as possible, so we put $P$ in the middle of the arc (making $\triangle BPC$ isosceles). We know that $BC=14$ and $\angle CPB = 150$ , so $\angle PBC = \angle PCB = 15$ . Let $O$ be the foot of the perpendicular from $P$ to line $BC$ . Then the area of [ $\triangle BPC$ ] is the same as $7OP$ because base $BC$ has length $14$ . We can split $\triangle BPC$ into two $15-75-90$ triangles $BOP$ and $COP$ , with $BO=CO=7$ and $OP=7 \tan 15=7(2-\sqrt{3})=14-7\sqrt3$ . Then, the area of [ $\triangle BPC$ ] is equal to $7 \cdot OP=98-49\sqrt{3}$ , and so the answer is $98+49+3=\boxed{150}$
| 150
|
6,189
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 1
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
Let $x$ be the amount of paint in a strip. The total amount of paint is $130+164+188=482$ . After painting the wall, the total amount of paint is $482-4x$ . Because the total amount in each color is the same after finishing, we have
\[\frac{482-4x}{3} = 130-x\] \[482-4x=390-3x\] \[x=92\]
Our answer is $482-4\cdot 92 = 482 - 368 = \boxed{114}$
| 114
|
6,190
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 2
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
Let the stripes be $b, r, w,$ and $p$ , respectively. Let the red part of the pink be $\frac{r_p}{p}$ and the white part be $\frac{w_p}{p}$ for $\frac{r_p+w_p}{p}=p$
Since the stripes are of equal size, we have $b=r=w=p$ . Since the amounts of paint end equal, we have $130-b=164-r-\frac{r_p}{p}=188-w-\frac{w_p}{p}$ . Thus, we know that \[130-p=164-p-\frac{r_p}{p}=188-p-\frac{w_p}{p}\] \[130=164-\frac{r_p}{p}=188-\frac{w_p}{p}\] \[r_p=34p, w_p=58p\] \[\frac{r_p+w_p}{p}=92=p=b.\] Each paint must end with $130-92=38$ oz left, for a total of $3 \cdot 38 = \boxed{114}$ oz.
| 114
|
6,191
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 3
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
After the pink stripe is drawn, all three colors will be used equally so the pink stripe must bring the amount of red and white paint down to $130$ ounces each. Say $a$ is the fraction of the pink paint that is red paint and $x$ is the size of each stripe. Then equations can be written: $ax = 164 - 130 = 34$ and $(1-a)x = 188 - 130 = 58$ . The second equation becomes $x - ax = 58$ and substituting the first equation into this one we get $x - 34 = 58$ so $x = 92$ . The amount of each color left over at the end is thus $130 - 92 = 38$ and $38 * 3 = \boxed{114}$
| 114
|
6,192
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 4
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
We know that all the stripes are of equal size. We can then say that $r$ is the amount of paint per stripe. Then $130 - r$ will be the amount of blue paint left. Now for the other two stripes. The amount of white paint left after the white stripe and the amount of red paint left after the blue stripe are $188 - r$ and $164 - r$ respectively. The pink stripe is also r ounces of paint, but let there be $k$ ounces of red paint in the mixture and $r - k$ ounces of white paint. We now have two equations: $164 - r - k = 188 - r - (r-k)$ and $164 - r - k = 130 - r$ . Solving yields k = 34 and r = 92. We now see that there will be $130 - 92 = 38$ ounces of paint left in each can. $38 * 3 = \boxed{114}$
| 114
|
6,193
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 5
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
Let the amount of paint each stripe painted used be $x$ . Also, let the amount of paint of each color left be $y$ . 1 stripe is drawn with the blue paint, and 3 stripes are drawn with the red and white paints. Add together the amount of red and white paint, $164 + 188 = 352$ and obtain the following equations : $352 - 3x = 2y$ and $130 - x = y$ . Solve to obtain $x = 92$ . Therefore $y$ is $130 - 92 = 38$ , with three cans of equal amount of paint, the answer is $38 * 3 = \boxed{114}$
| 114
|
6,194
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 6
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
Let $x$ be the number of ounces of paint needed for a single stripe. We know that in the end, the total amount of red and white paint will equal double the amount of blue paint.
After painting, the amount of red and white paint remaining is equal to $164+188-2x$ , and then minus another $x$ for the pink stripe. The amount of blue paint remaining is equal to $130-x$ .
So, we get the equation $2\cdot(130-x)=164+188-3x$ . Simplifying, we get $x=38$ and $3x=\boxed{114}$
| 114
|
6,195
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_1
| 7
|
Before starting to paint, Bill had $130$ ounces of blue paint, $164$ ounces of red paint, and $188$ ounces of white paint. Bill painted four equally sized stripes on a wall, making a blue stripe, a red stripe, a white stripe, and a pink stripe. Pink is a mixture of red and white, not necessarily in equal amounts. When Bill finished, he had equal amounts of blue, red, and white paint left. Find the total number of ounces of paint Bill had left.
|
Just like in solution 1, we note that all colors will be used equally, except for the pink stripe. This must bring red and white down to $130$ each, so $34$ red and $58$ white are used, making for a total of $92$ for the pink stripe. Thus, the other stripes also use $92$ . The answer is $130+164+188-4(92)=\boxed{114}$
| 114
|
6,196
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_2
| 1
|
Suppose that $a$ $b$ , and $c$ are positive real numbers such that $a^{\log_3 7} = 27$ $b^{\log_7 11} = 49$ , and $c^{\log_{11}25} = \sqrt{11}$ . Find \[a^{(\log_3 7)^2} + b^{(\log_7 11)^2} + c^{(\log_{11} 25)^2}.\]
|
First, we have: \[x^{(\log_y z)^2} = x^{\left( (\log_y z)^2 \right) } = x^{(\log_y z) \cdot (\log_y z) } = \left( x^{\log_y z} \right)^{\log_y z}\]
Now, let $x=y^w$ , then we have: \[x^{\log_y z} = \left( y^w \right)^{\log_y z} = y^{w\log_y z} = y^{\log_y (z^w)} = z^w\]
This is all we need to evaluate the given formula. Note that in our case we have $27=3^3$ $49=7^2$ , and $\sqrt{11}=11^{1/2}$ . We can now compute:
\[a^{(\log_3 7)^2} = \left( a^{\log_3 7} \right)^{\log_3 7} = 27^{\log_3 7} = (3^3)^{\log_3 7} = 7^3 = 343\]
Similarly, we get \[b^{(\log_7 11)^2} = (7^2)^{\log_7 11} = 11^2 = 121\]
and \[c^{(\log_{11} 25)^2} = (11^{1/2})^{\log_{11} 25} = 25^{1/2} = 5\]
and therefore the answer is $343+121+5 = \boxed{469}$
| 469
|
6,197
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_2
| 2
|
Suppose that $a$ $b$ , and $c$ are positive real numbers such that $a^{\log_3 7} = 27$ $b^{\log_7 11} = 49$ , and $c^{\log_{11}25} = \sqrt{11}$ . Find \[a^{(\log_3 7)^2} + b^{(\log_7 11)^2} + c^{(\log_{11} 25)^2}.\]
|
We know from the first three equations that $\log_a27 = \log_37$ $\log_b49 = \log_711$ , and $\log_c\sqrt{11} = \log_{11}25$ . Substituting, we find
\[a^{(\log_a27)(\log_37)} + b^{(\log_b49)(\log_711)} + c^{(\log_c\sqrt {11})(\log_{11}25)}.\]
We know that $x^{\log_xy} =y$ , so we find
\[27^{\log_37} + 49^{\log_711} + \sqrt {11}^{\log_{11}25}\]
\[(3^{\log_37})^3 + (7^{\log_711})^2 + ({11^{\log_{11}25}})^{1/2}.\]
The $3$ and the $\log_37$ cancel to make $7$ , and we can do this for the other two terms. Thus, our answer is
\[7^3 + 11^2 + 25^{1/2}\] \[= 343 + 121 + 5\] \[= \boxed{469}.\]
| 469
|
6,198
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_3
| 1
|
In rectangle $ABCD$ $AB=100$ . Let $E$ be the midpoint of $\overline{AD}$ . Given that line $AC$ and line $BE$ are perpendicular, find the greatest integer less than $AD$
|
From the problem, $AB=100$ and triangle $FBA$ is a right triangle. As $ABCD$ is a rectangle, triangles $BCA$ , and $ABE$ are also right triangles. By $AA$ $\triangle FBA \sim \triangle BCA$ , and $\triangle FBA \sim \triangle ABE$ , so $\triangle ABE \sim \triangle BCA$ . This gives $\frac {AE}{AB}= \frac {AB}{BC}$ $AE=\frac{AD}{2}$ and $BC=AD$ , so $\frac {AD}{2AB}= \frac {AB}{AD}$ , or $(AD)^2=2(AB)^2$ , so $AD=AB \sqrt{2}$ , or $100 \sqrt{2}$ , so the answer is $\boxed{141}$
| 141
|
6,199
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_3
| 2
|
In rectangle $ABCD$ $AB=100$ . Let $E$ be the midpoint of $\overline{AD}$ . Given that line $AC$ and line $BE$ are perpendicular, find the greatest integer less than $AD$
|
Let $x$ be the ratio of $BC$ to $AB$ . On the coordinate plane, plot $A=(0,0)$ $B=(100,0)$ $C=(100,100x)$ , and $D=(0,100x)$ . Then $E=(0,50x)$ . Furthermore, the slope of $\overline{AC}$ is $x$ and the slope of $\overline{BE}$ is $-x/2$ . They are perpendicular, so they multiply to $-1$ , that is, \[x\cdot-\frac{x}{2}=-1,\] which implies that $-x^2=-2$ or $x=\sqrt 2$ . Therefore $AD=100\sqrt 2\approx 141.42$ so $\lfloor AD\rfloor=\boxed{141}$
| 141
|
6,200
|
https://artofproblemsolving.com/wiki/index.php/2009_AIME_II_Problems/Problem_3
| 3
|
In rectangle $ABCD$ $AB=100$ . Let $E$ be the midpoint of $\overline{AD}$ . Given that line $AC$ and line $BE$ are perpendicular, find the greatest integer less than $AD$
|
Draw $CX$ and $EX$ to form a parallelogram $AEXC$ . Since $EX \parallel AC$ $\angle BEX=90^\circ$ by the problem statement, so $\triangle BEX$ is right.
Letting $AE=y$ , we have $BE=\sqrt{100^2+y^2}$ and $AC=EX=\sqrt{100^2+(2y)^2}$ . Since $CX=EA$ $\sqrt{100^2+y^2}^2+\sqrt{100^2+(2y)^2}=(3y)^2$ . Solving this, we have \[100^2+ 100^2 + y^2 + 4y^2 = 9y^2\] \[2\cdot 100^2 = 4y^2\] \[\frac{100^2}{2}=y^2\] \[\frac{100}{\sqrt{2}}=y\] \[\frac{100\sqrt{2}}{2}=y\] \[100\sqrt{2}=2y=AD\] , so the answer is $\boxed{141}$
| 141
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.