Find gcd(a, b)

Find x in the equation: ax=b (mod n): this program finds i such that a | b + i * modulus