00:01
Okay, so we want to use mathematical induction to show how the following is true.
00:06
So let's start with condition one.
00:09
So we need to check if n is equal to 1 is true.
00:12
So that gives us negative 1 plus 1, which is equal to negative 2.
00:17
Is that the same as the right hand side? well, that's 1 half times 1 and then 1 plus 3.
00:22
So we get negative 4 over 2, which is equal to negative 2 as well.
00:27
Okay, and now let's look at condition 2.
00:29
So in this case, we need to assume that k is equal to n is true.
00:36
So we can write that out.
00:39
We get the following.
00:41
We just replace our n with our k.
00:45
And then we have negative 1 over 2k times k plus 3.
00:49
And now we want to show that n is equal to k plus 1 is true...