Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $n \in N$. How to find a non-asymptotic upper bound for $\Gamma(n)$ and $\Gamma(\frac n2+1)$?

Thank you

share|cite|improve this question
Have you seen this article? – Antonio Vargas Nov 19 '12 at 19:31
Antonio: thank you – Peter Nov 19 '12 at 21:04
up vote 1 down vote accepted

Equation 6.5.1 here gives a reasonably tight bound except for very small n. I suppose section 5.11 here also could be unpacked to yield some upper bounds, depending on exactly what you're looking for. (I assume you know that for integer n, $\Gamma(n) = (n-1)!$.)

share|cite|improve this answer
Thank you, but I would like to get some refference as a book. – Peter Nov 29 '12 at 23:31

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.