Prove that $6n+n^7$ is divisible by $7$ for $n>0$.
Skip the $n=1$ part...
Induction hypothesis: $P(k)=6k+k^7=k(6+k^6)$ is divisible by $7$
For $n=k+1$, we have that $$P(k+1)=6(k+1)+(k+1)^7=(k+1)[6+(k+1)^6]$$ How should I continue? Thanks
Prove that $6n+n^7$ is divisible by $7$ for $n>0$.
Skip the $n=1$ part...
Induction hypothesis: $P(k)=6k+k^7=k(6+k^6)$ is divisible by $7$
For $n=k+1$, we have that $$P(k+1)=6(k+1)+(k+1)^7=(k+1)[6+(k+1)^6]$$ How should I continue? Thanks
On
Write $$(n^7-n)+7n=\frac{(n-1)n(n+1)\left((2n-1)^2+3\right)\left((2n+1)^2+3\right)}{16}+7n$$
If $7\mid n$ we are done, if $7\not\mid n$ there are some possibilities:
We don't have to worry about $16=2^4$ in the denominator, since $\gcd(2,7)=1$, and both:
are true.
On
Since $\binom7i$ is divisible by $7$ for $i\ne0,7$, we have that \begin{align}P(k+1)&=\color{red}{6(k+1)}+\color{blue}{(k+1)^7}\\&=\color{red}{6k+6}+\color{blue}{k^7+7(\text{something})+1}\\&=(6k+k^7)+7(\text{something}+1)\end{align} which is divisible by $7$ from the induction hypothesis.
On
There are, in my opinion, two possible approaches.
The first one is to show it is true for $n=1, \ldots , 7$ and then show by induction that if it's true for $n$ then it's true for $n+7$.
The second one is to use the Fermat's Little Theorem
$$(k+1)^7=\binom{7}{0}+\binom{7}{1}k^1+\binom{7}{2}k^2+\cdots+\binom{7}{6}k^6+\binom{7}{7}k^7$$
$$(k+1)^7=1+7k+\binom{7}{2}k^2+\cdots+\binom{7}{6}k^6+k^7$$ $$P(k+1)=6(k+1)+(k+1)^7=6k+6+1+k^7+7(...)$$ $$P(k+1)=6(k+1)+(k+1)^7=6k+7+k^7+7(...)$$ $$P(k+1)=6(k+1)+(k+1)^7=(6k+k^7)+7+7(...)$$
$6k+k^7$ is already divisible by 7 as you assumed this, other remaining terms are also multiple of 7 thus divisible by 7
$$ \forall n\ge 1 \hspace{10pt} P(n) \implies P(n+1)$$