Finding the GCF using the Euclidean Algorithm
Loading...
15,964
Loading...
Uploader Comments (hendrix5045)
Top Comments
-
@davedrave, why leave the comment if you don't like it? Just trying to be a dick or what?
-
how can i use this method for the GCF of 3 or more numbers ??
see all
All Comments (38)
-
Awesome!
-
Excellent!!
-
@hendrix5045 It was perfectly good and explained it quick which is what I wanted. There is nothing like procrastinating homework -_- lol
-
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
-
@SHYx999 our teacher tought us that da only equation used for 3 or more nos. is ladder method and prime factorization
-
this helped alot! :)
-
thanks dude.
Loading...
I think you would have got nicked a Com mark there at the end :p 123 + 36=3
?
Marine1996Us 3 months ago
@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.
hendrix5045 3 months ago
you have a sexy voice.
EmiilyRuth 9 months ago 3
@EmiilyRuth , ha thx :)
hendrix5045 9 months ago
Thank you, this is very clear.
Rankpenguin 1 year ago 2
@Rankpenguin, I'm glad I could help.
hendrix5045 1 year ago