๐
Euler's Theorem Survival
Reduce the exponent mod phi(n) before computing a^k mod n -- one bad reduction ends the round.
๐ 3 lifeives
๐ซ no clock
โถ Log in to play