Odd Primes Divisible by Sum of n^p-1 from n=1 to 103

  • Thread starter Thread starter icystrike
  • Start date Start date
  • Tags Tags
    Primes Sum
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
2 replies · 2K views
icystrike
Messages
444
Reaction score
1
Find all odd primes [tex]p[/tex], if any, so that [tex]p[/tex] divides [tex]\sum_{n=1}^{103} n^{p-1}[/tex]
 
Physics news on Phys.org
By Fermat's Little Theorem,
[tex]n^{p-1} \equiv 1 (mod p)[/tex]

[tex]\sum_{n=1}^{103} n^{p-1} \equiv 103 (mod p)[/tex] ,

Whence [tex]p \mid 103[/tex]

Since 103 is prime , therefore 103 it is the only prime.

It seems like my proof is wrong please correct me. (=
 
Your proof is valid for p>103. If p<=103 then you can have p | n and [itex]n^{p-1} (modp)[/itex] will be 0