AMC 10 Daily Practice Round 2
Complete problem set with solutions and individual problem pages
Define for all real numbers and . Find the value of .
- A.
- B.
- C.
- D.
- E.
※,
※.
∴ ※(※).
A bicycle has two wheels, while a tricycle has three wheels. There are a such vehicles with wheels. Find the number of bicycles.
- A.
- B.
- C.
- D.
- E.
Suppose that all vehicles are tricycles, then there are bicycles. Alternatively, we can also set up system of linear equations to solve the problem.
Real numbers ,, and satisfy the inequalities ,, and . Which of the following numbers is necessarily positive?
- A.
- B.
- C.
- D.
- E.
Notice that must be positive because . Therefore the answer is .
The other choices:
As grows closer to , decreases and thus becomes less than .
can be as small as possible , so grows close to as approaches .
For all , , and thus it is always negative.
The same logic as above, but when this time.
Two squares of side lengths and lie within a third square of side length , as shown below. What is the area of the shaded region?

- A.
- B.
- C.
- D.
- E.
Each of the shaded triangles can be paired with a congruent but unshaded triangle, and vice versa. Hence, the shaded region and the combined unshaded regions have the same area, so the shaded region has half the area of the entire square. The requested answer is therefore .
A palindrome is a number that has the same value when read from left to right or from right to left. (For example, is a palindrome.) Determine the number of palindromes between and .
- A.
- B.
- C.
- D.
- E.
Enumerate based on patterns: , , , , , , , , , , .
Jason walks from his home to school. If he walks meters per minute, he will be minutes late; if he walks meters per minute, he will be minutes late. In order to arrive on time, how fast should Jason walk in meters per minute?
- A.
- B.
- C.
- D.
- E.
The required time is minutes. meters per minute. Alternatively, we can also set up a rational equation to solve the problem.
Which of the following numbers is a perfect square?
- A.
- B.
- C.
- D.
- E.
Note that for all positive , we have .
We must find a value of such that is a perfect square. Since is a perfect square, we must also have be a perfect square. In order for to be a perfect square, must be twice a perfect square. From the answer choices, works, thus, and our desired answer is .
Consider the Fibonacci Sequence , , , , , , . Starting the third number, each succeeding number is the sum of the previous two numbers. Among the first numbers in the sequence, how many of them are multiples of ?
- A.
- B.
- C.
- D.
- E.
We can determine the pattern of remainders when each term in the sequence is divided by : , , , , , , , , , , , , , , , , , , , , , , , , . We find that a remainder of appears once for every numbers if the divisor is . As , there are such numbers.
A rectangle has and . Points and lie on sides and , respectively, such that and the area of is . What is ?
- A.
- B.
- C.
- D.
- E.
Since the area of is , we get that . Thus, . Let . Then and , so . Expanding and factoring gives , so either or .
If , then and , which is impossible, so thus . This gives and . Since is a rectangle, , so applying the Pythagorean Theorem on gives . Thus, .
Cards labeled from to are distributed to students A, B, and C, three cards each person without repetition. The following are the conversations between the students.
A: The three numbers on my cards form an arithmetic sequence.
B: Me too.
C: Only my cards do not form an arithmetic sequence.
Suppose that everyone is telling the truth, find the minimum of the sum of the numbers in three cards of C.
- A.
- B.
- C.
- D.
- E.
As the numbers of A and B form arithmetic sequences, their sums must be multiples of . The sum of cards is , which is also a multiple of . Therefore, the sum of C is also a multiple of . The sum of C can not be , so the sum is at least . Check and find is the correct answer.
A:
B:
C:
Consider positive integers such that , which of the following is a possible value of ?
- A.
- B.
- C.
- D.
- E.
None of the above
Since , , and are both prime and .
Let , , , , , , , ,
Then ,
So we are good as long as is not prime.
For example, .
This is true when , , , .
In the coordinate system, the and coordinates of the intersection point between lines and are both integers. How many possible values of are there?
- A.
- B.
- C.
- D.
- E.
Construct the system .
Plug the first equation into the second equation, we have .
It is clear that , so we have .
When or , is an integer, and now is also an integer.
Therefore, , four of them.
Let be a convex quadrilateral such that and. Let be the intersection of the diagonals and . If , find the area of .
- A.
- B.
- C.
- D.
- E.
Construct .
∵ , ,
∴ .
∵ ,
∴ , ,
∵ ,
∴ ,
∵ , ,
∴ ,
∴ , or , ,
∴ ,
,
∴ .
Therefore, .
Circles , , and each have radius . Circles and share one point of tangency. Circle has a point of tangency with the midpoint of . One side of rectangle is tangent to both circles and , and its opposite side is tangent to circle . The other two sides are tangent to circles and , respectively. What is the area of the part that is inside the rectangle but not inside the circle?
- A.
- B.
- C.
- D.
- E.

