Results 1 to 2 of 2

Thread: Euclidean Algorithm Problem

  1. Dec 12th 2012, 07:46 AM #1
    mastermin346
    mastermin346 is offline
    Member
    Joined
    Oct 2009
    Posts
    202

    Euclidean Algorithm Problem

    Find the greatest common divisor (GCD) and the least common multiple (LCM) for $\displaystyle 6678671$
    and $\displaystyle 1322685$. (Note : Use Euclidean Algorithm)
    Follow Math Help Forum on Facebook and Google+
  2. Dec 12th 2012, 08:03 AM #2
    emakarov
    emakarov is offline
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,577
    Thanks
    790

    Re: Euclidean Algorithm Problem

    What's your difficulty with this problem?
    Follow Math Help Forum on Facebook and Google+
« Have no idea on how to prove | Not completely sure how to prove this »

Similar Math Help Forum Discussions

  1. Euclidean algorithm
    Posted in the Algebra Forum
    Replies: 7
    Last Post: Oct 7th 2012, 06:40 AM
  2. Problem dealing with Euclidean Algorithm/gcd
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Feb 10th 2011, 07:56 PM
  3. [SOLVED] Euclidean Algorithm
    Posted in the Number Theory Forum
    Replies: 5
    Last Post: Sep 5th 2010, 06:45 PM
  4. Euclidean Algorithm Problem
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: Oct 15th 2009, 07:52 AM
  5. Problem - highest common factor, Euclidean Algorithm
    Posted in the Math Topics Forum
    Replies: 1
    Last Post: Jun 23rd 2009, 05:44 AM

Search Tags


/mathhelpforum @mathhelpforum