title: Solving recurrences
body: <p>Am trying to solve the given recursion, using recursion tree, <code>T(n) = 3T(n/3) + n/lg n.</code> </p>
  
  <p>In the first level <code>(n/3)/(log(n/3)) + (n/3)/(log(n/3)) + (n/3)/(log(n/3)) = n/(log(n/3))</code>. </p>
  
  <p>In the second level it turns out to be <code>n/(log(n/9))</code>.</p>
  
  <p>Can I generalize the above equation in the form of <code>n.loglogn</code></p>
  
  <p>This is a general doubt I've, I need an insight on this.</p>
  
  <p>Note:
  Any function that has to be <code>Theta(n^k log^k (n))</code> in that function k should >=1. And in this case k is -1 so master theorem doesn't come in to picture</p>