Skip to content

Practice: mathematical induction

Practice: mathematical induction

1

1+4+7+…+(3n−2)=n(3n−1)2\displaystyle {1+4+7+\ldots+(3n-2)}={\frac{n(3n-1)}{2}}
Prove by induction that the claim holds for every natural n\displaystyle n.

Base case

Check the claim for n=1\displaystyle {n}={1}.

Inductive step

Write the induction hypothesis – the claim for some natural k\displaystyle k – and what must be proved for k+1\displaystyle k+1.

The working: start from the expression you got after putting in the hypothesis, and reach what must be proved.

    / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

    / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

    Conclusion
    2

    1⋅2⋅3+2⋅3⋅4+…+n(n+1)(n+2)=n(n+1)(n+2)(n+3)4\displaystyle {1\cdot2\cdot3+2\cdot3\cdot4+\ldots+n(n+1)(n+2)}={\frac{n(n+1)(n+2)(n+3)}{4}}
    Prove by induction that the claim holds for every natural n\displaystyle n.

    Base case

    Check the claim for n=1\displaystyle {n}={1}.

    Inductive step

    Write the induction hypothesis – the claim for some natural k\displaystyle k – and what must be proved for k+1\displaystyle k+1.

    The working: start from the expression you got after putting in the hypothesis, and reach what must be proved.

      / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

      / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

      Conclusion
      3

      11⋅3+13⋅5+…+1(2n−1)(2n+1)=n2n+1\displaystyle {\frac{1}{1\cdot3}+\frac{1}{3\cdot5}+\ldots+\frac{1}{(2n-1)(2n+1)}}={\frac{n}{2n+1}}
      Prove by induction that the claim holds for every natural n\displaystyle n.

      Base case

      Check the claim for n=1\displaystyle {n}={1}.

      Inductive step

      Write the induction hypothesis – the claim for some natural k\displaystyle k – and what must be proved for k+1\displaystyle k+1.

      The working: start from the expression you got after putting in the hypothesis, and reach what must be proved.

        / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

        / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

        Conclusion
        4

        A sequence is defined by the recursion rule a1=1\displaystyle {a_1}={1}, an+1=an+2n\displaystyle {a_{n+1}}={a_n+2^n}.
        Prove by induction that an=2n−1\displaystyle {a_n}={2^n-1} for every natural n\displaystyle n.

        Base case
        Inductive step

          / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

          / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

          Conclusion
          5

          Prove by induction that 6n+4\displaystyle 6^n+4 is divisible by 5 for every natural n\displaystyle n.

          Inductive step

            / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

            / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

            6

            Prove by induction that n3−n\displaystyle n^3-n is divisible by 3 for every natural n\displaystyle n.

            Inductive step

              / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – check and a new line · * – times · ^ – power, ↓ – end of the power

              / – fraction bar · Tab or the arrows – between numerator and denominator, then a note above or below · Enter – a new line · * – times · ^ – power, ↓ – end of the power

              7

              Inbal wrote: “The claim: 2+4+…+2n=n2+n+5\displaystyle {2+4+\ldots+2n}={n^2+n+5}. For k+1\displaystyle k+1: 2+4+…+2k+2(k+1)=k2+k+5+2k+2=(k+1)2+(k+1)+5\displaystyle {2+4+\ldots+2k+2(k+1)}={k^2+k+5+2k+2}={(k+1)^2+(k+1)+5}. Proved.”
              What is missing in the proof? Is the claim true?