Scribd Logo
Upload

Welcome to Scribd!

  • 61 views

    Induccion Matematica en LaTeX

    Uploaded by

    leonardo14
    The document introduces simple mathematical induction. It presents a formula to prove, which is the sum of the first n positive integers equals n(n+1)/2 for all n ≥ 1. It then works through the proof in 4 steps: 1) an initial step showing the formula holds for n=1, 2) assuming the formula holds for some integer k, 3) showing it also holds for k+1, 4) completing the induction proof by factoring terms.

    Copyright:

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

    Induccion Matematica en LaTeX

    Uploaded by

    leonardo14
    61 views2 pages
    The document introduces simple mathematical induction. It presents a formula to prove, which is the sum of the first n positive integers equals n(n+1)/2 for all n ≥ 1. It then works through the proof in 4 steps: 1) an initial step showing the formula holds for n=1, 2) assuming the formula holds for some integer k, 3) showing it also holds for k+1, 4) completing the induction proof by factoring terms.

    Original Description:

    LaTeX

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document introduces simple mathematical induction. It presents a formula to prove, which is the sum of the first n positive integers equals n(n+1)/2 for all n ≥ 1. It then works through the proof in 4 steps: 1) an initial step showing the formula holds for n=1, 2) assuming the formula holds for some integer k, 3) showing it also holds for k+1, 4) completing the induction proof by factoring terms.

    Copyright:

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

    Induccion Matematica en LaTeX

    Uploaded by

    leonardo14
    The document introduces simple mathematical induction. It presents a formula to prove, which is the sum of the first n positive integers equals n(n+1)/2 for all n ≥ 1. It then works through the proof in 4 steps: 1) an initial step showing the formula holds for n=1, 2) assuming the formula holds for some integer k, 3) showing it also holds for k+1, 4) completing the induction proof by factoring terms.

    Copyright:

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

    Simple Mathematical Induction

    Ernest Michael Nelson


    May 19, 2019

    1 Introduction
    With this paper we will establish formula by the use of mathematical induction.
    An it will be a step by step way to solve. An hopefully it will help out the
    reader

    2 Formula
    We are given the formula
    ∞
    X n(n + 1)
    i= , ∀n ≥ 1
    n=1
    2

    And n is element of the positive integers.

    3 Proof
    We began by running off a few tern to aid us in seeing a pattern emerge in the
    formula.
    ∞
    X n(n + 1)
    1+2+3+4+5+·+n=
    n=1
    2

    4 Initial Step
    Let’s assume that n=1,
    1(1 + 1)
    1= =1
    2
    2
    1= =1
    2
    Next we assume that n=k and k is an element of the positive integers. And we
    denote it as equation 1.
    ∞
    X k(k + 1)
    1 + 2 + 3 + 4 + 5 + ··· + k = (1)
    2
    k=1

    1
    ∞
    X k(k + 1)
    1 + 2 + 3 + 4 + 5 + ··· + k =
    2
    k=1

    Now we do k+1 step and use equation 1 to help us solve the proof.
    ∞
    X (k + 1)((k + 1) + 1)
    1 + 2 + 3 + 4 + 5 + ··· + k + k + 1 =
    2
    k=1

    To aid us in seeing the proof we will simplify the right hand side (RHS) of the
    equation.
    ∞
    X (k + 1)(k + 2)
    1 + 2 + 3 + 4 + 5 + ··· + k + k + 1 =
    2
    k=1

    From (1) we will use in the Induction hypothesis t o prove the formula.

    k(k + 1) (k + 1)(k + 2)
    +k+1=
    2 2
    The next step we do is find the greatest common factor (GCF) on the left hand
    side (LHS).
    k(k + 1) 2(k + 1) (k + 1)(k + 2)
    + =
    2 2 2
    Now we can combine the (LHS) of the equation since we have the same denom-
    inator.
    k(k + 1) + 2(k + 1) (k + 1)(k + 2)
    =
    2 2
    Next we factor the equation on the (LHS).

    k 2 + k + 2k + 2 (k + 1)(k + 2)
    =
    2 2
    Combine like terms on the (LHS).

    k 2 + 3k + 2 (k + 1)(k + 2)
    =
    2 2
    Final we factor the equation on the (LHS) and we will be done.

    (k + 1)(k + 2) (k + 1)(k + 2)
    =
    2 2
    Thus we achieved what we desired¿

    You might also like