Wednesday, April 10, 2019
(in North America and South America)
Thursday, April 11, 2019
(outside of North American and South America)
©2019 University of Waterloo
The total of the listed prices is
Sales tax of 10% on
After sales tax is included, the total of Becky’s bill is
Alternately, we could add 10% sales tax directly to Becky’s bill by multiplying
After 10% sales tax is included, the cost of one $6.00 burrito is
At a cost of $6.60 for each burrito, the total cost of 7 burritos is
Since Jackson has $50.00, the greatest number of burritos that he can buy is 7.
On Monday, Chase spent
Including tax, Chase spent
On Tuesday, Chase spent
Including tax, Chase spent
Thus, Chase spent less money on Monday.
The
The
The
The area of
Solution 1
We begin by determining the equation of the line passing through
This line is perpendicular to the line with equation
This line passes through the origin and so it has
Point
Substituting the equation of the first line into the second, we get
When
Solution 2
As in Solution 1, we begin by recognizing that the line passing through
Point
The slope of the line through
Solving, we get
When
From part (b) Solution 1, the equation of the line passing through
Point
That is, the coordinates of
Similarly,
That is, the coordinates of
The area of
If the area of
This question is asking for the greatest number of factors of 2 in 9!.
Expressing 9! as a product of prime factors, we get
To be divisible by
Multiples of 7 are the only integers which have a factor of 7.
The smallest positive multiples of 7 are 7 and 14, and each of these contributes exactly one 7 to the prime factorization of 14!, and so if
Thus, the smallest value of
A positive integer equal to
Multiples of 7 are the only integers which have a factor of 7.
The first six positive multiples of 7
That is, 42! is divisible by
The next value of
However, 49 contributes two additional 7s to the prime factorization of 49! (since
For each positive integer
For each positive integer
Thus, there is no positive integer
Multiples of 13 are the only integers which have a factor of 13.
Since
Since 29 is a prime number and does not appear in the prime factorization of
We note that for each of the possible values
In the table below, we determine the number of factors of
Numbers containing factors of 2 |
2 | 4 | 6 | 8 | 10 | 12 | 14 | 16 | 18 | 20 | 22 | 24 | 26 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Number of factors of 2 in each |
1 | 2 | 1 | 3 | 1 | 2 | 1 | 4 | 1 | 2 | 1 | 3 | 1 |
Numbers containing factors of 3 |
3 | 6 | 9 | 12 | 15 | 18 | 21 | 24 |
---|---|---|---|---|---|---|---|---|
Number of factors of 3 in each |
1 | 1 | 2 | 1 | 1 | 2 | 1 | 1 |
Numbers containing factors of 5 |
5 | 10 | 15 | 20 | 25 |
---|---|---|---|---|---|
Number of factors of 5 in each |
1 | 1 | 1 | 1 | 2 |
Numbers containing factors of 7 |
7 | 14 | 21 |
---|---|---|---|
Number of factors of 7 in each |
1 | 1 | 1 |
Recall that
Since
Similarly,
Next, we determine the values of
Since
Finally, we determine the values of
Since
Therefore,
In order for a positive integer to be divisible by 10, its ones digit must be
For a positive integer to be digit-balanced, we need each digit
In the case that
This means the number of zeros must be
Since a multiple of
Every four-digit positive integer has digits:
In this part, we exclude the possibility that a digit could equal 0.
A positive integer with distinct digits
A positive integer with digits
A positive integer with digits
There are 2 choices for
Thus, in this case, there are
A positive integer with digits
There are 8 choices for
Thus, in this case, there are
A positive integer with digits
There 6 choices of positions for the two
There are then 8 choices for the left-most of the other digits (any non-zero digit other than 1) and 7 choices for the remaining digit (any non-zero digit other than 1 or
Thus, in this case, there are
In total, there are
We assume
We set
Using the condition that
Looking at the tens digit, we need
Continuing the addition, we have
Following the same reasoning, we have that
For now, we will not worry about the units digit of
Since each of
Similarly, at most two of the first
Suppose
If
Similarly, at most two of the first
If
The following table summarizes the maximum number of occurrences of each digit in the first
digit | maximum number of occurrences in |
---|---|
1 | 1 |
2 | 2 |
3 | 3 |
4 | 4 |
5 | 4 |
6 | 3 |
7 | 2 |
8 | 1 |
9 | 0 |
Since every digit of
To construct digit-balanced numbers
If the units digits are
Taking
Indeed, each of these numbers has
To produce pairs
The pair
The pair
There exist digit-balanced positive integers
Thus, the number of possible values of