Problem

Source: Mexico

Tags: number theory, induction



Let $k$ be a positive integer and $m$ be an odd integer. Prove that there exists a positive integer $n$ such that $n^n-m$ is divisible by $2^k$.