### baowilliam's blog

By baowilliam, history, 4 months ago,

with $(0\leq n\leq 2^{31}-1)$ caculate: $(2^{2^{n}} + 1)$ mod k $(1\leq k\leq 10^{6})$ 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 for my bad english!!!!)

• +26