Proof by contradiction

Big-O Examples T(n) = O(f(n)) If and only if we can find values for c, no > T(n) S c f(n), where Note: c, no cannot depend on n Claim: for every k >= 1, nk is not O(nk-1)