Wednesday, November 23, 2016
(in North America and South America)
Thursday, November 24, 2016
(outside of North American and South America)
©2016 University of Waterloo
Evaluating,
Answer: 1
Solution 1
Suppose that the full price of the second book was $
Since 50% is equivalent to
The combined full price, in dollars, of the two books was
Since Mike saved a total of 20% on his purchase, then he paid 80% of the combined full cost.
Since 80% is equivalent to
Therefore, we obtain the equivalent equations
Mike saved 20% of the full cost or
Solution 2
Suppose that the full price of the second book was $
The combined full price, in dollars, of the two books was
Since
Since
Therefore, we obtain the equivalent equations
Mike saved
Answer: $11
There are exactly
If
Since
If
If
Since we have
Since
If
Therefore, using a similar argument, we get
Therefore, there are exactly 5 lists with the desired properties.
Answer: 5
Suppose that the rectangular prism has dimensions
We label the various lengths as shown:
(We can think about the four “middle" rectangles in the net as forming the sides of the prism, the “top" rectangle as forming the top, and the “bottom" rectangle as forming the bottom.)
From the given information, we obtain the equations
Dividing the first equation by 2, we obtain
Adding the three equations, we obtain
This gives
Therefore,
Answer: 264
Since the first player to win 4 games becomes the champion, then Gary and Deep play at most 7 games. (The maximum number of games comes when the two players have each won 3 games and then one player becomes the champion on the next (7th) game.)
We are told that Gary wins the first two games.
For Deep to become the champion, the two players must thus play 6 or 7 games, because Deep wins 4 games and loses at least 2 games. We note that Deep cannot lose 4 games, otherwise Gary would become the champion.
If Deep wins and the two players play a total of 6 games, then the sequence of wins must be GGDDDD. (Here D stands for a win by Deep and G stands for a win by Gary.)
If Deep wins and the two players play a total of 7 games, then Deep wins 4 of the last 5 matches and must win the last (7th) match since he is the champion.
Therefore, the sequence of wins must be GGGDDDD or GGDGDDD or GGDDGDD or GGDDDGD. (In other words, Gary can win the 3rd, 4th, 5th, or 6th game.)
The probability of the sequence GGDDDD occurring after Gary has won the first 2 games is
Similarly, the probability of each of the sequences GGGDDDD, GGDGDDD, GGDDGDD, and GGDDDGD occurring is
Therefore, the probability that Gary wins the first two games and then Deep becomes the champion is
Answer:
We label the digits of
From the given information, the following sums must be multiples of 5:
Also, the following sums must be multiples of 4:
We need the following fact, which we label
If
and are positive integers that are both multiples of the positive integer , then their difference is also a multiple of .
This is true because if
By
Since
Similarly,
The pairs from the list
Note that
Therefore,
Using
Suppose that
Since
So if
Using similar analysis, we make a table that lists the first digit, and the resulting configurations:
Configuration | |
---|---|
1 | 1_0_46_5_ |
2 | 2_1_47_6_ |
3 | 3_2_48_7_ |
5 | 5_6_40_1_ |
6 | 6_7_41_2_ |
7 | 7_8_42_3_ |
8 | 8_5_43_0_ |
Note that, in the case where
While it is necessary that
Since the sum of the 9 digits of
Since each of the digits is between
If
If
If
If
If
If
If
If
Thus, when
Using similar analysis on the remaining cases, we obtain the following possible values for
The sum of these eight nine-digit integers is 3555555552.
(We note that the sum of the possible values for each digit is 32.)
Answer: 3555555552
When the table is continued, we obtain
Palindrome | Difference from last |
---|---|
1001 | |
1111 | 110 |
1221 | 110 |
1331 | 110 |
1441 | 110 |
1551 | 110 |
1661 | 110 |
1771 | 110 |
1881 | 110 |
1991 | 110 |
2002 | 110 |
2112 | 110 |
The eighth and ninth palindromes in the first column are 1771 and 1881.
When we continue to calculate positive differences between the palindromes in the first column, we see that
Since we are told that there are only two possible differences, then
Solution 1
The palindromes between 1000 and 10 000 are exactly the positive integers of the form
Since there are 9 choices for
That is,
Solution 2
The palindromes between 1000 and 10 000 are exactly all of the four-digit palindromes.
Between 1000 and 2000, there are 10 palindromes, as seen in the table above.
Between 2000 and 3000, there are also 10 palindromes:
In other words, in each of these 9 ranges, there are 10 palindromes, and so there are
That is,
Since there are 90 palindromes in the first column, there are 89 differences in the second column.
The difference between two consecutive palindromes with the same thousands digit is 110.
This is because two such palindromes can be written as
When these numbers are subtracted, we obtain “
Since there are 9 groups of 10 palindromes with the same thousands digit, then there are
Since there are 89 differences and each is equal to 110 or to 11 (from (b)), then there are
(We can check that the difference between the consecutive palindromes
Thus, the average of the 89 numbers in the second column is
To find the coordinates of
Since
Solution 1
The point,
Since
Solution 2
Consider a point
Since
Since
Since
Since
This means that the point with the maximum
Solution 1
Since
Also, if
Since
Therefore, the coordinates of
Solution 2
Since
Since
Since the slope of
Since
We want to determine the second point of intersection of the line with equation
Substituting for
When
Solution 1
Suppose that
Therefore,
We now show two different ways to find the coordinates of the possible locations for
Method 1
Since
Since
By using the same component distances, the length
Since
Therefore, possible locations for
Method 2
The slope of the line segment connecting
Since
Therefore, the line through
To find the possible locations of the point
The two possible locations for
Solution 2
Consider the points
To move from
Starting from
Similarly, starting from
Thus,
This means that
The slope of the line segment joining
Thus, the equation of the line through
Rearranging, we obtain
Substituting into the equation of the circle
The solution
The slope of the line segment joining
Thus, the equation of the line through
Substituting into the equation of the circle
The solution
Therefore, the coordinates of
By definition
Now
(It is true that there are no other integers
Solution 1
Let
Since
Since
In particular,
Solution 2
Since
Since
Since
Since
In (a), we determined that
Using (b), we see that
Similarly,
In general, because
Now for every positive integer
1 | 5 | 2 | 9 | 9 |
2 | 49 | 20 | 97 | 7 |
3 | 485 | 198 | 969 | 9 |
4 | 4801 | 1960 | 9601 | 1 |
5 | 47 525 | 19 402 | 95 049 | 9 |
Units digit of |
Units digit of |
Units digit of |
||
---|---|---|---|---|
1 | 5 | 2 | 9 | 9 |
2 | 9 | 0 | 7 | 7 |
3 | 5 | 8 | 9 | 9 |
4 | 1 | 0 | 1 | 1 |
5 | 5 | 2 | 9 | 9 |