IMONST 2 2023
PRIMARY CATEGORY
Instructions
1. The IMONST 2 paper contains six (6) essay/proof-type problems. Each problem is
worth 7 points each. Integer partial scores are possible.
2. There are di↵erent papers for the Primary, Junior, and Senior categories. Please make
sure you have the paper for the right category.
3. The time allowed for the test is 4 hours, from 10.00 am to 2.00 pm, 21 October 2023.
4. You need:
(a) An internet connection to download the question paper and submit your solutions.
(b) To turn on the camera for the whole duration of the test.
(c) A4 papers (blank, not lined) for scratch papers and final scripts.
(d) Pens, pencils, erasers, geometric tools (compass, ruler).
(e) IMPORTANT: A scanner to scan your scripts. If you don’t have a scanner, please
download a scanner app on your phone – we recommend Adobe Scan.
5. Please use your handwriting to write the solutions. Do not type or use any word
processing/typesetting software to produce your script.
6. Write your full name, category, and school/institution at the top of the first
page.
7. Work on the solutions on your own. Any discussions, communication, or assistance
from another person is not allowed and might result in disqualification.
8. Calculator is NOT allowed. This is NOT an open-book test.
9. Please upload your script in PDF format at https://forms.gle/xr5ckkLyPyeoY5Vp6
before 2.30pm. Also, name the file as: Primary/Junior/Senior Your Name.
E.g. Primary - Suhaimi Ramly
1
IMONST 2 2023 (Primary)
Problem 1. Prove that for all positive integers n, 13 + 23 + 33 + · · · + n3 is a perfect square.
Buktikan untuk semua integer positif n bahawa 13 + 23 + 33 + · · · + n3 ialah kuasa dua
sempurna.
Problem 2. Ivan bought 50 cats consisting of five di↵erent breeds. He records the number
of cats of each breed and after multiplying these five numbers he obtains the number
100000. How many cats of each breed does he have?
Ivan membeli 50 kucing yang terdiri daripada lima baka yang berbeza. Dia merekodkan
bilangan kucing bagi setiap baka dan selepas mendarabkan lima nombor tersebut dia
memperoleh nombor 100000. Berapakah bilangan kucing bagi setiap baka yang dia
ada?
Problem 3. Find all pairs of positive integers (x, y), so that the number x3 + y 3 is a prime.
Cari kesemua pasangan integer positif (x, y), supaya nombor x3 + y 3 ialah perdana.
2
Problem 4. Given a right-angled triangle with hypotenuse 2024, find the maximal area of
the triangle.
Diberi suatu segi tiga bersudut tegak dengan hipotenus 2024, cari luas maksimum bagi
segi tiga tersebut.
Problem 5. Ruby writes the numbers 1, 2, 3, . . . , 10 on the whiteboard. In each move, she
selects two distinct numbers, a and b, erases them, and replaces them with a + b 1.
She repeats this process until only one number, x, remains. What are all the possible
values of x?
Ruby menulis nombor 1, 2, 3, . . . , 10 pada papan putih. Pada setiap langkah, dia memilih
dua nombor yang berbeza, a dan b, padamkan kedua-dua nombor tersebut, dan gantikan
mereka dengan a + b 1. Dia mengulangi proses ini sehingga hanya satu nombor, x,
yang tinggal. Apakah kesemua nilai yang mungkin bagi x?
Problem 6. Suppose ABCD is a cyclic quadrilateral with \ABC = \ADC = 90 . Let
E and F be the feet of perpendiculars from A and C to BD respectively. Prove that
BE = DF .
Andai ABCD suatu sisi empat kitaran dengan \ABC = \ADC = 90 . Jadikan E
dan F kaki bagi garis-garis serenjang masing-masing dari A dan C ke BD. Buktikan
bahawa BE = DF .
⌅ END OF PAPER ⌅
© 2023 Malaysia IMO Committee
3
nel 13 I I 2
ne 2 13 23 9 732 3
1 2
3 13 23 33 62 367
1 2 3
n 4
n 4 13 23 33 43 ooo 102 5 1 2 3 4
152
n 5
13423 33 43 53 225 2 3 4 5
13 23 334 m3 1 2 34 n
I
13 23 334 m3
In ng
Induction
Base case
Statement is true when ne
If the statement is true for nah then it is true for n ktl
T
Inductivestep
Base case n l
LHS 13
RHS NID I
Inductive step n ie n ktl
n k 13 23 334 tf ACID
44111 21
3
n Ktl 13 23 33 ka
13 23 331 ft Ati KLEIN Ktp
K 1
4 rt
KY
Lift Atl
Ati
E4
KY x 4232
fertility
13 23 334 n
Inly is true for all n 1,213
I
1 2 3 44 th
a
I b c d e
at btctate 50
abode 100000
AM GM
inequality
1 8 27
1 8 27 Arithmetic Mean
AM 12
3
Y
GM 3 1 8 27 6 Geometric mean
I 9
Am If g
GM Ta 3
AM GM Inequality
Given a set of non real numbers
negative
AM 2 GM
AM GM only if all the real numbers are equal
Proof
at btctdte 50 I have proven
something
abede 100000
Am atbtftdte L
GM 5 axbxexdxe L
Am Gm a b c d e
at btctdte 50 a b c id e to
IM
23 43 p ab p
a b l
p
at
Catyscaenyty p or
bop
t
I
I 1
ay 42
I
Caystay
0 El
O my
ay
yay gg
s
nay
2
ayy
Iiity y't
Y
o
acay
o n
y nyt
y't yet
I zty
y
23 z a 23 2 Kl
z
y y y3 y yet
any
I ay I
y
say Try ny
z
atty Zay
I
say
I
nay
a b
2024
at b 20242
area
El L
2
4
1012 2024 ab
dgb
ab I 1012 2024
Area I 10217
case a b 1012 2024
Equality
a b 101252
at b 20242
af 10122
A I
a b
1012
h hmu 1012
B j
te TE Bue te
Area 202421 1012 4 I 1012 1012
I 2 3 45 6 7 8 9 10 55 IT of numbers I by 1
54 9 Total sum
2 3 45 6 7 8 9 10
bby
T 4 5 6 7 8 9 10 153 8
52 7
6 7 8 10
15 9
6 7 8 9 10 51 6
46 7 8 a 10 50 8
22 8 49 4
9 10
48 3
29 9 10
47 2
37 10
10 46 II
For it to be left with 1 number we will need 9 moves
After 9 moves 55 9 414 the final number
C
AC is a diameter
O midpoint AC
me midpoint of BD
O
0
E
B re Aoc equally spaced
openof p
tmtF
equally spaced
or
A EM MF
K BE BM ME
IMD MF
DF
111.711 t
s
Yt M F
A
Congruent
time
as
É In E
49 9 812
91,92
A
11 2 11 s a
19,0 95,0 4,0
