Use mathematical induction to prove the statement is true for all positive integers n.

6 + 12 + 18 + + 6n = 3n(n + 1)

Step-by-step explanation:

The given statement is:

6 + 12 + 18 + ... + 6n = 3n(n + 1)

we have t prove that the given statement is true for all positive integers n.

Thus, using mathematical induction, we have

Step 1: Let us show that the statement is true for n = 1.  

Putting n=1 in the given statement, we have

6 = 3(1)(1 + 1). And this is clearly a true statement.

So the statement is true for n = 1.  

Step 2: Show if it holds for k, then it holds for k + 1.  

Let us assume that the statement is true for a positive integer k. That is,

6 + 12 + ... + 6k = 3k(k + 1).  

Let us show that the statement must be true for the positive integer k + 1. We need to show that the sum of the first k + 1 multiples of 6 is equal to 3(k+1)( (k + 1) + 1).  

Thus,

6 + 12 + ... + 6k + 6(k+1) = [6 + 12 + ... + 6k] + 6(k + 1)  

= 3k(k + 1) + 6(k + 1) (this is true by the induction hypothesis)  

= 3(k + 1) [ k + 2 ] (Factorizing 3(k + 1) )  

= 3(k + 1)[(k + 1) + 1]

Therefore, the result holds.

Hence, the given statement is true for all positive integers n.

step-by-step explanation:

divide, then simplify your answer.

1. make -15.66 ÷   5.8 a fraction. then divide.

2. simplify.  

3. final answer.  

c: y > - 1/6x + 1

step-by-step explanation:

dashed line - meaning this < or > also not equal

solid line - meaning this < or > also equal

your answer is c because y > means up & it's shaded up, but y < means down

hope this ! : )