Merge pull request #1547 from 100daysummer/patch-2

mhayter · web-flow · commit 5b32a9220f73 · 2025-10-13T21:56:40.000-04:00
Update extended-euclid-algorithm.md
diff --git a/src/algebra/extended-euclid-algorithm.md b/src/algebra/extended-euclid-algorithm.md
@@ -93,7 +93,7 @@ int gcd(int a, int b, int& x, int& y) {
 }
 ```
 
-If you look closely at the variables `a1` and `b1`, you can notice that they take exactly the same values as in the iterative version of the normal [Euclidean algorithm](euclid-algorithm.md). So the algorithm will at least compute the correct GCD.
+If you look closely at the variables `a1` and `b1`, you can notice that they take exactly the same values as in the iterative version of the normal [Euclidean algorithm](euclid-algorithm.md#implementation). So the algorithm will at least compute the correct GCD.
 
 To see why the algorithm computes the correct coefficients, consider that the following invariants hold at any given time (before the while loop begins and at the end of each iteration):
 

Original file line number	Diff line number	Diff line change
`@@ -93,7 +93,7 @@ int gcd(int a, int b, int& x, int& y) {`
`93`	`93`	`}`
`94`	`94`	```
`95`	`95`
`96`		-If you look closely at the variables `a1` and `b1`, you can notice that they take exactly the same values as in the iterative version of the normal [Euclidean algorithm](euclid-algorithm.md). So the algorithm will at least compute the correct GCD.
	`96`	+If you look closely at the variables `a1` and `b1`, you can notice that they take exactly the same values as in the iterative version of the normal [Euclidean algorithm](euclid-algorithm.md#implementation). So the algorithm will at least compute the correct GCD.
`97`	`97`
`98`	`98`	`To see why the algorithm computes the correct coefficients, consider that the following invariants hold at any given time (before the while loop begins and at the end of each iteration):`
`99`	`99`