Scribd Logo
Upload

Welcome to Scribd!

  • Taller Inducción Matemática

    Uploaded by

    Carlos Salgado
    19 views2 pages
    The document lists 34 mathematical statements and proofs involving sums, sequences, inequalities, and divisibility that must be proved using mathematical induction. Some examples include proving that the sum of the first n squared terms is n(n+1)(2n+1)/3, that (1+x)n is greater than or equal to 1+nx for n natural numbers and x greater than or equal to -1, and that expressions like 11n-6 are divisible by 5 for all natural numbers n. The document instructs the reader to use mathematical induction to prove each of the listed statements.

    Original Description:

    induccion

    Original Title

    Taller Inducción Matemática (1)

    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 lists 34 mathematical statements and proofs involving sums, sequences, inequalities, and divisibility that must be proved using mathematical induction. Some examples include proving that the sum of the first n squared terms is n(n+1)(2n+1)/3, that (1+x)n is greater than or equal to 1+nx for n natural numbers and x greater than or equal to -1, and that expressions like 11n-6 are divisible by 5 for all natural numbers n. The document instructs the reader to use mathematical induction to prove each of the listed statements.

    Copyright:

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

    Taller Inducción Matemática

    Uploaded by

    Carlos Salgado
    The document lists 34 mathematical statements and proofs involving sums, sequences, inequalities, and divisibility that must be proved using mathematical induction. Some examples include proving that the sum of the first n squared terms is n(n+1)(2n+1)/3, that (1+x)n is greater than or equal to 1+nx for n natural numbers and x greater than or equal to -1, and that expressions like 11n-6 are divisible by 5 for all natural numbers n. The document instructs the reader to use mathematical induction to prove each of the listed statements.

    Copyright:

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

    Matemáticas Discretas

    Taller1: Inducción Matemática

    Pruebe por inducción matemática las siguientes proposiciones:

    𝑛(2𝑛 − 1)(2𝑛 + 1)
    1. 12 + 32 + 52 + ⋅ ⋅ ⋅ + (2𝑛 − 1)2 = , ∀𝑛 ∈ ℤ+
    3
    𝑛(𝑛 + 1)(2𝑛 + 7)
    2. 1 ⋅ 3 + 2 ⋅ 4 + 3 ⋅ 5 + ⋅ ⋅ ⋅ + 𝑛(𝑛 + 2) = , ∀𝑛 ∈ ℤ+
    6
    3. 1 + 2 + 22 + 23 ⋅ ⋅ ⋅ + 2𝑛−1 = 2𝑛 − 1, ∀𝑛 ∈ ℤ+
    𝑛2 (𝑛 + 1)2
    4. 13 + 23 + 33 + ⋅ ⋅ ⋅ + 𝑛3 = , ∀𝑛 ∈ ℤ+
    4
    5. 13 + 33 + 53 + ⋅ ⋅ ⋅ + (2𝑛 − 1)3 = 𝑛2 (2𝑛2 − 1), ∀𝑛 ∈ ℤ+
    6. 1 + 5 + 9 ⋅ ⋅ ⋅ + (4𝑛 − 3) = 2𝑛2 − 𝑛, ∀𝑛 ∈ ℤ+
    (−1)𝑛+1 𝑛(𝑛 + 1)
    7. 12 − 22 + 32 − 42 + ⋅ ⋅ ⋅ + (−1)𝑛+1 ⋅ 𝑛2 = , ∀𝑛 ∈ ℤ+
    2
    1 1 1 1 𝑛
    8. + + + ⋅⋅⋅ + = , ∀𝑛 ∈ ℤ+
    1⋅3 3⋅5 5⋅7 (2𝑛 − 1)(2𝑛 + 1) 2𝑛 + 1
    9. 1 + 3 + 5 + ⋅ ⋅ ⋅ + (2𝑛 − 1) = 𝑛2 , ∀𝑛 ∈ ℤ+
    𝑛(𝑛 + 1)(𝑛 + 2)
    10. 1 ⋅ 2 + 2 ⋅ 3 + 3 ⋅ 4 + ⋅ ⋅ ⋅ + 𝑛(𝑛 + 1) = , ∀𝑛 ∈ ℤ+
    3
    11. 2 + 6 + 10 + ⋅ ⋅ ⋅ + (4𝑛 − 2) = 2𝑛2 , ∀𝑛 ∈ ℤ+
    1 1 1 1 𝑛
    12. + + + ⋅⋅⋅ + = , ∀𝑛 ∈ ℤ+
    1⋅2 2⋅3 3⋅4 𝑛(𝑛 + 1) 𝑛+1
    13. 1 ⋅ 2 + 2 ⋅ 22 + 3 ⋅ 23 + ⋅ ⋅ ⋅ + 𝑛 ⋅ 2𝑛 = 2 + (𝑛 − 1)2𝑛+1 , ∀𝑛 ∈ ℤ+
    14. 2 ⋅ 1 + 2 ⋅ 3 + 2 ⋅ 32 + 2 ⋅ 33 + ⋅ ⋅ ⋅ + 2 ⋅ 3𝑛−1 = 3𝑛 − 1, ∀𝑛 ∈ ℤ+

    15. Desigualdad de Bernoulli: (1 + 𝑥)𝑛 ≥ 1 + 𝑛𝑥, ∀𝑛 ∈ ℤ+ y ∀𝑥 ∈ ℝ, 𝑥 ≥ −1


    16. 2𝑛 + 1 < 2𝑛 , ∀𝑛 ≥ 3
    17. 𝑛2 > 2𝑛 + 1, ∀𝑛 ≥ 3
    18. 2𝑛 < 𝑛!, ∀𝑛 ≥ 4

    19. 𝑛3 < 2𝑛 , ∀𝑛 ≥ 10
    20. 𝑛2 ≥ 𝑛, ∀𝑛 ∈ ℤ+
    21. 4𝑛2 > (𝑛 + 1)2 , ∀𝑛 ∈ ℤ+

    22. 22𝑛 > 𝑛2 , ∀𝑛 ∈ ℤ+


    23. 2𝑛 + 2 ≤ 2𝑛 , ∀𝑛 ≥ 3
    1 1
    24. ( )𝑛 < , ∀𝑛 ∈ ℤ+
    2 𝑛
    25. 11𝑛 − 6 es divisible entre 5, ∀𝑛 ∈ ℤ+
    26. 7𝑛 − 1 es divisible entre 6, ∀𝑛 ∈ ℤ+
    27. 22𝑛 − 1 es divisible entre 3, ∀𝑛 ∈ ℤ+

    28. 43𝑛 − 1 es divisible entre 9, ∀𝑛 ∈ ℤ+


    29. 52𝑛 − 1 es divisible entre 24, ∀𝑛 ∈ ℤ+
    30. 𝑛2 − 𝑛 es divisible entre 2, ∀𝑛 ∈ ℤ+
    31. 𝑛3 − 𝑛 es divisible entre 3, ∀𝑛 ∈ ℤ+

    32. 𝑛3 + (𝑛 + 1)3 + (𝑛 + 2)3 es divisible entre 9, ∀𝑛 ∈ ℤ+


    33. 10𝑛+1 − 9𝑛 − 10 es divisible entre 81, ∀𝑛 ∈ ℤ+
    34. 𝑛5 − 𝑛 es divisible entre 5, ∀𝑛 ∈ ℤ+

    35. Teorema de DeMoivre:


    (cos(𝜃) + 𝑖 sin(𝜃))𝑛 = cos(𝑛𝜃) + 𝑖 sin(𝑛𝜃), ∀𝑛 ∈ ℤ+ , ∀𝜃 ∈ ℝ, y donde 𝑖 es tal que, 𝑖2 = −1.

    You might also like