In asymptotic analysis n refers to the input size for an algorithm, so you may always assume n is an integer in this context Prove $2$n is O$($n$!)$ for n $>3.$