00:01
Hi, today we are solving the question in which let us see the proof.
00:05
So here base case is let n is equals to 1.
00:09
So we need to show that equation holds true for n is equals to 1.
00:15
So taking r plus 1 into 2 raised to the power 1.
00:23
So it is equals to 2 raised to the power 1 minus 1.
00:29
So it is equals to 1 not 1 it is equals to now from here on solving it we get 2 r plus 1 is equals to 2 so r is equals to 0 .5.
01:00
Since the equation holds true for n is equals to 1 the base case is proven.
01:18
Then now taking the inductive hypothesis so inductive hypothesis we can assume that equation holds true for n is equals to k where k is an arbitrary positive integer and k is greater than 1.
01:47
So that is r plus 1 into 2 raised to the power k minus 1 is equals to k into 2 into k minus 1.
02:10
So here inductive step we need to show that the equation hold true for n is equals to k plus 1.
02:18
That is if we take r plus 1 into 2 raised to the power k plus 1 minus 1...