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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|