Timeline for answer to Rediscovery of lost mathematics by Count Iblis
Current License: CC BY-SA 3.0
Post Revisions
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 8, 2016 at 9:32 | comment | added | Alexey Ustinov | Tonelli–Shanks algorithm is a problem V.2 from Vinogradov's "Elements of Number Theory" (my 6th edition was published in 1953, 20 years before Shanks). Similar algorithm can be found in the Grave's "Elementary course of number theory (1913). Grave calls it Korkine's method. Korkine proposed (1909, postmortal article) method for solving $x^n=a(mod p)$, but he used primitive roots, see mathnet.ru/php/… | |
| S Jul 18, 2014 at 17:04 | history | answered | Count Iblis | CC BY-SA 3.0 | |
| S Jul 18, 2014 at 17:04 | history | made wiki | Post Made Community Wiki by Count Iblis |