Finding the GCF using the Euclidean Algorithm

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
15,964
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on May 30, 2009

Demonstrates how to find the Greatest Common Factor using the Euclidean Algorithm.

  • likes, 3 dislikes

Link to this comment:

Share to:

Uploader Comments (hendrix5045)

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

    ?

  • @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.

  • you have a sexy voice.

  • @EmiilyRuth , ha thx :)

  • Thank you, this is very clear.

  • @Rankpenguin, I'm glad I could help.

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)

Sign In or Sign Up now to post a comment!
  • 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...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more