Math

Use Mathematical Induction to show that the statement
2 + 6 + 10 + . . . + (4n – 2) = 2n^2
is true

  1. 👍 0
  2. 👎 0
  3. 👁 53
asked by Josh
  1. n an sum n
    1 2 2
    2 6 8
    3 10 18
    4 14 32

    n (4n-2) 2n^2

    (n+1) (4(n+1)-2) [2n^2+ (4(n+1)-2)] or hopefully 2(n+1)^2

    [2n^2+ (4(n+1)-2)] = 2n^2+4n +2
    and
    2(n+1)^2 = 2(n^2+2n+1) = 2n^2+4n+2 done

    2n^2+ (4(n+1)-2)

    1. 👍 0
    2. 👎 0
    posted by Damon
  2. Using the 3 step process:
    1. test for n=1
    LS = 2
    RS = 2(1^2) = 2

    2. assume it true for n=k
    that is ....
    2+4+6 + ... + (4k-2) = 2k^2

    3 . prove it is then true for =k+1
    or
    2+4+6+ ... + (4k-2) + 4(k+1)-2 = 2(k+1)2
    LS = [2+4+6+...+ 4k-2 ] + 4(k+1)-2
    = 2k^2 + 4k + 4 - 2
    = 2(k^2 + 2k + 1)
    = 2(k+1)^2
    = RS

    QED

    1. 👍 0
    2. 👎 0
    posted by Reiny

Respond to this Question

First Name

Your Response

Similar Questions

  1. Algebra ASAP

    so this is a fill in on a worksheet and I am having difficulty as the ones I inserted are incorrect can anybody help me how to do it all, sorry it's a long problem. Show that 3^2n − 1 is divisible by 8 for all natural numbers n.

    asked by Briane Mendez on August 12, 2015
  2. Calculus

    Use mathematical induction to prove that the statement holds for all positive integers. Also, label the basis, hypothesis, and induction step. 1 + 5 + 9 + … + (4n -3)= n(2n-1)

    asked by Timofey on August 10, 2012
  3. AP Calc

    Use mathematical induction to prove that the statement holds for all positive integers. Also, can you label the basis, hypothesis, and induction step in each problem. Thanks 1. 2+4+6+...+2n=n^2+n 2. 8+10+12+...+(2n+6)=n^2+7n

    asked by Brock on August 5, 2012
  4. pre calc

    Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 - n + 2

    asked by allexelle on October 10, 2015
  5. pre calc

    Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 - n + 2

    asked by allexelle on October 9, 2015
  6. pre-calc

    Use mathematical induction to prove that the statement is true for every positive integer n. Show your work. 2 is a factor of n2 -n+2

    asked by Ciara on April 17, 2015
  7. Algebra II

    In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 the first step is to show that the statement is true for some integers n. Note:3(1)+1=1[3(1)+5]/2 is true. Select the steps required to complete the proof. A)Show

    asked by Jon on December 15, 2007
  8. Mathematical induction. I'm stuck. So far I have..

    For all integers n ≥ 1, prove the following statement using mathematical induction. 1+2^1 +2^2 +...+2^n = 2^(n+1) −1 Here's what I have so far 1. Prove the base step let n=1 2^1=2^(1+1)-1 False. Someone else suggested that the

    asked by Chris on October 11, 2013
  9. precalculus

    Can you check my answers? 1.Which of the following shows the best next step to prove the following by mathematical induction? 3^n>n*2^n, n≥1 1.When n=1, the formula is valid because 3^1 1*2^1 3>2 2.Assuming that 3^k>k*2^k

    asked by sally on December 15, 2016
  10. PreCalculus

    I tried to do these questions, however I can't seem to get the answer. Can someone help me? I would really appreciate it. _____________________________________ Mathematical Induction Prove that the statement in true for every

    asked by Anonymous on March 14, 2015

More Similar Questions