Finding the GCF using the Euclidean Algorithm

[Marine1996Us]

I think you would have got nicked a Com mark there at the end :p 123 + 36=3

?

[hendrix5045]

@Marine1996Us If you look closely at what you're talking about it's not a plus sign, it's the same symbol I use at the beginning of the video to relate the two numbers together. Think of it as the equivalent to the ampersand sign.

[NoMusicGenius]

Awesome!

[slba34g]

Excellent!!



[jynx631]

plz tell me  if the time complexity of this algo is the max length of the numbers?

and if u r a computer science student plz give me ur mail id.

reply asap

[UNLUCKYxINxLOVE]

this helped alot! :)

[RVRgeek]

thanks dude.

[EmiilyRuth]

you have a sexy voice.

[hendrix5045]

@EmiilyRuth , ha thx :)

[YESobamaCANfuckupUSA]

why cant my stupid professor just explain the damn thing this way!!! thnks bro

[selmerhorns]

Nice! Thanks for the post.

[surajgenius]

too good!!! gr8t lecture!!!



[95TurboSol]

I just found this method a couple weeks ago and now I use it all the time, such and awesome tool! Plus with a little modification (a couple extra steps) You can use the euclidean algorithm to find the LCM too.

-Matt

[Rankpenguin]

Thank you, this is very clear.

[hendrix5045]

@Rankpenguin, I'm glad I could help.

[rokkerboi21]

Awesome! Thank you for helping me with this! MUCH easier explained this way! =)

[king0fheart]

Dude, thank you so much for taking the time to explain this. I really appreciate it. I tried to Google "Euclidean Algorithm" and the results confused the hell outta me. But your video is easy to understand. Once again, THANKS!

[SHYx999]

how can i use this method for the GCF of 3 or more numbers ??

[GicoletTV]

@SHYx999 our teacher tought us that da only equation used for 3 or more nos. is ladder method and prime factorization

[oooPunksNotDeadooo]

Dude, thanks. :)))) I like math now. xD

[henryanki]

thanks man nice video!

what's the name of the programm you use for the notes?

thanks!

[davedrave]

this kinda sucks

[hendrix5045]

@davedrave, why leave the comment if you don't like it? Just trying to be a dick or what?

[davedrave]

@hendrix5045 nah jus din like it, you shoud use a better microphone and not mumble in ur videos if ur actually tryin to help people with math

[breedfreely]

@davedrave What do you mean? I heard the dude fine.

[FearedBliss]

@hendrix5045 It was perfectly good and explained it quick which is what I wanted. There is nothing like procrastinating homework -_- lol

[YourAppleTechHelp]

@davedrave u are the only one that dislike this... which means that u are the only tard that have seen this.

this pwns :D

[djkamal87]

Thanks for the video

[littledan008]

Nevermind, I wasn't thinking.. lol. 24 would be the GCF haha.

[littledan008]

What if someone were trying to find the GCF of 24 and 168? When you divide 168 by 24 you get 7...Yet 7 doesn't divide into 24 evenly? Please help!

[csharsha]

@littledan008 it doesn't need to. you have already found the gcd, which is 24. cuz 168 = 7(24) and 24 = 1(24) and 1, 7 are coprime.

[TheHoboFrog]

thanks the video, im in algebra 2 honors and my teacher gave us a lecture and an assignment about the euclidean algorithm and I didn't understand it at first... it's not in our book so this was a good refresher and helped me understand it... Thanks!

[DrLsw]

wow i have a faster way of doing that. lol i havnt tested it with to many numbers yet though.

[markdhen]

and also euclidean can be use in 3 or more numbers.. like 120, 40, 3 etc... if its how..? can you make another video if possible.. thank you..

[markdhen]

hi its me again.. what if when u divide a number then it answers 0 still u can use euclidean algorithm? like this 120 & 40. so its means GCF= 40? am i right?

[hendrix5045]

This is a reply to your first question - NO, there would be no need to use the euclidean algorithm because your remainder is already 0 after the first divide. Remember, your gcf is the divisor that makes the remainder 0. if you used the numbers 120 & 40 the gcf is 40. The GCF is the divisor that makes the remainder = 0. So 120 / 40 = 3, The remainder is equal to 0 because 40 goes into 120 evenly without anything left over. Therefore, the GCF is 40. If you have any other questions just ask

[taebuddy123]

@markdhen THen you got the gcf because the remainder is 0. 40 is your GCF