I had a hard time following the back substitution portion of the Euclidean Algorithm. I think I understand the reasoning and process when they apply the division algorithm to find (324, 148), but I don't understand why or how they applied back substitution. If I understand the algorithm, 4 is the GCD (324,148)? Then why the back substitution?
Reflective:
In my Math history class that I'm taking through independent study, I need to prove that the square root of a prime number is irrational. I've been struggling to understand or create a proof for such. Now that I've learned more about the division algorithm and it's application, as well as learning more about primes, I think I will have a much easier time creating the proof!
No comments:
Post a Comment