00:01
Right, so here we have two different functions to investigate.
00:04
The first is to see whether the function f of n being equal to 2 to the n plus 1 is big o of 2 to the power of n.
00:21
So we're going to figure that out.
00:28
And so we're just going to let initially k equal 0.
00:35
So that implies that n must be greater than 0.
00:40
It's the lowest bound there that we can choose, so it's an appropriate assumption.
00:49
And then we will take a look and we see that the absolute value of f of n is equal to the absolute value of 2 to the n plus 1.
01:02
This is equal to 2 times 2 to the n, which is equal to 2 times the 0 times the absolute value of 2 to the power of n.
01:20
So if we let c equal 2, then by big o notation, the absolute value of f of n, which is going to be equal to the absolute value of 2 times n plus 1.
01:43
Must be less than or equal to 2 times the absolute value of 2 to the n.
01:53
We already see that that is true...
