If you get remainder the first time, then the gcd is just the smaller number. E.g. If the numbers are 35 and 7 then 35 = 5*7 + 0, so 7 divides 35, and 7 divides 7, so the gcd is 7. easy...
as euclidean division algorithm said that if you reach the remainder of zero, the greatest common factor must be on the top of zero, what if in the first sight that you have already get the remainder of zero, how can you prove that gcf, using the ueclidean division algorithm?
ur not good at explaining. especially on line 3 where 8 is on the left of the equation i got lost why theres another 3 multiplies to 56. u just said times it and we get this. Why? why? u give the why and well understand u even better
@paulosayson Sorry if i dont explain. I just try to learn from doing. By line 3 do you mean 8=56-3.72+3.56? as that is just multiplying the line above out. We want it in temrs of 56 and 72 so we need to make it just that. 16 is a rearrangement of the first line 72=56+16 ==>16=72-56 which we can now sub in. I think you mean a different part tho as i dont see that needing much explaination. sorry
If you get remainder the first time, then the gcd is just the smaller number. E.g. If the numbers are 35 and 7 then 35 = 5*7 + 0, so 7 divides 35, and 7 divides 7, so the gcd is 7. easy...
spm053 4 months ago
At 3:53, it should be y = yo -(a/d)t
(or the negative can be in the expression for x, with y=yo+(a/d)t ;in any case,
the signs on the (a/d)t factor have to be opposite so that the factors with "t" cancel
out when our expressions for x and y are substituted back into the equation)
HumanBeing0669 9 months ago
@HumanBeing0669 thanks for that i really should have tested this.
burny1 9 months ago
its pronounced You-Clih-Dee-An and Dip-phan-teen. Not tryin to be that guy but I'm just pointing it out. The video did help me out tho so thanks
draconisthe0ry 11 months ago
@draconisthe0ry Thanks anyone would think that i'm one of those foreign lecturers lol
burny1 11 months ago
as euclidean division algorithm said that if you reach the remainder of zero, the greatest common factor must be on the top of zero, what if in the first sight that you have already get the remainder of zero, how can you prove that gcf, using the ueclidean division algorithm?
rich971983 1 year ago
@rich971983 Sorry i'm not sure
burny1 1 year ago
ur not good at explaining. especially on line 3 where 8 is on the left of the equation i got lost why theres another 3 multiplies to 56. u just said times it and we get this. Why? why? u give the why and well understand u even better
paulosayson 1 year ago
@paulosayson Sorry if i dont explain. I just try to learn from doing. By line 3 do you mean 8=56-3.72+3.56? as that is just multiplying the line above out. We want it in temrs of 56 and 72 so we need to make it just that. 16 is a rearrangement of the first line 72=56+16 ==>16=72-56 which we can now sub in. I think you mean a different part tho as i dont see that needing much explaination. sorry
burny1 1 year ago