2
$\begingroup$

Let $a_{1},\dots,a_{n},\,n>2$ distinct natural numbers. Prove that if $p_{1},\dots,p_{r}$ are prime numbers and they divide $a_{1}+\dots+a_{n}$ then exists an integer $k>1$ and a prime $p\neq p_{i},\,\forall i=1,\dots,r$ such that $p\mid a_{1}^{k}+\dots+a_{n}^{k}.$ I think it can be seen like $a_{1}+\dots+a_{n}\nmid a_{1}^{k}+\dots+a_{n}^{k}\,\,\forall k\in\mathbb{N}$ but I don't know how attack the problem.

$\endgroup$
  • 1
    $\begingroup$ What's the source of this problem, please? $\endgroup$ – Gerry Myerson Dec 12 '14 at 10:09
  • $\begingroup$ Are you still here? $\endgroup$ – Gerry Myerson Dec 13 '14 at 10:15

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.