# Asymptotic Tight bound question

1. Jan 21, 2012

### gr3g1

1. The problem statement, all variables and given/known data

Hi,

I just have a basic question regarding an asymptotic tight bound question.

The question is :
TRUE / FALSE

http://latex.codecogs.com/gif.latex?3^{n+1} \text{ belongs to } \Theta(3^{n}) [Broken]

By definition of big theta:

$c_{1}g(n) \leq f(n) \leq c_{2}g(n) \text { } \forall n > n0$

So in my case, $g(n) = 3^{n} \text{ and } f(n)=3^{n+1}$

Therefore to prove this true, I should show a set of values for c1, c2, and n for the definition to hold true.

Is that correct?

Last edited by a moderator: May 5, 2017