Timeline for Estimate for products of integers that are relatively prime with $N$
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 20, 2012 at 15:52 | comment | added | Gerhard Paseman | ... which will be -1 mod N, in a manner akin to the proof of Wilson's theorem. Gerhard "Ask Me About System Design" Paseman, 2012.05.20 | |
| May 20, 2012 at 15:43 | comment | added | Gerhard Paseman | Your remark regarding primitive roots should be made mod N. Taking N=9 I get 2240 which is not the 21st power of any integer. Also g^phi(N) will be 1, so the result will be a square root of 1 mod N. Gerhard "I Like The Proof Idea" Paseman, 2012.05.20 | |
| May 20, 2012 at 12:43 | history | answered | Daniel m3 | CC BY-SA 3.0 |