00:03
We are given multiple choices and we are asked to pick the choice, which is the correct answer.
00:16
So we are asked what the inductive hypothesis would be in a proof of mathematical induction that the sum of the first 0 .1 plus 2 plus 3 plus of the dot plus n equals n times n plus 1 over 2.
00:44
What would the inductive hypothesis be for this proof? let's consider choice a n equals 1.
01:03
This doesn't really tell us things about the natural numbers.
01:09
This is really only true for one natural number.
01:15
What about choice b? choice b doesn't tell us anything about a specific natural number except for the natural number one.
01:31
Choice c, this is the equality that 1 equals 1 times 1 plus 1 over 2.
01:43
Now, this is a form of our statement, but this is a form of the statement for n equals 1.
01:56
So this is actually the base case, and therefore it's not the inductive step, because this is not for some arbitrary n...