SOLUTION

1. Simplify the multiplication as follows:

 1  1  1  1 
2000   1     1     1       1  
 2  3  4  100 
1 2 3 99 1
 2000        2000   20
2 3 4 100 100

2. Since 2022  2  3  337 , d (2022)  8 .

One sees that X  102 and Y  1001, i.e., X  Y  1103 .

3. Since if Benny’s age is doubled and Calvin’s age is halved, both will be of the
same age, Benny’s current age : Calvin’s current age  1: 4 .
Let Benny’s current age be 1unit, then Andy’s current age is (2 units 7 ) and
Calvin’s current age is 4units. Hence,
2u  7  1u  4u  42  3  126  7u  133  1u  19
Thus, Calvin’s current age is 4  19  76 years old.

4.
A E B
G

D C

Join AG . Let  ABCD  denote the area of the rectangle ABCD .

Since AE  EB and AF  FD , let  AEG   BEG   m and  AFG   DFG   n.

1
 AFB   4  ABCD    AED   m  2n  n  2m  m  n .
4 1
Hence, area of non-shaded region is    5  6   20 cm2.
3 2
The area of shaded region is  3  3    5  5   20  40 cm2.
 2

5.
Rest Sat, Work Tue, Work Fri, Work Mon, Work Thu, Work Sun,
Days / Sun Wed Sat Tue Fri Mon
Work
No. of - 8 2 8 2 8 2 8 2 8 -
days

The table above shows the number of days that must elapse before the next
rest day falls on Sunday again.
Number of days = 8  5  2  4  48 . This translates to 48  7  6 remainder 6
weeks. Thus, 7 weeks must elapse before the next rest day falls on Sunday
again.

6. Since A  17 is a multiple of 5, A has remainder 3 when it is divided by 5.

Since A  17 is a multiple of 6, A has remainder 5 when it is divided by 6.
Let A  5m  3 , where m is an integer.
5m  3  5 (mod 6)  m  4 (mod 6)
Hence, A  5m  3  5  6k  4   3  30k  23 , where k is an integer.
Thus, the largest possible value of A is 30  2  23  83 .

1
7. Area of the shaded region is  2  3  3 units.
2
Case 1: Triangles of base 2 units and height 3 units, as shown in
Figure 1. There are 4  2  8 such triangles.

Figure 1

Case 2: Triangles of base 2 units and height 3 units, as shown in

Figure 2. There are 4  2  8 such triangles.

Figure 2

Case 3: Triangles of base 3 units and height 2 units, as shown in

Figure 3. There are 4  2  8 such triangles.

Figure 3

NMOS 2022
 3

Case 4: Triangles of base 3 units and height 2 units, as shown in

Figure 4. There are 4  2  8 such triangles.

Figure 4

Case 5: Triangles of base 2 units and height 3 units, as shown in

Figure 5. There are 2  2  2  8 such triangles.

Figure 5

Case 6: Triangles of base 3 units and height 2 units, as shown in

Figure 6. There are 2  2  2  8 such triangles.

Figure 6

There are altogether 8  8  8  8  8  8  48 triangles.

7a  b
8. Notice that a  b   1 if and only if b  0 . Hence, we conclude that
7a  b
n2  n3  0 .
7a  b
One also sees that a  b   0 if and only if b  7a , i.e., n 3  7n 2 .
7a  b
We conclude that n  7 is the only positive integer.

9. Suppose one machine from Warehouse B is sent to Factory I.

Consider the cost of  B,I  and  A, II  , i.e., sending one machine from

Warehouse B to Factory I and one machine from Warehouse A to Factory II. It

costs S$135.
If we switch the job, notice that  B, II  and  A,I  only costs S$120, a cheaper

option. Hence, we conclude that all 7 machines in Warehouse B should be

sent to Factory II. The total cost is 50  9  100  3  70  7  1240 .

NMOS 2022
 4

    
2
10. Notice that ab  P ab is only possible when P ab  9 .

 
P ab ab   ab 
2
Accepted Count
9 19, 33 91 1
8 18, 24, 42 81 1
7 17 71 1
6 16, 23, 32 61 1
5 15 51 1
4 14 41, 22 2
3 13, 31 2
2 12, 21 2
1 11 1
0 10, 20, …, 90 9

There are 21 such two-digit positive integers.

1 5
11. During the first 10 minutes, car X travelled 2.5   km longer than car Y.
6 12
25 5
During the last 25 minutes, car X travelled 0.5   km longer than car Y.
60 24
As the two cars reached station B at the same time, during the in-between 5
5 5 5
minutes, car Y should travel   km longer than car X, whereby car Y
12 24 8
5 5
should be faster than car X by   7.5 km per hour.
8 60
Hence, car X decreased speed by 7.5  2.5  10 km per hour.

