Posted by **Jon** on Saturday, December 15, 2007 at 6:43pm.

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 dont 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.

## Answer this Question

## Related Questions

- math - 1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-...
- Mathematical induction. I'm stuck. So far I have.. - For all integers n ≥ ...
- math induction - prove the product of 4 consecutive integers is always divisible...
- Algebra ASAP - so this is a fill in on a worksheet and I am having difficulty as...
- proof by induction - proof by mathmatical induction that the sum of the first n ...
- Mth 209 - Which of the following conclusions is true about the statement below? ...
- Math Quadratic Equations - 1. Which of the following conclusions is true about ...
- math - Which of the following conclusions is true about the statement below? x^2...
- MATH I NEED HELP PLEASE - 1. Which of the following conclusions is true about ...
- proof by mathematical induction - subject is PreCalulus. 2^(k+3) = and < (k+3...

More Related Questions