title: Big Oh Notation O((log n)^k) = O(log n)?
body: <p>In big-O notation is <code>O((log n)^k) = O(log n)</code>, where <code>k</code> is some constant (e.g. the number of logarithmic for loops), true?</p>
  
  <p>I was told by my professor that this statement was true, however he said it will be proved later in the course. I was wondering if any of you could demonstrate its validity or have a link where I could confirm if it is true.</p>