Tech Articles
Explore deep-dives, coding tutorials, and tech insights from the community.
Euclidean algorithm for computing the greatest common divisor¶ Given two non-negative integers $a$ and $b$ , we have to find their GCD (greatest common...
Binary Exponentiation¶ Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$ , where $n$ is a non-...