= Modular exponentiation
{wiki}
Can be calculated efficiently with the <Extended Euclidean algorithm>.
The <the beauty of mathematics>[beauty] of this algorithm is that because <exponentiation grows really fast>, there is no hope that we can ever learn all the digits of an exponential, as there is simply not enough time or memory for that. Therefore, a natural sub-question is if we can know some part of that number, and knowing the smallest digits is the most natural version of that question.
Back to article page
