Results 1 to 3 of 3

Thread: coprime

  1. #1
    Super Member
    Joined
    Aug 2009
    Posts
    639

    coprime

    how do you show that 2 consecutive integers are coprime?

    i know we need to show that gcd is 1 where they have opp parity
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member ignite's Avatar
    Joined
    Apr 2012
    From
    Kanpur,India
    Posts
    54
    Thanks
    12

    Re: coprime

    Let your numbers be a and a+1 and their gcd be d.
    $\displaystyle \Rightarrow d | a $ and $\displaystyle d | a+1 \Rightarrow d | (a+1-a) \Rightarrow d | 1 \Rightarrow d=1$
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Member Sylvia104's Avatar
    Joined
    Mar 2012
    From
    London, UK
    Posts
    107
    Thanks
    37

    Re: Coprime

    To show that two integers $\displaystyle m,n$ are coprime, it is sufficient to find integers $\displaystyle r,s$ such that $\displaystyle rm+sn=1$ (because any common divisor of $\displaystyle m,n$ must divide $\displaystyle rm+sn$ for all integers $\displaystyle r,s).$ In the case $\displaystyle m=a,$ $\displaystyle n=a+1,$ you have $\displaystyle n-m=1;$ hence $\displaystyle \gcd(m,n)=1.$
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Coprime elements
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: Jan 14th 2011, 04:00 AM
  2. [SOLVED] Coprime Polynomials
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Jan 2nd 2011, 02:39 PM
  3. coprime
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: Sep 13th 2009, 04:45 AM
  4. Coprime
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Feb 19th 2009, 10:32 AM
  5. Coprime polynomials
    Posted in the Advanced Algebra Forum
    Replies: 4
    Last Post: Nov 24th 2008, 01:48 AM

Search Tags


/mathhelpforum @mathhelpforum