Talk:Cipolla's algorithm: Revision history

30 January 2024

• curprev 14:3214:32, 30 January 2024 Cewbot talk contribs m 2,519 bytes +18 Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field. undo Tag: Talk banner shell conversion

8 March 2022

• curprev 05:3005:30, 8 March 2022 GreenC talk contribs 2,501 bytes +18 →Cipolla's algorithm is able to find square roots of powers of prime modula undo

16 January 2022

• curprev 22:4522:45, 16 January 2022 Endo999 talk contribs 2,483 bytes +7 toc added undo

18 February 2018

• curprev 17:3817:38, 18 February 2018 Endo999 talk contribs 2,476 bytes +77 →Cipolla's algorithm is able to find square roots of powers of prime modula: reference improvement undo

16 January 2018

• curprev 06:5106:51, 16 January 2018 Endo999 talk contribs 2,399 bytes +221 →What if a^2-n is a square? undo
• curprev 05:5705:57, 16 January 2018 Jackzhp talk contribs 2,178 bytes +203 →Cipolla's algorithm is able to find square roots of powers of prime modula undo

11 November 2017

• curprev 04:5804:58, 11 November 2017 TheBlueWizard talk contribs 1,975 bytes +86 Add rating, dummy header undo

11 October 2017

• curprev 14:0514:05, 11 October 2017 Endo999 talk contribs 1,889 bytes +199 →Cipolla's algorithm is able to find square roots of powers of prime modula: reference to dickson's work put in undo

28 September 2017

• curprev 18:2218:22, 28 September 2017 Endo999 talk contribs m 1,690 bytes +12 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 18:2118:21, 28 September 2017 Endo999 talk contribs 1,678 bytes −12 Undid revision 802824440 by Endo999 (talk) undo
• curprev 18:2018:20, 28 September 2017 Endo999 talk contribs m 1,690 bytes +12 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 18:1918:19, 28 September 2017 Endo999 talk contribs 1,678 bytes −11 Undid revision 802824236 by Endo999 (talk) undo
• curprev 18:1818:18, 28 September 2017 Endo999 talk contribs m 1,689 bytes +11 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 13:1513:15, 28 September 2017 Endo999 talk contribs m 1,678 bytes +11 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 13:0713:07, 28 September 2017 Endo999 talk contribs m 1,667 bytes 0 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 13:0613:06, 28 September 2017 Endo999 talk contribs m 1,667 bytes 0 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 13:0413:04, 28 September 2017 Endo999 talk contribs m 1,667 bytes +4 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 13:0213:02, 28 September 2017 Endo999 talk contribs 1,663 bytes +74 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 12:5912:59, 28 September 2017 Endo999 talk contribs m 1,589 bytes +120 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 12:5712:57, 28 September 2017 Endo999 talk contribs m 1,469 bytes 0 →Cipolla's algorithm is able to find square roots of powers of prime modula undo
• curprev 12:5612:56, 28 September 2017 Endo999 talk contribs 1,469 bytes +1,220 →Cipolla's algorithm is able to find square roots of powers of prime modula: new section undo

15 October 2016

• curprev 14:2814:28, 15 October 2016 94.74.104.42 talk 249 bytes +249 ←Created page with '1. x^2 = 10; in F_13 the Legendre symbol also is 1 in (10|3). Why 13? 2. (10|13) = 10^6 mod 13; Why 6? Wrom where this number? 3. a = 2; n = 10; a^2-n = 4-10 =...'