Malaysia IMONST 2 Senior Problem 6
Source: Malaysia IMO national selection test 2020
October 19, 2020
combinatoricsinduction
Problem Statement
Consider the following one-person game: A player starts with score and writes the number on an
empty whiteboard. At each step, she may erase any one integer (call it a) and writes two positive integers
(call them and ) such that . The player then adds to her score. She repeats the step
several times until she ends up with all 's on the whiteboard. Then the game is over, and the final score is
calculated. Let be the maximum and minimum final score that can be possibly obtained respectively.
Find .