1. PF Contest - Win "Conquering the Physics GRE" book! Click Here to Enter
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Asymptotic tight bound question

  1. Jan 21, 2012 #1
    1. The problem statement, all variables and given/known data


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

    The question is :

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

    By definition of big theta:

    [itex] c_{1}g(n) \leq f(n) \leq c_{2}g(n) \text { } \forall n > n0 [/itex]

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

    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
  2. jcsd
  3. Jan 21, 2012 #2
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Threads - Asymptotic tight bound Date
Asymptotic ODE Oct 5, 2017
Asymptotic geometry question Sep 29, 2017
Another proof involving orders of groups. Please help me make this proof air-tight. Jun 24, 2012