Wednesday, April 5, 2023
(in North America and South America)
Thursday, April 6, 2023
(outside of North American and South America)
©2023 University of Waterloo
Lonnie rests for 30 s between the 1st and 2nd sprints, the 2nd
and 3rd sprints, and so on up to and including the 23rd and 24th
sprints.
Thus, Lonnie takes the 30 s rest 23 times.
Since Lonnie sprints at a constant speed of 8 m/s, then it takes
Lonnie
Lonnie completes 24 such sprints, and so his time spent sprinting is
Lonnie also takes 23 rests, each of length 30 s, and so his time spent
resting is
On Monday, Lonnie’s total practice time is thus
Solution 1
On Tuesday, each of Lonnie’s 240 m sprints takes
Lonnie rests 19 times, and so he rests for a total of
On Tuesday, Lonnie’s total practice time is thus
Solution 2
On Monday, Lonnie sprints
On Tuesday, Lonnie also sprints
Since Lonnie sprints at the same constant speed on both days, then he
spends the same amount of time sprinting on each of the two days.
Thus, the difference between the length of time that Lonnie practices on
the two days is the difference between the time that he spends resting
between sprints.
Lonnie rests 23 times on Monday, and he rests 19 times on Tuesday.
Since he rests 4 more times on Monday than he does on Tuesday, then
Tuesday’s practice takes
The 5th row includes the integers 17, 19, 21, 23, and 25, and so the average of the integers
in the 5th row is
The row that has the integer 145 in the 1st position must
immediately follow the row that has 144 in the last position.
Since
Since
When moving from right to left along each row, the integers decrease by
2, and so the integer in the 39th position of the 40th row is
Solution 1
Moving from left to right along a row, the integers increase by a
constant (namely 2), and so the average of the integers in a row is
equal to the average of the integer in the first position of the row and
the integer in the last position of the row. Can you see why this is
true?
Since
Since
Thus, the average of the integers in the 16th row is
Solution 2
Since
This means that the average of the entries in each row up to and
including the 15th row must be at most 225.
Since
This means
We can check that the entries in row 16 are
The five-digit positive integer
Checking the possible values of
Value of |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
---|---|---|---|---|---|---|---|---|---|
Value of |
13 | 15 | 17 | 19 | 21 | 23 | 25 | 27 | 29 |
we get that
Solution 1
Since
Since
Since
Since
For each of the possible values of
For example when
In the table below, we determine the remaining pairs
1 | 2, 6 | |
2 | 4, 8 | |
4 | 4, 8 | |
5 | 2, 6 | |
7 | 2, 6 | |
8 | 4, 8 |
Thus, there are 12 different pairs of non-zero digits
Solution 2
Since
Since
Since
For each of the possible values of
For example when
When
When
When
Finally, we consider the fact that
As was shown in Solution 1, the possible values of
Combining this information with the previous values of
Thus, there are 12 different pairs of non-zero digits
If
An integer is divisible by 5 exactly when its ones digit is 0 or 5, and
so
Since
Substituting
Since
Since
The three-digit integer
The four-digit integer
Finally, we return to the requirement that
When
When
When
When
Therefore, there are
Computer 1 is an odd-numbered computer, and so each cord
connecting Computer 1 to another odd-numbered computer is red.
Thus, there is a route from Computer 1 to each of the odd-numbered
computers from 3 to 49, inclusive, that uses only red cords.
Each cord between an odd-numbered computer and an even-numbered computer
is blue.
Computer 1 is an odd-numbered computer and so every possible route from
Computer 1 to an even-numbered computer must use at least one blue
cord.
Thus there is no route from Computer 1 to any even-numbered computer
that uses only red cords.
There are 24 odd numbers between 2 and 50, and so there are 24 possible
values for
Two integers have different parity if one integer is
even and the other is odd.
Two integers have the same parity if they are both even or if
they are both odd.
There are two cases to consider:
If
If
The cord between Computer
Thus, for every pair of distinct computers, Computer
If the cord between Computer 13 and Computer 14 is yellow, then
there is a route between them that uses only yellow cords, so assume
that the cord between them is green.
Since there is no route connecting Computer 1 to Computer 50 that uses
only green cords, then the cord between Computer 1 and Computer 50 must
be yellow.
Further, since there is no route connecting Computer 1 to Computer 50
that uses only green cords, then at least one of the following must be
true:
the cord between Computer 1 and Computer 13 is yellow, or
the cord between Computer 13 and Computer 50 is yellow,
otherwise the route from Computer 1 to Computer 13 to Computer 50
uses only green cords.
Similarly, since there is no route connecting Computer 1 to Computer 50
that uses only green cords, then at least one of the following must be
true:
the cord between Computer 1 and Computer 14 is yellow, or
the cord between Computer 14 and Computer 50 is yellow,
otherwise the route from Computer 1 to Computer 14 to Computer 50
uses only green cords.
Since at least one of (i) or (ii) must be true, and at least one of
(iii) or (iv) must be true, then there are 4 cases to consider, as
follows.
Case A: (i) and (iii) are true
In this case, the cord between Computer 1 and Computer 13 is yellow, and the cord between Computer 1 and Computer 14 is yellow, and so the route from Computer 13 to Computer 1 to Computer 14 uses only yellow cords.
Case B: (i) and (iv) are true
In this case, the cord between Computer 1 and Computer 13 is yellow,
and the cord between Computer 14 and Computer 50 is yellow.
Recall that the cord between Computer 1 and Computer 50 is also yellow,
and so the route from Computer 13 to Computer 1 to Computer 50 to
Computer 14 uses only yellow cords.
Case C: (ii) and (iii) are true
In this case, the cord between Computer 13 and Computer 50 is yellow,
and the cord between Computer 1 and Computer 14 is yellow.
Since the cord between Computer 1 and Computer 50 is also yellow, then
the route from Computer 13 to Computer 50 to Computer 1 to Computer 14
uses only yellow cords.
Case D: (ii) and (iv) are true
In this case, the cord between Computer 13 and Computer 50 is yellow, and the cord between Computer 14 and Computer 50 is yellow, and so the route from Computer 13 to Computer 50 to Computer 14 uses only yellow cords.
Thus, if there is no route that connects Computer 1 to Computer 50 that uses only green cords, then there is always a route between Computer 13 and Computer 14 that uses only yellow cords.