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 :()
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | 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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|