Other prime exponents reduce to these, as their last digit is one of \(\{1,3,7,9\}\) ...s that if <math>p</math> is a prime number, then <math>(p - 1)! \equiv -1(\mod p)</math>. This motivates us to consider different cases. ...

...e will exist a piece-wise function (possibly with a greater than countable infinity number of pieces) that satisfies f(x). To find one of these functions we can limit our searching by proving that <math>f(ab) = ...