# Can someone check this proof for me, as I have looked over it, and I am not sure if it correct?

##
#1+4+7...(3n-2)=(n(3n-1))/2#

#(3n-2)=(n(3n-1))/2#

Basis case:

#n=1#

#(3 times 1)-2=(1 times (3 times 1))/2#

#1=1#

Assume that #n=k# :

#(3k-2)=(k(3k-1))/2#

Prove #n=k+1#

#(3(k+1))-2=((k+1) 3(k+1)-1)/2#

#3k-1=((k+1)(3k))/2#

#3k-1=((3k^2+3k))/2#

#3k-1=(k(3k+3))/2#

I have looked up the answer, and it looks different, but the result looks similar to the result of the original problem.

Basis case:

Assume that

Prove

I have looked up the answer, and it looks different, but the result looks similar to the result of the original problem.

##### 3 Answers

#### Answer:

I think your first eqaulity is wrong. Therefore the second derivation is wrong.

#### Explanation:

Assume n=5 in the fist equation. The left side is the become 13. But right side is 5x7=35. This indicate that the beginning equation is wrong.

#### Answer:

See Below

#### Explanation:

Here's roughly how it should have looked

**Claim:**

**Proof:** (By Induction)

**Base Case:** For

#=1#

#=2/2#

#=(1(3(1)-1))/2#

*Notice that we start at one side of the equality and arrive at the other, rather than starting from both at the same time and arriving at a tautology. This is typically preferable, and prevents issues such as*

**Induction Hypothesis:** Suppose, for some integer

*Notice that we do not assume that #k=n#. Rather, we assume that the claim is true for some arbitrary #k# which is greater than or equal to our base case. This is what allows us to say "the base case is true, so the next case is true, so the next case is true, so... so all cases are true." Also, be careful to copy the claim correctly. Our claim is regarding a sum of integers up to #3k-2#, not #3k-2# itself.*

**Inductive Step:** We wish to show that the claim holds true for

Indeed:

#=sum_(i=1)^k(3i-2) + (3k+1)#

#=(k(3k-1))/2+(3k+1)#

(Here is where we used our induction hypothesis)

#=(3k^2-k)/2 + (6k+2)/2#

#=(3k^2+5k+2)/2#

#=((k+1)(3k+2))/2#

#=((k+1)(3(k+1)-1))/2#

As we have supposed true for

*Notice again that we carefully matched the format of the original claim, and started from one side of the equality and showed the other, rather than starting from both sides and working our way to a tautology. Doing so is better left as scratch work.*

Once you are more comfortable with proofs by induction, as well as proofs in general, there are some liberties you can take in the form and what you add/say. As someone just learning, though, it is better to stick to the format closely.

Given:

Let the sum be

Let any place count be

Let the

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Then we have:

but

But

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~