ROSECODE 187
Smallest partition
Proposition :
[My timing: pencil and paper]
For any partition of {3,...,n} = A ∪ B the equation x*y = z where x,y,z (not necessarily distinct) are all in A or all in B has always a solution.
Find the least integer n such as this proposition is true.[My timing: pencil and paper]