j3s2023
j3s2023
Memorandum
1) The average of the 5 numbers equals
We now enumerate the possible values of (p, q) for each of these three
multiples of 5, taking care to ensure that 4 < p < q < 14:
● For p + q + 1 = 15, the possible values of (p, q) are (5, 9) and (6, 8).
● For p + q + 1 = 20, the possible values of (p, q) are (6, 13), (7, 12), (8, 11) and
(9, 10).
● For p + q + 1 = 25, the possible values of (p, q) are (11, 13) only.
2) Label the vertices as shown and let the sum of the numbers at the corners of each
face equal S. Consider two opposite faces - the sum of the numbers at their corners
is the sum of all the numbers from 1 to 8, so 2S = 1+2+...+8 = 36, so S = 18.
Next, consider the two faces A and B - since the sums of the numbers at the
corners of the two faces are equal, we have that
and so . Similarly
, and .
Rearranging these equations, we see that ; that
is; the difference between numbers at opposite corners is always the same.
We need to partition the numbers from 1 to 8 into the pairs (a, d), (c, b), (z, w),
(x, y) with the same difference.
This yields the three solutions shown below (all other solutions are rotations
and reflections of these three).
4) The single digit primes are 2, 3, 5 and 7. So, any number divisible by all of
them is divisible by .
The first few multiples of 210 with 4 digits are 1050, 1260, 1470, 1680, 1890,
…;
The smallest one without any prime digits is 1680.
3
2
5) 1
5 4
6
3
2
1 6 1
5 4 5 4 5 4
4 1
4 2
2 1 3
3 2 6
6 5 3 6
3 6
2 1 6 4
3 5
5 4
6) Glue a copy of the triangle, rotated through 180º, to the original triangle as
shown. The resulting parallelogram consists of 9 identically sized strips,
alternatingly coloured red and blue.
The five blue strips have total area 90×2 = 180, and hence the red strips have
total area .
5 AE BF
7) Using the similarity of triangles, with DE BC , = = .
DB AC 3
Hence, DB.BF = x = 15
8) Rephrasing the question, we want to find the number of 3-digit numbers such
that the difference between the digit sum and the number of matchsticks is
positive. Let’s look at the difference between the digit value and the number of
matchsticks for each digit:
We want to build three-digit numbers such that the sum of the three
differences is positive.
The total number of 3-digit numbers made from these digits equals 5P3 = 60
numbers. However, using the digits 1, 3 and 5 together yields a difference of -
3, which is not allowed - those 6 permutations need to be excluded. Similarly,
the digits 1, 3 and 9 can’t be used together, excluding another 6. Therefore
there are 60 – 6 – 6 = 48 such numbers in total.
9) x cm
Volume of Funnel = Volume of Cylinder
R 2 H = r 2 h
2
x
1, 6 = (2) 2 4,9
2
2
x
1, 6 = 4 4,9
4
4 4,9
x2 = 4,9 cm
0, 4
x 2 = 49
x = 7
4 cm
10)
Join the vertices of the triangle to the
centre of the clock, as shown. Since the
numbers of the clock are spread evenly
around the circle, they divide the circle C
o
360
into equal wedges with angle = 30o ; D
12
this implies that ADB = 30o and
x
BDC = 120o . Since the two triangles in A
B
question are isosceles, it follows that
180o − 30o
DBA = = 75o and
2
180o − 120o
DBC = = 30o and so x = 75o + 30o = 105o .
2
11) Solution 1
Write the equation as a long multiplication:
Solution 2
Let the 5-digit number be n. Then the condition means that
and so and
12)
L L
B C
14)
a) Jay wins if and only if one of the two players draws the white ball.
There are 6 possible ways to draw 2 balls from four, and exactly 3 of
them contains the while ball, so the probability of Jay winning is
.
b) Suppose that there are g green balls. Rufaro wins if both players draw
the same colour ball. The probability of both of them drawing green is
and the probability of them drawing white is .
Hence the probability of Rufaro winning equals
.
If the two players have equal probability of winning, this fraction must
equal a half, so and so
. Hence there must be 6 green balls
and 3 white balls, or 3 green balls and 6 white balls.
c) Suppose that there are b green balls and b white balls. Then similar to
the reasoning for part (b), for the game to be fair, we must have that
which leads to , which
has no solution.
15)
A
Move 1: A moves to a
position diagonally to B.
A
B B
B3
A B4 has 5 options. Moving 1 block at a time will give a max of 5 more
moves for B
B4