title: log base 2 equals log base 3 when analyzing time complexity?
body: <p>Most solutions to Exercise 4.4.6 of Intro. to Algorithms 3rd edition say, 
  n*log3(n) = Big omega of (n*lg(n)).</p>
  
  <p>Dose it mean log3(n) is equivalent to log2(n) when we are discussing time complexity of algorithms?</p>
  
  <p>Thanks</p>