I have to write a proof for the following statement.
$$\log_2(n!)\in\mathcal O(n\log_2(n))$$
What approach would you recommend. I am kind of LOST trying to figure this out.
I transformed the expression to logical symbols, I end up with this final expression.
$$\exists c\in\Bbb R,\exists\beta\in\Bbb N,\forall n\in\Bbb N,n\ge\beta\Rightarrow\log_2(n!)\le c(n\log_2(n))$$
I have to use the logarithmic rules and simple induction. But I have no idea how to assume the antecedent and determine de consequent for that exercise...