The question is to prove that
is in Θ(n5)
What I tried to do what split up 4n5 into two separate constants (2n5 + 2n5) and make that whole equation greater than or equal to 2n5 and got C = 2, N >= 6.
I'm unsure if I'm right and I'm still quite unsure how to actually prove that function is in Θ(n5). I hope someone can come along and help me solve this and what steps to take in order to prove other Big Oh notation problems.
Thank you for the help guys!
We have to show that there exists positive M and N such that
g(n) * M <= f(n) <= g(n) * N
for large enough ns. In this case, that's
M * n5 <= 4n5 - 17n4 - 33n3 - 13n2 <= N * n5
Divide by n5:
M <= 4 - 17(1/n) - 33(1/n2) - 13(1/n3) <= N
For large ns, we'll be left with
M <= 4 - ε <= N
We can pick M = 3 and N = 4.
This actually follows from the result above, but we can provide a specific proof as well.
We have to show that there exists a positive N such that
|f(n)| <= g(n) * N
for large enough ns. In this case, that's
|4n5 - 17n4 - 33n3 - 13n2| <= N * n5
Divide by n5:
4 - 17(1/n) - 33(1/n2) - 13(1/n3) <= N
For large ns, we'll be left with
4 - ε <= N
We can pick N = 4.
Reference:
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With