2
$\begingroup$

Possible Duplicate:
calculating $a^b \!\mod c$

I have a number of form: $p^n + p$, where $p$ is a prime number and $n$ can be any large number, for example, say $10^{12}$.

What is the generic algorithm to compute $(p^n + p) \pmod k$, where $k$ is a huge number say $k=1000000007$.

Thanks!

$\endgroup$

marked as duplicate by hardmath, Ross Millikan, Noah Snyder, Chris Eagle, Norbert Oct 8 '12 at 9:29

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

2
$\begingroup$

As you already know (a+b)mod n = ((a mod n) + (b mod n)) mod n . So I guess addition here is not a problem.

The real question seems to be on $p^n$ mod k where n is large. For that, have a look at Modular Exponentiation on wikipedia.

$\endgroup$
  • $\begingroup$ thank you , i will check it out. $\endgroup$ – JCH Oct 2 '12 at 16:56

Not the answer you're looking for? Browse other questions tagged or ask your own question.