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 the statement is true for any real number k. Show that the statement is true for k+1.

B)Assume that the statement is true for some positive integer k. Show that the statement is true for k+1.

C)Show that the statement is true for some positive integers k. Give a counterexample.

D)Assume thst the statement is true for some positive integers k+1. Show that the staement is true for k.
I don't know

Thank you SO much for helping me. I'm not looking for anyone to give me the answer because Ive done the work and what ever I answered is my BEST answer and I can't afford to get them wrong so thanks for all your help from the bottom of my heart.

  1. 👍 0
  2. 👎 0
  3. 👁 163
asked by Jon
  1. When I did this yesterday. I assumed it worked at any positive integer and then showed that it worked for n+1 ( Use n = k and n+1 = k+1 to make it clearer)

    1. 👍 0
    2. 👎 0
    posted by Damon
  2. thanks i got it

    1. 👍 0
    2. 👎 0
    posted by Jon

Respond to this Question

First Name

Your Response

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

    asked by Jon on December 13, 2007
  2. 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
  3. 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
  4. computer sciece(Computation Theory)

    Find the error in the following proof that all horses are the same color. CLAIM: In any set of h horses, all horses are the same color. PROOF: By induction on h. Basis: For h = 1. In any set containing just one horse, all horses

    asked by Alex on September 26, 2011
  5. 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
  6. 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
  7. pre-calculus

    Prove 3+4+5+...+(n+2) = [n(n+5)]/2 for n>4 Do the first step in a proof by induction.

    asked by James on June 21, 2010
  8. precalculus

    Can you please check my answers? 1.Find Pk + 1 if Pk=2^K-1/k! answer: 2^k+1/(k+1)! 2.Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) answer: 7+13+9...(6k-1+1)+6k+1 +(6k+2) 3.What is the first step when writing a

    asked by Anonymous on December 14, 2016
  9. precalculus

    Find Pk + 1 if Pk = 7 + 13 + 19 + ...+[6(k - 1)+1] + (6k + 1) 7 + 13 + 19 + …+[6(k - 1) + 1] + (6k + 1) + [6(k + 1) + 1] 8 + 14 + 20 + …+[7(k - 1) + 1] + (7k + 1) 7 + 13 + 19 + …+(6k + 1) 7 + 13 + 19 + ...+[6(k - 1) + 1] +

    asked by sally on December 14, 2016
  10. math induction

    prove the product of 4 consecutive integers is always divisible by 24 using the principles of math induction. Could anyone help me on this one? Thanks in advance! Sure For induction we want to prove some statement P for all the

    asked by zomg on September 14, 2006

More Similar Questions