Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a recurrence relation, it is like the following:

$$ T(e^n) = 2\cdot T(e^{n-1}) + e^n, \text{ where $e$ is the natural logarithm} $$

To solve this and find a Θ bound, i tried the following: I put k=en, and the equation transforms into: $$ T(k)=2\cdot T(k/e)+k $$ Then, i try to use the master theorem. According to master theorem, $a=2, b=e>2 $ and $f(k)=k$. So, we have the case where $f(k)=\Omega(n^{log_a b + \epsilon})$ for some $\epsilon$>0, thus we have $T(k)=\Theta (f(k))= \Theta(k)$. Then put $k=n$, we have $T(n)=\Theta(n)$. Does my solution have any mistakes?Thanks

share|cite|improve this question
up vote 1 down vote accepted

Looks fine to me. Even better, you can plug $T(k)=2T(k/e)+k$ directly in Wolfram Alpha to get an exact answer.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.