Scribd Logo
Upload

Welcome to Scribd!

  • X 4 (Mod 12) X 3 (Mod 7) MCD 1: Tiene Solucion

    Uploaded by

    Zein CT
    3 views11 pages
    The document shows the steps to find the greatest common divisor (GCD) of two numbers, 428 and 136, using the Euclidean algorithm. It first divides the larger number by the smaller number repeatedly to obtain remainders of 0, then lists the steps. It also uses the extended Euclidean algorithm to find the Bezout coefficients to express the GCD as a linear combination of the two numbers. The GCD is calculated to be 4. Similar procedures are shown for two other pairs of numbers.

    Original Description:

    te permite sacar chino

    Original Title

    mate discreta

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document shows the steps to find the greatest common divisor (GCD) of two numbers, 428 and 136, using the Euclidean algorithm. It first divides the larger number by the smaller number repeatedly to obtain remainders of 0, then lists the steps. It also uses the extended Euclidean algorithm to find the Bezout coefficients to express the GCD as a linear combination of the two numbers. The GCD is calculated to be 4. Similar procedures are shown for two other pairs of numbers.

    Copyright:

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

    X 4 (Mod 12) X 3 (Mod 7) MCD 1: Tiene Solucion

    Uploaded by

    Zein CT
    The document shows the steps to find the greatest common divisor (GCD) of two numbers, 428 and 136, using the Euclidean algorithm. It first divides the larger number by the smaller number repeatedly to obtain remainders of 0, then lists the steps. It also uses the extended Euclidean algorithm to find the Bezout coefficients to express the GCD as a linear combination of the two numbers. The GCD is calculated to be 4. Similar procedures are shown for two other pairs of numbers.

    Copyright:

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

    X≡ 4 (mod 12 )

    X≡ 3 (mod 7)

    MCD = 1

    tiene solucion
    X≡ 4 + 12 k

    sustitudir en la 2° ecuacion
    4+ 12 k ≡ 3 (mod 7 )
    12 k ≡ -1 (mod 7 )
    12 k ≡ 6 (mod 7 )
    5k ≡ 6 (mod 7 )

    buscamos un numero que se multiplicado 5 sea comcluente de 6

    k ≡ 4 (mod 7 j

    sustituimos k
    X≡ 4+ 12 k
    X≡ 4+ 12 ( 4+ 7)
    X≡ 4+ 48 + 84 j
    X≡ 52 + 84 j
    xmtiplo= residuo
    1 5 5
    2 10 3
    3 15 1
    4 20 6
    5 25 4
    6 30 2
    7 35 0
    8 40 5
    9 45 3
    10 50 1
    11 55 6
    12 60 4
    13 65 2
    Aplicando Algoritmo de Euclides EUCLIDES
    CALCULAR MCD : 428 136
    20 =
    428 = 136 X 3 + 20 16 =
    136 = 20 X 6 + 16 4 =
    20 = 16 X 1 + 4 0 =
    16 = 4 X 4 + 0 #DIV/0! =
    4 = 0 X ### + ### #DIV/0! =
    0 = #DIV/0! X ### + ### #DIV/0! =
    #DIV/0! = #DIV/0! X ### + ###
    #DIV/0! = #DIV/0! X ### + ###

    MCD = 4

    Aplicando Benzout:
    4 = 10 - 4 X 2
    4 = 10
    =
    =
    =
    =
    =
    =
    EUCLIDES BEZOUT
    428 - 3 X 136 4 = 20 - 1 X 16
    136 - 6 X 20 = 20 - 1 X ( 136 - 6
    20 - 1 X 16 = 7 X 20 - 1 X 136
    16 - 4 X 4 7 X ( 428 - 3 X ###
    4 - ### X 0 7 X 428 ### X 136
    0 - ### X ###
    ### - ### X ###
    X 20 )

    ) - 1 X 136
    ALGORITMO EUCLIDES

    MCD 710 310

    710 = 310 X 2 + 90
    310 = 90 X 3 + 40
    90 = 40 X 2 + 10
    40 = 10 X 4 + 0
    10 = 0 X Err:502 + ###

    bezout
    10 = 90 - 40 X 2
    = 90 - ( 310 - 90 X 3) X 2
    = 90 X 7 - 310
    = 710 - 310 x 2 x 7- 310
    = 710 x 7 - 310 x 14 - 310
    710 x 7 - 310 x 16
    90 = 710 - 310 ( 2)
    40 = 310 - 90 ( 3)
    10 = 90 - 40 ( 2)
    0 = 40 - 10 ( 4)
    ALGORITMO EUCLIDES

    MCD 180 146

    180 = 146 X 1 + 34
    146 = 34 X 4 + 10
    34 = 10 X 3 + 4
    10 = 4 X 2 + 2
    4 = 2 X 2 + 0

    bezout
    2 = 10 - 4 X 2
    = 10 - ( 34 - 10 X 3) X 2
    = 10 X 7 - 34
    = 146 - 34 x 4 x 7- 34
    = 146 x 7 - 34 x 28 - 34
    146 x 7 - 34 x 29
    146 x 7 - 180 - 146 x 1x 29
    146 x 37 - 180 x 30
    34 = 180 - 146 ( 1)
    10 = 146 - 34 ( 4)
    4 = 34 - 10 ( 3)
    2 = 10 - 4 ( 2)
    0 = 4 - 2 ( 2)
    ALGORITMO EUCLIDES

    MCD 180 146

    180 = 146 X 1 + 34
    146 = 34 X 4 + 10
    34 = 10 X 3 + 4
    10 = 4 X 2 + 2
    4 = 2 X 2 + 0

    bezout
    2 = 10 - 4 X 2
    = 10 - ( 34 - 10 X 3) X 2
    = 10 X 7 - 34
    = 146 - 34 x 4 x 7- 34
    = 146 x 7 - 34 x 28 - 34
    146 x 7 - 34 x 29
    146 x 7 - 180 - 146 x 1x 29
    146 x 37 - 180 x 30
    34 = 180 - 146 ( 1)
    10 = 146 - 34 ( 4)
    4 = 34 - 10 ( 3)
    2 = 10 - 4 ( 2)
    0 = 4 - 2 ( 2)

    You might also like