The volume of a rectangular box equals the area of its base times its height.
Thus, the height equals the volume divided by the area of the base.
The area of the base of the given box is .
Therefore, the height of the given box is .
Answer: (C)
Solution 1 is an exterior angle of .
Thus, .
Therefore, and so .
Solution 2
The sum of the angles of is , and so Since and are supplementary, then , and so .
Answer: (D)
From the given graph, 3 provinces and territories joined Confederation between 1890 and 1929, and 1 between 1930 and 1969.
Thus, between 1890 and 1969, a total of 4 provinces and territories joined Confederation.
Therefore, if one of the 13 provinces and territories is chosen at random, the probability that it joined Confederation between 1890 and 1969 is .
Answer: (B)
Since , then .
Alternatively, we note that since , then . If , then and if , then .
Answer: (B)
First, we note that .
Since , then the given expression also equals .
Since , then the given expression also equals .
We also see that .
Therefore, the only remaining expression is .
We note further that , which is not equal to 3.14.
Answer: (C)
Violet starts with one-half of the money that she needed to buy the necklace.
After her sister gives her money, she has three-quarters of the amount that she needs.
This means that her sister gave her of the total amount that she needs.
Since she now has three-quarters of the amount that she needs, then she still needs one-quarter of the total cost.
In other words, her father will give her the same amount that her sister gave her, or $30.
Answer: (D)
Since January 5 is a Monday and Mondays are 7 days apart, then January 12, 19 and 26 are also Mondays.
Since John goes for a run every 3 days, the dates in January on which he runs are January 5, 8, 11, 14, 17, 20, 23, 26, and 29.
The first of the Mondays on which John goes for a run after January 5 is January 26.
Answer: (C)
Solution 1
Since is a square and and are perpendicular to , then and are parallel to and .
Similarly, and are parallel to and .
Therefore, if we extend and to meet and extend and to meet , then square is divided into 9 rectangles.
Since and , then in fact is divided into 9 squares, each of which is 1 by 1.
Of these 9 squares, 6 are shaded and 3 are unshaded.
Therefore, the ratio of the shaded area to the unshaded area is , which equals .
Solution 2
Consider quadrilateral . has three right angles: at and because and are perpendicular to and , respectively, and at because is a square. Since has three right angles, then it has four right angles and so is a rectangle.
Since , then is actually a square and has side length 1, and so has area , or 1.
Similarly, is a square of side length 2, and so has area , or 4.
Since square is , then its area is , or 9.
The area of the unshaded region is equal to the difference between the areas of square and square , or .
Since square has area 9 and the area of the unshaded region is 3, then the area of the shaded region is .
Finally, the ratio of the shaded area to the unshaded area is , which equals .
Answer: (A)
From the given definition,
Answer: (E)
The line with equation has slope .
Since the line segment joining and is parallel to the line with equation , then the slope of this line segment is .
Therefore, or .
Thus, .
Answer: (E)
Solution 1
The two teams include a total of players.
There are exactly 36 students who are at least one team.
Thus, there are students who are counted twice.
Therefore, there are 8 students who play both baseball and hockey.
Solution 2
Suppose that there are students who play both baseball and hockey.
Since there are 25 students who play baseball, then of these play baseball and not hockey.
Since there are 19 students who play hockey, then of these play hockey and not baseball.
Since 36 students play either baseball or hockey or both, then (The left side is the sum of the numbers of those who play baseball and not hockey, those who play hockey and not baseball, and those who play both.)
Therefore, and so .
Thus, 8 students play both baseball and hockey.
Answer: (B)
Since and the perimeter of is 22, then .
Since and , then .
Since has perimeter 22, then .
Since the perimeter of is 24, then Therefore, .
Answer: (D)
We note that Thus, .
Now for each positive integer , the ones digit of is 0:
One way to see this is to note that we obtain each successive factorial by multiplying the previous factorial by an integer. (For example, .)
Thus, if one factorial ends in a 0, then all subsequent factorials will also end in a 0.
Since the ones digit of is 0, then the ones digit of each with will also be 0.
Alternatively, we note that for each positive integer , the factorial is the product of the positive integers from to . When , the product represented by includes factors of both 2 and 5, and so has a factor of 10, thus has a ones digit of 0.
Therefore, the ones digit of each of , , , , and is 0, and so the ones digit of is 0.
Since the ones digit of is 3 and the ones digit of is 0, then the ones digit of is or .
(We can verify, using a calculator, that .)
Answer: (B)
In a magic square, the numbers in each row, the numbers in each column, and numbers on each diagonal have the same sum.
Since the sum of the numbers in the first row equals the sum of the numbers in the first column, then or .
Therefore, the sum of the numbers in any row, in any column, or along either diagonal equals the sum of the numbers in the third column, which is .
Using the first column, or .
Using the second row, or .
Thus, .
Answer: (C)
Suppose that Deanna drove at km/h for the first 30 minutes.
Since 30 minutes equals one-half of an hour, then in these 30 minutes, she drove km.
In the second 30 minutes, she drove at km/h.
Thus, in these second 30 minutes, she drove km.
Since she drove 100 km in total, then or .
Thus, or .
Therefore, Deanna drove 90 km/h for the first 30 minutes.
Answer: (B)
Let be the centre of the circle. Join and .
Since the diameter of the semicircle is 20, then its radius is half of this, or 10.
Since and are radii, then .
Consider and .
Since is a rectangle, both triangles are right-angled (at and ).
Also, (equal sides of the rectangle) and (since they are radii of the circle).
Therefore, is congruent to . (Right-angled triangles with equal hypotenuses and one other pair of equal corresponding sides are congruent.)
Since and are congruent, then .
Since , then .
Finally, since is right-angled at , then we can apply the Pythagorean Theorem to conclude that .
Answer: (A)
Consider a stack of bills with a total value of $1000 that includes $20 bills and $50 bills.
The $20 bills are worth and the $50 bills are worth , and so or .
Determining the number of possible stacks that the teller could have is equivalent to determining the numbers of pairs of integers with and and .
(We must have and because each stack includes at least one $20 bill and at least one $50 bill.)
Since , then , so .
This means that .
Since is an integer, then .
Also, since , then the right side is the difference between two even integers, so is itself even, which means that must be even.
Therefore, the possible values of are .
Each of these values gives a pair that satisfies the equation : Translating back to the original context, we see that the maximum number of stacks that the teller could have is 9.
Answer: (A)
First, we calculate the value of for each integer from to , inclusive: Therefore, there are at least 6 integer values of for which is an integer, namely .
Since 6 is the largest possible choice given, then it must be the correct answer (that is, it must be the case that there are no more values of that work).
We can justify this statement informally by noting that if we start with , then making larger has the effect of continuing to multiply by which keeps the numerator odd and the denominator even, and so is never an integer when . A similar argument holds when .
We could justify the statement more formally by re-writing For this product to be an integer, it must be the case that each of and is an integer.
(Each of and is either an integer or a fraction with numerator 1 and denominator equal to a power of 2 or 3. If each is such a fraction, then their product is less than 1 and so is not an integer. If exactly one is an integer, then their product equals a power of 2 divided by a power of 3 or vice versa. Such a fraction cannot be an integer since powers of 3 cannot be “divided out" of powers of 2 and vice versa.)
This means that (and so ) and (and so ).
Therefore, . The integers in this range are the six integers listed above.
Answer: (E)
We are given that three consecutive odd integers have an average of 7.
These three integers must be 5, 7 and 9.
One way to see this is to let the three integers be . (Consecutive odd integers differ by 2.)
Since the average of these three integers is 7, then their sum is .
Thus, or and so .
When is included, the average of the four integers equals their sum divided by 4, or .
This average is an integer whenever is divisible by 4.
Since 21 is 1 more than a multiple of 4, then must be 1 less than a multiple of 4 for the sum to be a multiple of 4.
The smallest positive integers that are 1 less than a multiple of 4 are 3, 7, 11, 15, 19.
Since cannot be equal to any of the original three integers 5, 7 and 9, then the three smallest possible values of are 3, 11 and 15.
The sum of these possible values is .
Answer: (D)
We label the players P, Q, R, S, T, U.
Each player plays 2 games against each of the other 5 players, and so each player plays 10 games. Thus, each player earns between 0 and 10 points, inclusive.
We show that a player must have at least points to guarantee that he has more points than every other player.
We do this by showing that it is possible to have two players with 9 points, and that if one player has or 10 points, then every other player has at most 9 points.
Suppose that P and Q each win both of their games against each of R, S, T, and U and tie each of their games against each other.
Then P and Q each have a record of 8 wins, 2 ties, 0 losses, giving them each or 9 points.
We note also that R, S, T, U each have 4 losses (2 against each of P and Q), so have at most 6 points.
Therefore, if a player has 9 points, it does not guarantee that he has more points than every other player, since in the scenario above both P and Q have 9 points.
Suppose next that P has or 10 points.
If P has 10 points, then P won every game that he played, which means that every other player lost at least 2 games, and so can have at most 8 points.
If P has points, then P must have 9 wins, 1 tie and 0 losses. (With points, P has only “lost" point and so cannot have lost any games and can only have tied 1 game.)
Since P has 9 wins, then P must have beaten each of the other players at least once. (If there was a player that P had not beaten, then P would have at most wins.)
Since every other player has at least 1 loss, then every other player has at most 9 points.
Therefore, if P has or 10 points, then P has more points than every other player.
In summary, if a player has or 10 points, then he is guaranteed to have more points than every other player, while if he has 9 points, it is possible to have the same number of points as another player.
Thus, the minimum number of points necessary to guarantee having more points than every other player is .
Answer: (D)
Nylah’s lights come on randomly at one of the times 7:00 p.m., 7:30 p.m., 8:00 p.m., 8:30 p.m., or 9:00 p.m., each with probability .
What is the probability that the lights come on at 7:00 p.m. and are on for hours with ?
If the lights come on at 7:00 p.m. and are on for between 4 and 5 hours, then they go off between 11:00 p.m. and 12:00 a.m.
Since the length of this interval is 1 hour and the length of the total interval of time in which the lights randomly go off is 2 hours (11:00 p.m. to 1:00 a.m.), then the probability that they go off between 11:00 p.m. and 12:00 a.m. is .
Therefore, the probability that the lights come on at 7:00 p.m. and are on for hours with is .
Similarly, if the lights come on at 7:30 p.m., they can go off between 11:30 p.m. and 12:30 a.m., and the probability of this combination of events is also .
Similarly again, the probability of the lights coming on at 8:00 p.m. and going off between 12:00 a.m. and 1:00 a.m. is also .
If the lights come on at 8:30 p.m., then to be on for between 4 and 5 hours, they must go off between 12:30 a.m. and 1:00 a.m. (They cannot stay on past 1:00 a.m.)
The probability of this combination is .
If the lights come on at 9:00 p.m., they cannot be on for more than 4 hours, since the latest that they can go off is 1:00 a.m.
Therefore, the probability that the lights are on for between 4 and 5 hours is .
(We note that we can safely ignore the question of whether the lights coming on at 7:30 p.m. and going off at exactly 11:30 p.m., for example, affects the probability calculation, because 11:30 p.m. is a single point in an interval containing an infinite number of points, and so does not affect the probability.)
Answer: (E)
We call an arrangement of tiles of a specific region that satisfies any given conditions a tiling.
Since no tile can cross the line , we can consider tilings of the regions and separately.
We proceed without including the units of metres on each dimension.
First, we determine the number of tilings of the region .
To be able to discuss this effectively, we split into 8 squares measuring and label these squares as shown in Figure 1.
Figure 1
Consider square . It must be covered with either a horizontal tile (covering ) or a vertical tile (covering ).
If is covered with a vertical tile , then must also be covered with a vertical tile , since is covered and its tile cannot overlap .
This gives the configuration in Figure 2.
Figure 2
The remaining square can be covered in the two ways shown in Figure 3 and Figure 4.
Figure 3
Figure 4
This gives 2 tilings of so far.
If is covered with a horizontal tile , then we focus on and .
Either and are covered by one horizontal tile (again leaving a square that can be covered in 2 ways as above (see Figures 5 and 6)) or and are each covered by vertical tiles and , which means that is covered with 1 horizontal tile (see Figure 7).
Figure 5
Figure 6
Figure 7
So if is covered with a horizontal tile, there are tilings.
In total, there are possible tilings of the region .
Consider now region .
Suppose that the number of tilings of the region is .
Then for each of the 5 tilings of , there are tilings of , so there will be tilings of the entire region .
Divide into squares and label them as shown in Figure 8. We define and to be the midpoints of and , respectively.
Figure 8
We consider two cases – either the line is overlapped by a tile, or it isn’t.
If is not overlapped by a tile, then each of and is a region to be tiled, and so can be tiled in 5 ways, as we saw with .
In this case, the number of tilings of is .
Suppose that is overlapped by at least one tile.
If is covered by a horizontal tile, then and are covered by vertical tiles.
In this case, either is covered by a horizontal tile (Figure 9), or each of and is covered by a vertical tile (Figure 10).
Figure 9
Figure 10
In the first case (Figure 9), the upper region needs to be tiled and there are 5 ways to do this, as above.
In the second case (Figure 10), the remaining tiling is forced to be as shown in Figure 11. Can you see why?
Figure 11
Therefore, if is covered by a horizontal tile, there are tilings.
Suppose that is not covered by a horizontal tile, but is covered by a horizontal tile.
Then and are each covered by horizontal tiles and so and are each covered by vertical tiles and so and are each covered by horizontal tiles, and so must be covered by a horizontal tile.
In other words, there is only 1 tiling in this case, shown in Figure 12.
Figure 12
Suppose now that and are not covered by a horizontal tile, but is.
In this case, each of the bottom squares is tiled in a self-contained way. There are 2 ways to tile each, and so ways to tile the pair of squares. (These tilings are each self-contained because if either or is covered by a vertical tile, then the remaining three tiles in the corresponding square cannot be covered with tiles.)
Furthermore, and must be covered by vertical tiles, meaning that is tiled with a horizontal tile, as shown in Figure 13, and so there is only one tiling of the upper rectangle.
Figure 13
Thus, there are tilings of in this case, since the rest of the tiling is determined without choice.
Suppose finally that none of , , or is covered by a horizontal tile, but is.
Then and are covered with vertical tiles, which means that and are covered by vertical tiles, giving the diagram in Figure 14.
Figure 14
There is no way to complete this tiling without using a horizontal tile .
Therefore, there are no tilings in this case.
Finally, we can now say that there are tilings of .
This means that there are ways of tiling the entire region with the given conditions.
Answer: (A)
Suppose that the square base of the prism has side length , and that the prism has height .
We are asked to find the maximum possible area for rectangle .
The area of rectangle is equal to , since and .
Let be the point on directly below (that is, is perpendicular to the plane of ). Note that .
Draw line segment through with on and on so that is parallel to .
Draw line segment through with on and on so that is parallel to .
Then segments and divide square into four rectangles.
Let and .
Then , , , and .
is right-angled at so .
But is the hypotenuse of right-angled , so .
Thus, .
Since , , , and , then .
Similarly, using , we find that and using , we find that .
Subtracting from , we obtain or which gives or .
Similarly, subtracting from gives or which gives or .
Substituting these expressions for and into gives Recall that we want to maximize .
Since , then maximizing is equivalent to maximizing , which is equivalent to maximizing .
From above, Since , then (with equality when ).
Therefore, and so .
This means that maximum possible area of is .
Of the given answers, this is closest to 67.82.