NumberTheoryBasic
PolynomialAndEquation
AIME
2011
Find the number of positive integers $m$ for which there exist nonnegative integers $x_0$, $x_1$ , $\dots$ , $x_{2011}$ such that \[m^{x_0} = \sum_{k = 1}^{2011} m^{x_k}.\]
The solution for this problem is available for
$0.99.
You can also purchase a pass for all available solutions for
$99.