Can I use Binary Exponentiation with this problem? (2^2^n + 1) mod k

2 years ago

source link: http://codeforces.com/blog/entry/107325
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.

with (0≤n≤231−1)(0≤n≤231−1) caculate: (22n+1)(22n+1) mod k (1≤k≤106)(1≤k≤106) 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 for my bad english!!!!)

Recommend

seclists.org 7 years ago
Cache

oss-sec: Go programming language invalid modular exponentiation result (Exp() in...

Go programming language invalid modular exponentiation result (Exp() in math/big pkg) Nmap Announce

www.tuicool.com 6 years ago
Cache

Automatic Algorithms Optimization via Fast Matrix Exponentiation (2015)

PrefaceHi! My name is Alexander Borzunov . This article is the translation of my original publication . Sharing my work with Englis...

titangene.github.io 4 years ago
Cache

JavaScript 之旅 (3)：Exponentiation Operator (指數運算子)

寫程式應該很常會用到指數運算，過去我們會用 Math.pow()，但在 ES2016 (ES7) 提供了 exponentiation operator (指數運算子) 的讓寫法更...

mlwhiz.com 3 years ago
Cache

Solve almost every Binary Search Problem

Solve almost every Binary Search ProblemBy Rahul Agarwal 24 July 2021Algorithms are an integral part of data science. While most of us data scientists don’t take a proper algorithms course while studying, they are importan...