1. Introduction
Pochhamer’s products or shifted factorials, falling (lower) and rising (upper), are often encountered in pure and applied mathematics and in several exact sciences too. For example, we meet them in combinatorics, number theory, probability, statistics, statistical physics, etc. These products are closely related to the famous function which is well accessible also in a numerical sense.
The classical
rising Pochhammer’s product
1 of the order
and the basis
,
can be expressed, for
, in terms of
function as
There are only a few articles on approximating the Pochhammer product. One of them is [
3], where are given several approximations to the products in question. In our paper, we would like to present sharper and more general results than those given in [
3].
The last equation above suggests the most useful extension of the classical rising discrete-order Pochhammer’s factorial to a continuous-order Pochhammer’s factorial by setting the following definition.
Definition 1.
The rising Pochhammer’s factorial is defined as
Obviously, and , for .
Lemma 1.
For , we have
Proof. Considering Definition
1, we have, for
,
□
The classical
falling Pochhammer’s product of order
and basis
,
can be expressed by the rising Pochhammer’s factorial as
for an integer
n and a real
x satisfying
. Therefore, we extend the domain of the falling Pochhammer’s factorial to continuous case setting
Moreover, since , for , we set the next definition.
Definition 2.
The falling Pochhammer’s factorial we define as
Obviously, and , for .
2. Auxiliary Result (Approximation of Function)
The Stirling approximation formula of order
for
function says that for
we have [
2], [sect. 9.5]
where
and, for some
,
The numbers
,
,
, …are known as the Bernoulli coefficients
2. We have, for example,
with the estimates
,
,
,
,
,
,
.
As a consequence, we have for the (continuous) factorial function
the expression (the Stirling factorial formula)
3. Approximations to Pochhammer’s Products
Using (
1) and (
5) we calculate
According to (
7) we have, for
,
At small
x the estimate (
8) becomes useless. Therefore, in (
10) we replace
x with
, where
m is a positive integer, not being too large. Using the formulas (
10) and (
8) together with (
2), we find an asymptotic approximation of the generalized Pochhammer’s rising product given in the next theorem.
Theorem 1.
For and for integers , the equality
holds, where3
and, uniformly in p,
Example 1.
For we have
and
with .
For
and any integer
we obviously have
. Moreover, setting
and
in Theorem 1, we get a more accurate estimate, given in the next corollary
4.
Corollary 1.
For , there hold the following inequalities:
Figure 1 illustrates
5 the relations (
17) and (18) by plotting the graphs of the functions
and
, together with the graph (continuous line) of the function
, which nearly coincides with the function
.
Remark 1.
In the formula (16), m and r are the parameters that affect the error term . We stress that becomes very large for large r. Indeed, according to [1, 23.1.15], we have
In addition, referring to (5) and (7), or using [5], we have the double inequality
Consequently,
Thus, considering (16), we find6
Corollary 2.
For and for integers , satisfying , the approximation , given in Theorem 1, has the relative error
estimated as
Proof. According to Theorem 1, using Taylor’s formula, we obtain, for some
,
Now, for integers
, satisfying
, and for
, we have
. Consequently, referring to (
16) and (23), we estimate
. Hence, considering (
25), we get
□
The immediate consequence of Corollary 2 is the next corollary.
Corollary 3.
For and for integers , satisfying , the inequalities
hold.
Example 2.
Setting and in Corollary 3 we obtain the following double inequalities:
true for and , and
valid for and .
The inequalities in (
28) are illustrated in
Figure 2, where the dashed line represents the graph of the function
and the continuous line, compressed between the nearly coinciding graphs of the functions
, represents the graph of the function
.
We are interested in how the sequence
varies. Indeed, thanks to Theorem 1, for
and integers
, we have
Therefore, for integers
and
, for real
, and for the difference
,
using (
16), we estimate
The inequalities (
31) can be used to estimate the error
by using the appropriate
, which specifies a negligibly small
(see (
22)) and thus provides a useful estimate for
.
Figure 3 and
Figure 4 illustrate the estimate (
31), for
, by showing the graphs of the functions
7 and
, cramming the graphs of the functions
.
Remark 2 (open problem).
Figure 3, Figure 4, Figure 5 and Figure 6 suggest the hypotheses that , for all allowed values of all arguments.
For , the quantity is called p–factorial. The discrete factorial function is extended continuously, for real , as . Immediately from Theorem 1 we read the next corollary, which presents a formula for that does not contain the constant .
Corollary 4 (approximation of continuous factorial function).
For and integers we have8
for some from the interval .
Using Definition 2 and Theorem 1 we obtain the approximation of generalized Pochhammer’s falling product presented in the next theorem.
Theorem 2.
For real , satisfying and for integers , we have the equality
where , that is
with defined in (15), and
Remark 3.
For and any integer p, satisfying , we obviously have . In addition, using the inequality , true for , from (34) we obtain
Thus, for all integers and such that , we have a rough estimate9
Using Definition 2 and Corollary 3 we read the next result.
Corollary 5.
For real satisfying and for integers such that , the inequalities
and
hold.
Thanks to Corollary 5, the approximation
has the relative error
estimated as
true for
that meet all conditions given in Corollary 5.
4. Sequences of classical binomial coefficients
According to (
3), the binomial coefficient “
x over
n”,
can be expressed using the upper Pochhammer product in the way, given in the next Proposition.
Proposition 1.
For every real x and any integer , we have10
Proof. The first and the last cases are obvious. Relating to the second one, for
, we have
11
□
Thanks to Proposition 1, Theorem 1 and (
9), we present the following three examples.
Example 3.
Using and in Theorem 1 and in (9), we obtain, for some and ,
Thus, for every and some and , we have
Figure 7 shows the graphs of the sequences
and
, left and right respectively.
Example 4.
Setting and in Theorem 1 and in (9), we get, for some and ,
Therefore, for any , using some and , we find
Hence,
Figure 9 shows the graphs of the sequences
and
, left and right respectively.
Example 5.
Using and in Theorem 1 and in (9), and considering Example 4, we have12
for some and . Thus, for every there exists some and some such that
Consequently,
Figure 9 shows the graphs of the sequences
and
, left and right respectively.
Remark 4. More about binomial coefficients can be find in [4].
Notes
| 1 |
Leo August Pochhammer, 1841–1920 |
| 2 |
The positive numbers are called the Bernoulli numbers. |
| 3 |
considering , by definition |
| 4 |
which can be improved by increasing m
|
| 5 |
All figures in this paper are produced using Mathematica [ 6]. |
| 6 |
considering the estimate , for
|
| 7 |
with
|
| 8 |
taking into account the definition . |
| 9 |
interesting for a larger m
|
| 10 |
For , the floor symbol means the integer part of x. |
| 11 |
considering the equality , for , true by definition |
| 12 |
using the identity
|
References
- M. Abramowitz and I. A. Stegun Handbook of Mathematical Functions, 9th edn, Dover Publications, New York, (1974).
- R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1994.
- V. Lampret, Approximating real Pochhammer products: a comparison with powers, Cent. Eur. J. Math. 7 (2009), no. 3, 493–505.
- V. Lampret, Accurate approximations of classical and generalized binomial coefficients, Comput. Appl. Math. (2024), 43:341. [CrossRef]
- H. Robbins, A Remark on Stirling Formula, Amer. Math. Monthly, 62 (1955), 26–29.
- Wolfram, Mathematica, version 7.0, Wolfram Research, Inc., 1988–2009.
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).