Return to Revisions

1 of 3

asked Dec 17, 2013 at 14:20

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?

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

asked Dec 17, 2013 at 14:20

Khazhak Keghart Sahak

33
3