Kvant Math Problem 786
Consider small values of $n$ and $k$ to identify a pattern.
Verified: no
Verdicts: SKIP + SKIP
Solve time: 7m18s
Source on kvant.digital
Problem
Prove that for any natural numbers $n$ and $k$ (greater than 1), the number $n^k$ can be expressed as the sum of $n$ consecutive odd numbers.
(For example, $4^3=13+15+17+19$; $7^2=1+3+5+7+9+11+13$; $3^4=25+27+29$.)
A. N. Kozachenko
Exploration
Consider small values of $n$ and $k$ to identify a pattern. For $n=2$ and $k=2$, $2^2=4$ can be written as $1+3$. For $n=3$ and $k=2$, $3^2=9$ equals $1+3+5$. For $n=2$ and $k=3$, $2^3=8$ equals $3+5$. For $n=3$ and $k=3$, $3^3=27$ equals $7+9+11$. These examples suggest that $n^k$ can indeed be written as the sum of $n$ consecutive odd numbers, and that the first term of the sequence increases with $n$ and $k$ in a specific way.
Expressing a sum of $n$ consecutive odd numbers algebraically, if the first term is $a$, the sum is $a+(a+2)+\dots+(a+2(n-1)) = n(a+n-1)$. This yields the equation $n(a+n-1) = n^k$, hence $a+n-1 = n^{k-1}$, giving $a = n^{k-1}-n+1$. Testing this formula with examples confirms it produces the correct first term.
The likely delicate point is justifying this formula for all natural $n$ and $k>1$, and verifying that the sequence indeed consists of consecutive odd numbers.
Problem Understanding
The problem asks to show that any natural number power $n^k$, with $n>1$ and $k>1$, can be written as a sum of exactly $n$ consecutive odd numbers. This is a Type B problem, as the statement is given and we are to prove it directly. The core difficulty lies in explicitly identifying the starting number of the consecutive odd sequence and verifying that the sum formula works for all $n$ and $k$. The key insight is that any sum of $n$ consecutive odd numbers can be expressed as $n$ times a linear function of the first term, which can then be solved to match $n^k$.
Proof Architecture
Lemma 1 states that the sum of $n$ consecutive odd numbers starting with $a$ is $n(a+n-1)$. This follows directly from summing an arithmetic progression of $n$ terms with common difference $2$.
Lemma 2 asserts that for given $n$ and $k$, the equation $n(a+n-1)=n^k$ has a natural number solution for $a$, namely $a=n^{k-1}-n+1$. This is verified by simple algebra and checking positivity for all $n,k>1$.
The main argument combines these lemmas to conclude that $n^k$ equals the sum of $n$ consecutive odd numbers starting from $a=n^{k-1}-n+1$. The hardest part is ensuring that $a$ is indeed positive and odd.
Solution
The sum of $n$ consecutive odd numbers starting with an integer $a$ is an arithmetic progression with first term $a$, common difference $2$, and $n$ terms. Its sum is given by
$$S = n \cdot \frac{2a + 2(n-1)}{2} = n(a+n-1).$$
To express $n^k$ as such a sum, we set $n(a+n-1) = n^k$. Dividing both sides by $n$ yields $a+n-1 = n^{k-1}$, which gives
$$a = n^{k-1} - n + 1.$$
Since $n>1$ and $k>1$, we have $n^{k-1} \ge n > 1$, hence $a = n^{k-1}-n+1 \ge 1$, confirming that the first term is a natural number.
Next, we verify that $a$ is odd. Every power of a natural number $n$ is either odd or even depending on $n$. If $n$ is odd, $n^{k-1}$ is odd, and $a = \text{odd}-\text{odd}+1 = \text{odd}$. If $n$ is even, $n^{k-1}$ is even, and $a = \text{even}-\text{even}+1 = 1$, which is odd. Therefore, in all cases $a$ is odd.
Consequently, the $n$ consecutive odd numbers $a, a+2, a+4, \dots, a+2(n-1)$ sum to
$$n(a+n-1) = n \cdot n^{k-1} = n^k.$$
This completes the proof. ∎
Verification of Key Steps
The delicate steps are the positivity and parity of $a$. Testing small values of $n$ and $k$ confirms positivity: for $n=2$ and $k=3$, $a=2^{2}-2+1=3$. For $n=3$ and $k=4$, $a=3^3-3+1=25$. In both cases $a$ is positive.
Parity verification: if $n$ is even, $n^{k-1}$ is even and $n$ is even, so $a = \text{even}-\text{even}+1=1$, odd. If $n$ is odd, $n^{k-1}$ is odd, $n$ is odd, so $a = \text{odd}-\text{odd}+1=\text{odd}$. In both scenarios, $a$ is odd, ensuring the sequence consists of consecutive odd numbers.
These checks confirm that no corner case produces a negative or even first term.
Alternative Approaches
A combinatorial approach uses the representation of powers as sums of $n$-tuples in an $n \times n^{k-1}$ rectangle of unit squares, viewing consecutive odd numbers as sums along diagonals. While this offers geometric intuition, it requires additional setup and case checking to translate into explicit sums, making the direct arithmetic progression method simpler and fully general for all natural $n$ and $k$.