APSMO

MATHS 2019: DIVISION S

OLYMPIAD
OLYMPIAD 1
1A. How many whole numbers are less than 34 but greater than 43 ?

1B. In the given cryptarithm, different letters represent different

non-zero digits.

Find the least possible whole number value for the sum.

1C. Each figure in the sequence shown

is entirely composed of 1 x 1 shaded
squares.

If the pattern is continued, how many

1 x 1 shaded squares are there in the
20th figure?

1D. Beginning at the letter "A", arrow-directed paths from top A

to bottom spell the word "APSMO". JI-\
p p
How many different paths spell "APSMO"?
JI-""JI-""
s s s
,. ~ JI-"" JI-~
M M M M
JI-""JI-~ JI-""JI-~
0 0 0 0 0

1E. How many different rectangular prisms can be constructed

using exactly 24 identical unit cubes?
[One such example is shown with dimensions
2 X 3 X 4 .]
 APSMO
MATHS 2019: DIVISION S
OLYMPIAD
OLYMPIAD 2
2A. Sheila starts from home and needs to stop at her son's School Map not
school, the store, and work, in some order, before drawn to
scale.
returning home.

The map shown uses distances in kilometres.

How many kilometres is Sheila's shortest route?

Home Store

2B. Mr. and Mrs. Apsmo and their 2 children are randomly seated
around a four-seat circular table.

What is the probability, expressed as a fraction in lowest terms, that

Mr. and Mrs. Apsmo are seated next to one another?

2C. E_ach figure in the sequence shown is

entirely composed of 1 x 1 shaded squares.

The total perimeter of each figure is the

sum of its outer perimeter and its inner
perimeter.

The total perimeter of the first figure is 12 + 4 = 16 units.

If the pattern is continued, how many units is the total perimeter of the 100 th figure?

2D. In the given floorplan, the 5 rooms A, B, C, D, and E are

connected by the 7 doorways as shown.

In how many ways can Brad walk from room A to room E

without re-entering a room?

