Difference between revisions of "2016 AMC 12A Problems"
(→Problem 14) |
(→Problem 25) |
||
Line 222: | Line 222: | ||
==Problem 25== | ==Problem 25== | ||
− | Let k be a positive integer. Bernardo and Silvia take turns writing and erasing numbers on a blackboard as follows: Bernardo starts by writing the smallest perfect square with k+1 digits. Every time Bernardo writes a number, Silvia erases the last k digits of it. Bernardo then writes the next perfect square, Silvia erases the last k digits of it, and this process continues until the last two numbers that remain on the board differ by at least 2. Let f(k) be the smallest positive integer not written on the board. For example, if k = 1, then the numbers that Bernardo writes are 16, 25, 36, 49, 64, and the numbers showing on the board after Silvia erases are 1, 2, 3, 4, and 6, and thus f(1) = 5. What is the sum of the digits of f(2) + f(4)+ f(6) + ... + f(2016)? | + | Let k be a positive integer. Bernardo and Silvia take turns writing and erasing numbers on a blackboard as follows: Bernardo starts by writing the smallest perfect square with <math>k+1</math> digits. Every time Bernardo writes a number, Silvia erases the last k digits of it. Bernardo then writes the next perfect square, Silvia erases the last k digits of it, and this process continues until the last two numbers that remain on the board differ by at least 2. Let <math>f(k)</math> be the smallest positive integer not written on the board. For example, if <math>k = 1</math>, then the numbers that Bernardo writes are <math>16, 25, 36, 49, 64</math>, and the numbers showing on the board after Silvia erases are <math>1, 2, 3, 4,</math> and <math>6</math>, and thus <math>f(1) = 5</math>. What is the sum of the digits of <math>f(2) + f(4)+ f(6) + ... + f(2016)</math>? |
<math>\textbf{(A)}\ 7986\qquad\textbf{(B)}\ 8002\qquad\textbf{(C)}\ 8030\qquad\textbf{(D)}\ 8048\qquad\textbf{(E)}\ 8064</math> | <math>\textbf{(A)}\ 7986\qquad\textbf{(B)}\ 8002\qquad\textbf{(C)}\ 8030\qquad\textbf{(D)}\ 8048\qquad\textbf{(E)}\ 8064</math> | ||
[[2016 AMC 12A Problems/Problem 25|Solution]] | [[2016 AMC 12A Problems/Problem 25|Solution]] |
Revision as of 23:32, 3 February 2016
2016 AMC 12A (Answer Key) Printable versions: • AoPS Resources • PDF | ||
Instructions
| ||
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 |
Contents
- 1 Problem 1
- 2 Problem 2
- 3 Problem 3
- 4 Problem 4
- 5 Problem 5
- 6 Problem 6
- 7 Problem 7
- 8 Problem 8
- 9 Problem 9
- 10 Problem 10
- 11 Problem 11
- 12 Problem 12
- 13 Problem 13
- 14 Problem 14
- 15 Problem 15
- 16 Problem 16
- 17 Problem 17
- 18 Problem 18
- 19 Problem 19
- 20 Problem 20
- 21 Problem 21
- 22 Problem 22
- 23 Problem 23
- 24 Problem 24
- 25 Problem 25
Problem 1
What is the value of ?
Problem 2
For what value of does ?
Problem 3
The remainder function can be defined for all real numbers and with by
,
where denotes the greatest integer less than or equal to . What is the value of ?
Problem 4
The mean, median, and mode of the 7 data values are all equal to . What is the value of ?
Problem 5
Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two prime numbers (for example, ). So far, no one has been able to prove that the conjecture is true, and no one has found a counterexample to show that the conjecture is false. What would a counterexample consist of?
Problem 6
A triangular array of 2016 coins in the first row, 2 coins in the second row, 3 coins in the third row, and so on up to coins in the th row. What is the sum of the digits of ?
Problem 7
Which of these describes the graph of ?
Problem 8
What is the area of the shaded reigon of the given rectangle?
TODO: Diagram
Problem 9
The five small shaded squares inside this unit square are congruent and have disjoint interiors. The midpoint of each side of the middle square coincides with one of the vertices of the other four small squares as shown. The common side length is , where and are positive integers. What is ?
TODO: Diagram
Problem 10
Five friends sat in a movie theater in a row containing seats, numbered to from left to right. (The directions "left" and "right" are from the point of view of the people as they sit in the seats.) During the movie Ada went to the lobby to get some popcorn. When she returned, she found that Bea had moved two seats to the right, Ceci had moved one seat to the left, and Dee and Edie had switched seats, leaving an end seat for Ada. In which seat had Ada been sitting before she got up?
Problem 11
Each of the 100 students in a certain summer camp can either sing, dance, or act. Some students have more than one talent, but no student has all three talents. There are 42 students who cannot sing, 65 students who cannot dance, and 29 students who cannot act. How many students have two of these talents?
Problem 12
In , , , and . Point lies on , and bisects . Point lies on , and bisects . The bisectors intersect at . What is the ratio : ?
TODO: Diagram
Problem 13
Problem text
Problem 14
Each vertex of a cube is to be labeled with an integer from 1 through 8, with each integer being used once, in such a way that the sum of the four numbers on the vertices of a face is the same for each face. Arrangements that can be obtained from each other through rotations of the cube are considered to be the same. How many different arrangements are possible?
Problem 15
Problem text
Problem 16
Problem text
Problem 17
Problem text
Problem 18
Problem text
Problem 19
Problem text
Problem 20
Problem text
Problem 21
Problem text
Problem 22
Problem text
Problem 23
Problem text
Problem 24
Problem text
Problem 25
Let k be a positive integer. Bernardo and Silvia take turns writing and erasing numbers on a blackboard as follows: Bernardo starts by writing the smallest perfect square with digits. Every time Bernardo writes a number, Silvia erases the last k digits of it. Bernardo then writes the next perfect square, Silvia erases the last k digits of it, and this process continues until the last two numbers that remain on the board differ by at least 2. Let be the smallest positive integer not written on the board. For example, if , then the numbers that Bernardo writes are , and the numbers showing on the board after Silvia erases are and , and thus . What is the sum of the digits of ?