Induction 5
Loading...
Loading...
8:45
Induction 1by TheMathsters7,172 views- 6:39
Induction 6by TheMathsters1,661 views
- 10:01
Induction 8by TheMathsters2,027 views
- 7:53
Principle of Mathematical Induction 4by AbsoluteMathematics3,437 views
- 5:54
Induction 7by TheMathsters1,547 views
- 8:34
Modular arithmetic 6by TheMathsters3,574 views
- 7:58
Numbers 4by TheMathsters987 views
- 4:49
Induction 9by TheMathsters1,209 views
- 7:39
Sets 3by TheMathsters2,561 views
- 7:39
Sets 2by TheMathsters2,686 views
- 9:43
Sets 8by TheMathsters2,362 views
- 3:29
prove that (5^2n)-1 is a multiple of 8 for all n elements of Natural no.?by TucsonMathDoc453 views
- 4:48
Example of Proof By Inductionby MathDoctorBob4,879 views
- 2:59
Little Proof by Inductionby GR1o618033988749894811,668 views
- 5:01
Little Proof by Induction IIby GR1o61803398874989483,855 views
- 9:36
Sets 1by TheMathsters5,225 views
- 8:12
Mathematical Induction Video 1by speakerbill852 views
- 4:30
Direct Proofby Jagg1432,257 views
- 5:00
Mathematical Induction Ex1by ibpodcasting383 views
hey i think it said when n is odd or something, but doesn't matter now, thanks anyways
leonne12 2 years ago
Hi, I'll answer anyway in case anyone else is curious. If it's only when n is odd, you'd have to do your induction jumping two at a time (so the induction step would go from k to k+2).
TheMathsters 1 year ago
thanks, this helped me a lot. I just have a question. The problem i have was to prove n^2-1 is divisible by 4. I pretty much followed your steps but got stuck on (n^2-1)+(2n+1). I saw somewhere that they set it = to 4i +1 and than i guess i would move the 1 to cancel out the other one and get (n^2-1)+2n=4i which would prove that its divisible by 4. Is this right?
leonne12 2 years ago
Something is wrong here - n^2-1 is not always divisible by 4. Are you sure that's what you're trying to prove?
TheMathsters 2 years ago