Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Practica Numeros Enteros y Divisibilidad Calculo

    Uploaded by

    Lady Virginia Spina Arenales
    This document discusses divisibility and properties of integers. It defines divisibility and provides properties such as: if a divides b and b divides c, then a divides c; if a divides b, then a divides any integer combination of b. It also discusses the greatest common divisor (gcd) and its properties, including that the gcd of a and b is the largest positive integer that divides both a and b. Examples of divisibility are provided for integers and sequences such as the Fibonacci sequence.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Practica Numeros Enteros y Divisibilidad Calculo

    Uploaded by

    Lady Virginia Spina Arenales
    13 views3 pages
    This document discusses divisibility and properties of integers. It defines divisibility and provides properties such as: if a divides b and b divides c, then a divides c; if a divides b, then a divides any integer combination of b. It also discusses the greatest common divisor (gcd) and its properties, including that the gcd of a and b is the largest positive integer that divides both a and b. Examples of divisibility are provided for integers and sequences such as the Fibonacci sequence.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses divisibility and properties of integers. It defines divisibility and provides properties such as: if a divides b and b divides c, then a divides c; if a divides b, then a divides any integer combination of b. It also discusses the greatest common divisor (gcd) and its properties, including that the gcd of a and b is the largest positive integer that divides both a and b. Examples of divisibility are provided for integers and sequences such as the Fibonacci sequence.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    13 views3 pages

    Practica Numeros Enteros y Divisibilidad Calculo

    Uploaded by

    Lady Virginia Spina Arenales
    This document discusses divisibility and properties of integers. It defines divisibility and provides properties such as: if a divides b and b divides c, then a divides c; if a divides b, then a divides any integer combination of b. It also discusses the greatest common divisor (gcd) and its properties, including that the gcd of a and b is the largest positive integer that divides both a and b. Examples of divisibility are provided for integers and sequences such as the Fibonacci sequence.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    3 Números Enteros y Divisibilidad

    Consecuencias de los primeros 10 axiomas de los números enteros


    a b c

    0·a=0
    -(-a) = a
    (-a) · b = -(a · b) = a · (-b)
    (-a) · (-b) = a · b,
    a+b=a+c b = c,
    a 6= 0 a · b = a · c, b = c,
    2
    a = a, a=0 a = 1,
    2 2 2
    (a + b) = a + 2ab + b ,
    (a + b)(a - b) = a2 - b2.

    Propiedades de la divisibilidad a, b c

    a | a.
    a|b b|c a | c.
    a|b a|c a | (b - c).
    a|b ac | bc.
    na | nb n 6= 0 a | b.
    1 | a.
    a|1 a = ±1.
    a|0
    0|a a=0

    n n n+1 1

    a, b, c c 6= 0. a | b, ac | bc.

    a b a|b b|a
    Pn
    b a | bk k = 1, . . . n, a | ( k=1 xkbk) , xk k = 1, . . . , n
    Pnk
    k=1 xkbk, combinación lineal de los bk

    8 | (9n -1), n = 0, 1, 2, . . . .

    Fn n Sucesión de Fibonacci
    F1 = F2 = 1, Fn+2 = Fn+1 + Fn, n ∏ 1.

    1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, . . . .


    Fn | Fkn, k n
    c r D = d · c + r, 0 ∑ |r| < d

    D = 671, d = 9,
    D = -671, d = 9,
    D = 671, d = -9,
    D = -671, d = -9,
    D = -671, d = 19,
    D = 671, d = -19,
    D = 671, d = 19,
    D = 19, d = -671,
    D = 19, d = -671,
    D = 1934, d = -62390.

    2n 2n + 1
    n 2n pares 2n + 1
    impares

    a2 a
    2
    a 3 a 3

    6k + 5 6k + 1,
    8k + 1,
    9k - 1, 9k, 9k + 1.

    n n3 - n 3 3
    n = 3k n = 3k + 1 n = 3k + 2

    n2 | (n + 1)n - 1, n = 1, 2, 3, . . . .

    n
    n!.
    Notación a b=r b>0 a b = r, r
    a b a = bq + r, 0 ∑ r < |b|.
    23 7 = 2, 23 = 7 · 3 + 2 -4 5 = 1, -4 = 5 · (-1) + 1.

    b>0 b|a a b = 0.
    a
    b 6= 0 b|a
    b

    0 10
    123 10
    10 123
    457 33
    (-7) 3
    (-3) 7
    (-5) 5

    a|b (a, b) = |a|

    m>0 (ma, mb) = m(a, b).

    (a, b) = (-a, b) = (a, -b) = (-a, -b).

    a | bc (a, b) = 1 a | c.

    a | m, b | m (a, b) = 1, ab | m.
    (a, b) 6= 1

    p a (a, p) = 1 p

    n,

    (n, 2n + 1) = 1,
    (2n + 1, 3n + 1) = 1,

    (a, b) a b
    a b.

    a, b, c, d, s, t 2 Z

    a > 0, b > 0,
    d = sa + tb,
    d 6= (a, b).

    You might also like