Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

For each $n>0$, how do we prove that $$\Gamma'(n+1)> \log{n} \cdot \Gamma(n+1)$$

  • I had spent about half an hour on this question, but just could find any way of proceeding for the solution.

  • Wikipedia page gave me an interesting identity $$\Gamma'(n+1)= n! \cdot \Biggl( - \gamma + \sum\limits_{k=1}^{n} \frac{1}{k}\Biggr)$$ But i don't know how it can be applied here.

share|cite|improve this question
A link to the wikipedia page would be handy. – AD. Oct 27 '10 at 19:52
If the identity holds we would only need to prove that $\log n <\sum \frac{1}{k} -\gamma$, i.e. $$\sum \frac{1}{k}-\log n +\phi(n)>\gamma$$ for some positive function $\phi$. Finding such a $\phi$ might be done using some refinement in the estimate of the integral test, I believe. – AD. Oct 27 '10 at 19:58
up vote 6 down vote accepted

Well, if we rearrange the inequality to

$$\frac{\Gamma^{\prime}(n+1)}{\Gamma(n+1)} > \log n$$

and then note that

$$\frac{\Gamma^{\prime}(n+1)}{\Gamma(n+1)}=-\gamma+\sum_{j=1}^n \frac1{j}$$

you should be able to easily deduce the inequality.

share|cite|improve this answer
Note also that $\gamma=\lim_{n\to\infty}\sum_{j=1}^n \frac1{j}-\log n$. – J. M. Oct 27 '10 at 20:16
M: Oh ho! I missed the killer blow! – anonymous Oct 28 '10 at 5:09

Your Answer


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