[ It is not required that Brad pass through every room or every

doorway as he walks from room A to room E. J

2E. 27 identical small cubes are arranged to form a single large cube.

The total surface area of the 27 small cubes is K times the surface area of the large
cube.

Find K.
 APSMO
MATHS 2019: DIVISION S
OLYMPIAD
OLYMPIAD 3
3A. The prime factorisation of 2019 = 3 x 673.

Find the least counting number value of N so that 2019 x N is a perfect square.

3B. In a Cartesian plane, the rectangular region R is defined

~,:O
by-3::; x::; 2 and-6 :=;y::; 2.

Express, in lowest terms, the fraction of region R that

lies within Quadrant// .

3C. A 7cm by 10cm rectangle is partitioned into shaded and

unshaded regions 1 cm thick as shown.

The entire shaded area is Ko/a of the total area of the

rectangle.

Find Kto the nearest whole number.

3D. An arrow on a Cartesisan plane has one end pinned at the origin.

Initially, the arrow head is positioned on the point (7, 4).

After the arrow is rotated 90° clockwise about the origin, the arrow head is positioned
on the point (x, y).

Find the ordered pair (x, y).

3E. The whole number 25 x 34 x 5 9 has exactly K perfect square factors.

Find the whole number value of K.

 APSMO
MATHS 2019: DIVISION S
OLYMPIAD
OLYMPIAD 4
4A. Express-¼ x ¾ x � x ... x i81� x i81� x i81� as a single fraction in lowest terms.

4B. Points A, B, C, D, E and Fare evenly distributed on

the number line as shown.

Point A corresponds to¾,

Point F corresponds to-¼,

What fraction, in lowest terms, corresponds to Point D?

4C. Frank and Alice and their four children are randomly seated
around a circular table.

Express, as a fraction in lowest terms, the probability that Frank

and Alice are seated directly opposite each other.

4D. Each figure in the sequence shown is

entirely composed of 1 x 1 shaded squares.

If the pattern is continued, how many

1 x 1 shaded squares are there altogether
in the first 28 figures?

4E. The Moebius Pretzel Company sells pretzels in two differently sized packages.

A small package contains 4 pretzels.

A large package contains 7 pretzels.

What is the greatest number of Moebius Pretzels that cannot be purchased?

 APSMO
MATHS 2019: DIVISION S
OLYMPIAD
OLYMPIAD 5
SA. 75% of a number is 45.

What is 66f0/o of the same number?

SB. a and bare both whole numbers.

a2 x b = 23 x 52 x 17.
What is the greatest possible value of a?

SC. Find the greatest difference between two values from the following set:
1 -2 3 -4 1 -2 3 -4
{ 2, 3, 4, 5, 6, 7, 8, 9 }

SD. The diagram shows a map of the streets in a city where

every block is an identical square.
I need to travel along the streets from A to B via C, using
the shortest possible distance.
In how many different ways can I make this trip?

SE. Three-digit whole numbers ABC and CBA are formed from the three different
non-zero digits A, B, and C.
How many different whole number values are possible for ABC - CBA?
 Olympiad 1 Solutions

1A. METHOD 1 Strategy: Express each number in standard form.

Expand:
• 34 = 3 x 3 x 3 x 3 = 81, and
• 43 = 4 X 4 X 4 = 64.
The number of integers greater than 64 but less than 81 is 81 - 64 - 1 = 16.

METHOD 2 Strategy: List and count the numbers.

After expanding the numbers into standard form, create a list of numbers greater
than 64 but less than 81:
65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,and80.
There are 16 numbers in the list.

Follow-Up: (1) How many integers are greater than 2 5 and less than 2 8? [ 223 ]
(2) How many integers are there from 2 ° to 2 5 inclusive? [ 32]
(3) How many integers are less than 3 3 and greater than (-3)3? [ 53]

1 B. Strategy: Reason logically.

To find the least possible sum, we need to let A and f be the least values.
A and f must be 1 and 2.
Band D must be the next 2 possible least numbers which are 3 and 4.
The next least integer is 5, which must be C.
Therefore, one possible pair of addends is 13 542 and 24 531.
The sum is 38 073.

Follow-Up: (1) Use the same cryptarithm to find a second pair of addends that have the
same sum. [ 23 541 and 14 532 ]
(2) Let each of the letters in the two 5-digit numbers below represent a differe
digit from O to 9.
Find the least possible difference for ABCDE - FGHlj. [ 247]
 Olympiad 1 Solutions

1C. METHOD 1 Strategy: Look for a pattern.

In the first figure, there are 8 shaded squares, in the second there are 12 shaded
squares, in the third there are 16 shaded squares, and in the fourth there are 20
shaded squares.
As the length of the side of each figure increases by 1, there is an increase of 4 shaded
squares.
Observe the number of shaded squares as a product:
8=2x4, 12=3x4, 16=4x4 and 20= 5x4.
The first number is 1 more than the position of the figure in the sequence.
The number of shaded squares in the n th figure is (n + 1) x 4.
Therefore, the number of shaded squares in the 20th figure is (20+1)x4= 84.

METHOD 2 Strategy: Consider the number of corner and non-corner shaded squares.
There are 4 corner squares in each figure.
The number of shaded squares can then be found by adding the number of non­
corner shaded squares in each figure.
Figure Comer Squares Non-corner Squares > Total
1 4 4x1=4 4+4=8
2 4 4x2=8 4+8=12
3 4 4x3=12 4+12=16
4 4 4x4=16 4+16=20
: : :

20 4 4 X 20=80 4+80= 84

There are 84 shaded squares in the 20th figure.

METHOD 3 Strategy: Notice each figure can be seen as the difference between two
squares.
The counts can then be expressed as: 32 - F, 42 - 22, 5 2 - 32, 6 2 - 42, and so on.
Therefore the count for the 20 th figure can be expressed as
222 - 202=484 - 400=84.

Follow-Up: How many shaded squares are in the

40th shape? [ 164]
 Olympiad 1 Solutions

1D. METHOD 1 Strategy: Start with a simpler problem.

Only consider the top 2 levels. There are 2 possibilities:
Move left (L) or move right (R).
When you add the 3 rd level, there are 4 ways to go:
LL, LR, RL or RR.
Add the 4th level and there are 8 ways to go:
LLL, LLR, LRL, LRR, RLL, RLR, RRL, or RRR.
Notice each level adds a factor of 2 to the number of paths.
So when you add the next level, the fifth level, there will be 2 x 2 x 2 x 2 = 2 4 = 16 paths.

METHOD 2 Strategy: Start at the bottom and consider the number of ways to get to each
letter.
Consider the number of ways to get to each of the letters starting at the bottom row.
There are 2 paths from each letter M to get to the bottom row.
There are 2 paths to get from a letter Stoa letter M, so there are 4 paths to get from
each S to an 0.
Similarly, there are:
• 2 paths to get from P to S,
• 4 paths to get from P to M, and
• 8 paths to get from P to 0.
Finally, there are:
• 2 paths from A to P,
• 4 paths from A to S,
• 8 paths from A to M, and
• 16 paths from A to 0.

METHOD 3 Strategy: The number of ways to arrive at a

particular letter along a path equals the sum of the number 1
of ways to arrive at the letter(s) diagonally above. 1 1
1 2 1
Arriving at the bottom row by following an arrow­
directed path will spell out the word "APSM0". 1 3 3 1
1 4 6 4 1
This can be done in 1 + 4 + 6 + 4 + 1 = 16 ways.
 Olympiad 1 Solutions

1 D. Follow-Up: (1) Suppose the word ''TRIANGLE" was used instead of "APSMO'�
How many different top-to-bottom paths spell ''TRIANGLE''? [ 128 ]
(2) Luigi's Pizzeria offers the following toppings for a pizza: capsicum, sausage,
onion, pepperoni, mushrooms, meatballs, spinach, garlic, and zucchini. How
many different ways are there to top the pizza? [ 512 ]

1E. Strategy: Consider the length of the shortest dimension.

The factors of 24 are 1, 2, 3, 4, 6, 8, 12, and 24.

Case 1: Shortest dimension has length 1.

The product of the other two dimensions must be 24.

There are four possibilities for the other two dimensions:
1 x 24, 2 x 12, 3 x 8, and 4 x 6.

Possible dimensions for the rectangular prism are therefore

1 x 1 x 24, 1 x 2 x 12, 1 x 3 x 8, and 1 x 4 x 6.

Case 2: Shortest dimension has length 2.

The product of the other two dimensions must be 12.

There are two possibilities for the other two dimensions: 2 x 6 and 3 x 4.
Possible dimensions for the rectangular prism are therefore
2 x 2 x 6 and 2 x 3 x 4.

Case 3: Shortest dimension has length 3.

The product of the other two dimensions must be 8.

This is not possible, as at least one of these dimensions must be less than 3.
All together, there are 2 + 4 = 6 possible rectangular prisms constructible with 24 unit
cubes.

Follow-Up: (1) Use the information in the given question to find the dimensions of the
rectangular prism with the least surface area. [ 2 x 3 x 4]
(2) Use the information in the given question to find the dimensions of the
rectangular prism with the greatest surface area. [ 1 x 1 x 24]
(3) How many different rectangular prisms can be constructed using 48 identical
cubes? [ 9]
 Olympiad 2 Solutions

2A. METHOD 1 Strategy: Apply logical reasoning

Since we are looking for the shortest route, try to find a route that:
• uses the shortest distance (4.7), and
• avoids the longest distance (10.4).
A route that does this is Home-School-Store-Work-Home.
The total distance is 6.3 + 4.7 + 9 + 7.1 = 27.1 kilometres.

METHOD 2 Strategy: Calculate the distances of all possible routes.

Location Home Home Home Home Home Home

Distance 6.3km 6.3km 10.4km 10.4km 7.1km 7.1km
Location School School Food Food Work Work
Distance 8km 4.7km 4.7km 9km 8km 9km
Location Work Store Store Work School Store
Distance 9km 9km 8km 8km 4.7km 4.7km
Location Store Work Work School Store School
Distance 10.4km 7.1km 7.1km 6.3km 10.4km 6.3km
Location Home Home Home Home Home Home
Total
33.7km 27.1km 30.2km 33.7km 30.2km 27.1km
Distance

Note that the shortest distance is 27.1 kilometres.

Follow-Up: What is the number of kilometres in the longest route if Sheila can only stop
once at the other destinations before returning home? [ 33.7]

2B. METHOD 1 Strategy: Draw all possible seating arrangements.

Since there are only 3 different seating arrangements and since 2 of them place
Mr. and Mrs. Apsmo
MrA MrA
next to each other, the
probability is �.
Switching the children
has no effect on the C1 Mrs A (2
probability.
 Olympiad 2 Solutions

28. METHOD 2 Strategy: Apply logical reasoning.

Regardless of which seat Mr. Apsmo sits in, there is only 1 seat out of the 3 remaining
where Mrs. Apsmo would not be seated next to him.

Since there is a j chance not to be seated next to each other, there is a � chance that
they will be seated next to each other.

Follow-Up: In the given problem, what is the probability the 2 children sit next to each
other? [ � ]

2C. METHOD 1 Strategy: Use algebra and patterning.

Let n = the length of one side of the square.
The first figure has n = 3.
When n = 3, the total perimeter is 3 x 4 + 1 x 4 = 4(3 + 1) = 16.
When n = 4, the total perimeter is 4 x 4 + 2 x 4 = 4(4 + 2) = 24.
When n = 5, the total perimeter is 5 x 4 + 3 x 4 = 4(5 + 3) = 32.
In general, for any n, the total perimeter is n x 4 + (n - 2) x 4 = 4(n + n - 2) = 4(2n - 2).
For the 100th figure, n = 102, so the total perimeter is 4(2 x 102 - 2) = 4(202) = 808.

METHOD 2 Strategy: Look for a pattern based upon the four given figures.

Figure Perimeter It appears that for each new figure, the total perimeter
1 16 increases by 8.
2 24 To find the total perimeter of the 100th figure, we would
3 32 need to increase the total perimeter of the first figure by
ninety-nine 8s.
4 40

Thus, the total perimeter of the 100th figure will be the total perimeter of the first
figure increased by ninety-nine 8's or 16 + 99(8) = 808.

Follow-Up: In the 100th figure in the pattern given, what is the number of shaded squares?
[ 404]
 Olympiad 2 Solutions

2D. METHOD 1 Strategy: Use a tree diagram.

Create a tree diagram and count the paths
from Ato E.
Notice that there are 6 paths from Ato E.
�i� C D

D
I \E iD BI \E
iE B
I \E Ei
iE
METHOD 2 Strategy: Create a network graph.
Replace each room with a dot (vertex) and connect
the dots with a line segment if there is a doorway
connecting the two rooms.
Make a list of all the ways to get from vertex Ato
vertex E without passing through a dot more than
once.
The paths are:
A- B - D - E,
A- B - E ,
A- C - D - E,
A- C - D - B - E,
A- D - B - E, and
A- D - E.
There are 6 paths.

Follow-Up: In the original diagram, find a path that passes through every doorway exactly
one time.
You will have to enter some rooms more than once.
There are multiple paths that can solve the problem.
[ One path is: A-C-D-E-B-D-A-B.]
 Olympiad 2 Solutions

2E. METHOD 1 Strategy: Assign a number to the length of a side of a small cube.
The total surface area of a cube is 6 times the area of one of its faces.
If the length of a side of one of the 27 small cubes is 1:
• Each face has an area of 1, and each small cube has a
surface area of 6.
• The total surface area of the 27 small cubes is
27 x 6 = 162 square units.
The length of a side of the large cube would be 3. So:
• One face of the large cube has an area of 9, and
• The large cube has a surface area equal to 6 x 9 = 54 square units.
The total surface area of the 27 small cubes is 162 + 54 = 3 times that of the large
cube.
So, K= 3.

METHOD 2 Strategy: Use algebra.

The total surface area of a cube of side x is 6x2 .
If the length of a side of the larger cube is n, then the length of a side of one of the
smaller cubes is 1·
The total surface area of the 27 small cubes is 27 x 6( � ) 2 = 18n 2 .
The surface area of the larger cube is 6n2 .
Thus K= 18n2 = 3.
2

6n

Follow-Ups: (1) If the single larger cube in the original question were painted blue, how
many of the smaller 27 cubes would have 3 of their faces painted blue? [ 8]
(2) If the single larger cube in the original question were painted blue, how
many of the smaller 27 cubes would have exactly 1 face painted blue? [ 6]
 Olympiad 3 Solutions

3A. Strategy: Apply the definition of a perfect square.

Since the prime factorisation of 2019 is 3 x 673, and we want 2019 x N to be a
perfect square, each of the prime factors must occur an even number of times.
In order for 2019 x N to be a perfect square, we must have 3 x 673 x 3 x 673, or
2019 X 2019.
Therefore, the least counting number value of N is 2019.

Follow-Up: (1) Find the least counting number value of N, such that 2018 x N is a perfect
square. [ 2018]
(2) Find the least counting number value of N, such that 2020 x N is a perfect
square. [ 505]
(3) Find the least counting number value of N, such that 2020 + N is a perfect
square. [ 5]

3B. METHOD 1 Strategy: Make a diagram and compare the rectangular areas.
- -·---- �--- -
The height of the rectangle called region R is
2 - (-6) = 8 units and its width is 2 - (-3) = 5 units.
i 2
Therefore, the area of region R is 8 x 5 = 40 square units.
The area of the rectangle in Quadrant II is 2 x 3 = 6
-3 2 X
square units.
Therefore the fraction of region R that lies in Quadrant II is
_§_ - ]_
40 - 20 •

METHOD 2 Strategy: Draw the rectangle and count the -6

boxes.
Plot the rectangle as seen in Method 1.
Count the boxes in the dark grey rectangle and the light grey region.
There are 6 boxes in the dark region and 34 boxes in the light grey region.
The fraction of region R that lies in Quadrant II (dark grey rectangle) is
6 + (34 + 6) = 40
..§.. = 20
.J.. •

Follow-Up: Find the coordinates of the point that is the centre of region R. [ (-0.5, -2)]
 Olympiad 3 Solutions

-�
3C. METHOD 1 Strategy: Compute areas of shaded regions using subtraction.
Outer shaded region: Inner shaded region:

Area= 7 x 10 Area = 70 - (5 x 8)
= 70 sq. cm = 30 sq.cm Area = 3 x 6 Area = 18 - 4
=18sq.cm =14sq.cm

The total area of the 2 shaded regions will equal 30 + 14 = 44 square cm.
The ratio of the area of the shaded regions to the area of the greatest rectangle is
44 + 70 = 0.6286 = 63%.
Therefore, to the nearest whole number, K = 63%.

METHOD 2 Strategy: Compute areas of shaded regions by counting.

The total area of the shaded regions is the number of unit squares that are shaded.
Either count one at a time or realise that the number of shaded squares equals
[2(10) + 2(5)] + [2(6) + 2(1)] = 2(10 + 5 + 6 + 1) = 44.
The percentage is 44 + 70 = 63% so K = 63%.

Follow-Up: To the nearest tenth, what percent of the big rectangle is unshaded? [ 37.1 % ]

3D. METHOD 1 Strategy: Examine the graph.

Sketch coordinate axes and draw an arrow that points to (7, 4).
Hold your pencil on the origin and physically rotate the paper 90
degrees clockwise.
The arrow should now appear to point to (4, -7).

METHOD 2 Strategy: Think of the arrow as a direct path.

Imagining the If we turned 90
Cartesian plane as degrees clockwise
a compass, we can and went through the
reach the end of the same motions, we
arrow by travelling 7 would travel 7 units
units East and 4 units South and 4 units
North. East.

Therefore the arrow head will be positioned on (4, -7).

 Olympiad 3 Solutions

3D. Follow-Up: (1) The point C(2, -5) is the result of rotating a point K clockwise 90 ° about the
origin. What are the coordinates of K? [ (5, 2)]
(2) What are the coordinates of the only point that does not move when it is
rotated 90 ° about the origin? [ (0, 0)]

3E. METHOD 1 Strategy: Apply the definition of a perfect square.

A number is a perfect square when each of its prime factors occurs an even number
of times.
Since 25 X 3 4 X 5 9 = 2 X 2 X 2 X 2 X 2 X 3 X 3 X 3 X 3 X 5 X 5 X 5 X 5 X 5 X 5 X 5 X 5 X 5,
5 times 4 times 9 times

a perfect square factor of 25 x 3 4 x 5 9 must have: • 2 exactly 0, 2, or 4 times;

• 3 exactly 0, 2, or 4 times; and
• 5 exactly 0, 2, 4, 6, or 8 times.
There are:
• three possibilities for the exponents for 2,
• three possibilities for the exponents of 3, and
• five possibilities for the exponents for 5.
Therefore, there are 3 x 3 x 5 = 45 = K perfect square factors.

METHOD 2 Strategy: Make a list and count the number of perfect square factors.
The perfect square factors with With two prime factor 32 34
just one prime factor value are: values: 22 2 2 x 3 2 2 2 x 34
2 ° , 2 2 , 24 , 3 ° , 3 2 , 3 4 , s 0 , 5 2 , 5 4 , 5 6 ,
and 58 .
I 24 24 x 3 2 24 x 3 4

52 56 5s There are
Note that 2° = 3° = s0 = 1.
54
2 2 x 52 22 x 54 22 x 56 22 x 5s
22 4 + 16 = 20
So far, there are 9 perfect 24 24 x 52 24 x 54 24 x 56 24 x 58
perfect square
square factors. 32 32 x 52 32 x 54 32 x 56 32 x 5s
factors.
34 34 x 52 34 x 54 34 x 56 34 x 58

With three prime factor values: 22x 32 22x 34 24x32 24x 34

52 2 2 x 3 2 X 52 22 X 34 X 52 2•x 3 2 x 52 24 x 34 x 52
There are 16 perfect square
factors. 54 22 X 3 2 X 54 22 X 34 X 54 24 X 32 X 54 24 x 34 x 54
56 22 x 32 X 56 22 x 34 x 56 24 x 32 X 56 24 x 34 x 56
5s 22 x 32 x 5s 22 x 34 x 58 2•x 32 x 5s 24 x 34 x 58

In total, there are K= 9 + 20 + 16 = 45 perfect square factors.

Follow-Up: How many perfect cube factors are in the number 25 x 34 x 5 9? [ 16 ]

 Olympiad 4 Solutions

4A. METHOD 1 Strategy: Use cancellation (reducing fractions to become 1).

When multiplying fractions, any numerator can cancel with any denominator if
they have a common factor.
2 x .3" x )t' x ... x ..20tb x -20't7 x � _-
Therefore, .3" 2
)t' % ..20'tT ..20-1-8"" ..2(}'l-9'" 2019.

