I am trying to compute $2^{111455} \pmod{2012}$, but since the numbers are too large, I don't know how to compute it efficiently. I've got: $2012=2^2 \times 503$, $503$ is a prime. And that $111455=2012 \times 55 + 795$ but I don't know if it is useful.
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