Re: math equation
- From: "leavemsg1" <leavemsg1@...>
> It's so quiet in this group... you can hear a math equation drop!Better silence than noise.
(Wait a second, that entirely contradicts my taste in live music!)
Anyway, let's fix that; I was going to submit this to Carlos Rivera's
PrimePuzzles site, but shall post it here instead.
Prove, or disprove:
Phi(n)^(n+1) == 1 (mod Phi(n+1)) iff n is an odd prime
If proved, also show that the apparition is either at (n+1) or (n+1)/2
depending on n modulo 4.
Here, as always, Phi(n) is the n-th cyclotomic polynomial.
Heaps of freshly picked kudos will go to the provider of the first
() ASCII ribbon campaign () Hopeless ribbon campaign
/\ against HTML mail /\ against gratuitous bloodshed
[stolen with permission from Daniel B. Cristofani]
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around