If  M  13   25  M  M  2 , we have  M  13   2M  23 . Now 2M  23 is
2 2
12.

non-negative and we must have M  12 . Check that M  12 is a solution.

If  M  13   25  M  M  2 , we have  M  13   2M  27 . Similarly, one sees

2 2

that M  14 is a solution.
We conclude that M  12 is the smallest positive integer satisfying the
conditions.

NMOS 2022
 5

13. If the fire station is located along the rhombus, it will travel at least 2 AB distance,
i.e., half of the perimeter of the square, to reach the midpoint of BC. This is also
the case if the fire station is located along the square: at least half of the
perimeter of the square to reach the position which is symmetric about the
centre of the square.
9
In conclusion, p  2 AB  14 and the smallest possible value of p is 94. One
60
may set up the fire station at point E.

14.  
It is easy to see that D  9 . Refer to the fifth row where 7     . There

are only a few possibilities: 17  4  68 , 27  2  54 , or 37,47,57,67 multiplied

by 1.
If the divisor is 17, then the last step gives 17  7  119 . Now C  9  D , which
is not allowed.
One may also check that the divisor cannot be 37,47,57,67 . The only answer
is 27  527  14229 . Hence, A  B  C  D  16 .

15. 2020  5  404

From the first circle, the students who stayed behind are
5  1, 5  2, 5  3,, 5  404 . They will proceed to form the second circle.
404  5  80 remainder 4
From the second circle, the students who stayed behind are
5  5  1, 5  5  2,, 5  5  80 . They will proceed to form the third circle.
80  5  16
From the third circle, the students who stayed behind are
5  5  5  1, 5  5  5  2,, 5  5  5  16 . They will proceed to form the fourth
circle.
16  5  3 remainder 1
From the fourth circle, the students who stayed behind are
5  5  5  5  1, 5  5  5  5  2, 5  5  5  5  3
Thus, the last student who stays in the smallest circle is 5  5  5  5  3  1875

NMOS 2022
 6

16. Let the river flow speed be m (km/h) and the speed of the slow ship upstream
be n (km/h). Now the speed of the fast ship in still water is n  m (km/h).
According to the schedule, the slow ship moves upstream with speed n (km/h)
and travels 90 km. Meanwhile, the fast ship moves downstream with speed
n  2m (km/h) and travels 180 km.
It follows that (n  2m ) is twice of n  m . Hence, n is equal to 4m .

In reality, the slow ship travels 135 km. The fast ship travels with speed
n  2m  6m (km/h) for 2 hours, and then the rest of the time with speed m
135 135
(km/h). Since the total time is  , the fast ship is carried forward by
n  m 3m
135
the river flow for  2 hours.
3m
Notice that the fast ship also travels 135 km. We must have:
 135 
2  6m     2  m  270  135  135 , i.e., 12m  45  2m  135 .
 3m 
It follows that m  9 km per hour.

17.
A B

Q
P

D C

Since  ABP   DPC  

1
  ABCD  , hence,
DPC   1  2  1 .
2  ABCD  2 3  2 5
Since  ADP   BCP  
1
  ABCD  , hence,
 ADP   1  3  3 .
2  ABCD  2 3  7 20
Since  ABQ   CDQ  
1
  ABCD  , hence,
 ABQ   1  3  3 .
2  ABCD  2 3  5 16
Since  ADQ    BCQ  
1
  ABCD  , hence,
BCQ   1  1  1 .
2  ABCD  2 4  1 10

NMOS 2022
 7

Hence,
 APCQ   1  1  3  3  1  1   16  12  15  8   1  51  29 .
 
 ABCD  5 20 16 10  80  80 80
Thus m  n  29  80  109 .

18. Since A  35  89  124  A ,

(i) the number below 1 is 35  89  1  123 ;
(ii) the number next to 1 is  A  124   123  89  A  88 ;

(iii) the number below 89 is  A  124    A  88   1  211;

(iv) the number below 211 is  A  124   89  211  A  176 .

The sum of numbers on the diagonal is A   A  88    A  176  , hence,

A   A  88    A  176   A  124 . Therefore, A  194 .

19. For any three-digit number, the smallest sum of digits is 1 (for 100 only), and
the largest sum of digits is 27 (for 999 only). The other possible sums of digits
are 2, 3, 4, …, 26, and each will have at least 3 three-digit numbers. Suppose
we have 27 pigeonholes as 1, 2, 3, , 25, 26, 27 , the least value of
n in order to get at least 3 numbers whose sum of digits are the same is
2  25  2  1  53 .

20. A D

J I
E

B G H C

1  522 
Area of ADE is    202   238 cm2.
4  2 

- THE END -

NMOS 2022
 8

BLANK PAGE

NMOS 2022