tux
  • tux
Here is the question: http://i.imgur.com/HnBo7.png Base case n=1 1*(1-1)+2*(2-1)+3*(3-1)=1*(9*1^2-1) 1*(0)+2*(1)+3*(2)=1*(8) 8=8 How to do Inductive step for n=k and n=k+1?
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
amistre64
  • amistre64
if the basis works, then assume it works for any k, then adjust it by k+1 and try to get it back to a form of "k" to compare with
amistre64
  • amistre64
\[\text{assume: }\sum_{1}^{3k}i(i-1)=k(9k^2-1)\] \[\text{prove: }\sum_{1}^{3(k+1)}i(i-1)=(k+1)(9(k+1)^2-1)\]
amistre64
  • amistre64
\[1(0)+2(1)+3(2)+...+k(k-1)=k(9k^2-1)\] by adding (k+1)((k+1)-1) to both sides we get \[1(0)+2(1)+...+k(k-1)+[(k+1)(k+1)-1]=k(9k^2-1)+[(k+1)(k+1)-1\]

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

amistre64
  • amistre64
rewrite \[k(9k^2-1)+(k+1)[(k+1)-1]~\text{ into }~(k+1)(9(k+1)^2-1)\]

Looking for something else?

Not the answer you are looking for? Search for more explanations.