Timeline for Computability of a relation connected to the discrete logarithm
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2017 at 10:18 | comment | added | Wojowu | ah, right, I've missed that. It should still be true that $n$ may be taken prime, but a separate argument for that would be necessary. | |
| Nov 10, 2017 at 10:15 | comment | added | js21 | @Wojowu:That is much less obvious to achieve because of the condition $n > a,b$. | |
| Nov 10, 2017 at 10:13 | vote | accept | Dominic van der Zypen | ||
| Nov 10, 2017 at 10:04 | comment | added | Wojowu | Note that taking some prime factor of $n$ we may even assume that $n$ is prime. | |
| Nov 10, 2017 at 10:02 | history | answered | js21 | CC BY-SA 3.0 |