Math

posted by .

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

  • Math -

    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)

  • Math -

    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

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. math

    1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-4 B)4 C)12 D)-12 I chose C 2)Use Pascal's triangle to expand:(w-x)5 This ones long so I chose w5-5w4x+10w3x3-10w2x4+5wx4-x5 3)Use the binomial Theorem to find …
  2. 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 that …
  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
  4. 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)
  5. 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 …
  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
  7. 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 …
  8. 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
  9. 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
  10. Mathematical Induction

    Use mathematical induction to prove that the following is true. 8+11+14...+(3n+5)=1/2n(3n+13), for all n in the set of natural numbers.

More Similar Questions