Firstly, we propose an algorithm for calculating the extended gcd by providing a solution that minimizes one of the two coordinates. The algorithm relies on elementary arithmetic properties to parameterize the solutions. Secondly, we propose a modular geometric sequence to solve the linear diophantine equation au + b n v = 1 with a and b coprime integers and n a not null natural number.