I need to use the formal definitions of O-notations to prove that 2^n ∈ O(n!) I know that the factorial has a higher growth rate but I want to see how arfcom would be able to do this problem.
Posted: 2/4/2012 11:27:54 PM EDT
[#1]
Unless I misunderstand what you're trying to say, it's not an accurate statement, so you're going to have a hard time proving it.
