Elementary Number Theory: Divisibility proof

87 Views Asked by At

Let $k,m,n \in N\setminus \{0\}$, s.t. $n=k\cdot m$. Show that $k$ is odd $\Rightarrow ∀ a,b \in Z: (a^m+b^m) \mid (a^n+b^n)$

In the first part of the task, I have already shown that $∀ a,b \in Z: (a^m-b^m) \mid (a^n-b^n)$

3

There are 3 best solutions below

0
On

$a^{km} +b^{km} =(a^m +b^m )( a^{(k-1)m} -a^{(k-2)m} b^m +...+a^{m} b^{(k-2)m} +b^{(k-1)m} )$

0
On

Hint: if $k$ is odd then $$a^n + b^n = a^{km} + b^{km} = (a^m)^k - (-b^m)^k $$

0
On

You know that, if $k$ is odd, then $u+v \mid u^k + v^k$. Now let $u = a^m$ and $v = b^m$.