Discrete Math. Prove by Induction that 2 Divides n^2 + n for positive integer n

In this video, we prove by induction that 2 divides n^2 + n where n is a positive integer. This problem was taken from Discrete Mathematics and Its Applications by Kenneth Rosen, 7th edition, Chapter 5.1, question 31.

Discrete Mathematics playlist:
https://youtube.com/playlist?list=PLm90IN9RVLf_BneWC40564ZZAqpe2sz6-&si=bKhYao84EXCHpl6N

Induction Proofs playlist:
https://youtube.com/playlist?list=PLm90IN9RVLf-z-V3NIPi0-ZhxckZHup9q&si=hIv_gDttX16fM1F5

Chapters:
00:00 Introduction to Question
00:39 Explanation of Divides.
02:10 Base Case P(1)
02:58 Inductive Step P(k)
03:12 Induction Hypothesis (IH)
04:31 We Want to Show P(k+1) Case
05:26 Algebra Steps
06:44 TRICK!
07:00 Algebra Steps
09:24 QED and Note and Thanks for Watching

#discrete_mathematics #discretemathematics #induction_proof #induction #integers #integerproof #division