EUCLIDEAN ALGORITHM - DISCRETE MATHEMATICS

Подписаться 273 тыс.

Просмотров 268 тыс.

50% 1

Visit our website: bit.ly/1zBPlvm
Subscribe on RU-vid: bit.ly/1vWiRxW
-Playlists-
Discrete Mathematics 1: • Discrete Math (Sets, L...
Discrete Mathematics 2: • Discrete Math (Countin...
-Recommended Textbooks-
Discrete and Combinatorial Mathematics (Grimaldi): amzn.to/2T0iC53
Discrete Mathematics (Johnsonbaugh): amzn.to/2Hh7H41
Discrete Mathematics and Its Applications (Rosen): amzn.to/3lUgrMI
Book of Proof (Hammack): amzn.to/35eEbVg
Like us on Facebook: on. 1vWwDRc
We discuss the Euclidian Algorithm which is used to determine the gcd of two numbers.
Hello, welcome to TheTrevTutor. I'm here to help you learn your college courses in an easy, efficient manner. If you like what you see, feel free to subscribe and follow me for updates. If you have any questions, leave them below. I try to answer as many questions as possible. If something isn't quite clear or needs more explanation, I can easily make additional videos to satisfy your need for knowledge and understanding.

Опубликовано:

3 янв 2015

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 101

@decaquits1035 7 лет назад

I‘d say that this guy makes the best videos about Discrete Structures

@loganmahoney2284 5 лет назад

Hey man. This was the most clear and well explained videos I could find on this topic. Thank you.

@SomethingNick 7 лет назад

Can't thank you enough for these videos, my discrete lecturer doesn't use any examples and is terribad. You've helped me pull a B in the course so thankyou!

@joylox 7 лет назад

I have to say that this is the coolest thing I've seen in math for a long time. Such a cool trick!

@ray-al15 6 лет назад

You are the best man, the best in all youtube that talks about discrete structures/math. All the others are hard to understand to me. You make it so simple.

@hellogais2177 6 месяцев назад

perfect explanation, no weird accent, perfectly audible, readable, understandable.

@Reachnoob4life 6 лет назад

You are saving my grade right now because you make a lot more sense then my prof

@PunmasterSTP Год назад

Hey I know it's been half a decade, but I just came across your comment and was curious. How'd the rest of your class go?

@jeffreynivitanont3113 8 лет назад

thx man. your video saved my skin again

@MichaelCozineSounds 7 лет назад

pulled an all nighter watching your videos for my exam today. gonna kill it.

@thomasmorin2496 6 лет назад

Can we have an update?

@zemaumm 6 лет назад

Howd it go ?

@BonBonPalace 6 лет назад

This is me right now. ;_;

@noj1yt 5 лет назад

You failed the exam, didn't you?

@salimvali6509 5 лет назад

I sure am going to @@noj1yt

@ClifGaming 7 лет назад

Thanks a lot for making these videos they really help out.

@alextrubetskoy8304 6 лет назад

thank you very much. you saved my booty with these vids. keep up the great work.

@AllergicToMango 2 года назад

Awesome proof and knowledge. Thank you for the great example.

@Jiglo 6 лет назад

Can you make a video on how to find integers k and l using Euclid Theorem? Thanks.

@kristianlynes5908 3 года назад

does these videos cover the entire syllabus of a course in discrethe mathematics?

@zesansaeed 5 лет назад

Sir your method of teaching is excellent 👍👍👍

@shrimpo6416 2 года назад

Excellent explanation! Understandable for someone who has ZERO math background!

@NurulIslam-dw8yp 3 года назад

Well done! finally got the easiest proof.

@nikpagano3039 2 года назад

Thanks. Though This didn’t actually tell me anything I didn’t already read in my material. But the way you explained it help me understand it better.

@AlhambraDream 5 лет назад

Which program do you use as pencil?

@PunmasterSTP Год назад

Euclidean algorithm? More like "Amazing explanation, that's the best of 'em!" Thanks so much for making this video and explaining things so clearly. 👍

@Ali124hdkflc 3 года назад

Excellent explanation.

@hawaii94 7 лет назад

thanks for the help!

@matthewsnyder1079 2 года назад

Thank goodness I found this before another discrete exam

@RKO1988 4 года назад

Can you touch on the Corollary - Elementary Number Theory

@user-db3zv2de4q 4 месяца назад

Nice vid man

@dotofmath2094 4 года назад

You are owesome 🙏👌🙋you deserve to be million subscriber.

@teamclouday Год назад

This is awesome!

@sriniakhilgujulla8168 6 лет назад

How can u claim that d divides b and r and also d is gcd?

@dtgiabao9915 8 месяцев назад

Thank you it helps!

@WileChile51 3 года назад

Thank you!!! I knew there was a better way to find the GCD, my textbook lied to me lol.

@yashmishra12 5 лет назад

If D divides A then shouldn't we write a/d and not the other way round?

@christophkrass6929 2 года назад

great explanation

@nissykawaii 5 лет назад

Thank you. you saved me

@Barnykay 7 лет назад

Thanks alot!

@vodofearless2233 2 года назад

Best explanation

@ahmidahmid9303 5 лет назад

thank you

@kantaprasadsinha8025 3 года назад

Was it not known before naming the process as Euclidean algorithm ?.

@antonheimdal8445 6 лет назад

You can go lower right? 30 = 6*5, or did I miss something?

@tomgraham8745 6 лет назад

Yeah, but then you get 30=6*5+0, and the gcd of 6 and 0 is 6.

@grantsmith3653 3 года назад

It seems like Trev proved the forward and backward on the iff, but only proved that they're common divisors... not ~ greatest ~ common divisors.

@HarryPottergaming2104 11 месяцев назад

the gcd is actually 218

@rohangharibgard2899 Месяц назад

Yes, he didn't prove that it's the greatest common divisor, only that d is a common divisor

@DaniloSouzaMoraes 7 лет назад

What if for d | a - qb, d = 3, a = 6, q = 2 and b = 3. That would result in 3 | 6 - (3 x 2) = 3 | 0. How's that valid?

@blakef.8566 6 лет назад

Any number can divide 0 evenly

@chrisdesrochers9062 4 года назад

I see how the proof demonstrated that the gcd(a,b) was a common divisor of b and r, and vise verse, but how does this demonstrate that the gcd(a,b) is the greatest common divisor of b and r? How is this demonstrated by the proof as it is stated? Or how might this be deduced from what was proved? Thank you, Chris

@lordspongebobofhousesquare1616 2 года назад

Assume gcd(b,r) is larger than gcd(a,b). By the proof in the video, gcd(b, r) divides a and b. Therefore it is a common factor of a and b which is larger than gcd(a, b), contradiction. By the video also, gcd(a, b) divides b and r. In other words, it is a common factor of b and r. So, gcd(b, r) cannot be smaller than gcd(a, b). Hence gcd(a, b) = gcd (b,r)

@balerion_the_dread 2 года назад

@@lordspongebobofhousesquare1616 if you have assumed gcd(b,r) greater than gcd(a,b) , then how can you say gcd(b, r) divides a and b ?

@jurainejames6468 7 лет назад

What if at the end of the solution both numbers aren't exactly divided by the gcd what do you do? Say for eg I have gcd(105,385) where 105 is a and 385 is b*some other constant q. At the end of this, I get 77 it only exactly divides 385.

@Trevtutor 7 лет назад

Then you have your GCD!

@jurainejames6468 7 лет назад

So it doesn't matter if i get a remainder?

@darzo27 7 лет назад

77 Isn't the Greatest Common Divisor of 105 and 385. 35 is the GCD - the biggest number that can divide BOTH 105 AND 385, WITHOUT leaving a remainder. You perform the gcd algorithm( a = bq+r ) until you have no remainder (the point where b=1 and r=0), you look at the previous step and the value of b there.

@vyomyadav6497 2 года назад

Shouldn't it be a/d instead of d/a as d is the divisor and not the dividend.

@ashutoshniwal 2 года назад

Thanks for the lovely explanation, but your proof doesn't explain that why it has to be 'greatest'? is can be any common divisor.

@wendya2309 6 лет назад

What if you get something like "Find gcd(10^20, 6^30)"

@kylelam884 6 лет назад

why b=bq+r

@DanT-iu6oc 5 лет назад

10 minute video on YT > multimillionaire textbook authors, tenured professors lol

@accountko4698 Год назад

What if the second number is larger than the first? How should I solve that?

@PunmasterSTP Год назад

I think you could just switch the order of the two numbers and proceed with the same sequence of steps.

@izzatiarahman3841 8 лет назад

i still cant understand the proof of algorithm. can you make some examples that easy to understand? thanks in advance :)

@fahimahmedshojib8209 6 лет назад

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-qym5D5bhoQs.html

@glennredwine289 3 года назад

You are right Tilu.Even if you understand the procedure for finding THE GCD. the proof is still elusive.

@user-db3zv2de4q 4 месяца назад

Respect ya

@amitdobriyal2094 7 лет назад

prove d= as+bt

@firaskurdistani3969 3 года назад

thanksssssssssss

@matheuxvoom4528 7 лет назад

i think you should proof that d is the greatest common divisor you just proved that d is a common divisor not the greatest

@bigbangind 7 лет назад

assume e>d --> e|r and e|b then e|(bq+r) so e|a there is a contradiction thus d is the greatest cd

@simonberens 4 года назад

It seems your proof shows that d is a common factor but not the greatest common factor. Am I wrong?

@EndlessZeroSoulX 6 лет назад

6*6 is 36 not 30, i think you messed up at 3:20...

@kylelam884 6 лет назад

@DerPanda93 6 лет назад

He doesn't say that 6*6 = 30, he says that it's obvious that 30 and 6 are both divisible by 6 and that its obviously the biggest number which they share as a divisor.

@samisiddiqi5411 5 лет назад

@@DerPanda93 3 divides 6 and 30

@kylelam884 6 лет назад

i dont understand your explaning even though i dont need this stuff right now just doing my hard math since im only in 5th grade and they didnt teach it to my class yet though i know but when my teacher explins this i didnt really get it so i have to search on youtube

@CarlC9898 3 года назад

wtf

@Starkeweg Год назад

You realize ur a prophet in the discrete maths world right ?

@-CraZY1711- Год назад

Ok ok… um what did he say srry I’m too young to understand this U-U

@zstar8397 9 месяцев назад

Hey hope you are doing alright just I wanna say that GOD loved the world so much he sent his only begotten son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD..