Scribd Logo
Upload

Welcome to Scribd!

  • Adobe Scan Feb 02, 2022

    Uploaded by

    Devi Lal
    8 views3 pages
    The document presents Euclid's algorithm for dividing two positive integers a and b to obtain their greatest common divisor. It states that if a = bq + r, where 0 ≤ r < b, then the greatest common divisor of a and b is the same as the greatest common divisor of b and r. The proof proceeds by showing that recursively applying this process of dividing the larger number by the smaller will eventually yield remainders of 0, at which point the last non-zero remainder is the greatest common divisor.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document presents Euclid's algorithm for dividing two positive integers a and b to obtain their greatest common divisor. It states that if a = bq + r, where 0 ≤ r < b, then the greatest common divisor of a and b is the same as the greatest common divisor of b and r. The proof proceeds by showing that recursively applying this process of dividing the larger number by the smaller will eventually yield remainders of 0, at which point the last non-zero remainder is the greatest common divisor.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views3 pages

    Adobe Scan Feb 02, 2022

    Uploaded by

    Devi Lal
    The document presents Euclid's algorithm for dividing two positive integers a and b to obtain their greatest common divisor. It states that if a = bq + r, where 0 ≤ r < b, then the greatest common divisor of a and b is the same as the greatest common divisor of b and r. The proof proceeds by showing that recursively applying this process of dividing the larger number by the smaller will eventually yield remainders of 0, at which point the last non-zero remainder is the greatest common divisor.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    6nct

    thr b 6
    ter net
    inkezer b divids a poSitive inkeger
    a
    Theoem2
    then a .
    numeicallg qeeter

    we have
    Po
    6a m inkeger y ( loih |v1>i)
    Suwhthat a- b
    Here a = lal= ]by|

    71b
    fEuclids heerem ok Division Algosithm -

    hem here exist miglu


    Z wth aaamd b >0
    Let
    Let a,bE
    uhere O
    o4Lr2b
    rb-
    Y Sue hat gb- b +Y
    inkegers imd
    and
    alled he geo tist
    inteaers n d r
    are
    The

    dhe ocminder specbinl.

    Pro we Consider the infinite Sequemce

    A-6-ax e 7 5o that b-ar z0

    A S non-empty áef
    t r = -1b Ez

    - am alb lb}-b

    z = -lb/e z
    wlere

    At4 C6-a1L1))>o
    has a minime
    sub set the hU, A
    te
    Being the
    non- empy

    clement Y (Sey) r-a70


    =Y-a 0
    Now eA
    Noe ha
    b-ay or Some ,64
    agaun - a >o
    b =a +8
    / =
    b-ay-a >o
    Since rEA theetort T>o
    Yb-a(1H)>0
    Ya =YeA with <
    weerYbe the minmal eeme
    mut Rave
    SA. There is a
    Cantrooluhis
    e a
    OLSCa
    Here we Kae pund ,r e Z Suh hat b=a aq +r
    where oLYLa
    Some , i EZ Such hat

    6= ai,+ whorc OLY L9

    Omd
    hen
    a(9)= Y-Y
    la C4-) = I5-)
    a l-l =
    |Y-y| whare 0|r-7l2a
    o a a , | 2a

    ao)
    we m wyt hAne

    a C-) =
    -r
    o =Y
    Y-YI
    Hence pne dha q, amdY also lun flue

    You might also like