Timeline for Given a prime exponent e and a prime number n, find b, where b^e = 1 mod n
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 21, 2016 at 13:19 | comment | added | fkraiem | In fact it is not necessary for $g$ to be a primitive root; any element will do. | |
| Jun 21, 2016 at 13:08 | history | edited | gammatester | CC BY-SA 3.0 |
Added the other solutions for the example
|
| Jun 21, 2016 at 11:15 | history | edited | gammatester | CC BY-SA 3.0 |
added 172 characters in body
|
| Jun 21, 2016 at 11:06 | history | answered | gammatester | CC BY-SA 3.0 |