As we know, we can compute $a^b \pmod{n}$ efficiently using Right-to-left binary method Modular exponentiation.
Assume b is a prime number .
Can we compute directly $(a+1)^b\pmod{n}$ using $a^b\pmod{n}$?
Monday, September 10, 2018
Subscribe to:
Post Comments (Atom)
-
So if I have a matrix and I put it into RREF and keep track of the row operations, I can then write it as a product of elementary matrices. ...
-
I am asked to prove the density of irrationals in $\mathbb{R}$. I understand how to do this by proving the density of $\mathbb{Q}$ first, na...
-
Can someone just explain to me the basic process of what is going on here? I understand everything until we start adding 1's then after ...
No comments:
Post a Comment