Algebra II
posted by Jon .
In an induction proof of the statement 4+7+10+...+(3n1)=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.
Respond to this Question
Similar Questions

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? 
discrete math
use a direct proof to show that the product of two odd numbers is odd. Proofs: (all the nos. i used are odd) 3 x 3 = 9 5 x 9 = 45 7 x 3 = 21 Yes, but you didn't prove the statement for "all" odd integers, only the odd integers you … 
proof by induction
proof by mathmatical induction that the sum of the first n natural numbers is equal n(n+1)/2 It's true for n = 1. Assume that it is true for some n. Then the sum of the first n+1 natural integers can be obtained by dding the last number … 
math
1)Find the third iterate x3 of f(x)=x24 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:(wx)5 This ones long so I chose w55w4x+10w3x310w2x4+5wx4x5 3)Use the binomial Theorem to find … 
Math
Prove that the statement: (1/5)+(1/5^2)+(1/5^3)+...+(1/5^n)=(1/4)(11/5^n) is true for all positive integers n. Write your proof in the space below. 
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 clearly … 
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 … 
Mth 209
Which of the following conclusions is true about the statement below? 
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 … 
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] + (6k7 …