Induction Proof for Sum of First N Squares | Discrete Math

Опубликовано: 24 Март 2021
на канале: Wrath of Math

1,204

We use induction to prove that 1^2 + 2^2 + ... + n^2 = (n(n+1)(2n+1))/6. As in, the sum of the first n squares is (n(n+1)(2n+1))/6. This is a straightforward induction proof with a bit of messy expansion, but that's the worst of it! Induction proofs are good to be very comfortable with, so let's cozy on up to this induction proof example!

Discrete Math Exercises:    • Discrete Math Exercises

★DONATE★
◆ Support Wrath of Math on Patreon for early access to new videos and other exclusive benefits:   / wrathofmathlessons
◆ Donate on PayPal: https://www.paypal.me/wrathofmath

Thanks to Robert Rennie and Barbara Sharrock for their generous support on Patreon!

Thanks to Crayon Angel, my favorite musician in the world, who upon my request gave me permission to use his music in my math lessons: https://crayonangel.bandcamp.com/

Follow Wrath of Math on...
● Instagram:   / wrathofmathedu
● Facebook:   / wrathofmath
● Twitter:   / wrathofmathedu

My Music Channel:    / @emery3050

Смотрите видео Induction Proof for Sum of First N Squares | Discrete Math онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь Wrath of Math 24 Март 2021, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 1,204 раз и оно понравилось 32 людям.

223