Given a modulus and an integer coprime to it, we want to find a power of that integer that is congruent to 1 in that modulus. One reason is that this allows us to find an explicit multiplicative inverse of that integer. This is where Euler’s congruence comes into play. Euler gives us, not necessarily the lowest exponent, but an exponent that works for all integers coprime to the modulus.