title: Proving Big-Oh Notation
body: <p>I have been trying to prove how f(n) = log(n^3) is O(logn).
  I get what O(logn) complexity means but I can wrap my head around by proving log(n^3) is O(logn)</p>
  
  <p>**If this question has already been asked, please link me to that post. Thanks.</p>