Submitted:
05 August 2026
Posted:
07 August 2026
You are already at the latest version
Abstract
Employing the fundamental techniques of substitution (change of variables) and integration by parts, the discussion in this letter focuses on obtaining explicit formulas of the integral\( K_{p,r} =\int x^p \left ( 1+ x^2\right )^r dx \) mainly for \( p \) an integer and \( r \) an integral multiple of \( \frac{1}{2} \). As the case where \( r \) is a non-negative integer is rather simple and obvious, we concentrate mainly on the cases where \( r \) is a negative integer or an odd multiple of \( \frac{1}{2} \) except when consideration of other cases is appropriate.
Keywords:
binomial integral
; double factorial
; explicit formula
; initial condition
; integral
MSC: primary 26A06; secondary 26C99
1. Preliminary
The traditional analytical approach for evaluating integrals relies on a toolkit of substitution and reduction formulas through integration by parts. The results of such manual derivations, accumulated and compiled over centuries, resulted in a large number of formulas for various integrals and are now available in encyclopedic handbooks [1,8], which serve as the authoritative reference for practitioners seeking a specific solution.
In the meantime, the modern algorithmic approach is embodied by symbolic computation packages such as Maple [9] and Mathematica [13], which implement sophisticated procedures, for instance the Risch-Norman algorithm, to find antiderivatives automatically [7]. While immensely powerful, these algorithms operate as black boxes, but offer limited insight into the analytical relationships between solutions, mathematical structure of the solutions, or a methodology for manual derivation.
Among a large number of integrals, the evaluation of binomial integrals of the form is a classical problem in integral calculus with importance in physics and engineering [3,4]. The theoretical limits of this problem were established by Chebyshev, whose theorem delineates the specific conditions under which these integrals can be expressed in terms of elementary functions [5]. The class of integrals
is equivalent to a subclass of the binomial integrals for and constitutes a classical yet nontrivial problem in integral calculus, particularly when the parameters p and r extend beyond simple non-negative integers. Such cases arise naturally in various applications: for instance, the integral appears in the computation of surface areas of solids of revolution [17]. From a more general perspective, integrals of this type can be expressed in terms of Gauss hypergeometric functions [2,12]. In modern mathematical physics, related integrals with integer and half-integer parameters are frequently analyzed using harmonic polylogarithms [10] and special-function expansions, particularly in the study of Bessel-type functions and Feynman integrals [11,14,15]. Some of the formulas in [8, 2.27, pp. 99-101]] can be interpreted as special cases of .
Despite the breadth of existing results [1,6,8], several limitations remain apparent in both pedagogical and research-oriented treatments of the integral . For instance, standard substitution techniques frequently lead to case-by-case calculations, which tend to obscure the underlying analytical structure of the solutions [17]. In addition, reduction formulas obtained through integration by parts often encounter ‘walls’ that interrupt recursive evaluation, requiring problem-dependent initial conditions. Furthermore, although closed-form expressions are available for many individual cases, these results are typically scattered across tables or derived in isolation [1,8] with little emphasis on a unified analytical organization on the parameter space .
In this letter, we develop a unified analytical and recursive framework for the systematic evaluation of The approach in this letter is based on a detailed analysis of the parameter plane . We identify five fundamental lines , , , , and along which the integral admits direct closed-form evaluation. These cases provide a complete and natural set of initial conditions that anchor the recursive structure of the problem. Building upon these initial conditions, we derive two general recursion formulas that enable the evaluation of at any admissible point in the parameter plane while systematically bypassing the recursion barriers encountered, mostly on the line , in conventional approaches.
The main contributions of this work can be summarized as follows:
- The parameter plane of is systematically analyzed to provide a unified analytical framework for the categorization and derivation of . Five fundamental lines are identified upon which the integral can be evaluated directly to serve as the foundational initial conditions.
- Two general recursion formulas are derived that enable the methodical generation of solutions at any admissible point .
- By identifying a complete and sufficient set of initial conditions, traditional recursion walls are systematically bypassed, thus ensuring recursive stability.
- This work culminates in a compendium of explicit, closed-form formulas, serving as a valuable reference.
2. Evaluation of with Basic Techniques
In this section we first apply basic techniques of integral for the evaluation of the integral . Throughout the letter, except when necessary, integration constants are omitted for brevity.
It is simple to have or
when p is an integer and r is a non-negative integer, where ,
and is the indicator function of x defined by if and if .
2.1. Evaluation via Substitution
We start with the most basic method for the evaluation of the integral .
2.1.1. Substitution 1
With , we have
When is an integer, (4) can be rewritten as
with . When is a non-positive integer, (5) can be expressed as
for which we can use partial fraction expansion if is an integer. On the other hand, (5) will produce the formula or
when is a non-negative integer, where and with .
When , we get , and thus or
using (6) by noting that .
2.1.2. Substitution 2
With , we get
which will produce the formula or
when is a non-negative integer, where and .
2.1.3. Substitution 3
With , we get
similar to the second method but more useful especially when r is an integral multiple of . When is a non-negative integer, (17) will produce (15) again. On the other hand, when is a non-positive integer, (17) can be expressed as
and subsequently evaluated via partial fraction expansion if is an integer. Note that (17) is almost the same as (14), yet more useful because it can be evaluated via partial fraction expansion when is an integer thus including the case where r is an integer.
From (17) with , we get or
We get or
from (18).
2.2. Evaluation via Integration by Parts
We address two ways of integration by parts, which will eventually lead us to useful recursion formulas for the evaluation of .
2.2.1. Integration by Parts 1
When , with , , , and , we get
Letting in (21), we get the result or
for . Obviously, or
Next, (21) can be rewritten as
from which we get the following two results.
First, when , we get , which can be expressed as
for and . When , (25) is the same as (22). Although we assumed from the starting point of (21), note that (25) holds even for , producing
for . The recursion (26) can of course be obtained alternatively as , where is used.
On the other hand, when in (24), we get or
for .
2.2.2. Integration by Parts 2
Subsequently, (37) can be expressed as
which can be used to obtain the following two results.
First, when and , we get , or
for and . When , (40) is the same as (38). In (37), we have assumed : yet, producing
(40) holds true even for . The result (41) can also be shown in an alternative way as with from (22).
Secondly, when and , we get or equivalently for : this result is the same as (27) when p is replaced with .
3. Explicit Formulas from Direct Evaluation
Let us now consider the main problem of obtaining the explicit formulas of the integral for p an integer and r an integral multiple of in this and following sections. We first consider the cases for which direct evaluation is possible.
In the following developments, and denote the product and sum, respectively, for even when b is not an integer. We also let and if . Here, denotes a point on the p–r plane for p integer and r an integral multiple of , and often represents also.
3.1. The Cases , , , and
For , from (22) and (23), we easily get
Next, by combining the results shown in (11) and (38), we have
for . Similarly, collecting the results shown in (13) and (27), we have
for .
Next, for , the result (A8) shown in Appendix A.1 can be expressed as
after some steps. Here,
and
with
the sign of y: note that we have chosen , not . From (46), we get or
for instance.
3.2. Discussion
For every point on the five lines , , , , and , the integral now has readily available formula. The formulas can be used also as the initial conditions (IC’s) in obtaining the formulas for other points via recursions as discussed in Section 4. Figure 1 illustrates the five lines on which every point now has an explicit formula for the integral .
4. Evaluation via Recursions
For the points not on the five lines , , , , and , and also for some points on the five lines, the integral can be evaluated via recursions as described in this section.
4.1. Evaluation of When
If , we easily get as discussed in (23) also. For , we can obtain from or vise versa for , with the recursion
which can be derived from (21) or (37).
In using the recursion (53), two IC’s are required because the recursion describes a relationship between two ’s with a difference of 2 in the subscript p and we assume integers for p. In addition, due to the ‘wall’ effect (that is, neither from nor from can be obtained when ) caused by the factors in the denominator on the right-hand side of (53), one additional initial condition is required. In short, for the recursion (53), a complete set of three IC’s would be , of which the first, second, and third elements can be replaced by any element from , , and , respectively.
Now, by adding
obtained from (53), we get
for with m a positive integer, where ‘’ denotes ‘’. It is easy to see that the result (57) can also be used for with m a negative integer after an interchange of the subscripts p and s. Subsequently, the IC’s , , and shown in (8), (11), and (23), respectively, can be used to obtain recursively for , for , and for , respectively. More specifically, we will eventuslly get
where as defined in (3),
denotes the lower bound of the summation on the right-hand side of (58),
denotes the upper bound of the summation on the right-hand side of (58),
and
We get , , , and from (58). Similarly, we get and .
4.2. Other Points of
When p is fixed, to obtain from or vice versa for , we can use
shown in (25) under the condition . Next, when r is fixed, to obtain from or vise versa for , we can use
shown in (40) under the condition .
Clearly, when using the two recursions (63) and (64), it is natural to employ the known formulas of the points on the six lines , , , , , and as the IC’s. From Figure 1, it is observed that there now exist four (if ) and three (if ) formulas of readily available as the candidates of the IC’s when using (63) for p fixed. Similarly, when using (64) for r fixed, four (if ) and three (if ) formulas of are readily available as the candidates of the IC’s.
4.2.1. Initial Conditions for the Recursion ( 63)
To obtain with a fixed value of via the recursion (63), let as in (3), , and . The recursion (63) implies that can be obtained from and vice versa in general: however, when and when , neither from nor from can be obtained. Based on this observation, we divide the points into three groups such that , , and , where , , and are called the group sets of r. For each of the group sets, we need two IC’s because we have assumed integral multiples of for r and the recursion (63) describes a relationships between two ’s with a difference of 1 in the subscript r. In the meantime, an IC with r an odd multiple of for one of the three group sets can be used also in another set across a border or when the border is an integer. Likewise, an IC with r an integer can be used across a border when the border is an odd multiple of : that is, two of the six IC’s are redundant. In other words, the number of elements for a complete set of IC’s is at most four: refer to Section 4.2.3 for more detail.
Specifically, we would first choose and . Next, if is an odd multiple of (equivalently, if p is an even integer), it suffices to choose and because one of and is 0 and the other is an odd multiple of . If is an integer, on the other hand, both and are integers: then, we could choose or as the remaining two IC’s, where ℏ denotes any odd multiple of . In short, a complete set of IC’s for the recursion (63) is
In the set , the IC’s and can be replaced by any element of the sets and , respectively. In addition, when is an integer and an odd multiple of , the IC can be replaced by any element of the sets and , respectively. Similarly, the IC can be replaced by any element of the sets and when is an integer and an odd multiple of , respectively.
4.2.2. Initial Conditions for the Recursion ( 64)
To obtain with a fixed value of via the recursion (64), let , , and . Denote by , , and the group sets of p. Following steps similar to those in Section 4.2.1, a complete set of IC’s for the recursion (64) is
where ⊙ denotes any even integer.
In the set , the IC’s and can be replaced by any element of the sets and , respectively. Similarly, the IC can be replaced by any element of the sets and when is an even and an odd integer, respectively. Likewise, the IC can be replaced by any element of the sets and when is an odd and an even integers, respectively. Note that .
4.2.3. Special Cases
Let us note that, although in effect contains only three elements because when , it will still be a set of a sufficient number of IC’s for solving the recursion (63). Similarly, when , the set will still be a complete set for solving the recursion (64) although it contains only three elements because .
Each of the sets for and for contains only two elements because and , respectively: the number two of IC’s will be insufficient for solving the recursions. Yet, when and when , the integral does not need to be calculated via recursions but can easily be obtained via direct evaluations as we have discussed already in Section 3.1 with details delineated in Appendices Appendix A.1 and Appendix A.2.
4.3. Evaluation of via the Recursion ( 63)
Now, with and , if we add
we get
for .
Now, note that , where
with the double factorial defined as
Some values of are shown in Table 1 for easy reference.
Then, for , we finally get from (71)
useful when calculating from the initial condition for , and
useful when calculating from the initial condition for . The two formulas (74) and (75) can be used when , , or , but not when r and s are in different group sets.
Let us now describe in detail how to obtain the integral for a fixed r based on (74) and (75). The procedures differ slightly depending on the value of or, equivalently, of p. First, when the set of IC’s is , , , , that is, when is an odd multiple of or equivalently when p is an even integer, use the initial condition in (74) for obtaining for ; use the initial condition in (75) for obtaining for ; use the initial condition in (74) for obtaining for ; and use the initial condition in (75) for obtaining for . In effect, as mentioned before indirectly, among the two sets and , one set is used when obtaining for r odd multiple of and the other set for r even multiple of .
On the other hand, when the set of IC’s is , , , or , , , , that is, when is an integer or equivalently when p is an odd integer, use the initial condition in (74) for obtaining for and the initial condition in (75) for obtaining for : these two steps are the same as those in the first case. The initial condition can next be used in (74) for obtaining for ; and also in (75) for obtaining for . In addition, we need to obtain for : for that goal, we may use the initial condition in (74) for obtaining for or use the initial condition in (75) for obtaining for . Table 2 summarizes how can be obtained when the value of p is fixed.
When , a result that is the same as (44) subject to an integral constant can be obtained based on (74) and (75) as shown in Appendix A.3.
Example 1.
Example 2.
4.4. Evaluation of via the Recursion ( 64)
Following steps similar to those leading to (74) and (75), with details provided in Appendix A.4, we can get
and
useful in the calculation of for with the initial condition when and , respectively, where
and
The two formulas (86) and (87) can be used when , , or , but not when p and s are in different group sets. After a discussion similar to that in Section 4.3, we will get Table 3 as the details on evaluating for a fixed value of r.
Example 3.
The result (A35) shown in Appendix A.5 for can be written as
where
and
Note that we have used in (93).
Example 4.
With (90), we can obtain , , , , , and , for instance.
We can also obtain and .
Example 5.
5. Conclusions
In this letter, by employing the well-known techniques, i.e., substitution (change of variables) and integration by parts, for integration, we have addressed the integral , where we have focused on the cases of integers for p and integral multiples of for r. The cases , , , and of the integral have first been obtained by direct calculations. For the remaining cases of the integral including the special case of , explicit formulas for the integral have been obtained via recursive formulas derived based on integration by parts: in these cases, the formulas obtained by direct calculations are used as the initial conditions. Detailed discussions on the issue of choosing the initial conditions have also been provided. Some of the explicit formulas of the integral are tabulated, and examples and applications of the results are also included.
Appendix A. Derivations of Formulas
Appendix A.1. the Case p = −1
First, the case has already been addressed in (45). When , we can use partial fraction expansion based on from (6) with or
from (18) with . In addition, the formula
from (14) with is more and less convenient than (A1) when r is even and odd, respectively, multiple of .
First, for , we have with from (A2). Thus,
For example, we get and .
Subsequently, for , we have with , , and from (A2). Thus, letting , we get or
For example, we get and : the latter result can alternatively be obtained as or
with from (A1): the last term of (A5) is equivalent to the last term of shown in (51) because .
When for , using that , we get or
from (A1). For example, when and when .
Subsequently, when for , using (A1) we get or
by replacing m and in (A6) with (from we get ) and , respectively. For example, we get when and when .
In passing, let us note that a result equivalent to (A8) can be obtained via (26) alternatively. For example, by using (26) recursively and recollecting (23), we have or
for . The term in (A9) can be expressed as , where : we have used that when the integers j and k satisfy [[16] Table 1.4] and that [[16] (1.E.22)]. In essence, (A9) is equivalent to the first line on the right-hand side (A8).
Appendix A.2. the Case r = −1
The cases , , and have been addressed in (9), (44), and (45), respectively. Let us next consider the remaining cases . First, recollect that or
and for . Then, for with , we have or
using (A10). Similarly, when with , we get or
with and . Note that, when or , we have . Thus, for example, from (A12) while it can also be expressed as , which can be derived as or
We also easily get or
Appendix A.3. the Case p = 1
When , with and , (74) and (75) can be expressed as or
for , and or
for , respectively. In addition, from and , we can choose the set , , , of IC’s.
Now, with , , and the initial condition from (43), we get or
for from (A19). With , , and the initial condition shown in (36), we get or
for from (A20).
Appendix A.4. Derivation of (86) and (87)
Appendix A.5. the Case
When , we get , , , , and . Let us choose the set , , , of IC’s.
First, from (86), with , , and shown in (19), we get or
for ; and with , , and shown in (8), we get
for .
Appendix A.6. the Case r = −2
When , we get , , , , and . We can choose the IC’s from1 (16), from (103), from (44), and from (83), where we have chosen 0 as ⊙.
References
- M. Abramowitz and I. A. Stegun (Ed.), Handbook of Mathematical Functions, Dover, 1972.
- F. Beukers, “Gauss’ hypergeometric function”, in Arithmetic and Geometry Around Hypergeometric Functions, Progress in Mathematics 260, Birkhäuser Verlag, Basel, pp. 23—42, 2007.
- K. N. Boyadzhiev, A binomial formula for evaluating integrals, arXiv preprint arXiv:2205.08618, 2022. (https://arxiv.org/abs/2205.08618).
- P. F. Byrd and M. D. Friedman, Handbook of Elliptic Integrals for Engineers and Scientists, 2nd ed. New York, NY, USA: Springer-Verlag, 1971.
- P. L. Chebyshev, “Sur l’intègration des diffèrentielles irrationnelles," Journal de Mathèmatiques Pures et Appliquées, vol. 18, pp. 87—111, 1853.
- M. W. Coffey, Integrals in Gradshteyn and Ryzhik: Hyperbolic and trigonometric function, arXiv preprint arXiv:1803.00632, 2018.
- K. O. Geddes, S. R. Czapor, and G. Labahn, Algorithms for Computer Algebra. Boston, MA, USA: Kluwer Academic Publishers, 1992.
- I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, Seventh Ed., Academic, 2007.
- A. Heck and W. Koepf, Introduction to Maple, New York, NY, USA: Springer, 1993.
- M. Y. Kalmykov, B. F. L. Ward, and S. Yost, “All order ε-expansion of Gauss hypergeometric functions with integer and half/integer values of parameters”, Journal of High Energy Physics, vol. 2007, no. 2, pp. 1–21, 2007.
- K. S. Kölbig, “Two infinite integrals of products of modified Bessel functions and powers of logarithms”, Journal of Computational and Applied Mathematics, vol. 62, no. 1, pp. 41–65, 1995.
- V. H. Moll, K. T. Kohl, and others, “The integrals in Gradshteyn and Ryzhik. Part 20: hypergeometric functions”, Scientia Series A: Mathematical Sciences, vol. 21, pp. 43–54, 2011.
- M. Morrison, C. Hastings, and K. Mischo, Hands-on Start to Wolfram Mathematica, Champaign, IL, USA: Wolfram Media, 2015.
- E. Panzer, Feynman integrals and hyperlogarithms, PhD thesis, Humboldt University of Berlin, 2015.
- E. Remiddi and J. A. M. Vermaseren, “Harmonic polylogarithms”, International Journal of Modern Physics A, vol. 15, no. 5, pp. 725–754, 2000.
- I. Song, S. R. Park, and S. Yoon, Probability and Random Variables: Theory and Applications, Springer, 2022.
- J. Stewart, D. K. Clegg, and S. Watson, Calculus: Early Transcendentals, 9th Ed., Cengage Learning, Independence, KY, 2020.
Figure 1.
The points on the five bold lines , , , , and , as well as those on the line , all have readily available formulas of .
Figure 1.
The points on the five bold lines , , , , and , as well as those on the line , all have readily available formulas of .

Table 1.
Some values of
| k | ⋯ | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 | ⋯ | |||||||||
| ⋯ | 945 | 384 | 105 | 48 | 15 | 8 | 3 | 2 | 1 | 1 | ⋯ |
Table 2.
Evaluation of for fixed p.
| Value of p | With IC | Via formula | Calculate for | |
| (74) | ||||
| (75) | ||||
| (75) | ||||
| (74) | ||||
| (74) | ||||
| (75) | ||||
| (74) | ||||
| (75) | ||||
| (75) | ||||
| (74) | ||||
| Among the last two sets of calculations, only one set is necessary | ||||
| Note: . . . any odd multiple of . | ||||
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. |
© 2026 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/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.