Talk:Modular exponentiation: Revision history

21 January 2017

• curprev 22:2022:20, 21 January 2017‎ rosettacode>Mariuss‎ m 4,407 bytes +401‎ point out some number theory basics

21 November 2016

• curprev 16:4416:44, 21 November 2016‎ Hout talk contribs‎ 4,006 bytes +145‎ →‎Formulae hidden to most browsers by under-tested cosmetic edits at 04:42, 26 April 2016

22 September 2016

• curprev 21:1321:13, 22 September 2016‎ Hout talk contribs‎ 3,861 bytes +737‎ Visibility of formulae lost by under-tested edit at 04:42, 26 April 2016

26 April 2016

• curprev 04:4704:47, 26 April 2016‎ rosettacode>Gerard Schildberger‎ m 3,124 bytes +93‎ →‎task requirements: add whitespace, corrected a misspelling.

14 May 2012

• curprev 23:5723:57, 14 May 2012‎ rosettacode>Gerard Schildberger‎ m 3,031 bytes −3‎ →‎task requirements: removed an extra blank line. -- ~~~~
• curprev 23:5523:55, 14 May 2012‎ rosettacode>Gerard Schildberger‎ 3,034 bytes +433‎ added a new section, ==task requirements=== -- ~~~~

25 December 2011

• curprev 18:4018:40, 25 December 2011‎ Sonia talk contribs‎ 2,601 bytes +203‎ →‎Tell algorithm?: sure, make it EC

24 December 2011

• curprev 20:3520:35, 24 December 2011‎ rosettacode>Dkf‎ 2,398 bytes +502‎ →‎Tell algorithm?: Do you really think that people use multiple algorithms? Really?
• curprev 19:3719:37, 24 December 2011‎ rosettacode>Mwn3d‎ 1,896 bytes +340‎ →‎Tell algorithm?: i added the improve tag to my own solution
• curprev 18:1918:19, 24 December 2011‎ Sonia talk contribs‎ 1,556 bytes +720‎ →‎Tell algorithm?: new section

21 December 2011

• curprev 02:0002:00, 21 December 2011‎ rosettacode>Dkf‎ 836 bytes +340‎ →‎What if m < 0?: Save us an argument; exclude the case

20 December 2011

• curprev 23:1823:18, 20 December 2011‎ rosettacode>Kernigh‎ 496 bytes +224‎ →‎What if m < 0?: new section

19 December 2011

• curprev 19:4919:49, 19 December 2011‎ rosettacode>Kernigh‎ 272 bytes +272‎ Draft change!