METHOD 2 Strategy: Search for a pattern.

Notice that � x ! = � and � x ! x t = � and � x ! x t x � = �.

In each case the final result has the numerator of the initial fraction and the
denominator of the final fraction.
Following the pattern, we can infer that the product would equal 20�9.

METHOD 3 Strategy: Use the multiplicative property of fractions and the multiplicative
identity.
Notice that multiplying 2 x _l_ 2 x _l_ - J_
_l_ x 1 -2·
3 4 = 4 3 =2
Apply this idea to the given product to get

_l_ X _l_ X _-1_ X X 2016 X

2017 X
2018
3 4 5 ... 2017 2018 2019

_ 2 3 4 2016 2017 2018

3 X 4 x ...
X X X X
-2019 2016 2017 2018

2
= 2019 •

i�
Follow-Up: (1) Express ��; • as a simple fraction where the symbol'!' is read 'factorial" and
1
n! means to multiply the numbers 1 x 2 x 3 x ... x (n - 2) x (n - 1) x n. [ 2019 ].
(2) Express in simplest form:
-1 X -3 X -5 X -7 X -9 X 2 X 4 X 6 X 8 X 10 [-1]
2 4 6 8 JO 1 3 5 7 9'

48. METHOD 1 Strategy: Compute the length of each subsegment.

