Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
← 55 members online
 0 viewing
badreferences
Group Title
For \(p>1\), integer \(p\) can only be prime iff\[\sum_{i=1}^{p1}i^{p1}\equiv1\pmod p\]Prove?
 2 years ago
 2 years ago
badreferences Group Title
For \(p>1\), integer \(p\) can only be prime iff\[\sum_{i=1}^{p1}i^{p1}\equiv1\pmod p\]Prove?
 2 years ago
 2 years ago

This Question is Closed

badreferences Group TitleBest ResponseYou've already chosen the best response.0
Whoops, ahaha, fixed the TeX.
 2 years ago

mathmate Group TitleBest ResponseYou've already chosen the best response.0
Use fermat's little theorem. a^p = a which is equivalent to a^(p1) = 1 Now proceed with the summation.
 2 years ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.