Hi experts,(adsbygoogle = window.adsbygoogle || []).push({});

I came across a question to determine whether 2^n = O(n!) is true or false. If its true, i need to prove it.

I am aware of the list of growing order functions. So i suppose the statement is true.

However, I can't prove it.

anyone can help me with this? thank you very much!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How to prove expontential = O (n!)

Loading...

Similar Threads - prove expontential | Date |
---|---|

How to prove problem is P or NP? | Mar 12, 2015 |

Proving NFA accepts reverse string of DFA | Mar 7, 2012 |

**Physics Forums - The Fusion of Science and Community**