# Tagged Questions

19 views

### Solving recurrence relation with $c=\Theta(\log(\log(n)))$

The master theorem in recurrence relations, i encounter with difficulty in solving problems, which have $c=\Theta$ $($of something$)$ or when it has $\log(n)$ or its variants instead of a simple ...
23 views

67 views

### Understanding Recurrence Relation

as i ask question and answered by some Clever people at this topic: Recurrence Relation Solving Problem i try to learn new thing with new question very similar to get familiar with recurrence ...
19 views

### What is the asymptotic bound of the recurrence : $T(n)= 2T\frac{n}{2}+\log n$?

I have managed to reach upto : $T(n) = 2.n.\log n - \log n - [2+2.2^2 +3.2^3 + \dots\log_2 n.2^{\log_2 n}]$ I m stuck here and not getting any clue how for solving the arithmetico-geometric series. ...
16 views

### Can someone help me solve this recurrence using the Master Theorem?

Can someone help me solve this recurrence? $$T(n)= T(n^{1/2}) + Θ(\log\log n)$$ I know that I have to change the variables $m=\log n$. Then I have: $$S(m)=S(m/2)+Θ(\log m)$$ Case 2 of Master ...
16 views

### third order recurrence relation with non-constant coefficients

Does anyone know of a paper that may have been written on $3^{rd}$ order recurrence relations with polynomial coefficients, that is, one of the form $$A(n)a_{n+3}+B(n)a_{n+2}+C(n)a_{n+1}=D(n)a_n$$ ...
67 views

### Estimating the recurrence $T(n,i) = (\lfloor\frac{n-i}{i}\rfloor \cdot i ) + T(i + (n \operatorname{rem} i), (n \operatorname{rem} i))$
Given $i < n/2$ and denoting $[x]$ to be an integer part of $x$ (floor$(x)$) and $(a \operatorname{rem} b)$ to be a reminder when $a$ is divided by $b$.  T(n,i) = ...