title: Solve the recurrence: T(n)=2T(n/2)+n/logn
body: <p>I can find the sum of each row <code>(n/log n-i)</code> and also I can draw its recursive tree but I can't calculate sum of its rows.  </p>
  
  <pre><code>T(n)=2T(n/2)+n/logn
  </code></pre>
  
  <p><code>T(1) = 1</code></p>