GET READY FOR THE AMC 10 WITH AoPS
Learn with outstanding instructors and top-scoring students from around the world in our AMC 10 Problem Series online course.
CHECK SCHEDULE

Difference between revisions of "2014 AMC 10B Problems"

(Problem 8)
(Problem 24)
Line 71: Line 71:
  
 
==Problem 24==
 
==Problem 24==
 +
The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] if it is not true that for every <math>n</math> from <math>1</math> to <math>15</math> one can find a subset of the numbers that appear consecutively on the circle that sum to <math>n</math>. Arrangements that differ only by a rotation or a reflection are considered the same. How many different bad arrangements are there?
 +
 +
<math> \textbf {(A) } 1 \qquad \textbf {(B) } 2 \qquad \textbf {(C) } 3 \qquad \textbf {(D) } 4 \qquad \textbf {(E) } 5 </math>
  
 
==Problem 25==
 
==Problem 25==

Revision as of 12:03, 20 February 2014

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. Unknown error_msg) 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 ${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

Problem 13

Problem 14

Problem 15

Problem 16

Problem 17

Problem 18

Problem 19

Problem 20

Problem 21

Problem 22

Problem 23

Problem 24

The numbers 1, 2, 3, 4, 5 are to be arranged in a circle. An arrangement is [i]bad[/i] 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