Robotpolice
New member
- Joined
- Oct 21, 2011
- Messages
- 1
Hi guys
Looking for some help with a Big Oh problem. Hope this is the right subforum.
The question is: show that a^n = O(n!) where 'a' is a positive constant and 'n' is a natural number.
So I started by doing:
a^n <= c * n! (where c is some constant)
and substituted values for c, and n, (e.g. c=3, n=8)
and found the O(n!) is true for values of n > 7. I even graphed some values of n! to show them growing faster than a^n but this is no good for proving large values of n (e.g. 1,000,000)
Any help greatly appreciated
Looking for some help with a Big Oh problem. Hope this is the right subforum.
The question is: show that a^n = O(n!) where 'a' is a positive constant and 'n' is a natural number.
So I started by doing:
a^n <= c * n! (where c is some constant)
and substituted values for c, and n, (e.g. c=3, n=8)
and found the O(n!) is true for values of n > 7. I even graphed some values of n! to show them growing faster than a^n but this is no good for proving large values of n (e.g. 1,000,000)
Any help greatly appreciated