Since the length of the segment from A to Fis j - j = 81-z3 = ,52 and since it is divided
into 5 subsegments, each subsegment has a length of-&.
Therefore, Point O corresponds to the number
----------------------------------,�tMMI-
l + 3(-n--) = l + l = ; .
 Olympiad 4 Solutions

48. METHOD 2 Strategy: Use common denominators.

Convert the numbers that correspond to A and O into fractions with the same
denominator.
Then A corresponds to the number = l ?2
and F corresponds to the number � = 182 .
Since there are 4 equally spaced points between A and 8, they must correspond to
4 5 6 7
12, 12, 12, and 12 respectively.
6
So, D corresponds to the number 12 = �.

Follow-Up: (1) Find the number that corresponds to a point midway between -J and
7 1
2" [ 12]
(2) Order the following unit fractions from least to greatest:
1 1 1 1 1 1 1 1 1 1 1 1 1 11111
4 ' 12 ' 15 ' 2 ' 5 ' 10 ' 9 ' 3 ' 99 • [15 ' 99 '12 ' 1 0 ' 9 ' 5 ' 4 ' 3 ' 2 ]

4C. METHOD 1: Strategy: Count the number of seating arrangements that satisfy the
conditions.
In a circular table there is no first position.
Once Frank is seated, there are 5 choices for Alice.
Of these 5 choices, only 1 is directly across from Frank.
Therefore, the probability is �.

