Return to Revisions

3 of 3

added 33 characters in body

edited Dec 18, 2013 at 11:31

Khazhak Keghart Sahak

33
3

Calculating (n ^ fibonacci(k)) MOD m for a large value of k

The value of $k$ can be very large indeed (up to $10^{12}$). Is there an efficient way to calculate the output?

Edit : 'm' is a prime number.

nt.number-theory analytic-number-theory computational-number-theory

asked Dec 17, 2013 at 14:20

Khazhak Keghart Sahak

33
3