Jump to content

Baby-step giant-step: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

5 September 2024

2 June 2024

7 April 2024

12 February 2024

26 October 2023

4 June 2023

8 May 2023

9 February 2023

4 February 2023

30 September 2022

  • curprev 22:3222:32, 30 September 2022 192.114.91.212 talk 7,525 bytes −47 Addition doesn't really make much sense if we also consider general groups. General groups have only a "multiplication" operation. I would also suggest writing the time complexity as O*(root(n)) as the operation may take any polylog factor including constant time. undo Tags: Visual edit Mobile edit Mobile web edit

27 September 2022

26 September 2022

6 June 2022

15 April 2022

16 October 2021

11 October 2021

10 September 2021

7 September 2021

25 August 2021

22 April 2021

4 October 2020

24 May 2020

11 May 2020

23 April 2020

18 April 2020

2 March 2020

1 March 2020

5 December 2019

18 October 2019

26 June 2019

5 May 2019

1 May 2019

  • curprev 04:3004:30, 1 May 2019 2001:5b0:49cb:1c08:41ce:9d7a:ffac:e7a7 talk 6,703 bytes −1 Note that for example 2**10 == 34 mod 99 and that in this case m = ceil(sqrt(99)) = 10. Thus we need to write 10 = i*10+j, however this is not possible if we restrict j < m. Since i >= 0 we need 10=0*10+10 where i=0 and j=10. Thus j may be equal to m. undo

17 December 2018

16 December 2018

11 September 2018

23 August 2018

24 July 2018

28 April 2018

4 December 2017

25 November 2017

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)