Wednesday, 15 April 2015

modular arithmetic - How to find remainder modulo n, when n is a large number

I am doing RSA questions and I really could use help! Can someone show me a simple way to find 25^9 \pmod{33}?

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...