SciELO - Scientific Electronic Library Online

vol.31 número1The global convergence of a descent PRP conjugate gradient methodOn a linearisation method for Reiner-Rivlin swirling flow índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados



Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google


Computational & Applied Mathematics

versão On-line ISSN 1807-0302

Comput. Appl. Math. vol.31 no.1 São Carlos  2012 

Sharpness of Muqattash-Yahdi problem



Chao-Ping ChenI; Cristinel MorticiII, *

ISchool of Mathematics and Informatics, Henan Polytechnic University, Jiaozuo City 454003, Henan Province, People's Republic of China E-mail:
IIValahia University of Târgoviste, Department of Mathematics, Bd. Unirii 18, 130082 Târgoviste, Romania E-mail:




Let ψ denote the psi (or digamma) function. We determine the values of theparameters p, q and r such that
ψ(n) ln(n + p) -
is the best approximations. Also, we present closer bounds for psi function, which sharpens some known results due to Muqattash and Yahdi, Qi and Guo, and Mortici.

Mathematical subject classification: 33B15, 26D15.

Key words: psi function, polygamma functions, rate of convergence, approximations.



The gamma function is usually defined for x > 0 by

The logarithmic derivative of the gamma function:

is known as the psi (or digamma) function. The successive derivatives of the psi function ψ(x):

are called the polygamma functions.

The following asymptotic formula is well known for the psi function:

(see [1, p. 259]), where

are the Bernoulli numbers.

Recently, the approximations of the following form:

were studied by Muqattash and Yahdi [6]. They computed the error

and then the approximation (2) was compared with the approximation obtained by considering the first two terms of the series (1), that is

Very recently, the family (2) was also discussed by Qi and Guo [7]. One of their main results is the following inequality on x (0, ):

where γ = 0.577215... is the Euler-Mascheroni constant.

In the final part of the paper [6], the authors wonder whether there are profitable constants a [0, 1] and b [1, 2] for which better approximations of the form

can be obtained. Mortici [3] solved this open problem and proved that the best approximations (4) appear for


Moreover, the author derived from [3, Theorem 2.1] the following symmetric double inequality: For x > = 0.40824829...,

This double inequality is more accurate than the estimations (3) of Qi and Guo.

We define the sequence by

We are interested in finding the values of the parameters p, q and r such that is the fastest sequence which would converge to zero. This provides the best approximations of the form:

Our study is based on the following Lemma 1, which provides a method for measuring the speed of convergence.

Lemma 1 (see [4] and [5]). If the sequence converges to zero and if there exists the following limit:


Theorem 1. Let the sequence be defined by (6). Then for


we have

The speed of convergence of the sequence is given by the order estimate O(n-4) as n .

Proof. First of all, we write the difference vn - vn + 1 as the following power series in n-1:

According to Lemma 1, the three parameters p, q and r, which produce the fastest convergence of the sequence are given by (10)

that is, by (8) and (9). We thus find that

Finally, by using Lemma 1, we obtain the assertion (1) of Theorem 1.

Solutions (8) and (9) provide the best approximations of type (7):


Theorem 2 below presents closer bounds for psi function.

Theorem 2. For x > = 1.23394491..., then

Proof. The lower bound of (13) is obtained by considering the function F defined by

We conclude from the asymptotic formula (1) that

It follows form [2, Theorem 9] that

Differentiating F(x) with respect to x and applying the second inequality in (14) yields, for x > ,


Therefore, F'(x) < 0 for x > . This leads to

F(x) >

This means that the first inequality in holds for x > .

The upper bound of (13) is obtained by considering the function G defined by

We conclude from the asymptotic formula (1) that

Differentiating G(x) with respect to x and applying the first inequality in (14) yields, for x > 0,



Therefore, Q(x) > 0 and G'(x) > 0 for x > x2. This leads to

This means that the second inequality in (13) holds for x > 0.158650823....

Some computer experiments indicate that for x > 2.30488055, the lower bound in (13) is sharper than one in (5). For x > 0.5690291018, the upper bound in (13) is sharper than one in (5).

The inequality (13) provides the best approximations:


Acknowledgements. The work of the second author was supported by agrant of the Romanian National Authority for Scientific Research, CNCS -UEFISCDI, project number PN-II-ID-PCE-2011-3-0087.



[1] M. Abramowitz and I.A. Stegun (Editors), Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Applied Mathematics Series, 55, Ninth printing, National Bureau of Standards, Washington, D.C. (1972).         [ Links ]

[2] H. Alzer, On some inequalities for the gamma and psi functions. Math. Comp., 66 (1997), 373-389.         [ Links ]

[3] C. Mortici, The proof of Muqattash-Yahdi conjecture. Math. Comput. Modelling, 51 (2010), 1154-1159.         [ Links ]

[4] C. Mortici, New approximations of the gamma function in terms of the digamma function. Appl. Math. Lett., 23 (2010), 97-100.         [ Links ]

[5] C. Mortici, Product approximations via asymptotic integration. Amer. Math. Monthly, 117 (2010), 434-441.         [ Links ]

[6] I. Muqattash and M. Yahdi, Infinite family of approximations of the digamma function. Math. Comput. Modelling, 43 (2006), 1329-1336.         [ Links ]

[7] F. Qi and B.-N. Guo, Sharp inequalities for the psi function and harmonic numbers, arXiv:0902.2524v1 [math CA]         [ Links ].



Received: 21/XII/10.
Accepted: 24/VIII/11.



* Corresponding author.

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons