Induction Takes 11 Minutes. The Formula Takes 2. Both Are Right | #discretemath | #induction

#Dogmathic #MathInduction #DiscreteMath #SummationProof #MathProof Why Does 1 + 4 + 7 + … Collapse So Cleanly? Induction and summation are the two tools math students are told to trust. This video puts both of them to work on the same problem: proving that the sum of the arithmetic sequence 1 + 4 + 7 + ... + (3n−2) equals n(3n−1)/2 for all integers n greater than or equal to 1. The video does induction first, on purpose. Base case checks out at n=1, both sides equal 1. Then comes the induction hypothesis, where we assume the formula holds up to k and try to claw our way to k+1. The algebra is honest , there's a common denominator step, a distribution step, and a factoring step where you're trying to squeeze 3k² + 5k + 2 into two clean binomials. It works. It's satisfying in the way that things are satisfying when you didn't cheat to get there. Then the arithmetic formula shows up and does the whole thing in four lines. First term is 1, last term is 3n−2, there are n terms. Plug into the formula for the sum of an arithmetic sequence and you're done. n(3n−1)/2 drops right out. The contrast is the point. Both methods are correct. One builds the proof from the ground up and the other uses structure that's already there. Knowing when to use which one is most of the game. Topics covered: mathematical induction, arithmetic sequence, summation formula, induction hypothesis, induction step, base case, closed form expression, arithmetic series, common denominator, polynomial factoring, discrete math, proof techniques, sigma notation, linear sequence Support Dogmathic https://ko-fi.com/dogmathic https://dogmathic.com/ matherssen(at)gmail.com    • My Handwriting Is Bad but This Proof Is Be...      • Ruby!      • Induction Proofs      • Discrete Mathematics      • Summations      • Number Theory   Properties and Concepts Used: Mathematical induction (proof by induction) Arithmetic sequence Arithmetic series sum formula: Sn = n(a₁ + aₙ)/2 Base case verification Induction hypothesis (pk assumption) Induction step (showing pk+1 follows from pk) Sigma notation / summation notation Closed-form expression Common denominator algebra Polynomial expansion (distribution) Polynomial factoring (factoring 3k² + 5k + 2) FOIL method Telescoping structure recognition First and last term identification in a sequence Chapters: 0:00 Introduction and goal 0:46 Proof 1: Induction begins 1:03 Base case (n=1) 3:09 Induction hypothesis 4:32 Induction step (showing pk+1) 7:03 Applying the induction hypothesis 9:23 Factoring and finishing 11:38 Proof 2: Arithmetic formula 13:56 Wrap-up #Dogmathic #MathInduction #DiscreteMath #SummationProof #mathproofs