Hi, I'm doing an exercise on mods for large numbers, i don't know if there is a more efficient solution than using binary exponentiation? Hope to help you, thanks. (Sorry about my bad english :()
# | User | Rating |
---|---|---|
1 | Benq | 3813 |
2 | tourist | 3768 |
3 | maroonrk | 3570 |
4 | Radewoosh | 3535 |
5 | fantasy | 3526 |
6 | jiangly | 3523 |
7 | Um_nik | 3522 |
8 | orzdevinwang | 3441 |
9 | cnnfls_csy | 3427 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 178 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | maroonrk | 163 |
7 | adamant | 162 |
8 | kostka | 161 |
9 | YouKn0wWho | 158 |
10 | antontrygubO_o | 154 |
Can I use Binary Exponentiation with this problem? 2^2^n mod k
Hi, I'm doing an exercise on mods for large numbers, i don't know if there is a more efficient solution than using binary exponentiation? Hope to help you, thanks. (Sorry about my bad english :()
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 |
![]() |
baowilliam | 2022-09-26 19:02:58 | 70 | Tiny change: 'with (0\leq n\l' -> 'with $(0\leq n\l' | |
en3 |
![]() |
baowilliam | 2022-09-26 18:48:01 | 10 | Tiny change: 'caculate: 2^2^n mod k (1 ' -> 'caculate: (2^2^n + 1) mod k (1 ' | |
en2 |
![]() |
baowilliam | 2022-09-26 18:47:06 | 69 | ||
en1 |
![]() |
baowilliam | 2022-09-26 18:44:00 | 257 | Initial revision (published) |
Name |
---|