Prove n(n^2+5) is a multiple of 6. Principle of Mathematical Induction

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Thankyou so much, youve just saved me for my specialist maths investigation. This happens to be an exact question on it but i dont want to copy it down without fully understanding proof by induction first (id rather try do it myself without just an answer because im really not learning that way with the answer) and your videos have really been helping me out. Thaknyou so much!

isaacnjuguna
Автор

Thanks for the solution. Was thinking about the idea of factoring out 6 after you expand the proof for k + 1, to get 6(m + (k(k+1)/2) + 1) . Since k(k+1)/2 is the Gauss sum of k integers, so k(k+1)/2 is always an integer, therefore we get 6(m + p + 1).

hawundlovu
Автор

thanks Ms Shaws ...got a lot of ideas from this proof

ahnafakif