Let $m\ge 2$ be an integer. Find the smallest positive integer $n>m$ such that for any partition with two classes of the set $\{ m,m+1,\ldots ,n \}$ at least one of these classes contains three numbers $a,b,c$ (not necessarily different) such that $a^b=c$. Ciprian Manolescu