Thank you so much for this insightful learning to understanding the infinite possibilities with math. I was a little confused when I saw the number "6" under the 888 within the long-division portion of this video.
Thank you! The book I am reading is terrible, and all video tutorials I've tried viewing on this absolutely sucked for trying to make sense of what I am reading. This tutorial actually put this into a perspective I could actually understand!
i noticed that you said 54 DIVIDED BY 888, and 24 DIVIDED BY 54. shouldn't you have said 888 DIVIDED BY 54, and 54 DIVIDED BY 16 instead? isn't the number inside the sign divided by the number outside and not the other way around?
It's part of the long division: 6 * 54 = 324, the greatest multiple of 54 smaller than 348. If you try long division with smaller numbers, like 51 / 3, that should help make it clear. Hope this helps!
Why did you use 7 in your 2nd example??? Anyone should know that if a prime number does not divide into the larger number with a remainder of 0 then the gcd MUST be 1. The only denominator of a prime is 1 and itself.
Why people are saying he explained clearly? He did not even explain anything. He is just showing the formula. How that formula is drived or proved? How? Why? No explaination.
He explained how the formula worked and how to use it to find the gcd, he did not tell us that he was going to show more than that, nothing more is needed. If you want a more detailed explanation go watch some other videos.
mathworld.wolfram.com/EuclideanAlgorithm.html Let's find the gcd(a, b) with a being larger. a = bq + r, if a and b are evenly divisible by x then r is also evenly divisible by x as r = a - bq = sx - txq = x(s - tq). If b and r are evenly divisible by y then a is evenly divisible by y as a = bq + r = cyq + dy = y(cq + d). Therefore any common divisor of b and r is a common divisor of a and b. Therefore gcd(a, b) = gcd(b, r1) = gcd(r1, r2) etc. See, no magic.
