added 33 characters in body

Source Link

edited Dec 18, 2013 at 11:31

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.

added 7 characters in body

Source Link

edited Dec 17, 2013 at 14:38

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

Source Link

asked Dec 17, 2013 at 14:20

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?

Return to Question