2014 AMC 10B Problems

Revision as of 13:20, 20 February 2014 by Checkmate1021 (talk | contribs) (Problem 21)

Problem 1

Leah has $13$ coins, all of which are pennies and nickels. If she had one more nickel than she has now, then she would have the same number of pennies and nickels. In cents, how much are Leah's coins worth?

$\textbf {(A) } 33 \qquad \textbf {(B) } 35 \qquad \textbf {(C) } 37 \qquad \textbf {(D) } 39 \qquad \textbf {(E) } 41$

Problem 2

What is $\frac{2^3 + 2^3}{2^{-3} + 2^{-3}}$?

$\textbf {(A) } 16 \qquad \textbf {(B) } 24 \qquad \textbf {(C) } 32 \qquad \textbf {(D) } 48 \qquad \textbf {(E) } 64$

Problem 3

Randy drove the first third of his trip on a gravel road, the next $20$ miles on pavement, and the remaining one-fifth on a dirt road. In miles how long was Randy's trip?

$\textbf {(A) } 30 \qquad \textbf {(B) } \frac{400}{11} \qquad \textbf {(C) } \frac{75}{2} \qquad \textbf {(D) } 40 \qquad \textbf {(E) } \frac{300}{7}$

Problem 4

Susie pays for $4$ muffins and $3$ bananas. Calvin spends twice as much paying for $2$ muffins and $16$ bananas. A muffin is how many times as expensive as a banana?

$\textbf {(A) } \frac{3}{2} \qquad \textbf {(B) } \frac{5}{3} \qquad \textbf {(C) } \frac{7}{4} \qquad \textbf {(D) } 2 \qquad \textbf {(E) } \frac{13}{4}$

Problem 5

Problem 6

Orvin went to the store with just enough money to buy $30$ balloons. When he arrived, he discovered that the store had a special sale on balloons: buy $1$ balloon at the regular price and get a second at $\frac{1}{3}$ off the regular price. What is the greatest number of balloons Orvin could buy?

$\textbf {(A) } 33 \qquad \textbf {(B) } 34 \qquad \textbf {(C) } 36 \qquad \textbf {(D) } 38 \qquad \textbf {(E) } 39$

Problem 7

Suppose $A>B>0$ and A is $x%$ (Error compiling LaTeX. ! Missing $ inserted.) greater than $B$. What is $x$?

$\textbf {(A) } 100(\frac{A-B}{B}) \qquad \textbf {(B) } 100(\frac{A+B}{B}) \qquad \textbf {(C) } 100(\frac{A+B}{A})\qquad \textbf {(D) } 100(\frac{A-B}{A}) \qquad \textbf {(E) } 100(\frac{A}{B})$

Problem 8

A truck travels $\frac{b}{6}$ feet ever $t$ seconds. There are $3$ feet in a yard. How many yards does the truck travel in $3$ minutes?

$\textbf {(A) } \frac{b}{1080t} \qquad \textbf {(B) } \frac{30t}{b} \qquad \textbf {(C) } \frac{30b}{t}\qquad \textbf {(D) } \frac{10t}{b} \qquad \textbf {(E) } \frac{10b}{t}$

Problem 9

Problem 10

Problem 11

Problem 12

The largest divisor of 2,014,000,000 is itself. What is the fifth-largest divisor?

$\textbf {(A) } 125, 875, 000 \qquad \textbf {(B) } 201, 400, 000 \qquad \textbf {(C) } 251, 750, 000 \qquad \textbf {(D) } 402, 800, 000 \qquad \textbf {(E) } 503, 500, 000$

Problem 13

Problem 14

Problem 15

Problem 16

Four fair six-sided dice are rolled. What is the probability that at least three of the four dice show the same value?

$\textbf {(A) } \frac{1}{36} \qquad \textbf {(B) } \frac{7}{72} \qquad \textbf {(C) } \frac{1}{9}\qquad \textbf {(D) } \frac{5}{36} \qquad \textbf {(E) } \frac{1}{6}$

Problem 17

Problem 18

A list of $11$ positive integers has a mean of $10$, a median of $9$, and a unique mode of $8$. What is the largest possible value of an integer in the list?

$\textbf {(A) } 24 \qquad \textbf {(B) } 30 \qquad \textbf {(C) } 31\qquad \textbf {(D) } 33 \qquad \textbf {(E) } 35$

Problem 19

Two concentric circles have radii $1$ and $2$. Two points on the outer circle are chosen independently and uniformly at random. What is the probability that the chord joining the two points intersects the inner circle?

$\textbf{(A) }\frac{1}{6}\qquad\textbf{(B) }\frac{1}{4}\qquad\textbf{(C) }\frac{2-\sqrt{2}}{2}\qquad\textbf{(D) }\frac{1}{3}\qquad\textbf{(E) }\frac{1}{2}\qquad$

Problem 20

Problem 21

Trapezoid $ABCD$ has parallel sides $\overline{AB}$ of length $33$ and $\overline{CD}$ of length $21$. The other two sides are of lengths $10$ and $14$. The angles at $A$ and $B$ are acute. What is the length of the shorter diagonal of $ABCD$?

Problem 22

Problem 23

Problem 24

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is bad if it is not true that for every $n$ from $1$ to $15$ one can find a subset of the numbers that appear consecutively on the circle that sum to $n$. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?

$\textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5$

Problem 25

In a small pond there are eleven lily pads in a row labeled $0$ through $10$. A frog is sitting on pad $1$. When the frog is on pad $N$, $0<N<10$, it will jump to pad $N-1$ with probability $\frac{N}{10}$ and to pad $N+1$ with probability $1-\frac{N}{10}$. Each jump is independent of the previous jumps. If the frog reaches pad $0$ it will be eaten by a patiently waiting snake. If the frog reaches pad $10$ it will exit the pond, never to return. what is the probability that the frog will escape being eaten by the snake?

$\textbf {(A) } \frac{32}{79} \qquad \textbf {(B) } \frac{161}{384} \qquad \textbf {(C) } \frac{63}{146} \qquad \textbf {(D) } \frac{7}{16} \qquad \textbf {(E) } \frac{1}{2}$

Invalid username
Login to AoPS