|
|
(46 intermediate revisions by 2 users not shown) |
Line 1: |
Line 1: |
− | ==Instructions==
| |
| | | |
− | 1. All rules of a regular AMC 10 apply.
| |
− |
| |
− | 2. Please submit your answers in a DM to me (Lcz).
| |
− |
| |
− | 3. Don't cheat.
| |
− |
| |
− | Here's the problems!
| |
− |
| |
− | ==Problem 1==
| |
− |
| |
− | Find the value of <math>2^{0+1+2}+2+0(1+(2))+20(12)</math>.
| |
− |
| |
− | <math>\textbf{(A)}\ 8 \qquad\textbf{(B)}\ 248 \qquad\textbf{(C)}\ 250 \qquad\textbf{(D)}\ 252 \qquad\textbf{(E)}\ 254</math>
| |
− |
| |
− | ==Problem 2==
| |
− |
| |
− | If <math>|x-2|=0</math>, and <math>|y-3|=1</math>, find the sum of all possible values of <math>|xy|</math>.
| |
− |
| |
− | <math>\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 16</math>
| |
− |
| |
− | ==Problem 3==
| |
− |
| |
− | What is <math>1*2+2*3+3*4+4*5+5*6+6*7+7*8</math>?
| |
− |
| |
− | <math>\textbf{(A)}\ 84 \qquad\textbf{(B)}\ 120 \qquad\textbf{(C)}\ 138 \qquad\textbf{(D)}\ 150 \qquad\textbf{(E)}\ 168</math>
| |
− |
| |
− | ==Problem 10==
| |
− |
| |
− | Jack and Jill play a (bad) game on a number line which contains the integers. Jack starts at <math>-1</math>, and Jill starts at <math>18</math>. Every turn, the judge flip a standard six sided die. If the number rolled is a square number, Jack moves to the right <math>10</math> units. Otherwise, Jill moves to the left <math>5</math> units. Find the probability for which Jack and Jill pass each other for the first time in <math>3</math> moves.
| |
− |
| |
− | <math>\textbf{(A)}\ 4/27 \qquad\textbf{(B)}\ 2/9 \qquad\textbf{(C)}\ 1/3 \qquad\textbf{(D)}\ 4/9 \qquad\textbf{(E)}\ 2/3</math>
| |
− |
| |
− | ==Problem 13==
| |
− |
| |
− | How many <math>4</math>-digit integers contain a substring of digits that is divisible by <math>4</math>? (For example, count in <math>1532</math> because it contains <math>32</math>, but don't count in <math>1734</math>.)
| |