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
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 11, 2016 at 19:50 | comment | added | Igor Rivin | Chebotarev is applied to the polynomial $x^n-q.$ Mod most primes this has no linear factor, so $q$ is not an $n$-th power. | |
| Jan 11, 2016 at 18:58 | comment | added | Alex | @GerryMyerson I apologize, what exactly would Chebotarev's be applied to? | |
| Jul 21, 2015 at 1:28 | history | edited | Igor Rivin | CC BY-SA 3.0 |
fixed typo
|
| Jul 21, 2015 at 1:27 | vote | accept | Alex | ||
| Jul 21, 2015 at 1:20 | history | answered | Igor Rivin | CC BY-SA 3.0 |