Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Agoh–Giuga conjecture
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Relation to Wilson's theorem== The Agoh–Giuga conjecture bears a similarity to [[Wilson's theorem]], which has been proven to be true. Wilson's theorem states that a number ''p'' is prime if and only if :<math>(p-1)! \equiv -1 \pmod p,</math> which may also be written as :<math>\prod_{i=1}^{p-1} i \equiv -1 \pmod p.</math> For an odd prime p we have :<math>\prod_{i=1}^{p-1} i^{p-1} \equiv (-1)^{p-1} \equiv 1 \pmod p,</math> and for p=2 we have :<math>\prod_{i=1}^{p-1} i^{p-1} \equiv (-1)^{p-1} \equiv 1 \pmod p.</math> So, the truth of the Agoh–Giuga conjecture combined with Wilson's theorem would give: a number ''p'' is prime if and only if :<math>\sum_{i=1}^{p-1} i^{p-1} \equiv -1 \pmod p</math> and :<math>\prod_{i=1}^{p-1} i^{p-1} \equiv 1 \pmod p.</math>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)