z-logo
open-access-imgOpen Access
Remarks on a paper by Chao-Ping Chen and Feng Qi
Author(s) -
Stamatis Koumandos
Publication year - 2005
Publication title -
proceedings of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.968
H-Index - 84
eISSN - 1088-6826
pISSN - 0002-9939
DOI - 10.1090/s0002-9939-05-08104-9
Subject(s) - algorithm , artificial intelligence , computer science
In a recent paper, Chao-Ping Chen and Feng Qi (2005) established sharp upper and lower bounds for the sequence P n := 1.3 … ( 2 n − 1 ) 2.4 … 2 n P_{n}:=\frac {1.3\ldots (2n-1)}{2.4\ldots 2n} . We show that their result follows easily from a theorem of G. N Watson published in 1959. We also show that the main result of Chen and Qi’s paper is a special case of a more general inequality which admits a very short proof.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here