with (0 <= n <= 2^31-1) caculate: (2^2^n + 1) mod k (1 <= k <= 10^16) Hi, I'm doing an exercise on mods for large numbers, i don't know if there is a more efficient solution than using binary exponentiation? Hope to help you, thanks. (Sorry about my bad english :()