Return the Greatest Common Divisor of a and b using Euclid's Algorithm.
(a, b)
| 139 | |
| 140 | |
| 141 | def gcd(a, b): |
| 142 | """Return the Greatest Common Divisor of a and b using |
| 143 | Euclid's Algorithm.""" |
| 144 | while a != 0: |
| 145 | a, b = b % a, a |
| 146 | return b |
| 147 | |
| 148 | |
| 149 | def findModInverse(a, m): |
no outgoing calls
no test coverage detected