METHOD 2 Strategy: Consider all possible arrangements.

Once Frank sits, there are 5! = 120 possible arrangements for the remaining family
members.
The seat opposite Frank can be filled by any one of the children or by Alice.
If Alice sits opposite her husband, there are 4! = 24 possible arrangements for the
children.
Therefore, the probability of satisfying the requested situation is /2 = �. 6
Follow-Up: Suppose the family members described in the problem are sitting in a row
containing 6 chairs. What is the probability that both parents are sitting at the
ends of'the row? [ 115 ]
 Olympiad 4 Solutions

□
4D. METHOD 1 Strategy: Find a pattern.
In the first figure, there are 8 shaded squares.
In the second there are 12 shaded squares.
In the third there are 16 shaded squares, and so on. Effi C
This corresponds to a pattern that can be observed by subdividing the areas, where
the first figure comprises 4 congruent rectangles that are each composed of 2 squares,
to give a total area of 4 x 2.
Using a similar subdivision strategy, the second figure has an area of 4 x 3, and the n th
figure has 4 x (n + 1).
Consequently, the 28th figure will have an area of 4 x 29 shaded squares.
The sum of all the shaded squares in the first 28 figures is
4(2 + 3 + 4 + ... + 29) = 4((2 + 29) + (3 + 28) + ... + (15 + 16))
= 4(14 X 31)
= 1736.

