Results 1 to 2 of 2

Thread: show that...

  1. #1
    Member
    Joined
    Feb 2008
    Posts
    125

    show that...

    Prove that if a=bq+r, then gcd(a,b)=gcd(b,r)
    Follow Math Help Forum on Facebook and Google+

  2. #2
    is up to his old tricks again! Jhevon's Avatar
    Joined
    Feb 2007
    From
    New York, USA
    Posts
    11,663
    Thanks
    5
    Quote Originally Posted by mandy123 View Post
    Prove that if a=bq+r, then gcd(a,b)=gcd(b,r)
    Assuming $\displaystyle b \ne 0$, note that $\displaystyle a$ is a multiple of $\displaystyle (b,r)$, since it can be written as a linear combination of $\displaystyle b$ and $\displaystyle r$. So $\displaystyle (b,r) \mid (a,b)$ since $\displaystyle b$ is a multiple of $\displaystyle (b,r)$ as well.

    Now use $\displaystyle r = a - bq$ to show that $\displaystyle (a,b) \mid (b,r)$. thus it will follow that $\displaystyle (b,r) \mid (a,b)$ and $\displaystyle (a,b) \mid (b,r)$ so that $\displaystyle (a,b) = (b,r)$
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Using the MVT to show this
    Posted in the Calculus Forum
    Replies: 0
    Last Post: Nov 25th 2010, 11:19 AM
  2. Show the sum
    Posted in the Calculus Forum
    Replies: 5
    Last Post: Oct 21st 2010, 03:28 AM
  3. Show that f o g is one-to-one
    Posted in the Calculus Forum
    Replies: 2
    Last Post: Jan 24th 2010, 06:29 PM
  4. Show that ln5 < 1 + 1/2 + 1/3 + 1/4.
    Posted in the Calculus Forum
    Replies: 2
    Last Post: Apr 6th 2009, 01:29 AM
  5. how to show show this proof using MAX
    Posted in the Calculus Forum
    Replies: 2
    Last Post: Jan 14th 2009, 12:05 PM

/mathhelpforum @mathhelpforum