Subcontests
(6)NT from EGMO 2018
Consider the set
A={1+k1:k=1,2,3,4,⋯}.
[*]Prove that every integer x≥2 can be written as the product of one or more elements of A, which are not necessarily different.[*]For every integer x≥2 let f(x) denote the minimum integer such that x can be written as the
product of f(x) elements of A, which are not necessarily different.
Prove that there exist infinitely many pairs (x,y) of integers with x≥2, y≥2, and f(xy)<f(x)+f(y). (Pairs (x1,y1) and (x2,y2) are different if x1=x2 or y1=y2).
Combinatorics from EGMO 2018
The n contestant of EGMO are named C1,C2,⋯Cn. After the competition, they queue in front of the restaurant according to the following rules.[*]The Jury chooses the initial order of the contestants in the queue.
[*]Every minute, the Jury chooses an integer i with 1≤i≤n.[*]If contestant Ci has at least i other contestants in front of her, she pays one euro to the Jury and moves forward in the queue by exactly i positions.
[*]If contestant Ci has fewer than i other contestants in front of her, the restaurant opens and process ends.[*]Prove that the process cannot continue indefinitely, regardless of the Jury’s choices.
[*]Determine for every n the maximum number of euros that the Jury can collect by cunningly choosing the initial order and the sequence of moves.