<div>Hallo everyone,</div>
<div> </div>
<div>I try to understand how the following recursive function works:</div>
<div> </div>
<div>extGCD :: Integer -> Integer -> [Integer] <br>extGCD a 0 = [1, 0, a]<br>extGCD a b = let (q, r) = a `quotRem` b<br> [s, t, g] = extGCD b r<br> in [t, s - q * t, abs g]</div>
<div> </div>
<div> Some hints to explain??</div>
<div> </div>
<div>Regards,</div>
<div>Z.Stanasiuk</div>