Calculate exponents as large as (int)^(10^8), with the modulo operation, in linear time. This program takes a single O(n) iteration, and fill up the entire array of possible exponents. And then you ...

This was an self-imposed exercise to write a program using properties of modulus (specifically congruence power and congruence multiply/divide) to more efficiently calculate the modulo of very large ...