From the book Discrete Mathematics for Computing 2nd Edition in eBook:
I know how to perform the Euclidean Algorithm and GCM(a,b). I am however, deeply confused by this:
$$1 = 415 - 69(421 - 1 \times 415)$$ $$ = 70 \times 415 - 69 \times 421$$
How is this expression constructed $70 \times 415 - 69 \times 421$?
N.B. I am still new to this and learning, I am using the following book(s):
Discrete Mathematics for Computing / Edition 2
by Peter Grossman [eBook]
Discrete Mathematics for Computing / Edition 3
by Peter Grossman [Physical copy]

Now we have $415+69\times415-69\times421$, in this expression we have one $415$ plus $69$ $415$s. That makes $70$ $415$s. So we have $70\times 415-69\times 421$.
Finally we have $$415-69(421-1\times415)=70\times415-69\times421$$
– David Krell Mar 16 '24 at 12:16