Timeline for On the computational complexity of Pepin's test
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2020 at 0:06 | vote | accept | DDS | ||
| Oct 17, 2020 at 9:08 | history | edited | Bruno | CC BY-SA 4.0 |
Mistake on exponentiation
|
| Oct 17, 2020 at 9:06 | comment | added | Bruno | Of course! Sorry for that, and I correct! | |
| Oct 17, 2020 at 8:20 | comment | added | Emil Jeřábek | Repeated squaring takes $O(\log(\frac{F_n-1}2))=O(2^n)$ operations, not $O(\log(3^{\dots}))$. | |
| Oct 17, 2020 at 8:04 | history | answered | Bruno | CC BY-SA 4.0 |