METHOD 2 Strategy: Use subtraction of areas.

Notice that the number of shaded squares can be determined by subtracting the area
of the unshaded central square from the area of the larger square.
• The first figure has 9 - 1 = 8 shaded squares.
• The second has 16 - 4 = 12 shaded squares.
• The third figure has 25 - 9 = 16 shaded squares.
• The nth figure has (n + 2)2 - n2 = 4n + 4 = 4(n + 1) squares.
Thus, the 28th figure has 4(28 + 1) = 4 x 29 shaded squares.
The calculation can then be completed using Method 1.

METHOD 3 Strategy: Nest the squares.

Since the smallest figure has a side length of 3, and there are 28 figures in total, the
largest figure will have a side length of 30.
We can see that the pt figure can fit into the "hole" in the centre of the 3 rd figure.
Together, the 1st and 3 rd figures would fit into the "hole" of the 5 th figure.
Combining all of the odd-numbered figures, we can create a 29 x 29 square with a
single square missing in the centre, comprising 29 x 29 - 1 = 840 shaded squares.
Likewise, combining all of the even-numbered figures, we can create a 30 x 30 square
with four squares missing in the centre, comprising 30 x 30 - 4 = 896 shaded squares.
Therefore, the sum of all the shaded squares is 840 + 896 = 1736.
 Olympiad 4 Solutions

