title: Difference between solving T(n) = 2T(n/2) + n/log n and T(n) = 4T(n/2) + n/log n using Master Method
body: <p>I recently stumbled upon a resource where the 2T(n/2) + n/log n <strong>type</strong> of recurrences were declared unsolvable by MM.</p>
  
  <p>I accepted it as a lemma, until today, when another resource proved to be a contradiction (in some sense).</p>
  
  <p>As per the resource (link below): Q7 and Q18 in it are the rec. 1 and 2 respectively in the question whereby, the answer to Q7 says it can't be solved by giving the reason 'Polynomial difference b/w f(n) and n^(log a base b)'.
  On the contrary, answer 18 solves the second recurrence (in the question here) using case 1.</p>
  
  <p><a href="http://www.csd.uwo.ca/~moreno/CS433-CS9624/Resources/master.pdf" rel="nofollow">http://www.csd.uwo.ca/~moreno/CS433-CS9624/Resources/master.pdf</a></p>
  
  <p>Can somebody please clear the confusion?</p>