Results 1 to 2 of 2

Math Help - Euclid's Algorithm and Bezout's Identity

  1. #1
    Junior Member
    Joined
    Mar 2009
    From
    Madison, WI
    Posts
    42

    Euclid's Algorithm and Bezout's Identity

    Prove: If am + bn = e for some e, then (a,b) divides e.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    Jul 2009
    Posts
    69
    Quote Originally Posted by Zennie View Post
    Prove: If am + bn = e for some e, then (a,b) divides e.
    By lemma of Euclid Algorithm: if gcd(a,b)= e then there exist m,n (integers) s.t. e= am+bn . Since gcd(a,b) is e. then a divides e. and b divides e?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Euclid Algorithm
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: January 15th 2012, 11:32 AM
  2. [SOLVED] Problem from a section on Bezout's Identity
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: February 18th 2010, 06:27 PM
  3. Euclid's Algorithm
    Posted in the Number Theory Forum
    Replies: 0
    Last Post: March 29th 2009, 04:54 AM
  4. Another GCD using Euclid's Algorithm
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: September 23rd 2008, 09:03 AM
  5. Euclid's algorithm
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: August 3rd 2008, 05:18 AM

Search Tags


/mathhelpforum @mathhelpforum