Modular Exponentiation with Example, Finding Final digit and final two digits in given number.
Modular Exponentiation: Definition : Modular exponentiation is the process of repeatedly squaring and reducing a number modulo some integer, and then combining the results to find the required answer. Modulo refers to the act of finding the remainder when a certain number is divided by another. For examples: 5 Modulo 3 is 2. The use of this operation will be in algorithm which uses divisibility, most simply, finding whether a number is odd or even. Exponentiation is simple raising a number to a certain power 5 2 =25. Module and exponentiation are both mathematics terms, nothing related to IT field. However, your script may use this logic. C=b e (Mod m), where e exponent, m is modules. To find final digit and two final digits, use modular Exponentiation method: Universe Method: Modular Exponentiation is a Universe method to find last digits. Use following option: 1. To find last digit use Modulo 10 2. To find last two digits use Modulo 100 3. To find last three digits use Modulo 1...