4D. Follow-Up: (1) If there are 30 people in a room and each person shakes hands with each
of the others, how many handshakes will take place? [ 435 J
(2) The Sierpinski sequence seen to the right is generated by joining unit
equilateral triangles. Each successive triangular
shape has 4 times the area of the preceding shape.
If this pattern continues, what is the total number
of small shaded triangles that appear in the first 4
figures of this sequence? [ 120 J

4E. METHOD 1 Strategy: List quantities in a table.

It is possible to purchase any multiple of One can also purchase a package of 7,
4 pretzels. followed by any number of 4s,
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16 9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24 17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32 25 26 27 28 29 30 31 32

two packages of 7, followed by any or three packages of 7, followed by any

number of 4s, number of 4s.
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
9 10 11 12 13 14 15 16 9 10 11 12 13 14 15 16
17 18 19 20 21 22 23 24 17 18 19 20 21 22 23 24
25 26 27 28 29 30 31 32 25 26 27 28 29 30 31 32

Since we can purchase the four consecutive amounts 18, 19, 20, and 21, we can add 4
to each to get the next four consecutive amounts.
• Thus, the greatest number that cannot be purchased is 17.

METHOD 2 Strategy: Use the formula of Frobenius.

Since 4 and 7 are relatively prime, the greatest number of pretzels that cannot be
formed is given by the Frobenius number for the set {4, 7}. For any two relatively
prime numbers a and b, the Frobenius number will be ab - a - b.
In this case, 4(7) - 4 - 7 = 17.

Follow-Up: (1) If paper money only came in denominations of $2, $5, and $10, what
amounts of money could not be paid in bills? [ $1 and $3 only]
(2) Stamps are sold in denominations of 1 OC and 49C only. What is the amount
beyond which all amounts can be made? [ 431 ]
(3) The Moebius Pretzel Company decides to sell packages of 2, 3, 5, 7, 11, and
13 pretzels. In how many different ways can August purchase 15 pretzels to
serve at a party? [ 12 ]
 Olympiad 5 Solutions

SA. METHOD 1 Strategy: Use tape diagrams.

75% o r! of the numbe is 45. r

j of 60 is 20.
Therefore, 1 of the numbe is 15, which 2 % o r 32 of 60 is 40.
Therefore, 663
r

means the number is 60.

45

I
15 15 15 ,s �l--2_0__ �_ :
____ 2_0_�
60 40

METHOD 2 Strategy: Partition a rectangle.

We are working with both qua rters and thirds of a quantity, so represent th s
i

quantity using a rectangle, with fou r columns represent i ng qua r ters and three rows
representing thirds.

!
Since of the numbe r is 45, then each � of this entire quantity is represented
column is 15 and each box is 5. by 2 rows.
These rows add up to 40.

Follow-Up: Given that � of a number is 3 more than � of the same number, find the
number. [ 45 ]

SB. Strategy: Isolate perfect square factors.

We know that a2 x b = 23 x 5 2 x 17 = 22 x 2 x 5 2 x 17.
Since 2, 5 and 17 are all prime, the greatest possible value for a2 is 22 x 5 2 .
It follows that a = 2 x 5 = 10.

Folow-Up: Find the least positive number N so that N x (23 x 52 x 17) is a perfect square.
l

[ 34]
 Olympiad 5 Solutions

SC. METHOD 1 Strategy: Build a table to compare the values in this set.
We shall begin by noting that all of the values lie between -1 and 1.

Smallest so far Largest so far

3
2 < i, so l is the smallest so far and i is -2
3 2
the largest so far.

1 is positive, so it is only a candidate for the

largest value. -2 3
3 4
We know that 1 > i.
Since the difference between -1 and -54 is �,
and the difference between -1 and -J
is �, -4
4
3
4
we can see that -5 is closer to -1 and is
therefore smaller.

The remaining values all lie between -i and i, and so cannot be either the smallest
or the largest values in the set.

Therefore the greatest difference between two values from the set is
3 -4 _ 3 4 _ 15 16 _ 31
4 - (5) - 4 + s - 20 + 20 - 20·

METHOD 2 Strategy: Change the values to decimals for easier comparison.

We can convert the values to decimals, rounding to two decimal places.

1 -2 3 -4 1 -2 3 -4
Value 3 4 5 6 7 8 9

Decimal Fraction 0.5 -0.67 0.75 -0.8 0.17 -0.29 0.38 -0.44

Listing these in order, we have:

-4 -2 -4 -2 1 3 1 3
Value 5 3 9 7 6 8 2 4

Decimal Fraction -0.8 -0.67 -0.44 -0.29 0.17 0.38 0.5 0.75

We can see that the largest is 1 (0.75) and the smallest is -: (-0.8).
Therefore the greatest difference is 0.75 - (-0.8) = 1.55 = ��.
 Olympiad S Solutions

so. Strategy: Count in an organised way.

Al------'I/ street
One
We shall define one street and turn
as being the path between the map so
two intersections, that A is at
C
the top.

The first horizontal

row would then
include all of the There is 1 way to reach
intersections each of those intersections.
that occur after
travelling along
one street.

The second To count the paths to

horizontal row each intersection, we
would include would add the number
the intersections of paths that could be
that occur after taken to reach each of the
travelling along intersections that came
two streets. immediately before.

To travel from A to
C, we can see that
After3streets there are 6 paths
�Rt:::::h:t::::::.S.:t::::::.����=====Aft;:e=:r::::4 s::tr= ts .
ee:::._
--,
that wou Id lead to C.

To travel from C to Therefore there are 6 x 10 = 60

B, we can see that paths from A to B via C.
there are 10 paths
that would lead [ Note that this is Pascal's
to B. Triangle.]
 Olympiad 5 Solutions

SE. METHOD 1 Strategy: Use algebra to represent the 3-digit numbers.

Expand the 3-digit number ABCto 100A + 108 + C.

Expand CBA to 1 00C + 108 + A.

If we assume C > A, then CBA - ABC = 99C - 99A = 99( C -A).

Since A and C are non-zero digits, there are only 8 unique values for N = C -A.

These values are 1 through 8.

METHOD 2 Strategy: Make a chart of all possibilities.

A 8 C CBA-ABCor N A B C CBA-ABCor
ABC-CBA ABC-CBA
�
1 2 3 321-123 198 1 2 4 421-124

1 2 5 521-125 396 1 2 6 621-126

1 2 7 721-127 594 1 2 8 821 -128
�
1 2 9 921-129 792 1 3 2 231 -132 99
--------- _,,,.,,.-
1 3 4 431-134 297 1 3 5 531 -135
�
1 3 6 631-136 495 1 3 7 731 -137
�
----- �
1 3 8 831-138 693 1 3 9 931-139
�

Notice that with all 14 examples in the chart, there are only 8 possible values for N.

By selecting any other combinations for A, B, and C, the difference ABC - CBA or

CBA -ABC will repeat one of the 8 values for N displayed in the chart.
Therefore, there are only 8 possible values for N = C -A.

Follow-Up: (1) A and B are distinct non-zero digits which are used to form the two 2-digit
whole numbers AB and BA. How many whole number values of AB - BA are
possible? [ 8]
(2) Same question as originally stated, but A, B, and C do not have to be distinct.
[ 9]
(3) A, 8, C and D are distinct non-zero digits which are used to form the two
4-digit whole numbers ABCD and DCBA. If ABCD - DCBA = N, how many whole
number values for N are possible? [ 64]