General Solutions
General Solutions
1. Robin goes birdwatching one day. He sees three types of birds: penguins, pigeons, and robins.
2 1
3 of the birds he sees are robins. 8 of the birds he sees are penguins. He sees exactly 5 pigeons.
How many robins does Robin see?
Answer: 16
2 1 5
Solution: 1 − − = of the birds that Robin sees are pigeons. Therefore, Robin sees
3 8 24
5 2
exactly = 24 birds, so · 24 = 16 robins.
5 3
24
2. Jimmy runs a successful pizza shop. In the middle of a busy day, he realizes that he is running
low on ingredients. Each pizza must have 1 lb of dough, 14 lb of cheese, 61 lb of sauce, and 13
lb of toppings, which include pepperonis, mushrooms, olives, and sausages. Given that Jimmy
currently has 200 lbs of dough, 20 lbs of cheese, 20 lbs of sauce, 15 lbs of pepperonis, 5 lbs of
mushrooms, 5 lbs of olives, and 10 lbs of sausages, what is the maximum number of pizzas that
Jimmy can make?
Answer: 80
Solution: The limiting factor is the cheese. With only 20 lbs of cheese, the most pizzas that
can be made is 20 · 4 = 80 .
3. Queen Jack likes a 5-card hand if and only if the hand contains only queens and jacks. Consid-
ering all possible 5-card hands that can come from a standard 52-card deck, how many hands
does Queen Jack like?
Answer: 56
Solution: There are a total of 8 queens and jacks, each of which is distinguishable from the
8
others. Thus, the number of hands that Queen Jack likes is 5 = 56 .
4. What is the smallest number over 9000 that is divisible by the first four primes?
Answer: 9030
Solution: The first four primes are 2, 3, 5, and 7, so the number must be a multiple of
2 · 3 · 5 · 7 = 210. The least multiple of 210 that is greater than 9000 is 210 · 43 = 9030 .
5. A rhombus has area 36 and the longer diagonal is twice as long as the shorter diagonal. What
is the perimeter of the rhombus?
√
Answer: 12 5
Solution: Let d be the length of the shorter diagonal and 2d the length of the longer diagonal. If
d1 , d2 are the lengths of the diagonals of a rhombus, its area will be d12·d2 . Thus, we have d2 = 36
√ √
and d = 6. Therefore, the side length of the rhombus is 32 + 62 = 3 5, so the perimeter is
√
12 5 .
6. Nick is a runner, and his goal is to complete four laps around a circuit at an average speed of
10 mph. If he completes the first three laps at a constant speed of only 9 mph, what speed does
he need to maintain in miles per hour on the fourth lap to achieve his goal?
Answer: 15
Solution: Let d be the length of one lap in miles. Then he needs to complete the four laps in
4d 2d 3d d 2d d d
10 = 5 hours. He has already spent 9 = 3 hours on the first three laps, so he has 5 − 3 = 15
hours left. Therefore, he must maintain a speed of 15 mph on the final lap.
SMT 2013 General Test Solutions February 2, 2013
7. A fly and an ant are on one corner of a unit cube. They wish to head to the opposite corner
of the cube. The fly can fly through the interior of the cube, while the ant has to walk across
the faces of the cube. How much shorter is the fly’s path if both insects take the shortest path
possible?
√ √
Answer: 5 − 3
Solution: The fly’s path is the space diagonal of the cube, √ or the hypotenuse of the right
triangle with one leg as a face diagonal of the√cube (length
√ 2) and the other leg as an edge of
the cube (length 1). Thus, it has a length of 2 + 1 = 3. The ant’s path crosses two faces of
the cube to reach the opposite corner and is minimized as the diagonal of the rectangle formed
by these two faces when flattened√out. Thus, √ it is the hypotenuse of a right triangle with legs
of length 2 and 1 and has length 4 + 1 = 5. The difference in length between the ant’s path
√ √
and the fly’s path is 5 − 3 .
8. According to Moor’s Law, the number of shoes in Moor’s room doubles every year. In 2013,
Moor’s room starts out having exactly one pair of shoes. If shoes always come in unique, match-
ing pairs, what is the earliest year when Moor has the ability to wear at least 500 mismatched
pairs of shoes? Note that left and right shoes are distinct, and Moor must always wear one of
each.
Answer: 2018
Solution: If there are n pairs of shoes, then the number of mismatched pairs is n(n − 1). In
2017, there are 16 pairs of shoes, so there are 16 · 15 = 240 < 500 possible mismatchings. In
2018, there are 32 pairs of shoes, so there are 32 · 31 = 992 > 500 possible mismatchings.
9. A tree has 10 pounds of apples at dawn. Every afternoon, a bird comes and eats x pounds of
apples. Overnight, the amount of food on the tree increases by 10%. What is the maximum
value of x such that the bird can sustain itself indefinitely on the tree without the tree running
out of food?
Answer: 10/11
Solution: After removing x from 10, and then increasing that amount by 10%, we must end
up with at least the amount we started with, 10 pounds. That is, the maximum value of x must
satisfy 11
10 (10 − x) = 10. Solving for x, we get that x = 10/11 .
10. Consider a sequence given by an = an−1 + 3an−2 + an−3 , where a0 = a1 = a2 = 1. What is the
remainder of a2013 divided by 7?
Answer: 5
Solution: In order to find the remainder mod 7, evaluate the sequence mod 7: 1 + 3 + 1 ≡
5 mod 7, 5 + 3 · 1 + 1 ≡ 2 mod 7, and so on. The sequence repeats itself after 6 iterations,
producing
1, 1, 1, 5, 2, 4, 1, 1, 1, . . .
Since 2013 ≡ 3 mod 6, then a2013 ≡ a3 ≡ 5 mod 7.
√
11. Sara has an ice cream cone with every meal. The cone has a height of 2 2 inches and the base
of the cone has a diameter of 2 inches. Ice cream protrudes from the top of the cone in a perfect
hemisphere. Find the surface area of the ice cream cone, ice cream included, in square inches.
Answer: 5π
SMT 2013 General Test Solutions February 2, 2013
2
q √
Solution: The radius of the cone is = 1, so the lateral height of the cone is 12 + (2 2)2 = 3
2
and the lateral surface area of the cone is π · 1 · 3 = 3π. Next, the surface area of the hemisphere
is 2πr2 = 2π. Thus, the total surface area is 2π + 3π = 5π .
12. What is the greatest possible value of c such that x2 + 5x + c = 0 has at least one real solution?
25
Answer: 4
Solution: For an equation to have real solutions, the discriminant must be nonnegative. Thus,
25
we have b2 − 4ac = 52 − 4c ≥ 0 or ≥ c.
4
13. R2 -tic-tac-toe is a game where two players take turns putting red and blue points anywhere on
the xy plane. The red player moves first. The first player to get 3 of their points in a line
without any of their opponent’s points in between wins. What is the least number of moves
in which Red can guarantee a win? (We count each time that Red places a point as a move,
including when Red places its winning point.)
Answer: 4
Solution: If Red only places 3 points, then Blue can get in between Red’s first 2 points and
block the third point from winning. Therefore, the answer is no smaller than 4.
Now, we will describe a strategy that enables Red to win in 4 moves. First, Red places a point
r1 and then Blue places a point b1 . Then, Red places a point r2 such that r1 , r2 , and b1 are not
collinear. Blue must now place a point b2 between r1 and r2 in order to avoid losing immediately.
Red must now place a point r3 between b1 and b2 to avoid losing immediately. But now, r3 r1
and r3 r2 are both lines without any blue points between them. So, no matter which line Blue
chooses to block, Red can immediately place a point r3 on the other line such that there are 3
red points in in a row.
Therefore, Red needs 4 moves to guarantee a win.
14. Peter is chasing after Rob. Rob is running on the line y = 2x + 5 at a speed of 2 units a second,
starting from the point (0, 5). Peter starts running t seconds after Rob, running at 3 units a
second. Peter also starts at (0, 5), and catches up to Rob at the point (17, 39). What is the
value of t?
√
17 5
Answer:
6
√ √
Solution:
√ Rob runs a distance of 172 + 342 = 17 5 units. √ Therefore, Rob runs for a total
17 5 17 5
of seconds. Peter must therefore run a total of − t seconds, and we know that
2√ ! √ 2
17 5 √ 17 5
3 − t = 17 5. Solving for t, we get t = .
2 6
15. Given regular hexagon ABCDEF , compute the probability that a randomly chosen point inside
the hexagon is inside triangle P QR, where P is the midpoint of AB, Q is the midpoint of CD,
and R is the midpoint of EF .
3
Answer:
8
Solution: If we partition the hexagon into six equilateral triangles by drawing AD, BE, and
CF , we get 6 congruent equilateral triangles. If we then take each equilateral triangle and
SMT 2013 General Test Solutions February 2, 2013
partition each one into four smaller equilateral triangles by means of connecting the midpoints
of the sides, we note that P QR contains 9 of the small equilateral triangles while ABCDEF
3
contains 24 of the small equilateral triangles. The probability therefore follows as .
8
16. Eight people are posing together in a straight line for a photo. Alice and Bob must stand next
to each other, and Claire and Derek must stand next to each other. How many different ways
can the eight people pose for their photo?
Answer: 2880
Solution: Imagine that there are six slots that people can fit into. Alice and Bob go into one
slot, Claire and Derek go into another slot, and each of the remaining four people get a slot.
There are 6! = 720 ways for the six slots to be assigned, and then there are 2 ways for Alice
and Bob to stand, and there are also 2 ways for Claire and Derek to stand, thereby giving
720 × 22 = 2880 ways for all of them to pose for the picture.
17. An isosceles right triangle is inscribed in a circle of radius 5, thereby separating the circle into
four regions. Compute the sum of the areas of the two smallest regions.
25π
Answer: − 25
2
Solution:
We use the fact that the hypotenuse of any right triangle that is inscribed in a circle is actually
a diameter of the circle.
25π
The area of the circle is 25π. The hypotenuse creates two semicircles of area each. The legs
2 √
(5 2)2
divide one of these semicircles into three regions, including a right triangle with area =
2
25π 25π
25. The other two regions sum to − 25. Since 25 > − 25, the sum of the areas of the
2 2
25π
two smallest regions is − 25 .
2
18. Caroline wants to plant 10 trees in her orchard. Planting n apple trees requires n2 square meters,
planting n apricot trees requires 5n square meters, and planting n plum trees requires n3 square
meters. If she is committed to growing only apple, apricot, and plum trees, what is the least
amount of space, in square meters, that her garden will take up?
Answer: 40
Solution: If we plant apple trees, the first apple tree requires 1 square meter to grow. The
second one requires 3 = 22 − 12 square meters to grow, the third one requires 5 = 32 − 22 ,
and the fourth one requires 7 = 42 − 32 . If we plant apricot trees, each tree requires 5 square
meters to grow. If we plant plum trees, the first plum tree requires 1 square meter whereas
each subsequent one will require at least 7 = 23 − 13 square meters. Thus, to take up the least
amount of space, we should plant 3 apple trees, 6 apricot trees, and 1 plum tree for a total of
40 square meters.
19. A triangle with side lengths 2 and 3 has an area of 3. Compute the third side length of the
triangle.
√
Answer: 13
SMT 2013 General Test Solutions February 2, 2013
2·3
Solution: Note that = 3, so therefore the triangle is a right triangle with legs 2 and 3. As
2 √
√
a result, the third side length is, by the Pythagorean Theorem, 22 + 32 = 13 .
20. Ben is throwing darts at a circular target with diameter 10. Ben never misses the target when he
throws a dart, but he is equally likely to hit any point on the target. Ben gets d5 − xe points for
having the dart land x units away from the center of the target. What is the expected number
of points that Ben can earn from throwing a single dart? (Note that dye denotes the smallest
integer greater than or equal to y.)
11
Answer:
5
Solution: We can split the target into five concentric circles with radii 1, 2, 3, 4, and 5; the
five corresponding regions have areas of π, 3π, 5π, 7π, 9π and are worth 5, 4, 3, 2, 1 points
5 · π + 4 · 3π + 3 · 5π + 2 · 7π + 1 · 9π 11
respectively. Thus the answer is = .
25π 5
21. How many positive three-digit integers a b c can represent a valid date in 2013, where either a
corresponds to a month and b c corresponds to the day in that month, or a b corresponds to a
month and c corresponds to the day? For example, 202 is a valid representation for February
2nd, and 121 could represent either January 21st or December 1st.
Answer: 273
Solution: The integers which are valid have a 1-1 correspondence to days in the first 9 months
– this is straightforward to see for all positive integers that do not have a 1 in the hundreds
place and just requires careful inspection of the case where 1 is in the hundreds place. There
are 365 − 31 − 30 − 31 = 273 such days.
22. The set A = {1, 2, 3, . . . , 10} contains the numbers 1 through 10. A subset of A of size n is
competent if it contains n as an element. A subset of A is minimally competent if it itself is
competent, but none of its proper subsets are. Find the total number of minimally competent
subsets of A.
Answer: 55
Solution: There is clearly 1 minimally competent subset of size 1, which is just {1}. For
size 2, any minimally competent subset must contain 2 and then one of 3 through 10 (not 1,
because then the minimally competent subset of size 1 would be a proper subset), so there are 8
possibilities. For size k in general, we can see that a minimally competent subset of size k must
contain k and then k − 1 numbers, each larger than k. Thus, a minimally competent subset can
contain at most 5 numbers.
The answer is then 5k=1 10−k
P
k−1 , which can be computed directly as 55 . We can also argue by
induction that the number is equal to F10 (the 10th Fibonacci number), which may be easier to
compute.
24. Compute the square of the distance between the incenter (center of the inscribed circle) and
circumcenter (center of the circumscribed circle) of a 30-60-90 right triangle with hypotenuse of
length 2.
√
Answer: 2 − 3
Solution: Orient the triangle such that the right angle of the triangle is at the origin, and such
that the two legs point in the directions of the positive x- and y-axes. Note that the incenter
is at (r, r), √
where r is the inradius of the circle, but since the area is A = rs, we have that
3 √ √ ! √ !
A 2√ = 3 1 3 3 1
r= = √ . The circumcenter is at either , or , .
s 3+ 3 3+ 3 2 2 2 2
2
√
The square of the distance between the incenter and the circumcenter is therefore 2 − 3 .
25. A 3×6 grid is filled with the numbers in the list {1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9} accord-
ing to the following rules: (1) Both the first three columns and the last three columns contain
the integers 1 through 9. (2) No number appears more than once in a given row. Let N be the
number of ways to fill the grid and let k be the largest positive integer such that 2k divides N .
What is k?
Answer: 13
Solution: First, note that we can fill the first 3 columns with any permutation of the numbers 1
through 9. Thus, there are 9! ways to do this. Next, we must consider how many ways there are
to place numbers in the remaining three columns. This problem can be broken into two parts:
splitting the numbers into each of 3 rows, and permuting the numbers in each row. For the
first part, either the rows switch positions without their contents mixing (2 ways) or each new
row has one number from one row and two numbers from another row. In this second option,
there are 33 = 27 ways to split each original row into a single and a pair, and 2 ways to arrange
these singles and pairs. So we have a total of 2 + 27 · 2 = 56 ways. For the second part, we
note that each set of 3 elements in a row can be permuted in 3! ways, giving a total of 56 · (3!)3
ways to fill the last 3 columns, given a particular permutation for the first three columns. Thus,
N = 9! · 56 · 63 , and therefore N is divisible by 2k for k ≤ 7 + 3 + 3 = 13 .