## Bézout’s Identity, using Euclid’s algorithm

Articles, Blog 9 CommentsHello and welcome to Maths with Jay. Now, we’ve already seen by using Euclid’s algorithm that we can find the highest common factor of 39 and 15. So remember that we found that it was the last remainder in this process here; so here the highest common factor was three. What we’re going to do