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
|
|---|---|---|---|---|---|
2,901
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10A_Problems/Problem_25
| 4
|
Real numbers $x$ $y$ , and $z$ are chosen independently and at random from the interval $[0,n]$ for some positive integer $n$ . The probability that no two of $x$ $y$ , and $z$ are within 1 unit of each other is greater than $\frac {1}{2}$ . What is the smallest possible value of $n$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$
|
Imagine Points $x$ $y$ $z$ as the "starting points" of three "blocks" of real numbers that have length $1$ . We are just trying to find the probability that those three "blocks" do not overlap. To do this we can set each unit of $1$ into $\mu$ equal little increments, and take the limit of the probability as $\mu$ approaches $\infty$ . (This is because there are indefinitely many real numbers in a given interval.) We see that the total number of arrangements for the three blocks of $1$ , without considering the rule that no two blocks shall overlap is $(n\mu + 1)^3$ . We see that the number of ways to arrange the three blocks such that no three of them are overlapping is simply $\dbinom{(n-2)\mu + 3}{3}$ . Taking the limit as $\mu$ approaches infinity, we obtain our closed form to be $\lim_{\mu \to \infty} \frac{\dbinom{(n-2)\mu + 3}{3}}{ (n\mu + 1)^3 }.$ Dividing leading coefficients, we obtain $\lim_{\mu \to \infty} \frac{\dbinom{(n-2)\mu + 3}{3}}{ (n\mu + 1)^3 } = \frac{\mu(n-2)^3}{\mu n^3} = \frac{(n-2)^3}{n^3}$ . Solving the inequality $\frac{(n-2)^3}{n^3} > \frac{1}{2}$ , we get the least value of $n$ as $n=\boxed{10}$
| 10
|
2,902
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_1
| 1
|
Each third-grade classroom at Pearl Creek Elementary has $18$ students and $2$ pet rabbits. How many more students than rabbits are there in all $4$ of the third-grade classrooms?
$\textbf{(A)}\ 48\qquad\textbf{(B)}\ 56\qquad\textbf{(C)}\ 64\qquad\textbf{(D)}\ 72\qquad\textbf{(E)}\ 80$
|
In each class, there are $18-2=16$ more students than rabbits. So for all classrooms, the difference between students and rabbits is $16 \times 4 = \boxed{64}$
| 64
|
2,903
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_2
| 1
|
A circle of radius 5 is inscribed in a rectangle as shown. The ratio of the length of the rectangle to its width is 2:1. What is the area of the rectangle?
[asy] draw((0,0)--(0,10)--(20,10)--(20,0)--cycle); draw(circle((10,5),5));[/asy]
$\textbf{(A)}\ 50\qquad\textbf{(B)}\ 100\qquad\textbf{(C)}\ 125\qquad\textbf{(D)}\ 150\qquad\textbf{(E)}\ 200$
|
Note that the diameter of the circle is equal to the shorter side of the rectangle. Since the radius is $5$ , the diameter is $2\cdot 5 = 10$ .
Since the sides of the rectangle are in a $2:1$ ratio, the longer side has length $2\cdot 10 = 20$ .
Therefore the area is $20\cdot 10 = 200$ or $\boxed{200}$
| 200
|
2,904
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_4
| 1
|
When Ringo places his marbles into bags with 6 marbles per bag, he has 4 marbles left over. When Paul does the same with his marbles, he has 3 marbles left over. Ringo and Paul pool their marbles and place them into as many bags as possible, with 6 marbles per bag. How many marbles will be leftover?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$
|
In total, there were $3+4=7$ marbles left from both Ringo and Paul.We know that $7 \equiv 1 \pmod{6}$ . This means that there would be $1$ marble leftover, or $\boxed{1}$
| 1
|
2,905
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_4
| 2
|
When Ringo places his marbles into bags with 6 marbles per bag, he has 4 marbles left over. When Paul does the same with his marbles, he has 3 marbles left over. Ringo and Paul pool their marbles and place them into as many bags as possible, with 6 marbles per bag. How many marbles will be leftover?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$
|
Let $r$ be the number of marbles Ringo has and let $p$ be the number of marbles Paul has. we have the following equations: \[r \equiv 4 \mod{6}\] \[p \equiv 3 \mod{6}\] Adding these equations we get: \[p + r \equiv 7 \mod{6}\] We know that $7 \equiv 1 \mod{6}$ so therefore: \[p + r \equiv 7 \equiv 1 \mod{6} \implies p + r \equiv 1 \mod{6}\] Thus when Ringo and Paul pool their marbles, they will have $\boxed{1}$ marble left over.
| 1
|
2,906
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_5
| 1
|
Anna enjoys dinner at a restaurant in Washington, D.C., where the sales tax on meals is 10%. She leaves a 15% tip on the price of her meal before the sales tax is added, and the tax is calculated on the pre-tip amount. She spends a total of 27.50 dollars for dinner. What is the cost of her dinner without tax or tip in dollars?
$\textbf{(A)}\ 18\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 21\qquad\textbf{(D)}\ 22\qquad\textbf{(E)}\ 24$
|
Let $x$ be the cost of her dinner.
$27.50=x+\frac{1}{10}*x+\frac{3}{20}*x$
$27+\frac{1}{2}=\frac{5}{4}*x$
$\frac{55}{2}=\frac{5}{4}x$
$\frac{55}{2}*\frac{4}{5}=x$
$x=22$
$\boxed{22}$
| 22
|
2,907
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_7
| 1
|
For a science project, Sammy observed a chipmunk and a squirrel stashing acorns in holes. The chipmunk hid 3 acorns in each of the holes it dug. The squirrel hid 4 acorns in each of the holes it dug. They each hid the same number of acorns, although the squirrel needed 4 fewer holes. How many acorns did the chipmunk hide?
$\textbf{(A)}\ 30\qquad\textbf{(B)}\ 36\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 54$
|
Let $x$ be the number of acorns that both animals had.
So by the info in the problem:
$\frac{x}{3}=\left( \frac{x}{4} \right)+4$
Subtracting $\frac{x}{4}$ from both sides leaves
$\frac{x}{12}=4$
$\boxed{48}$
| 48
|
2,908
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_8
| 1
|
What is the sum of all integer solutions to $1<(x-2)^2<25$
$\textbf{(A)}\ 10\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 19\qquad\textbf{(E)}\ 25$
|
$(x-2)^2$ = perfect square.
1 < perfect square < 25
Perfect square can equal: 4, 9, or 16
Solve for $x$
$(x-2)^2=4$
$x=4,0$
and
$(x-2)^2=9$
$x=5,-1$
and
$(x-2)^2=16$
$x=6,-2$
The sum of all integer solutions is
$4+5+6+0+(-1)+(-2)=\boxed{12}$
| 12
|
2,909
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_9
| 1
|
Two integers have a sum of 26. When two more integers are added to the first two integers the sum is 41. Finally when two more integers are added to the sum of the previous four integers the sum is 57. What is the minimum number of odd integers among the 6 integers?
$\textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5$
|
Out of the first two integers, it's possible for both to be even: for example, $10 + 16 = 26.$ But the next two integers, when added, increase the sum by $15,$ which is odd, so one of them must be odd and the other must be even: for example, $3 + 12 = 15.$ Finally, the next two integers increase the sum by $16,$ which is even, so we can have both be even: for example, $2 + 14 = 16.$ Therefore, $\boxed{1}$ is the minimum number of integers that must be odd.
| 1
|
2,910
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_10
| 1
|
How many ordered pairs of positive integers $(M,N)$ satisfy the equation $\frac{M}{6}=\frac{6}{N}?$
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$
|
Cross-multiplying gives $MN=36.$ We write $36$ as a product of two positive integers: \begin{align*} 36 &= 1\cdot36 \\ &= 2\cdot18 \\ &= 3\cdot12 \\ &= 4\cdot9 \\ &= 6\cdot6. \end{align*} The products $1\cdot36, 2\cdot18, 3\cdot12,$ and $4\cdot9$ each produce $2$ ordered pairs $(M,N),$ as we can switch the order of the factors. The product $6\cdot6$ produces $1$ ordered pair $(M,N).$ Together, we have $4\cdot2+1=\boxed{9}$ ordered pairs $(M,N).$
| 9
|
2,911
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_10
| 2
|
How many ordered pairs of positive integers $(M,N)$ satisfy the equation $\frac{M}{6}=\frac{6}{N}?$
$\textbf{(A)}\ 6\qquad\textbf{(B)}\ 7\qquad\textbf{(C)}\ 8\qquad\textbf{(D)}\ 9\qquad\textbf{(E)}\ 10$
|
Cross-multiplying gives $MN=36.$ From the prime factorization \[36=2^2\cdot3^2,\] we conclude that $36$ has $(2+1)(2+1)=9$ positive divisors. There are $9$ values of $M,$ and each value generates $1$ ordered pair $(M,N).$ So, there are $\boxed{9}$ ordered pairs $(M,N)$ in total.
| 9
|
2,912
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_11
| 1
|
A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$
|
Desserts must be chosen for $7$ days: Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Saturday.
There are $3$ choices for dessert on Saturday: pie, ice cream, or pudding, as there must be cake on Friday and the same dessert may not be served two days in a row. Likewise, there are $3$ choices for dessert on Thursday. Once dessert for Thursday is selected, there are $3$ choices for dessert on Wednesday, once Wednesday's dessert is selected there are $3$ choices for dessert on Tuesday, etc. Thus, there are $3$ choices for dessert for each of $6$ days, so the total number of possible dessert menus is $3^6$ , or $\boxed{729}$
| 729
|
2,913
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_11
| 2
|
A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible?
$\textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304$
|
There are $4 \cdot 3^6$ ways for the desserts to be chosen. By symmetry, any of the desserts that are chosen on Friday share $\frac{1}{4}$ of the total arrangements. Therefore our answer is $\frac{4\cdot3^6}{4} = 3^6 = \boxed{729}.$
| 729
|
2,914
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_13
| 1
|
It takes Clea 60 seconds to walk down an escalator when it is not operating, and only 24 seconds to walk down the escalator when it is operating. How many seconds does it take Clea to ride down the operating escalator when she just stands on it?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$
|
Let $s$ be the speed of the escalator and $c$ be the speed of Clea. Using $d = v t$ , the first statement can be translated to the equation $d = 60c$ . The second statement can be translated to $d = 24(c+s)$ . Since the same distance is being covered in each scenario, we can set the two equations equal and solve for $s$ . We find that $s = \dfrac{3c}{2}$ . The problem asks for the time it takes her to ride down the escalator when she just stands on it. Since $t = \dfrac{d}{s}$ and $d = 60c$ , we have $t = \dfrac{60c}{\dfrac{3c}{2}} = 40$ seconds. Answer choice $\boxed{40}$ is correct.
| 40
|
2,915
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_13
| 2
|
It takes Clea 60 seconds to walk down an escalator when it is not operating, and only 24 seconds to walk down the escalator when it is operating. How many seconds does it take Clea to ride down the operating escalator when she just stands on it?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$
|
Let $s$ be the speed of the escalator and $c$ be the speed of Clea. Then without loss of generality , assume that the length of the escalator be 1. Then $c=\dfrac{1}{60}$ and $c+s=\dfrac{1}{24}$ , so $s=\dfrac{1}{24}-\dfrac{1}{60}=\dfrac{1}{40}$ . Thus the time it takes for Clea to ride down the operating escalator when she just stands on it is $\dfrac{1}{\dfrac{1}{40}}=\boxed{40}$
| 40
|
2,916
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_13
| 3
|
It takes Clea 60 seconds to walk down an escalator when it is not operating, and only 24 seconds to walk down the escalator when it is operating. How many seconds does it take Clea to ride down the operating escalator when she just stands on it?
$\textbf{(A)}\ 36\qquad\textbf{(B)}\ 40\qquad\textbf{(C)}\ 42\qquad\textbf{(D)}\ 48\qquad\textbf{(E)}\ 52$
|
WLOG, let the length of the escalator be $120$ ft. So, Clea's rate is $120/60=2$ feet per second (fps $*$ ), and the escalator and Clea's rate is $120/24=5$ fps. So, the escalator's rate is $5-2=3$ fps. Therefore, $120/3=\boxed{40}$
| 40
|
2,917
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_15
| 1
|
In a round-robin tournament with 6 teams, each team plays one game against each other team, and each game results in one team winning and one team losing. At the end of the tournament, the teams are ranked by the number of games won. What is the maximum number of teams that could be tied for the most wins at the end of the tournament?
$\textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ 5\qquad\textbf{(E)}\ 6$
|
The total number of games (and wins) in the tournament is $\frac{6 \times 5}{2}= 15$ . A six-way tie is impossible as this would imply each team has 2.5 wins, so the maximum number of tied teams is five. Here's a chart of 15 games where five teams each have 3 wins:
The "X's" are for when it is where a team is set against itself, which cannot happen. The chart says that Team 6 has lost all of its matches, which means that each of the other teams won against it. Then, alternating Wins and Losses were tried. It shows that it is possible for 5 teams to tie for the same amount of wins, which in this case is 3 wins.
Thus, the answer is $\boxed{5}$
| 5
|
2,918
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_20
| 1
|
Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$
|
The last number that Bernardo says has to be between 950 and 999. Note that $1\rightarrow 2\rightarrow 52\rightarrow 104\rightarrow 154\rightarrow 308\rightarrow 358\rightarrow 716\rightarrow 766$ contains 4 doubling actions. Thus, we have $x \rightarrow 2x \rightarrow 2x+50 \rightarrow 4x+100 \rightarrow 4x+150 \rightarrow 8x+300 \rightarrow 8x+350 \rightarrow 16x+700$
Thus, $950<16x+700<1000$ . Then, $16x>250 \implies x \geq 16$
Because we are looking for the smallest integer $x$ $x=16$ . Our answer is $1+6=\boxed{7}$ , which is A.
| 7
|
2,919
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_20
| 2
|
Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$
|
Work backwards. The last number Bernardo produces must be in the range $[950,999]$ . That means that before this, Silvia must produce a number in the range $[475,499]$ . Before this, Bernardo must produce a number in the range $[425,449]$ . Before this, Silvia must produce a number in the range $[213,224]$ . Before this, Bernardo must produce a number in the range $[163,174]$ . Before this, Silvia must produce a number in the range $[82,87]$ . Before this, Bernardo must produce a number in the range $[32,37]$ . Before this, Silvia must produce a number in the range $[16,18]$ . Silvia could not have added 50 to any number before this to obtain a number in the range $[16,18]$ , hence the minimum $N$ is 16 with the sum of digits being $\boxed{7}$
| 7
|
2,920
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_20
| 3
|
Bernardo and Silvia play the following game. An integer between $0$ and $999$ inclusive is selected and given to Bernardo. Whenever Bernardo receives a number, he doubles it and passes the result to Silvia. Whenever Silvia receives a number, she adds $50$ to it and passes the result to Bernardo. The winner is the last person who produces a number less than $1000$ . Let $N$ be the smallest initial number that results in a win for Bernardo. What is the sum of the digits of $N$
$\textbf{(A)}\ 7\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 11$
|
If our first number is $N,$ then the sequence of numbers will be \[2N,~2N+50,~4N+100,~4N+150,~8N+300,~8N+350,~16N+700,~16N+750\] Note that we cannot go any further because doubling gives an extra $1500$ at the end, which is already greater than $1000.$ The smallest $N$ will be given if $16N+750>1000>16N+700 \implies 15<N<19.$ Since the problem asks for the smallest possible value of $N,$ we get $16,$ and the sum of its digits is $1+6=\boxed{7}$
| 7
|
2,921
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_21
| 1
|
Four distinct points are arranged on a plane so that the segments connecting them have lengths $a$ $a$ $a$ $a$ $2a$ , and $b$ . What is the ratio of $b$ to $a$
$\textbf{(A)}\ \sqrt{3}\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ \sqrt{5}\qquad\textbf{(D)}\ 3\qquad\textbf{(E)}\ \pi$
|
For any $4$ non-collinear points with the given requirement, notice that there must be a triangle with side lengths $a$ $a$ $2a$ , which is not possible as $a+a=2a$ . Thus at least $3$ of the $4$ points must be collinear.
If all $4$ points are collinear, then there would only be $3$ lines of length $a$ , which wouldn't work.
If exactly $3$ points are collinear, the only possibility that works is when a $30^{\circ}-90^{\circ}-60^{\circ}$ triangle is formed.
Thus $b=\sqrt{3}a$ , or $\frac{b}{a}=\boxed{3}$
| 3
|
2,922
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_22
| 1
|
Let ( $a_1$ $a_2$ , ... $a_{10}$ ) be a list of the first 10 positive integers such that for each $2\le$ $i$ $\le10$ either $a_i + 1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$
|
If we have 1 as the first number, then the only possible list is $(1,2,3,4,5,6,7,8,9,10)$
If we have 2 as the first number, then we have 9 ways to choose where the $1$ goes, and the numbers ascend from the first number, $2$ , with the exception of the $1$ .
For example, $(2,3,1,4,5,6,7,8,9,10)$ , or $(2,3,4,1,5,6,7,8,9,10)$ . There are $\dbinom{9}{1}$ ways to do so.
If we use 3 as the first number, we need to choose 2 spaces to be 2 and 1, respectively. There are $\dbinom{9}{2}$ ways to do this.
In the same way, the total number of lists is: $\dbinom{9}{0} +\dbinom{9}{1} + \dbinom{9}{2} + \dbinom{9}{3} + \dbinom{9}{4}.....\dbinom{9}{9}$
By the binomial theorem , this is $2^{9}$ $512$ , or $\boxed{512}$
| 512
|
2,923
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_22
| 2
|
Let ( $a_1$ $a_2$ , ... $a_{10}$ ) be a list of the first 10 positive integers such that for each $2\le$ $i$ $\le10$ either $a_i + 1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$
|
Arrange the spaces and put arrows pointing either up or down between them. Then for each arrangement of arrows there is one and only one list that corresponds to up. For example, all arrows pointing up is $(1,2,3,4,5...10)$ . There are 9 arrows, so the answer is $2^{9}$ $512$ $\boxed{512}$
| 512
|
2,924
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_22
| 3
|
Let ( $a_1$ $a_2$ , ... $a_{10}$ ) be a list of the first 10 positive integers such that for each $2\le$ $i$ $\le10$ either $a_i + 1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$
|
Notice that the answer to the problem is solely based on the length of the lists, i.e. 10. We can replace 10 with smaller values, such as 2 and 3, and try to find a pattern. If we replace it with 2, we can easily see that there are two possible lists, $(1, 2)$ and $(2, 1)$ . If we replace it with 3, there are four lists, $(1, 2, 3), (2, 1, 3), (2, 3, 1),$ and $(3, 2, 1)$ . Since 2 and 4 are both powers of 2, it is likely that the number of lists is $2^{n-1}$ , where $n$ is the length of the lists. $2^{10-1}=512=\boxed{512}$
| 512
|
2,925
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_22
| 4
|
Let ( $a_1$ $a_2$ , ... $a_{10}$ ) be a list of the first 10 positive integers such that for each $2\le$ $i$ $\le10$ either $a_i + 1$ or $a_i-1$ or both appear somewhere before $a_i$ in the list. How many such lists are there?
$\textbf{(A)}\ \ 120\qquad\textbf{(B)}\ 512\qquad\textbf{(C)}\ \ 1024\qquad\textbf{(D)}\ 181,440\qquad\textbf{(E)}\ \ 362,880$
|
If $a_1=10$ , the sequence must be $10, 9, 8,7,6,5,4,3,2,1$ . If $a_2=10$ , then $a_1=9$ , and the sequence is $9, 10, 8, 7, 6, 5,4,3,2,1$ . If $a_3=10$ , then the possible sequences are \[9,8,10,7,6,5,4,3,2,1 \text{ and}\] \[8,9,10,7,6,5,4,3,2,1.\] In general, for an $n$ -length sequence, if $a_i=n$ , then $a_1$ through $a_{i-1}$ can be filled in $f(i-1)$ ways with $n-i+1$ through $n-1$ , and $a_{i+1}$ through $a_{n}$ must be sorted in decreasing order with the remaining numbers ( $1$ through $n-i$ ), in one way. Thus $f(n) = \sum_{i=0}^{n-1} f(i)$ , where $f(0)=1$
We can see (or prove by induction) that $f(n)=2^{n-1} ~\forall~ n \ge 1$ . Hence, $f(10)=2^9=\boxed{512}$
| 512
|
2,926
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_24
| 1
|
Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$
|
Let the ordered triple $(a,b,c)$ denote that $a$ songs are liked by Amy and Beth, $b$ songs by Beth and Jo, and $c$ songs by Jo and Amy. The only possible triples are $(1,1,1), (2,1,1), (1,2,1)(1,1,2)$
To show this, observe these are all valid conditions. Second, note that none of $a,b,c$ can be bigger than 3. Suppose otherwise, that $a = 3$ . Without loss of generality, say that Amy and Beth like songs 1, 2, and 3. Then because there is at least one song liked by each pair of girls, we require either $b$ or $c$ to be at least 1. In fact, we require either $b$ or $c$ to equal 1, otherwise there will be a song liked by all three. Suppose $b = 1$ . Then we must have $c=0$ since no song is liked by all three girls, a contradiction.
Case 1 : How many ways are there for $(a,b,c)$ to equal $(1,1,1)$ ? There are 4 choices for which song is liked by Amy and Beth, 3 choices for which song is liked by Beth and Jo, and 2 choices for which song is liked by Jo and Amy. The fourth song can be liked by only one of the girls, or none of the girls, for a total of 4 choices. So $(a,b,c)=(1,1,1)$ in $4\cdot3\cdot2\cdot4 = 96$ ways.
Case 2 : To find the number of ways for $(a,b,c) = (2,1,1)$ , observe there are $\binom{4}{2} = 6$ choices of songs for the first pair of girls. There remain 2 choices of songs for the next pair (who only like one song). The last song is given to the last pair of girls. But observe that we let any three pairs of the girls like two songs, so we multiply by 3. In this case there are $6\cdot2\cdot3=36$ ways for the girls to like the songs.
That gives a total of $96 + 36 = 132$ ways for the girls to like the songs, so the answer is $\boxed{132}$
| 132
|
2,927
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_24
| 2
|
Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$
|
Let $AB, BJ$ , and $AJ$ denote a song that is liked by Amy and Beth (but not Jo), Beth and Jo (but not Amy), and Amy and Jo (but not Beth), respectively. Similarly, let $A, B, J,$ and $N$ denote a song that is liked by only Amy, only Beth, only Jo, and none of them, respectively. Since we know that there is at least $1\: AB, BJ$ , and $AJ$ , they must be $3$ songs out of the $4$ that Amy, Beth, and Jo listened to. The fourth song can be of any type $N, A, B, J, AB, BJ$ , and $AJ$ (there is no $ABJ$ because no song is liked by all three, as stated in the problem.) Therefore, we must find the number of ways to rearrange $AB, BJ, AJ$ , and a song from the set $\{N, A, B, J, AB, BJ, AJ\}$
Case 1: Fourth song = $N, A, B, J$
Note that in Case 1, all four of the choices for the fourth song are different from the first three songs.
Number of ways to rearrange = $(4!)$ rearrangements for each choice $*\: 4$ choices = $96$
Case 2: Fourth song = $AB, BJ, AJ$
Note that in Case $2$ , all three of the choices for the fourth song repeat somewhere in the first three songs.
Number of ways to rearrange = $(4!/2!)$ rearrangements for each choice $*\: 3$ choices = $36$
$96 + 36 = \boxed{132}$
| 132
|
2,928
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_24
| 3
|
Amy, Beth, and Jo listen to four different songs and discuss which ones they like. No song is liked by all three. Furthermore, for each of the three pairs of the girls, there is at least one song liked by those two girls but disliked by the third. In how many different ways is this possible?
$\textbf{(A)}\ 108\qquad\textbf{(B)}\ 132\qquad\textbf{(C)}\ 671\qquad\textbf{(D)}\ 846\qquad\textbf{(E)}\ 1105$
|
There are $\binom{4}{3}$ ways to choose the three songs that are liked by the three pairs of girls.
There are $3!$ ways to determine how the three songs are liked, or which song is liked by which pair of girls.
In total, there are $\binom{4}{3}\cdot3!$ possibilities for the first $3$ songs.
There are $3$ cases for the 4th song, call it song D.
Case $1$ : D is disliked by all $3$ girls $\implies$ there is only $1$ possibility.
Case $2$ : D is liked by exactly $1$ girl $\implies$ there are $3$ possibility.
Case $3$ : D is liked by exactly $2$ girls $\implies$ there are $3$ pairs of girls to choose from. However, there's overlap when the other song liked by the same pair of girl is counted as the 4th song at some point, in which case D would be counted as one of the first $3$ songs liked by the same girls.
Counting the overlaps, there are $3$ ways to choose the pair with overlaps and $4\cdot3=12$ ways to choose what the other $2$ pairs like independently. In total, there are $3\cdot12=36$ overlapped possibilities.
Finally, there are $\binom{4}{3}\cdot3!\cdot(3+1+3)-36=132$ ways for the songs to be likely by the girls. $\boxed{132}$
| 132
|
2,929
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_25
| 1
|
A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$
|
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,red); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,blue); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,blue); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,green); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,blue); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,green); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,green); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,orange); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,green); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,orange); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,red); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,blue); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
There is $1$ way to get to any of the red arrows. From the first (top) red arrow, there are $2$ ways to get to each of the first and the second (top 2) blue arrows; from the second (bottom) red arrow, there are $3$ ways to get to each of the first and the second blue arrows. So there are in total $5$ ways to get to each of the blue arrows.
From each of the first and second blue arrows, there are respectively $4$ ways to get to each of the first and the second green arrows; from each of the third and the fourth blue arrows, there are respectively $8$ ways to get to each of the first and the second green arrows. Therefore there are in total $5 \cdot (4+4+8+8) = 120$ ways to get to each of the green arrows.
Finally, from each of the first and second green arrows, there are respectively $2$ ways to get to the first orange arrow; from each of the third and the fourth green arrows, there are $3$ ways to get to the first orange arrow. Therefore there are $120 \cdot (2+2+3+3) = 1200$ ways to get to each of the orange arrows, hence $2400$ ways to get to the point $B$ $\boxed{2400}$
| 400
|
2,930
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_25
| 2
|
A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$
|
[asy] size(6cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)); draw((0.0,0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)); draw((4.0, 0.0)--(6.0,0.0)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(3.0,-1.7320508075688772), red); draw((7.0,1.7320508075688772)--(6.0,-0.0)--(7.0,-1.7320508075688772), blue); dot((0,0)); label("$A$",(0,0),WNW); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,red); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,blue); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,blue); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,blue); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,red); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,blue); [/asy]
For every blue arrow, there are $2\cdot 2=4$ ways to reach it without using the reverse arrow since the bug can choose any of $2$ red arrows to pass through and $2$ black arrows to pass through. If the bug passes through the white arrow, the red arrow that the bug travels through must be the closest to the first black arrow. Otherwise, the bug will have to travel through both red segments, which is impossible because now there is no path to take after the bug emerges from the reverse arrow. Similarly, with the blue segments, the second black arrow taken must be the one that is closest to the blue arrow that was taken. Also, it is trivial that the two black arrows taken must be different. Therefore, if the reverse arrow is taken, the blue arrow taken determines the entire path and there is $1$ path for every arrow. Since the bug cannot return once it takes a blue arrow, the answer must be divisible by $5$ $\boxed{2400}$ is the only answer that is.
| 400
|
2,931
|
https://artofproblemsolving.com/wiki/index.php/2012_AMC_10B_Problems/Problem_25
| 3
|
A bug travels from A to B along the segments in the hexagonal lattice pictured below. The segments marked with an arrow can be traveled only in the direction of the arrow, and the bug never travels the same segment more than once. How many different paths are there?
[asy] size(10cm); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((0.0,0.0)--(1.0,1.7320508075688772)--(3.0,1.7320508075688772)--(4.0,3.4641016151377544)--(6.0,3.4641016151377544)--(7.0,5.196152422706632)--(9.0,5.196152422706632)--(10.0,6.928203230275509)--(12.0,6.928203230275509)); draw((3.0,-1.7320508075688772)--(4.0,0.0)--(6.0,0.0)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,3.4641016151377544)--(12.0,3.464101615137755)--(13.0,5.196152422706632)--(15.0,5.196152422706632)); draw((6.0,-3.4641016151377544)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,0.0)--(12.0,0.0)--(13.0,1.7320508075688772)--(15.0,1.7320508075688776)--(16.0,3.464101615137755)--(18.0,3.4641016151377544)); draw((9.0,-5.196152422706632)--(10.0,-3.464101615137755)--(12.0,-3.464101615137755)--(13.0,-1.7320508075688776)--(15.0,-1.7320508075688776)--(16.0,0)--(18.0,0.0)--(19.0,1.7320508075688772)--(21.0,1.7320508075688767)); draw((12.0,-6.928203230275509)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)--(19.0,-1.7320508075688772)--(21.0,-1.7320508075688767)--(22.0,0)); draw((0.0,-0.0)--(1.0,-1.7320508075688772)--(3.0,-1.7320508075688772)--(4.0,-3.4641016151377544)--(6.0,-3.4641016151377544)--(7.0,-5.196152422706632)--(9.0,-5.196152422706632)--(10.0,-6.928203230275509)--(12.0,-6.928203230275509)); draw((3.0,1.7320508075688772)--(4.0,-0.0)--(6.0,-0.0)--(7.0,-1.7320508075688772)--(9.0,-1.7320508075688772)--(10.0,-3.4641016151377544)--(12.0,-3.464101615137755)--(13.0,-5.196152422706632)--(15.0,-5.196152422706632)); draw((6.0,3.4641016151377544)--(7.0,1.7320508075688772)--(9.0,1.7320508075688772)--(10.0,-0.0)--(12.0,-0.0)--(13.0,-1.7320508075688772)--(15.0,-1.7320508075688776)--(16.0,-3.464101615137755)--(18.0,-3.4641016151377544)); draw((9.0,5.1961524)--(10.0,3.464101)--(12.0,3.46410)--(13.0,1.73205)--(15.0,1.732050)--(16.0,0)--(18.0,-0.0)--(19.0,-1.7320)--(21.0,-1.73205080)); draw((12.0,6.928203)--(13.0,5.1961524)--(15.0,5.1961524)--(16.0,3.464101615)--(18.0,3.4641016)--(19.0,1.7320508)--(21.0,1.732050)--(22.0,0)); dot((0,0)); dot((22,0)); label("$A$",(0,0),WNW); label("$B$",(22,0),E); filldraw((2.0,1.7320508075688772)--(1.6,1.2320508075688772)--(1.75,1.7320508075688772)--(1.6,2.232050807568877)--cycle,black); filldraw((5.0,3.4641016151377544)--(4.6,2.9641016151377544)--(4.75,3.4641016151377544)--(4.6,3.9641016151377544)--cycle,black); filldraw((8.0,5.196152422706632)--(7.6,4.696152422706632)--(7.75,5.196152422706632)--(7.6,5.696152422706632)--cycle,black); filldraw((11.0,6.928203230275509)--(10.6,6.428203230275509)--(10.75,6.928203230275509)--(10.6,7.428203230275509)--cycle,black); filldraw((4.6,0.0)--(5.0,-0.5)--(4.85,0.0)--(5.0,0.5)--cycle,white); filldraw((8.0,1.732050)--(7.6,1.2320)--(7.75,1.73205)--(7.6,2.2320)--cycle,black); filldraw((11.0,3.4641016)--(10.6,2.9641016)--(10.75,3.46410161)--(10.6,3.964101)--cycle,black); filldraw((14.0,5.196152422706632)--(13.6,4.696152422706632)--(13.75,5.196152422706632)--(13.6,5.696152422706632)--cycle,black); filldraw((8.0,-1.732050)--(7.6,-2.232050)--(7.75,-1.7320508)--(7.6,-1.2320)--cycle,black); filldraw((10.6,0.0)--(11,-0.5)--(10.85,0.0)--(11,0.5)--cycle,white); filldraw((14.0,1.7320508075688772)--(13.6,1.2320508075688772)--(13.75,1.7320508075688772)--(13.6,2.232050807568877)--cycle,black); filldraw((17.0,3.464101615137755)--(16.6,2.964101615137755)--(16.75,3.464101615137755)--(16.6,3.964101615137755)--cycle,black); filldraw((11.0,-3.464101615137755)--(10.6,-3.964101615137755)--(10.75,-3.464101615137755)--(10.6,-2.964101615137755)--cycle,black); filldraw((14.0,-1.7320508075688776)--(13.6,-2.2320508075688776)--(13.75,-1.7320508075688776)--(13.6,-1.2320508075688776)--cycle,black); filldraw((16.6,0)--(17,-0.5)--(16.85,0)--(17,0.5)--cycle,white); filldraw((20.0,1.7320508075688772)--(19.6,1.2320508075688772)--(19.75,1.7320508075688772)--(19.6,2.232050807568877)--cycle,black); filldraw((14.0,-5.196152422706632)--(13.6,-5.696152422706632)--(13.75,-5.196152422706632)--(13.6,-4.696152422706632)--cycle,black); filldraw((17.0,-3.464101615137755)--(16.6,-3.964101615137755)--(16.75,-3.464101615137755)--(16.6,-2.964101615137755)--cycle,black); filldraw((20.0,-1.7320508075688772)--(19.6,-2.232050807568877)--(19.75,-1.7320508075688772)--(19.6,-1.2320508075688772)--cycle,black); filldraw((2.0,-1.7320508075688772)--(1.6,-1.2320508075688772)--(1.75,-1.7320508075688772)--(1.6,-2.232050807568877)--cycle,black); filldraw((5.0,-3.4641016)--(4.6,-2.964101)--(4.75,-3.4641)--(4.6,-3.9641016)--cycle,black); filldraw((8.0,-5.1961524)--(7.6,-4.6961524)--(7.75,-5.19615242)--(7.6,-5.696152422)--cycle,black); filldraw((11.0,-6.9282032)--(10.6,-6.4282032)--(10.75,-6.928203)--(10.6,-7.428203)--cycle,black);[/asy]
$\textbf{(A)}\ 2112\qquad\textbf{(B)}\ 2304\qquad\textbf{(C)}\ 2368\qquad\textbf{(D)}\ 2384\qquad\textbf{(E)}\ 2400$
|
We use casework.
The main thing to notice is that, if the bug does not go backwards, then every vertical set of arrows can be used, as the bug could travel straight downwards and then use any arrow to continue right.
Note: The motivation is quite weird so follow my numbers as they start from the left (point A) and go right (point B).
Case 1: Bug does not go backwards.
The number of cases for this is just each vertical set of arrows multiplied to each other (if you don't understand where I'm coming from, try to understand where these numbers come from!)
And so we have $2*2*4*4*4*2*2 = 2^{10}$ cases.
Case 2: The bug goes backwards once, either at the first arrow or third arrow.
Here, we have to count the fact that there is a horizontal midline that the bug could not cross, or otherwise it would be stepping on the same edge twice.
Back on first arrow: $2*1*2*4*4*2*2 = 2^{8}$ cases.
Back on third arrow: $2*2*4*4*4*1 = 2^{8}$ cases.
Case 3: The bug goes backwards once, at the second arrow.
Same thing as above, except since there are 4 arrows in the vertical set (plus one for the backwards arrow), then the calculations are a bit different.
We have $2*2*4*1*2*4*2*2 = 2^{9}$ cases.
Notice that the first and third back arrows decrease the number of cases by a factor of $2^2$ and the second back arrow decreases the number of cases by $2^1$ . Hence,
1st + 2nd = $2^7$
2nd + 3rd = $2^7$
1st + 3rd = $2^6$
1st + 2nd + 3rd = $2^5$
And so the number of cases in total is $2^{10} + 2^9 + 2^8 + 2^8 + 2^7 + 2^7 + 2^6 + 2^5 \Rightarrow 1024 + 512 + 256 + 256 + 128 + 128 + 64 + 32 = \boxed{2400}$
| 400
|
2,932
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_1
| 1
|
A cell phone plan costs $20$ dollars each month, plus $5$ cents per text message sent, plus $10$ cents for each minute used over $30$ hours. In January Michelle sent $100$ text messages and talked for $30.5$ hours. How much did she have to pay?
$\textbf{(A)}\ 24.00 \qquad \textbf{(B)}\ 24.50 \qquad \textbf{(C)}\ 25.50 \qquad \textbf{(D)}\ 28.00 \qquad \textbf{(E)}\ 30.00$
|
The base price of Michelle's cell phone plan is $20$ dollars.
If she sent $100$ text messages and it costs $5$ cents per text, then she must have spent $500$ cents for texting, or $5$ dollars. She talked for $30.5$ hours, but $30.5-30$ will give us the amount of time exceeded past 30 hours. $30.5-30=.5$ hours $=30$ minutes.
Since the price for phone calls is $10$ cents per minute, the additional amount Michelle has to pay for phone calls is $30*10=300$ cents, or $3$ dollars.
Adding $20+5+3$ dollars $\boxed{28}$
| 28
|
2,933
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_2
| 1
|
A small bottle of shampoo can hold $35$ milliliters of shampoo, whereas a large bottle can hold $500$ milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy?
$\textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$
|
To find how many small bottles we need, we can simply divide $500$ by $35$ . This simplifies to $\frac{100}{7}=14 \frac{2}{7}.$ Since the answer must be an integer greater than $14$ , we have to round up to $15$ bottles, or $\boxed{15}$
| 15
|
2,934
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_4
| 1
|
Let X and Y be the following sums of arithmetic sequences:
\begin{eqnarray*}X &=& 10+12+14+\cdots+100,\\ Y &=& 12+14+16+\cdots+102.\end{eqnarray*}
What is the value of $Y - X?$
$\textbf{(A)}\ 92\qquad\textbf{(B)}\ 98\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 102\qquad\textbf{(E)}\ 112$
|
We see that both sequences have equal numbers of terms, so reformat the sequence to look like:
\begin{align*} Y = \ &12 + 14 + \cdots + 100 + 102\\ X = 10 \ + \ &12 + 14 + \cdots + 100\\ \end{align*} From here it is obvious that $Y - X = 102 - 10 = \boxed{92}$
| 92
|
2,935
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_4
| 2
|
Let X and Y be the following sums of arithmetic sequences:
\begin{eqnarray*}X &=& 10+12+14+\cdots+100,\\ Y &=& 12+14+16+\cdots+102.\end{eqnarray*}
What is the value of $Y - X?$
$\textbf{(A)}\ 92\qquad\textbf{(B)}\ 98\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 102\qquad\textbf{(E)}\ 112$
|
We see that every number in Y's sequence is two more than every corresponding number in X's sequence. Since there are 46 numbers in each sequence, the difference must be $46\cdot 2=\boxed{92}$
| 92
|
2,936
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_4
| 3
|
Let X and Y be the following sums of arithmetic sequences:
\begin{eqnarray*}X &=& 10+12+14+\cdots+100,\\ Y &=& 12+14+16+\cdots+102.\end{eqnarray*}
What is the value of $Y - X?$
$\textbf{(A)}\ 92\qquad\textbf{(B)}\ 98\qquad\textbf{(C)}\ 100\qquad\textbf{(D)}\ 102\qquad\textbf{(E)}\ 112$
|
\begin{align*} X&=10+12+14+\cdots +100 \\ Y&=X-10+102 = X+92 \\ Y-X &= (X+92)-X \\ &= \boxed{92} $\blacksquare$
| 92
|
2,937
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_6
| 1
|
Set $A$ has $20$ elements, and set $B$ has $15$ elements. What is the smallest possible number of elements in $A \cup B$
$\textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300$
|
$A \cup B$ will be smallest if $B$ is completely contained in $A$ , in which case all the elements in $B$ would be counted for in $A$ . So the total would be the number of elements in $A$ , which is $\boxed{20}$
| 20
|
2,938
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_6
| 2
|
Set $A$ has $20$ elements, and set $B$ has $15$ elements. What is the smallest possible number of elements in $A \cup B$
$\textbf{(A)}5 \qquad\textbf{(B)}\ 15 \qquad\textbf{(C)}\ 20\qquad\textbf{(D)}\ 35\qquad\textbf{(E)}\ 300$
|
Assume WLOG that $A={1, 2, 3, 4, \cdots , 20}$ , and $B={6, 7, 8, 9, 10, \cdots , 20}$ . Then, all the integers $6$ through $20$ would be redundant in $A \cup B$ , so $A \cup B = 1, 2, 3, 4, \cdots, 20 \implies \boxed{20}$
| 20
|
2,939
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_8
| 1
|
Last summer 30% of the birds living on Town Lake were geese, 25% were swans, 10% were herons, and 35% were ducks. What percent of the birds that were not swans were geese?
$\textbf{(A)}\ 20\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 50\qquad\textbf{(E)}\ 60$
|
75% of the total birds were not swans. Out of that 75%, there was $30\% / 75\% = \boxed{40}$ of the birds that were not swans that were geese.
| 40
|
2,940
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_8
| 2
|
Last summer 30% of the birds living on Town Lake were geese, 25% were swans, 10% were herons, and 35% were ducks. What percent of the birds that were not swans were geese?
$\textbf{(A)}\ 20\qquad\textbf{(B)}\ 30\qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 50\qquad\textbf{(E)}\ 60$
|
WLOG, suppose there were 100 birds in total living on Town Lake, then 30 were geese, 25 were swans, 10 were herons, and 35 were ducks. $100-25 = 75$ of the birds are not swans and 30 of these are geese, so the answer is $\frac{30}{75} \times 100 = \boxed{40}$
| 40
|
2,941
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_10
| 1
|
A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$
|
The total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Since $1771$ is the product of three sets of values, we can begin with prime factorization, since it gives some insight into the values: $7, 11, 23$ . Since neither $(C)$ nor $(E)$ are any of these factors, they can be eliminated immediately, leaving $(A)$ $(B)$ , and $(D)$
Beginning with $(A) 7$ , we see that the number of pencils purchased by each student must be either $11$ or $23$ . However, the problem states that the price of each pencil must exceed the number of pencils purchased, so we can eliminate this.
Continuing with $(B) 11$ , we can conclude that the only case that fulfils the restrictions are that there are $23$ students who each purchased $7$ such pencils, so the answer is $\boxed{11}$ . We can apply the same logic to $(E)$ as we applied to $(A)$ if one wants to make doubly sure.
| 11
|
2,942
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_10
| 2
|
A majority of the $30$ students in Ms. Demeanor's class bought pencils at the school bookstore. Each of these students bought the same number of pencils, and this number was greater than $1$ . The cost of a pencil in cents was greater than the number of pencils each student bought, and the total cost of all the pencils was $$17.71$ . What was the cost of a pencil in cents?
$\textbf{(A)}\ 7 \qquad \textbf{(B)}\ 11 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 23 \qquad \textbf{(E)}\ 77$
|
We know the total cost of the pencils can be found by $(\text{students}\cdot\text{pencils purchased by each}\cdot\text{price of each pencil})$
Using prime factorization like in the solution above, we see that there is only one combination of three whole numbers whose product is equal to $1771$ $7, 11, 23$ (without using $1$ ). So we know that $7, 11$ , and $23$ must be the number of students, the number of pencils purchased by each student and the price of each pencil in cents.
We know that $23$ must be the number of students, as it is the only number that makes up the majority of 30.
We pick the greater of the remaining numbers for the price of each pencil in cents, which is $11$
Therefore, our answer is $\boxed{11}$
| 11
|
2,943
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_12
| 1
|
The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$
|
For the points made from two-point shots and from three-point shots to be equal, the numbers of made shots are in a $3:2$ ratio. Therefore, assume they made $3x$ and $2x$ two- and three- point shots, respectively, and thus $3x+1$ free throws. The total number of points is \[2 \times (3x) + 3 \times (2x) + 1 \times (3x+1) = 15x+1\]
Set that equal to $61$ , we get $x = 4$ , and therefore the number of free throws they made $3 \times 4 + 1 = 13 \Rightarrow \boxed{13}$
| 13
|
2,944
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_12
| 2
|
The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$
|
Let $x$ be the number of free throws. Then the number of points scored by two-pointers is $2(x-1)$ and the same goes for three-pointers because they scored the same number of points with twos and threes. Thus, our equation is $x+4(x-1) = 61 \Rightarrow x=13$ , giving us $\boxed{13}$ for an answer.
| 13
|
2,945
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_12
| 3
|
The players on a basketball team made some three-point shots, some two-point shots, and some one-point free throws. They scored as many points with two-point shots as with three-point shots. Their number of successful free throws was one more than their number of successful two-point shots. The team's total score was $61$ points. How many free throws did they make?
$\textbf{(A)}\ 13 \qquad \textbf{(B)}\ 14 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 17$
|
We let $a$ be the number of $2$ -point shots, $b$ be the number of $3$ -point shots, and $x$ be the number of free throws. We are looking for $x.$ We know that $2a=3b$ , and that $x=a+1$ . Also, $2a+3b+1x=61$ . We can see
\begin{align*} a&=x-1 \\ 2a &= 2x-2 \\ 3a &= 2x-2. \\ \end{align*}
Plugging this into $2a+3b+1x=61$ , we see
\begin{align*} 2x-2+2x-2+x &= 61 \\ 5x-4 &= 61 \\ 5x &= 65 \\ x &= \boxed{13}
| 13
|
2,946
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_13
| 1
|
How many even integers are there between $200$ and $700$ whose digits are all different and come from the set $\left\{1,2,5,7,8,9\right\}$
$\text{(A)}\,12 \qquad\text{(B)}\,20 \qquad\text{(C)}\,72 \qquad\text{(D)}\,120 \qquad\text{(E)}\,200$
|
We split up into cases of the hundreds digits being $2$ or $5$ . If the hundred digits is $2$ , then the units digits must be $8$ in order for the number to be even and then there are $4$ remaining choices ( $1,5,7,9$ ) for the tens digit, giving $1 \times 4 \times 1=4$ possibilities. Similarly, there are $1 \times 2 \times 4=8$ possibilities for the $5$ case, giving a total of $\boxed{12}$ possibilities.
| 12
|
2,947
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_13
| 2
|
How many even integers are there between $200$ and $700$ whose digits are all different and come from the set $\left\{1,2,5,7,8,9\right\}$
$\text{(A)}\,12 \qquad\text{(B)}\,20 \qquad\text{(C)}\,72 \qquad\text{(D)}\,120 \qquad\text{(E)}\,200$
|
We see that the last digit of the $3$ -digit number must be even to have an even number. Therefore, the last digit must either be $2$ or $8$
Case $1$ -the last digit is $2$ . We must have the hundreds digit to be $5$ and the tens digit to be any $1$ of ${1,7,8,9}$ , thus obtaining $4$ numbers total.
Case $2$ -the last digit is $8$ . We now can have $2$ or $5$ to be the hundreds digit, and any choice still gives us $4$ choices for the tens digit. Therefore, we have $2 \cdot 4=8$ numbers.
Adding up our cases, we have $4+8=\boxed{12}$ numbers.
| 12
|
2,948
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_13
| 3
|
How many even integers are there between $200$ and $700$ whose digits are all different and come from the set $\left\{1,2,5,7,8,9\right\}$
$\text{(A)}\,12 \qquad\text{(B)}\,20 \qquad\text{(C)}\,72 \qquad\text{(D)}\,120 \qquad\text{(E)}\,200$
|
We see that there are $\dbinom63=20$ total possibilities for a 3-digit number whose digits do not repeat and are comprised of digits only from the set ${1,2,5,7,8,9}.$ Obviously, some of these (such as $987,$ for example) will not work, and thus the answer will be less than $20.$ The only possible option is $\boxed{12}.$ ~ Technodoggo
| 12
|
2,949
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_15
| 1
|
Roy bought a new battery-gasoline hybrid car. On a trip the car ran exclusively on its battery for the first $40$ miles, then ran exclusively on gasoline for the rest of the trip, using gasoline at a rate of $0.02$ gallons per mile. On the whole trip he averaged $55$ miles per gallon. How long was the trip in miles?
$\mathrm{(A)}\ 140 \qquad \mathrm{(B)}\ 240 \qquad \mathrm{(C)}\ 440 \qquad \mathrm{(D)}\ 640 \qquad \mathrm{(E)}\ 840$
|
We know that $\frac{\text{total miles}}{\text{total gas}}=55$ . Let $x$ be the distance in miles the car traveled during the time it ran on gasoline, then the amount of gas used is $0.02x$ . The total distance traveled is $40+x$ , so we get $\frac{40+x}{0.02x}=55$ . Solving this equation, we get $x=400$ , so the total distance is $400 + 40 = \boxed{440}$
| 440
|
2,950
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_15
| 2
|
Roy bought a new battery-gasoline hybrid car. On a trip the car ran exclusively on its battery for the first $40$ miles, then ran exclusively on gasoline for the rest of the trip, using gasoline at a rate of $0.02$ gallons per mile. On the whole trip he averaged $55$ miles per gallon. How long was the trip in miles?
$\mathrm{(A)}\ 140 \qquad \mathrm{(B)}\ 240 \qquad \mathrm{(C)}\ 440 \qquad \mathrm{(D)}\ 640 \qquad \mathrm{(E)}\ 840$
|
Let $d$ be the length of the trip in miles. Roy used no gasoline for the 40 first miles, then used 0.02 gallons of gasoline per mile on the remaining $d - 40$ miles, for a total of $0.02 (d - 40)$ gallons. Hence, his average mileage was \[\frac{d}{0.02 (d - 40)} = 55.\] Multiplying both sides by $0.02 (d - 40)$ , we get \[d = 55 \cdot 0.02 \cdot (d - 40) = 1.1d - 44.\] Then $0.1d = 44$ , so $d = \boxed{440}$ . The answer is $(C)$
| 440
|
2,951
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_17
| 1
|
In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$
|
Let $A=x$ . Then from $A+B+C=30$ , we find that $B=25-x$ . From $B+C+D=30$ , we then get that $D=x$ . Continuing this pattern, we find $E=25-x$ $F=5$ $G=x$ , and finally $H=25-x$ . So $A+H=x+25-x=25 \rightarrow \boxed{25}$
| 25
|
2,952
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_17
| 2
|
In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$
|
Given that the sum of 3 consecutive terms is 30, we have $(A+B+C)+(C+D+E)+(F+G+H)=90$ and $(B+C+D)+(E+F+G)=60$
It follows that $A+B+C+D+E+F+G+H=85$ because $C=5$
Subtracting, we have that $A+H=25\rightarrow \boxed{25}$
| 25
|
2,953
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_17
| 3
|
In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$
|
From the given information, we can deduce the following equations:
$A+B=25, B+D=25, D+E=25, D+E+F=30, E+F+G =30$ , and $F+G+H=30$
We can then cleverly manipulate the equations above by adding and subtracting them to be left with the answer.
$(A+B)-(B+D)=25-25 \implies (A-D)=0$
$(A-D)+(D+E)=0+25 \implies (A+E)=25$
$(A+E)-(E+F+G)=25-30 \implies (A-F-G)=-5$ (Notice how we don't use $D+E+F=30$
$(A-F-G)+(F+G+H)=-5+30 \implies (A+H)=25$
Therefore, we have $A+H=25 \rightarrow \boxed{25}$
| 25
|
2,954
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_17
| 4
|
In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$
|
Since all of the answer choices are constants, it shouldn't matter what we pick $A$ and $B$ to be, so let $A = 20$ and $B = 5$ . Then $D = 30 - B -C = 20$ $E = 30 - D - C = 5$ $F = 30 - D - E =5$ , and so on until we get $H = 5$ . Thus $A + H = \boxed{25}$
| 25
|
2,955
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_17
| 5
|
In the eight term sequence $A$ $B$ $C$ $D$ $E$ $F$ $G$ $H$ , the value of $C$ is $5$ and the sum of any three consecutive terms is $30$ . What is $A+H$
$\textbf{(A)}\ 17 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 25 \qquad \textbf{(D)}\ 26 \qquad \textbf{(E)}\ 43$
|
Assume the sequence is \[15,10,5,15,10,5,15,10\]
Thus, $15+10=\boxed{25}$
| 25
|
2,956
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_19
| 1
|
In 1991 the population of a town was a perfect square. Ten years later, after an increase of 150 people, the population was 9 more than a perfect square. Now, in 2011, with an increase of another 150 people, the population is once again a perfect square. Which of the following is closest to the percent growth of the town's population during this twenty-year period?
$\textbf{(A)}\ 42 \qquad\textbf{(B)}\ 47 \qquad\textbf{(C)}\ 52\qquad\textbf{(D)}\ 57\qquad\textbf{(E)}\ 62$
|
Let the population of the town in $1991$ be $p^2$ . Let the population in $2001$ be $q^2+9$ . It follows that $p^2+150=q^2+9$ . Rearrange this equation to get $141=q^2-p^2=(q-p)(q+p)$ . Since $q$ and $p$ are both positive integers with $q>p$ $(q-p)$ and $(q+p)$ also must be, and thus, they are both factors of $141$ . We have two choices for pairs of factors of $141$ $1$ and $141$ , and $3$ and $47$ . Assuming the former pair, since $(q-p)$ must be less than $(q+p)$ $q-p=1$ and $q+p=141$ . Solve to get $p=70, q=71$ . Since $p^2+300$ is not a perfect square, this is not the correct pair. Solve for the other pair to get $p=22, q=25$ . This time, $p^2+300=22^2+300=784=28^2$ . This is the correct pair. Now, we find the percent increase from $22^2=484$ to $28^2=784$ . Since the increase is $300$ , the percent increase is $\frac{300}{484}\times100\%\approx\boxed{62}$
| 62
|
2,957
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_19
| 2
|
In 1991 the population of a town was a perfect square. Ten years later, after an increase of 150 people, the population was 9 more than a perfect square. Now, in 2011, with an increase of another 150 people, the population is once again a perfect square. Which of the following is closest to the percent growth of the town's population during this twenty-year period?
$\textbf{(A)}\ 42 \qquad\textbf{(B)}\ 47 \qquad\textbf{(C)}\ 52\qquad\textbf{(D)}\ 57\qquad\textbf{(E)}\ 62$
|
Since all the answer choices are around $50\%$ , we know the town's starting population must be around $600$ . We list perfect squares from $400$ to $1000$ \[441, 484, 529,576,625,676,729,784,841,900,961\] We see that $484$ and $784$ differ by $300$ , and we can confirm that $484$ is the correct starting number by noting that $484+150=634=25^2+9$ . Thus, the answer is $784/484-1\approx \boxed{62}$
| 62
|
2,958
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_19
| 3
|
In 1991 the population of a town was a perfect square. Ten years later, after an increase of 150 people, the population was 9 more than a perfect square. Now, in 2011, with an increase of another 150 people, the population is once again a perfect square. Which of the following is closest to the percent growth of the town's population during this twenty-year period?
$\textbf{(A)}\ 42 \qquad\textbf{(B)}\ 47 \qquad\textbf{(C)}\ 52\qquad\textbf{(D)}\ 57\qquad\textbf{(E)}\ 62$
|
Let the population of the town in 1991 be $a^2$ and the population in 2011 be $b^2$ . We know that $a^2+150+150=b^2 \implies a^2-b^2=-300 \implies b^2-a^2=300 \implies (b-a)(b+a)=300$ . Note that $b-a$ must be even. Testing, we see that $a=22$ and $b=28$ works, as $484+150-9=625=25^2$ , so $\frac{784-484}{484} \approx \boxed{62}$
| 62
|
2,959
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 1
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
Let vertex $A$ be any vertex, then vertex $B$ be one of the diagonal vertices to $A$ $C$ be one of the diagonal vertices to $B$ , and so on. We consider cases for this problem.
In the case that $C$ has the same color as $A$ $D$ has a different color from $A$ and so $E$ has a different color from $A$ and $D$ . In this case, $A$ has $6$ choices, $B$ has $5$ choices (any color but the color of $A$ ), $C$ has $1$ choice, $D$ has $5$ choices, and $E$ has $4$ choices, resulting in a possible of $6 \cdot 5 \cdot 1 \cdot 5 \cdot 4 = 600$ combinations.
In the case that $C$ has a different color from $A$ and $D$ has a different color from $A$ $A$ has $6$ choices, $B$ has $5$ choices, $C$ has $4$ choices (since $A$ and $B$ necessarily have different colors), $D$ has $4$ choices, and $E$ has $4$ choices, resulting in a possible of $6 \cdot 5 \cdot 4 \cdot 4 \cdot 4 = 1920$ combinations.
In the case that $C$ has a different color from $A$ and $D$ has the same color as $A$ $A$ has $6$ choices, $B$ has $5$ choices, $C$ has $4$ choices, $D$ has $1$ choice, and $E$ has $5$ choices, resulting in a possible of $6 \cdot 5 \cdot 4 \cdot 1 \cdot 5 = 600$ combinations.
Adding all those combinations up, we get $600+1920+600=\boxed{3120}$
| 120
|
2,960
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 2
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
First, notice that there can be $3$ cases. One with all vertices painted different colors, one with one pair of adjacent vertices painted the same color and the final one with two pairs of adjacent vertices painted two different colors.
Case $1$ : There are $6!$ ways of assigning each vertex a different color. $6! = 720$
Case $2$ : There are $\frac {6!}{2!} * 5$ ways. After picking four colors, we can rotate our pentagon in $5$ ways to get different outcomes. $\frac {6!}{2} * 5 = 1800$
Case $3$ : There are $\frac {\frac {6!}{3!} * 10}{2!}$ ways of arranging the final case. We can pick $3$ colors for our pentagon. There are $5$ spots for the first pair of colors. Then, there are $2$ possible ways we can put the final pair in the last $3$ spaces. But because the two pairs are indistinguishable, we divide by $2!$ $\frac {\frac {6!}{3!} * 10}{2!} = 600$
Adding all the possibilities up, we get $720+1800+600=\boxed{3120}$
| 120
|
2,961
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 3
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
There are $6$ ways to assign a color to $A$ . WLOG, give vertex $A$ a color; we can multiply by $6$ at the end. Since vertices $A$ and $C$ cannot have the same color, there are $5$ ways to assign colors to vertex $C$ . Using this same logic, there are $5$ ways to assign a color to vertices $E$ $B$ , and $D$ , giving a total of $5^4=625$ ways. However, vertex $D$ cannot be the same color as vertex $A$ . To use complementary counting, we need to find the amount of ways for $D$ and $A$ to have the same color. Notice that this is equivalent to the amount of ways to arrange colors among the vertices of a square. Using the same logic as above, there are $5^3=125$ ways, except we must subtract the number of ways for a triangle. Each time, there is $1$ less vertex, so $5$ times less ways to color. This process stops when there are only $2$ vertices left; in this case there are simply $5$ ways to color this figure.
So in conclusion, there are $6(5^4-(5^3-(5^2-(5))))=6(5^4-5^3+5^2-5)=\boxed{3120}$ ways.
| 120
|
2,962
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 4
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
This problem is a direct application of the chromatic polynomial of a graph, represented by $P_k(G)$ , which returns a polynomial representing the number of ways to color a graph $G$ with $k$ colors such that no two adjacent vertices share the same color. In other words, it gives us a polynomial in terms of $k$ where we can plug in $k=6$ to get our answer.
Well, if we want to find $P_k$ for a graph $G$ , we should probably first draw the graph, right? We can first draw five vertices (without any edges) in the shape of a pentagon. After connecting the diagonals, we get a star. We attempt to shift the vertices around to simplify the graph, which we quickly realize is isomorphic (can be turned into) the five-cycle, or the pentagon.
Finding $P_k$ on a graph with a cycle of length at most 3 is straightforward -- we first pick a vertex v. It has 0 colored (visited) neighbors, so we can color it in k ways. We then move on to the vertices adjacent to v, etc, and at the end we multiply all these together. For example, the chromatic polynomial of a triangle is $k(k-1)(k-2)$ . However, cycles with length > 3 introduce ambiguity, and thus the above technique fails. Thus, we need to use the recursive formula $P_k(G) = P_k(G-e)-P_k(G*e)$ , where $G-e$ represents removing e and $G*e$ represents contracting e, or collapsing the two endpoints of e into one. When we hit a graph where the longest cycle has length 3, we can use the first technique to quickly find $P_k$
After about four iterations of the algorithm, we get that the chromatic polynomial is $k(k-1)^4 - k(k-1)^3 + k(k-1)(k-2)$ . Plugging in 6 gives us $\boxed{3120}$
| 120
|
2,963
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 5
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
In pentagon $ABCDE$ , fix any vertex $A$ . Now draw diagonal $AC$ . There are six choices for vertex $A$ and $5$ choices for vertex $C$
Now draw diagonal $CE$ . Since $E$ cannot be the same color as vertex $C$ , we have $5$ choices for $E$ . Again, we have five choices for vertex $D$ (draw diagonal $AD$ ).
Thus there are $6 \cdot 5$ choices for vertices $A$ and $C$ and $5 \cdot 5$ combinations for $D$ and $E$
To determine the final count, we consider two cases for the final $25$ combinations of $D$ and $E$ , which uniquely determines $B$ . Then, we multiply by $30$ since the choices of $A$ and $C$ are independent from these two cases.
Case $1$ $D$ and $E$ are the same color. There are $4$ possible pairs (This is because $D$ and $E$ are not chosen from the same 5 colors. $D$ cannot be $A$ as they are on a diagonal, but $E$ can be. ~ primegn), and thus we have $5$ choices for $B$ . There are $20$ cases here.
Case $2$ $D$ and $E$ are different. There are $25-4 = 21$ possible combinations and we have $4$ choices for $B$ (not the color of $D$ nor $E$ ). In this case we have $21 \cdot 4 = 84$ cases.
Our final count is $30(84+20) = \boxed{3120}$
| 120
|
2,964
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 6
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
WLOG, draw $ABCDE$ such that point $A$ is at the top, and write the letters in counterclockwise order. WLOG, fill in $A$ first. There are $6$ ways to do so. From here we proceed with casework on the color of $B$
Summing up the cases, $600+600+1920=3120 \Longrightarrow \boxed{3120}$
| 120
|
2,965
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 7
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
Notice that a minimum of, $3$ and a maximum of $5$ colours can be used.
This is straight forward and there are $6P5 = 720$ ways.
If $x$ and $y$ have same colours, they have to be adjacent. Let $x$ be directly right of $y$ $4$ consecutive points from $x$ clockwise have different colours. They can be coloured in $6P4=360$ ways. And $x$ can be chosen in $5$ ways, bringing the total to $360 \times 5=1800$
Note that $3$ points can't have the same colour as at least $1$ of the lines joining them will be a diagonal. Then the arrangement is $2-2-1$ . The point with distinct colour can be chosen in $5$ ways and can be coloured in $6$ ways. The next two points clockwise can be coloured in $5$ ways and the next two in $4$ ways. The total is $5 \times 6 \times 5 \times 4=600$
Finally, adding all cases, the answer is $600+1800+720=3120 \Longrightarrow \boxed{3120}$
| 120
|
2,966
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 8
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
Name the pentagon $ADBEC$ . Then $A,B;$ $B,C;$ $C,D;$ $D,E$ and $E,A$ have to be of different colours.
$A$ can be coloured in $6$ ways, $B$ in $5$ ways (Without the one used for $A$ ), $C$ in $5$ ways (Without the one used for $B$ ), $D$ in $5$ ways (Without the one used for $C$ ).
Now we find the expected value of how many ways can $E$ be coloured.
If $A$ and $C$ are of the same colour, $A$ and $D$ are always different. This happens $\frac{1}{5}$ times and leaves $4$ options for $E$
If $A$ and $C$ are of different colours $\left(\frac{4}{5} \ \text{of the time} \right)$ then there is a $\frac{1}{5}$ chance that $A$ and $D$ are of same colour and $\frac{4}{5}$ chance that they are different. The first one leaves $5$ ways to colour $E$ and the second one leaves $4$
Calculating all these, we find the expected value for the number of ways $E$ can be coloured is $\frac{1}{5} \times 4 + \frac{4}{5} \left( \frac{1}{5} \times 5 + \frac{4}{5} \times 4 \right) = 4.16$
Therefore total number or ways $= 6 \times 5 \times 5 \times 5 \times 4.16 = \boxed{3120}$
| 120
|
2,967
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_22
| 9
|
Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible?
$\textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750$
|
First, we know that there are $6$ ways to assign a color to vertex $A$ . Then, there are $6$ ways to assign a color to vertex $B$ , because it doesn't depend on vertex $A$ . There are also $5$ ways to assign a color to vertex $C$ , because it can't be the same color as vertex $A$ . Notice that both vertices $E$ and $D$ have 5 or 4 choices, depending on whether $A$ $B$ , and $C$ are the same color. This means that the we know that the amount of choices must be bigger than $6 \times 6 \times 5 \times 4 \times 4 = 2880$ , which eliminates options $A$ and $B$
Then, notice that the amount of choices must be smaller than $6 \times 6 \times 5 \times 4.5 \times 4.5 = 3645$ , because the expected amount of choices $E$ and $D$ have are less than 4.5. (There is a greater probability that $A$ $B$ , and $B$ $C$ are both different). This eliminates option $E$ , which leaves us with options $C$ and $D$
We know that the amount of choices must be a multiple of $6$ , so $D$ is eliminated, leaving us with option $\boxed{3120}$
| 120
|
2,968
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_23
| 1
|
Seven students count from 1 to 1000 as follows:
Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says 1, 3, 4, 6, 7, 9, . . ., 997, 999, 1000.
Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers.
Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers.
Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers.
Finally, George says the only number that no one else says.
What number does George say?
$\textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998$
|
First look at the numbers Alice says. $1, 3, 4, 6, 7, 9 \cdots$ skipping every number that is congruent to $2 \pmod 3$ . Thus, Barbara says those numbers EXCEPT every second - being $2 + 3^1 \equiv 5 \pmod{3^2=9}$ . So Barbara skips every number congruent to $5 \pmod 9$ . We continue and see:
Alice skips $2 \pmod 3$ , Barbara skips $5 \pmod 9$ , Candice skips $14 \pmod {27}$ , Debbie skips $41 \pmod {81}$ , Eliza skips $122 \pmod {243}$ , and Fatima skips $365 \pmod {729}$
Since the only number congruent to $365 \pmod {729}$ and less than $1,000$ is $365$ , the correct answer is $\boxed{365}$
| 365
|
2,969
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_23
| 2
|
Seven students count from 1 to 1000 as follows:
Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says 1, 3, 4, 6, 7, 9, . . ., 997, 999, 1000.
Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers.
Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers.
Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers.
Finally, George says the only number that no one else says.
What number does George say?
$\textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998$
|
After Alice says all her numbers, the numbers not mentioned yet are \[\text{Alice: } 2,5,8,11,14,17,\cdots,998.\] After Barbara says all her numbers, the numbers that haven't been said yet are \[\text{Barbara: } 5,14,23,32,41,50,\cdots,995.\] After Candice, the list is \[\text{Candice: } 14,41,68,\cdots,986.\] Notice how each list is an arithmetic sequence where the common differene is thrice the common ratio of the previous list and the first term is the second term of the previous list. Now that the pattern is clear, we construct the rest of the lists: \[\text{Debbie: } 41,122,203,\cdots,959\] \[\text{Eliza: } 122,365,608,878\] \[\text{Fatima: } 365\]
Thus, George says $\boxed{365}$
| 365
|
2,970
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_23
| 4
|
Seven students count from 1 to 1000 as follows:
Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says 1, 3, 4, 6, 7, 9, . . ., 997, 999, 1000.
Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers.
Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers.
Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers.
Finally, George says the only number that no one else says.
What number does George say?
$\textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998$
|
Similar to Solution 1 we find that the only number that George can say must leave a remainder of $2$ when divided by $3$ , and that it must also leave a remainder of $5$ when divided by $9$ . Since we as human beings are usually lazy, and that MAA provides answer choices, we check all the possible numbers and find that our answer is $\boxed{365}$
| 365
|
2,971
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_23
| 5
|
Seven students count from 1 to 1000 as follows:
Alice says all the numbers, except she skips the middle number in each consecutive group of three numbers. That is, Alice says 1, 3, 4, 6, 7, 9, . . ., 997, 999, 1000.
Barbara says all of the numbers that Alice doesn't say, except she also skips the middle number in each consecutive group of three numbers.
Candice says all of the numbers that neither Alice nor Barbara says, except she also skips the middle number in each consecutive group of three numbers.
Debbie, Eliza, and Fatima say all of the numbers that none of the students with the first names beginning before theirs in the alphabet say, except each also skips the middle number in each of her consecutive groups of three numbers.
Finally, George says the only number that no one else says.
What number does George say?
$\textbf{(A)}\ 37\qquad\textbf{(B)}\ 242\qquad\textbf{(C)}\ 365\qquad\textbf{(D)}\ 728\qquad\textbf{(E)}\ 998$
|
Every integer from 1 to 1000 can be written in the form $t_n+1$ in base 10, where $t_n$ is a trinary integer with no more than 7 significant digits. The important insight is that person $1\le{k}\le6$ will not say $n$ if and only if the $k$ th digit from the right of $t_n$ is 1. Therefore, the last 6 digits of $t_n$ must be 1, as the first 6 people never said the number. The only options for $t_n$ are thus $2111111$ $1111111$ , and $0111111$ . But, since George only said one number, the first two must have been too big for it to be $\le1000$ . Our answer is therefore $111111_3+1=\frac{3^6-1}{3-1}+1=364+1=\boxed{365}$
| 365
|
2,972
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_25
| 1
|
Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$
|
There must be four rays emanating from $X$ that intersect the four corners of the square region. Depending on the location of $X$ , the number of rays distributed among these four triangular sectors will vary. We start by finding the corner-most point that is $100$ -ray partitional (let this point be the bottom-left-most point).
We first draw the four rays that intersect the vertices. At this point, the triangular sectors with bases as the sides of the square that the point is closest to both do not have rays dividing their areas. Therefore, their heights are equivalent since their areas are equal. The remaining $96$ rays are divided among the other two triangular sectors, each sector with $48$ rays, thus dividing these two sectors into $49$ triangles of equal areas.
Let the distance from this corner point to the closest side be $a$ and the side of the square be $s$ . From this, we get the equation $\frac{a\times s}{2}=\frac{(s-a)\times s}{2}\times\frac1{49}$ . Solve for $a$ to get $a=\frac s{50}$ . Therefore, point $X$ is $\frac1{50}$ of the side length away from the two sides it is closest to. By moving $X$ $\frac s{50}$ to the right, we also move one ray from the right sector to the left sector, which determines another $100$ -ray partitional point. We can continue moving $X$ right and up to derive the set of points that are $100$ -ray partitional.
In the end, we get a square grid of points each $\frac s{50}$ apart from one another. Since this grid ranges from a distance of $\frac s{50}$ from one side to $\frac{49s}{50}$ from the same side, we have a $49\times49$ grid, a total of $2401$ $100$ -ray partitional points. To find the overlap from the $60$ -ray partitional, we must find the distance from the corner-most $60$ -ray partitional point to the sides closest to it. Since the $100$ -ray partitional points form a $49\times49$ grid, each point $\frac s{50}$ apart from each other, we can deduce that the $60$ -ray partitional points form a $29\times29$ grid, each point $\frac s{30}$ apart from each other. To find the overlap points, we must find the common divisors of $30$ and $50$ which are $1, 2, 5,$ and $10$ . Therefore, the overlapping points will form grids with points $s$ $\frac s{2}$ $\frac s{5}$ , and $\frac s{10}$ away from each other respectively. Since the grid with points $\frac s{10}$ away from each other includes the other points, we can disregard the other grids. The total overlapping set of points is a $9\times9$ grid, which has $81$ points. Subtract $81$ from $2401$ to get $2401-81=\boxed{2320}$
| 320
|
2,973
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_25
| 2
|
Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$
|
Position the square region $R$ so that the bottom-left corner of the square is at the origin. Then define $s$ to be the sidelength of $R$ and $X$ to be the point $(rs, qs)$ , where $0<r,q<1$
There must be four rays emanating from $X$ that intersect the four corners of $R$ . The areas of the four triangles formed by these rays are then $A_1=\frac{qs\times s}{2}$ $A_2=\frac{(s-rs)\times s}{2}$ $A_3=\frac{(s-qs)\times s}{2}$ , and $A_4=\frac{rs\times s}{2}$
If a point is $n$ -ray partitional, then there exist positive integers $a, b, c, d$ such that $a+b+c+d=n$ and $\frac{A_1}{a}=\frac{A_2}{b}=\frac{A_3}{c}=\frac{A_4}{d}$ . Substituting in our formulas for $A_1$ $A_2$ $A_3$ , and $A_4$ and canceling equal terms, we get \[\frac{q}{a}=\frac{1-r}{b}=\frac{1-q}{c}=\frac{r}{d}.\]
Taking $\frac{q}{a}=\frac{1-q}{c}$ and solving for $q$ , we get $q=\frac{a}{a+c}$ , and taking $\frac{1-r}{b}=\frac{r}{d}$ and solving for $r$ , we get $r=\frac{d}{b+d}$ . Finally, from $\frac{q}{a}=\frac{r}{d}$ , we have $qd=ar$ $\Leftrightarrow$ $\frac{ad}{a+c}=\frac{ad}{b+d}$ $\Leftrightarrow$ $a+c=b+d$
So for a point $X$ to be $100$ -ray partitional, $a+b+c+d=100$ , so $a+c=b+d=50$ $X$ must then be of the form $\left(\frac{d}{50}s, \frac{a}{50}s\right)$ . Since $X$ is in the interior of $R$ $a$ and $d$ can be any positive integer from $1$ to $49$ (with $b$ and $c$ just equaling $50-d$ and $50-a$ , respectively). Thus, there are $49\times 49=2401$ points that are $100$ -ray partitional.
However, the problem asks for points that are not only $100$ -ray partitional but also not $60$ -ray partitional. Points that are $60$ -ray partitional are of the form $\left(\frac{m}{30}s, \frac{n}{30}s\right)$ , where $m$ and $n$ are also positive integers. We count the number of points $\left(\frac{d}{50}s, \frac{a}{50}s\right)$ that can also be written in this form. For a given $d$ $\frac{d}{50}=\frac{m}{30}$ if and only if $m=\frac{3}{5}d$ , and likewise with $a$ and $n$ . We can then see that a point is both $100$ -ray partitional and $60$ -ray partitional if and only if $a$ and $d$ are both divisible by $5$ . There are $9$ integers between $1$ and $49$ that are divisible by $5$ , so out of our $2401$ points that are $100$ -ray partitional, $9\times 9=81$ are also $60$ -ray partitional.
Our answer then is just $2401-81=\boxed{2320}$
| 320
|
2,974
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10A_Problems/Problem_25
| 3
|
Let $R$ be a unit square region and $n \geq 4$ an integer. A point $X$ in the interior of $R$ is called n-ray partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are $100$ -ray partitional but not $60$ -ray partitional?
$\textbf{(A)}\ 1500 \qquad \textbf{(B)}\ 1560 \qquad \textbf{(C)}\ 2320 \qquad \textbf{(D)}\ 2480 \qquad \textbf{(E)}\ 2500$
|
For the sake of simplicity, let $R$ be a $60 \times 60$ square and set the bottom-left point as the origin. Then, $R$ has vertices: \[(0,0), (60,0), (60,60), (0,60).\]
Now, let a point in the square have coordinates $(x, y).$
In order for the point to be $100-$ ray partitional, we must be able to make $100$ triangles with area $60^2/100 = 36.$ For it to not be $60$ -ray partitional, we cannot make $60$ triangles with area $60^2/60 = 60.$
When we draw such a triangle, it's base will always be on one of the sides of the square. If it is on the bottom side, then the height must be $y$ . So, the base of each triangle must be $\frac{72}{y}.$ So, there will be $\frac{60}{\frac{72}{y}} = \frac{60y}{72}$ total triangles on that side.
If the triangle is on the right side of the square, then the height has to be $60 - x.$ So, the base will be $\frac{72}{60-x}$ and there will be $\frac{60 (60-x)}{72}$ triangles.
If the triangle is on the top, the height will be $60-y$ , the base will be $\frac{72}{60-y}$ and there will be $\frac{60 (60-y)}{72}$ triangles along this side.
The triangles on the left will have height $x$ , base $\frac{72}{x}$ and $\frac{60x}{72}$ such triangles must exist.
Simplifying, we get $\frac{5y}{6}, \frac{5 (60-x)}{6}, \frac{5(60-y)}{6}, \frac{5x}{6}$ triangles on the respective sides of the square.
All of these numbers must be integers. Let $x = 60a$ and $y = 60b$ where $0 < a, b < 1.$
Then, the amounts become: \[50a, 50b, 50 - 50a, 50 - 50b.\]
As long as $50a$ and $50b$ are integers, $50 - 50a$ and $50 - 50b$ will also be integers.
For this to happen, $a$ and $b$ must be of the form $\frac{x}{50}$ where $1 \le x \le 49.$ So, we have a total of $49^2 = 2401$ points that are $100$ -ray partitional.
Now, we must calculate the number of $100$ - ray partitional points that are also $60$ -ray partitional.
Using a method similar to before, if a point is $60$ -ray partitional, then we must be able to make $30a, 30b, 30 - 30a, 30 -30b$ triangles on the different sides.
So, $30a$ and $30b$ must be integers. This means $a$ and $b$ have to be of the form $\frac{y}{30}$ where $0<y<30.$
If a point is both $100$ -ray partitional and $60$ -ray partitional, then it can be written as \[\frac{x}{50} = \frac{y}{30}\] . Note that whenever $x$ is divisible by $5$ , a $y$ will always exist to satisfy the above equation.
So, $x$ has to be in the range $(0, 50)$ and must be divisible by $5$ . There are $9$ possibilities, namely $5, 10, 15, 20, 25, 30, 35, 40, 45.$
The $x$ -coordinate of the point and the $y$ -coordinate of the point can each use any of these $9$ possibilities, giving $9^2 = 81$ numbers that are both $100$ -ray partitional and $60$ -ray partitional.
Overall, we are left with $2401 - 81 = \boxed{2320}$ solutions.
| 320
|
2,975
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_2
| 1
|
Josanna's test scores to date are $90, 80, 70, 60,$ and $85$ . Her goal is to raise here test average at least $3$ points with her next test. What is the minimum test score she would need to accomplish this goal?
$\textbf{(A)}\ 80 \qquad\textbf{(B)}\ 82 \qquad\textbf{(C)}\ 85 \qquad\textbf{(D)}\ 90 \qquad\textbf{(E)}\ 95$
|
The average of her current scores is $77$ . To raise it $3$ points, she needs an average of $80$ , and so after her $6$ tests, a sum of $480$ . Her current sum is $385$ , so she needs a $480 - 385 = \boxed{95}$
| 95
|
2,976
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_4
| 1
|
LeRoy and Bernardo went on a week-long trip together and agreed to share the costs equally. Over the week, each of them paid for various joint expenses such as gasoline and car rental. At the end of the trip it turned out that LeRoy had paid $A$ dollars and Bernardo had paid $B$ dollars, where $A < B$ . How many dollars must LeRoy give to Bernardo so that they share the costs equally?
$\textbf{(A)}\ \frac{A + B}{2} \qquad\textbf{(B)}\ \dfrac{A - B}{2}\qquad\textbf{(C)}\ \dfrac{B - A}{2}\qquad\textbf{(D)}\ B - A \qquad\textbf{(E)}\ A + B$
|
The difference in how much LeRoy and Bernardo paid is $B-A$ . To share the costs equally, LeRoy must give Bernardo half of the difference, which is $\boxed{2}$
| 2
|
2,977
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_4
| 2
|
LeRoy and Bernardo went on a week-long trip together and agreed to share the costs equally. Over the week, each of them paid for various joint expenses such as gasoline and car rental. At the end of the trip it turned out that LeRoy had paid $A$ dollars and Bernardo had paid $B$ dollars, where $A < B$ . How many dollars must LeRoy give to Bernardo so that they share the costs equally?
$\textbf{(A)}\ \frac{A + B}{2} \qquad\textbf{(B)}\ \dfrac{A - B}{2}\qquad\textbf{(C)}\ \dfrac{B - A}{2}\qquad\textbf{(D)}\ B - A \qquad\textbf{(E)}\ A + B$
|
Since there are no restrictions on cost paid besides $A<B$ , we can use an example where $A = 40$ and $B = 50$ . Quickly, we realize the only way they could pay the same amount of money is if they both pay 45 dollars. This means LeRoy must give Bernardo $50 - 45 = 5$ . Looking at the answer choices we see only $\frac{50-40}{2} = 5$ works. $\boxed{2}$
| 2
|
2,978
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_5
| 1
|
In multiplying two positive integers $a$ and $b$ , Ron reversed the digits of the two-digit number $a$ . His erroneous product was $161$ . What is the correct value of the product of $a$ and $b$
$\textbf{(A)}\ 116 \qquad\textbf{(B)}\ 161 \qquad\textbf{(C)}\ 204 \qquad\textbf{(D)}\ 214 \qquad\textbf{(E)}\ 224$
|
We have $161 = 7 \cdot 23.$ Since $a$ has two digits, the factors must be $23$ and $7,$ so $a = 32$ and $b = 7.$ Then, $ab = 7 \times 32 = \boxed{224}.$
| 224
|
2,979
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_6
| 1
|
On Halloween Casper ate $\frac{1}{3}$ of his candies and then gave $2$ candies to his brother. The next day he ate $\frac{1}{3}$ of his remaining candies and then gave $4$ candies to his sister. On the third day he ate his final $8$ candies. How many candies did Casper have at the beginning?
$\textbf{(A)}\ 30 \qquad\textbf{(B)}\ 39 \qquad\textbf{(C)}\ 48 \qquad\textbf{(D)}\ 57 \qquad\textbf{(E)}\ 66$
|
Let $x$ represent the amount of candies Casper had at the beginning.
\begin{align*} \frac{2}{3} \left(\frac{2}{3} x - 2\right) - 4 - 8 &= 0\\ \frac{2}{3} x - 2 &= 18\\ \frac{2}{3} x &= 20\\ x &= \boxed{30}
| 30
|
2,980
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_6
| 2
|
On Halloween Casper ate $\frac{1}{3}$ of his candies and then gave $2$ candies to his brother. The next day he ate $\frac{1}{3}$ of his remaining candies and then gave $4$ candies to his sister. On the third day he ate his final $8$ candies. How many candies did Casper have at the beginning?
$\textbf{(A)}\ 30 \qquad\textbf{(B)}\ 39 \qquad\textbf{(C)}\ 48 \qquad\textbf{(D)}\ 57 \qquad\textbf{(E)}\ 66$
|
We work backwards. If he had 8 candies at the end, then before he gave candies to his sister he had 12 candies. This means that at the end of Halloween he had 18 candies, so before he gave candies to his brother he had 20 candies. Therefore, at the start he had $\boxed{30}$
| 30
|
2,981
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_6
| 3
|
On Halloween Casper ate $\frac{1}{3}$ of his candies and then gave $2$ candies to his brother. The next day he ate $\frac{1}{3}$ of his remaining candies and then gave $4$ candies to his sister. On the third day he ate his final $8$ candies. How many candies did Casper have at the beginning?
$\textbf{(A)}\ 30 \qquad\textbf{(B)}\ 39 \qquad\textbf{(C)}\ 48 \qquad\textbf{(D)}\ 57 \qquad\textbf{(E)}\ 66$
|
A solve by algebra is more secure and safe (and usually faster), but you can also test the answer choices. We are lucky and option A works $\Longrightarrow \boxed{30}$
| 30
|
2,982
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_7
| 1
|
The sum of two angles of a triangle is $\frac{6}{5}$ of a right angle, and one of these two angles is $30^{\circ}$ larger than the other. What is the degree measure of the largest angle in the triangle?
$\textbf{(A)}\ 69 \qquad\textbf{(B)}\ 72 \qquad\textbf{(C)}\ 90 \qquad\textbf{(D)}\ 102 \qquad\textbf{(E)}\ 108$
|
The sum of two angles in a triangle is $\frac{6}{5}$ of a right angle $\longrightarrow \frac{6}{5} \times 90 = 108$
If $x$ is the measure of the first angle, then the measure of the second angle is $x+30$ \[x + x + 30 = 108 \longrightarrow 2x = 78 \longrightarrow x = 39\]
Now we know the measure of two angles are $39^{\circ}$ and $69^{\circ}$ . By the Triangle Sum Theorem, the sum of all angles in a triangle is $180^{\circ},$ so the final angle is $72^{\circ}$ . Therefore, the largest angle in the triangle is $\boxed{72}$
| 72
|
2,983
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_10
| 1
|
Consider the set of numbers $\{1, 10, 10^2, 10^3, \ldots, 10^{10}\}$ . The ratio of the largest element of the set to the sum of the other ten elements of the set is closest to which integer?
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)} 101$
|
The requested ratio is \[\dfrac{10^{10}}{10^9 + 10^8 + \ldots + 10 + 1}.\] Using the formula for a geometric series, we have \[10^9 + 10^8 + \ldots + 10 + 1 = \dfrac{10^{10} - 1}{10 - 1} = \dfrac{10^{10} - 1}{9},\] which is very close to $\dfrac{10^{10}}{9},$ so the ratio is very close to $\boxed{9}.$
| 9
|
2,984
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_10
| 2
|
Consider the set of numbers $\{1, 10, 10^2, 10^3, \ldots, 10^{10}\}$ . The ratio of the largest element of the set to the sum of the other ten elements of the set is closest to which integer?
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)} 101$
|
The problem asks for the value of \[\dfrac{10^{10}}{10^9 + 10^8 + \ldots + 10 + 1}.\] Written in base 10, we can find the value of $10^9 + 10^8 + \ldots + 10 + 1$ to be $1111111111.$ Long division gives us the answer to be $\boxed{9}.$
| 9
|
2,985
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_10
| 3
|
Consider the set of numbers $\{1, 10, 10^2, 10^3, \ldots, 10^{10}\}$ . The ratio of the largest element of the set to the sum of the other ten elements of the set is closest to which integer?
$\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 9 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 11 \qquad\textbf{(E)} 101$
|
Let $f(n)=\dfrac{10^n}{1+10+10^2+10^3+\cdots+10^{n-1}}$ . We are approximating $f(10)$ . Trying several small values of $n$ gives answers very close to $9$ , so our answer is $\boxed{9}\approx9.09.$ ~Technodoggo
| 9
|
2,986
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_11
| 1
|
There are $52$ people in a room. what is the largest value of $n$ such that the statement "At least $n$ people in this room have birthdays falling in the same month" is always true?
$\textbf{(A)}\ 2 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 5 \qquad\textbf{(E)}\ 12$
|
Pretend you have $52$ people you want to place in $12$ boxes, because there are $12$ months in a year. By the Pigeonhole Principle , one box must have at least $\left\lceil \frac{52}{12} \right\rceil$ people $\longrightarrow \boxed{5}$
| 5
|
2,987
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_12
| 1
|
Keiko walks once around a track at exactly the same constant speed every day. The sides of the track are straight, and the ends are semicircles. The track has a width of $6$ meters, and it takes her $36$ seconds longer to walk around the outside edge of the track than around the inside edge. What is Keiko's speed in meters per second?
$\textbf{(A)}\ \frac{\pi}{3} \qquad\textbf{(B)}\ \frac{2\pi}{3} \qquad\textbf{(C)}\ \pi \qquad\textbf{(D)}\ \frac{4\pi}{3} \qquad\textbf{(E)}\ \frac{5\pi}{3}$
|
Let $s$ be Keiko's speed in meters per second, $a$ be the length of the straight parts of the track, $b$ be the radius of the smaller circles, and $b+6$ be the radius of the larger circles. The length of the inner edge will be $2a+2b \pi$ and the length of the outer edge will be $2a+2\pi (b+6).$ Since it takes $36$ seconds longer for Keiko to walk on the outer edge,
\begin{align*} \frac{2a+2b \pi}{s} + 36 &= \frac{2a+2\pi (b+6)}{s}\\ 2a+2b\pi +36s &= 2a+2b\pi +12\pi\\ 36s&=12\pi\\ s&=\boxed{3}
| 3
|
2,988
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_12
| 2
|
Keiko walks once around a track at exactly the same constant speed every day. The sides of the track are straight, and the ends are semicircles. The track has a width of $6$ meters, and it takes her $36$ seconds longer to walk around the outside edge of the track than around the inside edge. What is Keiko's speed in meters per second?
$\textbf{(A)}\ \frac{\pi}{3} \qquad\textbf{(B)}\ \frac{2\pi}{3} \qquad\textbf{(C)}\ \pi \qquad\textbf{(D)}\ \frac{4\pi}{3} \qquad\textbf{(E)}\ \frac{5\pi}{3}$
|
It is basically the same as Solution 1 except you can completely disregard the straight edges of the track since it will take Keiko the same time to walk that length for both inner and outer circles. Instead, focus on the circular part. If the diameter of the smaller circle were $r,$ then the length of the smaller circle would be $r \pi$ and the length of the larger circle would be $(r+12) \pi.$ Since it still takes $36$ seconds longer,
\begin{align*} \frac{r \pi}{s} + 36 &= \frac{(r+12)\pi}{s}\\ r \pi + 36s &= r \pi + 12 \pi\\ s&=\boxed{3}
| 3
|
2,989
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_13
| 1
|
Two real numbers are selected independently at random from the interval $[-20, 10]$ . What is the probability that the product of those numbers is greater than zero?
$\textbf{(A)}\ \frac{1}{9} \qquad\textbf{(B)}\ \frac{1}{3} \qquad\textbf{(C)}\ \frac{4}{9} \qquad\textbf{(D)}\ \frac{5}{9} \qquad\textbf{(E)}\ \frac{2}{3}$
|
We will use complementary counting. The probability that the product is negative can be found by finding the probability that one number is positive and the other number is negative. The probability of a positive number being selected is $\frac13$ , and the probability of a negative number being selected is $\frac23$ . So, we see that the probability of the product being negative is \[2 \cdot \frac23 \cdot \frac13 = \frac49.\]
We multiply by $2$ because you can either pick the negative or positive number first.
Thus, the probability of the product being positive is \[1-\frac49 = \boxed{59}\]
| 59
|
2,990
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_14
| 1
|
A rectangular parking lot has a diagonal of $25$ meters and an area of $168$ square meters. In meters, what is the perimeter of the parking lot?
$\textbf{(A)}\ 52 \qquad\textbf{(B)}\ 58 \qquad\textbf{(C)}\ 62 \qquad\textbf{(D)}\ 68 \qquad\textbf{(E)}\ 70$
|
Let the sides of the rectangular parking lot be $a$ and $b$ . Then $a^2 + b^2 = 625$ and $ab = 168$ . Add the two equations together, then factor. \begin{align*} a^2 + 2ab + b^2 &= 625 + 168 \times 2\\ (a + b)^2 &= 961\\ a + b &= 31 \end{align*} The perimeter of a rectangle is $2 (a + b) = 2 (31) = \boxed{62}$
| 62
|
2,991
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_14
| 2
|
A rectangular parking lot has a diagonal of $25$ meters and an area of $168$ square meters. In meters, what is the perimeter of the parking lot?
$\textbf{(A)}\ 52 \qquad\textbf{(B)}\ 58 \qquad\textbf{(C)}\ 62 \qquad\textbf{(D)}\ 68 \qquad\textbf{(E)}\ 70$
|
We see the answer choices or the perimeter are integers. Therefore, the sides of the rectangle are most likely integers that satisfy $a^2+b^2=25^2$ . In other words, $(a,b,25)$ is a set of Pythagorean triples. Guessing and checking, we have $(7,24,25)$ as the triplet, as the area is $7 \cdot 24 = 168$ as requested. Therefore, the perimeter is $2(7+24)=\boxed{62}$
| 62
|
2,992
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_17
| 1
|
In the given circle, the diameter $\overline{EB}$ is parallel to $\overline{DC}$ , and $\overline{AB}$ is parallel to $\overline{ED}$ . The angles $AEB$ and $ABE$ are in the ratio $4 : 5$ . What is the degree measure of angle $BCD$
$\textbf{(A)}\ 120 \qquad\textbf{(B)}\ 125 \qquad\textbf{(C)}\ 130 \qquad\textbf{(D)}\ 135 \qquad\textbf{(E)}\ 140$
|
We can let $\angle AEB$ be $4x$ and $\angle ABE$ be $5x$ because they are in the ratio $4 : 5$ . When an inscribed angle contains the diameter , the inscribed angle is a right angle . Therefore by triangle sum theorem, $4x+5x+90=180 \longrightarrow x=10$ and $\angle ABE = 50$
$\angle ABE = \angle BED$ because they are alternate interior angles and $\overline{AB} \parallel \overline{ED}$ . Opposite angles in a cyclic quadrilateral are supplementary , so $\angle BED + \angle BCD = 180$ . Use substitution to get $\angle ABE + \angle BCD = 180 \longrightarrow 50 + \angle BCD = 180 \longrightarrow \angle BCD = \boxed{130}$
| 130
|
2,993
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_17
| 2
|
In the given circle, the diameter $\overline{EB}$ is parallel to $\overline{DC}$ , and $\overline{AB}$ is parallel to $\overline{ED}$ . The angles $AEB$ and $ABE$ are in the ratio $4 : 5$ . What is the degree measure of angle $BCD$
$\textbf{(A)}\ 120 \qquad\textbf{(B)}\ 125 \qquad\textbf{(C)}\ 130 \qquad\textbf{(D)}\ 135 \qquad\textbf{(E)}\ 140$
|
Note $\angle ABE = \angle BED=50$ as before. The sum of the interior angles for quadrilateral $EBCD$ is $360$ . Denote the center of the circle as $P$ $\angle PDE = \angle PED = 50$ . Denote $\angle PDC = \angle PCD = x$ and $\angle PBC = \angle PCB = y$ . We wish to find $\angle BCD = x+y$ . Our equation is $(\angle PDE +\angle PED)+(\angle PDC+\angle PCD)+(\angle PBC + \angle PCB) = 360 \longrightarrow 2(50) + 2x +2y = 360$ . Our final equation becomes $2(x+y)+100 = 360$ . After subtracting $100$ and dividing by $2$ , our answer becomes $x+y=\boxed{130}$
| 130
|
2,994
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_17
| 3
|
In the given circle, the diameter $\overline{EB}$ is parallel to $\overline{DC}$ , and $\overline{AB}$ is parallel to $\overline{ED}$ . The angles $AEB$ and $ABE$ are in the ratio $4 : 5$ . What is the degree measure of angle $BCD$
$\textbf{(A)}\ 120 \qquad\textbf{(B)}\ 125 \qquad\textbf{(C)}\ 130 \qquad\textbf{(D)}\ 135 \qquad\textbf{(E)}\ 140$
|
Note that $\overset{\Large\frown} {BE}$ intercepts $\angle BAE$ . Since, $\overset{\Large\frown} {BE}=180$ , thus $\angle BAE=90°$ (courtesy of the Inscribed Angles Theorem).
Since we know that $\angle BAE=90°$ , then $\angle AEB + \angle ABE = 90°$ , (courtesy of the Triangle Sum Theorem) and also $5\angle AEB = 4\angle ABE$ . By solving this variation, $\angle AEB = 40$ and $\angle ABE = 50$ . After that, due to the Alternate Interior Angles Theorem, $\angle ABE \cong \angle BED$ , which means $\angle BED = 50$
After doing some angle chasing, then these following facts should be true, $\overset{\Large\frown} {AB}=80$ $\overset{\Large\frown} {BD}=100$ $\overset{\Large\frown} {AE}=100$
Note that the arcs have to equal 360, so, $360=\overset{\Large\frown} {AB}+\overset{\Large\frown} {BD}+\overset{\Large\frown} {DE}+\overset{\Large\frown} {AE}$
$360=80+100+100+\overset{\Large\frown} {DE}$
$\overset{\Large\frown} {DE}=80$
Notice how $\overset{\Large\frown} {DB}$ intercepts $\angle BCD$ and that $\overset{\Large\frown} {DB}=\overset{\Large\frown} {DE}+\overset{\Large\frown} {AE}+\overset{\Large\frown} {AB}$
$\overset{\Large\frown} {DB}=80+100+80$
$\overset{\Large\frown} {DB}=260$
According to the Inscribed Angles Theorem, $2\angle BCD=\overset{\Large\frown} {DB}$ , therefore the answer is $\frac{260}{2}= \boxed{130}$
| 130
|
2,995
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_18
| 1
|
Rectangle $ABCD$ has $AB = 6$ and $BC = 3$ . Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$ . What is the degree measure of $\angle AMD$
$\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$
|
It is given that $\angle AMD \sim \angle CMD$ . Since $\angle AMD$ and $\angle CDM$ are alternate interior angles and $\overline{AB} \parallel \overline{DC}$ $\angle AMD \cong \angle CDM \longrightarrow \angle CMD \cong \angle CDM$ . Use the Base Angle Theorem to show $\overline{DC} \cong \overline{MC}$ . We know that $ABCD$ is a rectangle , so it follows that $\overline{MC} = 6$ . We notice that $\triangle BMC$ is a $30-60-90$ triangle, and $\angle BMC = 30^{\circ}$ . If we let $x$ be the measure of $\angle AMD,$ then \begin{align*} 2x + 30 &= 180\\ 2x &= 150\\ x &= \boxed{75}
| 75
|
2,996
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_18
| 2
|
Rectangle $ABCD$ has $AB = 6$ and $BC = 3$ . Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$ . What is the degree measure of $\angle AMD$
$\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$
|
After finding $MC = 6,$ we can continue using trigonometry as follows.
We know that $\angle{BMC} = 180-2x$ and so $\sin (180-2x) = \frac{3}{6} = \frac{1}{2}$
It is obvious that $\sin (30) = \frac{1}{2}$ and so $180-2x=30.$
Solving, we have $x = \boxed{75}$
| 75
|
2,997
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_18
| 3
|
Rectangle $ABCD$ has $AB = 6$ and $BC = 3$ . Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$ . What is the degree measure of $\angle AMD$
$\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$
|
Let $\angle{DMC} = \angle{AMD} = \theta$ . If we let $AM = x$ , we have that $MD = \sqrt{x^2 + 9}$ , by the Pythagorean Theorem, and similarily, $MC = \sqrt{x^2 - 12x + 45}$ . Applying the law of cosine, we see that \[2x^2 + 54 - 12x - 2 \sqrt{x^4 - 12x^3 + 54x^2 - 108x + 405} \cdot \cos (\theta) = 36\] and \[\tan (\theta) = \frac{3}{x}\] YAY!!! We have two equations for two variables... that are relatively difficult to deal with. Well, we'll try to solve it. First of all, note that $\sin (\theta) = \frac{3}{\sqrt{x^2+9}}$ , so solving for $\cos (\theta)$ in terms of $x$ , we get that $\cos (\theta) = \frac{x \cdot \sqrt{x^2 + 9}}{x^2 + 9}$ . The equation now becomes
\[2x^2 + 54 - 12x - 2 \sqrt{x^4 - 12x^3 + 54x^2 - 108x + 405} \cdot \frac{x \cdot \sqrt{x^2 + 9}}{x^2 + 9} = 36\] Simplifying, we get
\[4x^4 - 48x^3 + 216x^2 - 432x + 324\]
Now, we apply the quartic formula to get
\[x = 6 \pm 3 \sqrt{3}\]
We can easily see that $x = 6 + 3 \sqrt{3}$ is an invalid solution. Thus, $x = 6 - 3 \sqrt{3}$
Finally, since $\tan (\theta) = \frac{3}{6 - 3 \sqrt{3}} = 2 + \sqrt{3}$ $\theta = \frac{5 + 12n}{12} \pi$ , where $n$ is any integer. Converting to degrees, we have that $\theta = 75 + 180n$ . Since $0 < \theta < 90$ , we have that $\theta = \boxed{75}$ $\square$
| 75
|
2,998
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_18
| 4
|
Rectangle $ABCD$ has $AB = 6$ and $BC = 3$ . Point $M$ is chosen on side $AB$ so that $\angle AMD = \angle CMD$ . What is the degree measure of $\angle AMD$
$\textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}\ 60 \qquad\textbf{(E)}\ 75$
|
We have $DC=CM=6$ . By the Pythagorean Theorem, $BM=\sqrt{6^2-3^2}=3\sqrt{3}$ , and thus $AM=6-3\sqrt{3}$ , We have $\tan(AMD)=\frac{6-3\sqrt{3}}{3}=2+\sqrt{3}$ , or $\angle AMD=\boxed{75}$ ~awsomek
| 75
|
2,999
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_19
| 1
|
What is the product of all the roots of the equation \[\sqrt{5 | x | + 8} = \sqrt{x^2 - 16}.\]
$\textbf{(A)}\ -64 \qquad\textbf{(B)}\ -24 \qquad\textbf{(C)}\ -9 \qquad\textbf{(D)}\ 24 \qquad\textbf{(E)}\ 576$
|
First, square both sides, and isolate the absolute value. \begin{align*} 5|x|+8&=x^2-16\\ 5|x|&=x^2-24\\ |x|&=\frac{x^2-24}{5}. \\ \end{align*} Solve for the absolute value and factor.
Case 1: $x=\frac{x^2-24}{5}$
Multiplying both sides by $5$ gives us \[5x=x^2-24.\] Rearranging and factoring, we have \begin{align*} x^2-5x-24 &=0, \\ (x-8)(x+3) &= 0.\\ \end{align*}
Case 2: $x=\frac{-x^2+24}{5}$
As above, we multiply both sides by $5$ to find \[5x=-x^2+24.\] Rearranging and factoring gives us \begin{align*} x^2+5x-24 &=0, \\ (x+8)(x-3) &= 0. \\ \end{align*}
Combining these cases, we have $x= -8, -3, 3, 8$ . Because our first step of squaring is not reversible, however, we need to check for extraneous solutions. Plug each solution for $x$ back into the original equation to ensure it works. Whether the number is positive or negative does not matter since the absolute value or square will cancel it out anyways.
Trying $|x|=|3|$ , we have \begin{align*} \sqrt{5|3|+8}&=\sqrt{3^2-16}, \\ \sqrt{15+8}&=\sqrt{9-16}, \\ \sqrt{23} &\not= \sqrt{-7}.\\ \end{align*} Therefore, $x = 3$ and $x= -3$ are extraneous.
Checking $|x|=|8|$ , we have \begin{align*} \sqrt{5|8|+8}&=\sqrt{8^2-16}, \\ \sqrt{40+8}&=\sqrt{64-16}, \\ \sqrt{48}&=\sqrt{48}.\\ \end{align*}
The roots of our original equation are $-8$ and $8$ and product is $-8 \times 8 = \boxed{64}$
| 64
|
3,000
|
https://artofproblemsolving.com/wiki/index.php/2011_AMC_10B_Problems/Problem_19
| 2
|
What is the product of all the roots of the equation \[\sqrt{5 | x | + 8} = \sqrt{x^2 - 16}.\]
$\textbf{(A)}\ -64 \qquad\textbf{(B)}\ -24 \qquad\textbf{(C)}\ -9 \qquad\textbf{(D)}\ 24 \qquad\textbf{(E)}\ 576$
|
Square both sides, to get $5|x| + 8 = x^2-16$ . Rearrange to get $x^2 - 5|x| - 24 = 0$ . Seeing that $x^2 = |x|^2$ , substitute to get $|x|^2 - 5|x| - 24 = 0$ . We see that this is a quadratic in $|x|$ . Factoring, we get $(|x|-8)(|x|+3) = 0$ , so $|x| = \{8,-3\}$ . Since the radicand of the equation can't be negative, the sole solution is $|x| = 8$ . Therefore, $x$ can be $8$ or $-8$ . The product is then $-8 \times 8 = \boxed{64}$
| 64
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.