MathDB
O 10

Source:

May 25, 2007

Problem Statement

Let m≥2m \ge 2 be an integer. Find the smallest integer n>mn>m such that for any partition of the set {m,m+1,⋯ ,n}\{m,m+1,\cdots,n\} into two subsets, at least one subset contains three numbers a,b,ca, b, c such that c=abc=a^{b}.
Back to ProblemsView on AoPS