Problem

Source: Oliforum Contest V 2017 p5 https://artofproblemsolving.com/community/c2487525_oliforum_contes

Tags: partition, number theory, Sets



Find the smallest integer $n > 3$ such that, for each partition of $\{3, 4,..., n\}$ in two sets, at least one of these sets contains three (not necessarily distinct) numbers $ a, b, c$ for which $ab = c$. (Alberto Alfarano)