Timeline for Given n and q, how to find p so q$\neq$n-th power (mod p)?
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 21, 2015 at 1:27 | vote | accept | Alex | ||
Jul 21, 2015 at 1:20 | answer | added | Igor Rivin | timeline score: 3 | |
Jul 21, 2015 at 0:36 | history | edited | Alex | CC BY-SA 3.0 |
added 16 characters in body
|
Jul 21, 2015 at 0:34 | comment | added | Alex | Well, that would work if there were a way to guarantee it would always return an answer. Not an optimal solution obviously. | |
Jul 21, 2015 at 0:24 | comment | added | Gerry Myerson | I don't suppose you would accept "systematic search" as an answer? | |
Jul 21, 2015 at 0:19 | history | edited | Alex | CC BY-SA 3.0 |
added 26 characters in body
|
Jul 21, 2015 at 0:14 | review | First posts | |||
Jul 21, 2015 at 0:41 | |||||
Jul 21, 2015 at 0:13 | history | asked | Alex | CC BY-SA 3.0 |