Prove by induction that 3n(n 1) is divisible by 6 for all positive integers.

We are asked to prove by the method of mathematical induction that:

      3n(n+1) is divisible by 6 for all positive integers.

which is divisible by 6.

Hence, the result is true for n=1

i.e. 3k(k+1) is divisible by 6.

Let n=k+1

then

Since, the first term:

is divisible by 6.

( As the result is true for n=k)

and the second term is also divisible by 6.

Hence, the sum:

 is divisible by 6.

Hence, the result is true for n=k+1

Hence, we may say that the result is true for all n where n belongs to positive integers.

answer: i cant see the graphs but i can you find the answer

step-by-step explanation:

the first point we'll be 0,0 and then you go up the y axis 4 places and over to the right 1 so your second point will be 1,4

10 * 563.67 = 5636.7