By the principle of inclusion-exclusion, it can be deduced that the desired area is equal to the area of the rectangle minus the sum of the areas of the three circles , and , plus the overlapping area between circle and circles and .
Then, we can compute the shaded area as the area of half of plus the area of the rectangle minus the area of the two sectors created by and . This is .
The area of the rectangle is , so the area is .
Consider a -problem test with multiple choices and fill-in-the-blanks. Each multiple choice worth points and each fill-in-the-blank worth points. The overall correct rate is (accross the problems). In addition, the correct rate of fill-in-the-blanks is and the average score is . Determine the correct rate of multiple choices.
- A.
- B.
- C.
- D.
- E.
Average number of problems correct: .
Average number of correct fill-in-the-blanks: , so average number of correct multiple choices: .
There are multiple choices, so there are fill-in-the-blanks.
Correct rate on multiple choices: .
In how many ways can apples and oranges be arranged in a line such that any oranges are separated by at least apples?
- A.
- B.
- C.
- D.
- E.
Observe that for each such arrangement, we can remove apples between each of the pairs of adjacent orange (i.e. pairs of orange with no orange between them) to obtain an arbitrary arrangement of apples and oranges. Conversely, starting with any arrangement of apples and oranges, adding apples between each pair of adjacent oranges yields an arrangement of apples and oranges such that any oranges are separated by at least apples. Hence, the number of desired arrangements equals the number of arrangements of apples and oranges, or .
The roots of equation with respect to are , respectively, while are rational numbers that are not all . Determine .
- A.
- B.
- C.
- D.
- E.
By Vieta's Formula on higher power,
. As , we have or .
① If , then . Solve to get (not applicable) or ;
② If , then . Solve to get .
Therefore, or .
or . Each case gives the sum of .
Refer to the figure below. In parallelogram , . Construct a circle from such that it is tangent to both and with tangent points and , repsectively. The circle also intersects with and at and , respectively. If and , determine the perimeter of parallelogram .
- A.
- B.
- C.
- D.
- E.
Let , then . Also, and .
∵ ,
∴ .
∵ ,
∴ and .
By , we have ,
∴ ,
∴ .
Suppose that and are both quadratic functions with quadratic coefficient . If and , determine .
- A.
- B.
- C.
- D.
- E.
If and , by the given conditions,
①;
②.
①② gives , so ;
①② gives , .
Also, by , we have .
∴ and ,
∴ .
Let .
We can readily get is also a quadratic function with quadratic coefficient .
Also, , ,
∴ ,
∴ ,
∴ and .
Three diagonals are drawn in a regular hexagon of side length , splitting the hexagon into several regions. What is the least possible area of such a region?
- A.
- B.
- C.
- D.
- E.

Above, the two diagonals stemming from a common vertex are and , which form the smallest angle possible of , and the third diagonal bounds as tightly as possible.
The area we seek is . First, triangles and are similar in ratio , so or, equivalently, . Additionally, by symmetry, which yields that . Therefore, Now, triangles and share an altitude from , implying . Then, since is a -- triangle with leg length , it has area , giving us the requested answer of .
Jacob uses the following procedure to write down a sequence of numbers. First he chooses the first term to be . To generate each succeeding term, he flips a fair coin. If it comes up heads, he doubles the previous term and subtracts . If it comes up tails, he takes half of the previous term and subtracts
. The probability that the th term is an integer is less than . What is the minimum value of ?
- A.
- B.
- C.
- D.
- E.
We construct a tree showing all possible outcomes that Jacob may get after flips; we can do this because there are only possibilities:
Similarily, we found the probabililty for the th term to be an integer is , for the th term to be an integer is . So the answer is .
Consider four spheres in the same space with radii , , , , respectively. Each of the four spheres are externally tangent to the other three spheres. There is a fifth sphere such that is externally tangent to all four original spheres. Determine the radius of the fifth sphere.
- A.
- B.
- C.
- D.
- E.
Let the centers of the spheres with radii be and , respectively. Similarly, let the centers of the spheres with radii be and , respectively.
Then we can readily get and .
In addition, .
Let the center of the fifth sphere be and radius . So is inside the tetrahedron . and . Take the midpoint of and denote as . Connect and , so and .
∴ Plane is the perpendicular bisector plane of and we denote as ,
∴ is in the plane . Also, by , we have is in the perpendicular bisector plane of ,
∴ is on the altitude of the base of , which is . is the midpoint of . Then, we calculate that ,
∴ is an equilateral triangle adn , , ,
Plug in, .
The final equation is . Solve to get .
Let denote the greatest integer less than or equal to . Find the number of positive integer that satisfy .
- A.
- B.
- C.
- D.
- E.
By ,
∴ ,
∴ ,
∴ ,
∴ ,
So to get , or , .
Travis has to babysit the terrible Thompson triplets. Knowing that they love big numbers, Travis devises a counting game for them. First Tadd will say the number , then Todd must say the next two numbers ( and ), then Tucker must say the next three numbers (, , ), then Tadd must say the next four numbers (, , , ), and the process continues to rotate through the three children in order,each saying one more number than the previous child did, until the number is reached. What is the number said by Tadd?
- A.
- B.
- C.
- D.
- E.
Define a round as one complete rotation through each of the three children.
We create a table to keep track of what numbers each child says for each round.
| Round Tadd Todd Tucker |
Notice that at the end of the , the last number said is the triangular number.
Tadd says number in round , , numbers in round , numbers in round , and in general numbers in round , At the end of round , the number of numbers Tadd has said so far is , by the arithmetic series sum formula. We therefore want the smallest positive integer such that . The value of will tell us in which round Tadd says his number. Through guess and check (or by actually solving the quadratic inequality), .
Now, using our formula , Tadd says numbers in the first rounds, so we are looking for the number Tadd says in the round.
We found that the last number said at the very end of the round is the triangular number.
For , the triangular number is . Thus the answer is .
For every integer , we can represent it by , is a nonnegative integer and is an odd number. . Find .
- A.
- B.
- C.
- D.
- E.
By the definition, we know .
So for those , .
Let
.
, when , is a nonnegative integer.
Subsitute we have .
A less rigorous but time-saving approach to the exam can be to write the first terms of and , then you may find out and , that will also give you the answer is .
In computer science, there is a cool method to calculate the value of for each , which is , commonly referred to as "lowbit". This involves many interesting properties of binary numbers, and children interested in this topic can search and learn more about it.
- 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
