MathDB
Problems
Contests
National and Regional Contests
Malaysia Contests
Malaysia IMONST
2020 Malaysia IMONST 2
6
6
Part of
2020 Malaysia IMONST 2
Problems
(1)
Malaysia IMONST 2 Senior Problem 6
Source: Malaysia IMO national selection test 2020
10/19/2020
Consider the following one-person game: A player starts with score
0
0
0
and writes the number
20
20
20
on an empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers (call them
b
b
b
and
c
c
c
) such that
b
+
c
=
a
b + c = a
b
+
c
=
a
. The player then adds
b
×
c
b\times c
b
×
c
to her score. She repeats the step several times until she ends up with all
1
1
1
's on the whiteboard. Then the game is over, and the final score is calculated. Let
M
,
m
M, m
M
,
m
be the maximum and minimum final score that can be possibly obtained respectively. Find
M
−
m
M-m
M
−
m
.
combinatorics
induction