Preprint
Article

This version is not peer-reviewed.

Evaluation of a Subclass \( K_{p,r} =\int x^p \left ( 1+ x^2\right )^r dx \) of the Binomial Integral

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: 
;  ;  ;  ;  

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 x p a + b x n r d x 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
K p , r = x p 1 + x 2 r d x
is equivalent to a subclass of the binomial integrals x p a + b x n r d x for a b > 0 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 K 2 , 1 2 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 K p , r .
Despite the breadth of existing results [1,6,8], several limitations remain apparent in both pedagogical and research-oriented treatments of the integral K p , r . 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 ( p , r ) .
In this letter, we develop a unified analytical and recursive framework for the systematic evaluation of K p , r The approach in this letter is based on a detailed analysis of the parameter plane ( p , r ) . We identify five fundamental lines p = 1 , p = 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0 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 K p , r at any admissible point in the parameter plane while systematically bypassing the recursion barriers encountered, mostly on the line p + 2 r + 1 = 0 , in conventional approaches.
The main contributions of this work can be summarized as follows:
  • The parameter plane of ( p , r ) is systematically analyzed to provide a unified analytical framework for the categorization and derivation of K p , r . Five fundamental lines are identified upon which the integral K p , r 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 ( p , r ) .
  • 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 K p , r with Basic Techniques

In this section we first apply basic techniques of integral for the evaluation of the integral K p , r . Throughout the letter, except when necessary, integration constants are omitted for brevity.
It is simple to have K p , r = q = 0 r r q x p + 2 q d x or
K p , r = r r 1 I A 0 r r 1 ln | x | + q = 0 , q r 1 r r q x p + 2 q + 1 p + 2 q + 1
when p is an integer and r is a non-negative integer, where A 0 r = { 0 , 1 , , r } ,
r 1 = p + 1 2 ,
and I A ( x ) is the indicator function of x defined by I A ( x ) = 1 if x A and I A ( x ) = 0 if x A .

2.1. Evaluation via Substitution

We start with the most basic method for the evaluation of the integral K p , r .

2.1.1. Substitution 1

With x = tan θ , we have
K p , r = sin p θ cos p + 2 r + 2 θ d θ .
When p 1 2 is an integer, (4) can be rewritten as
K p , r = 1 v 2 p 1 2 v p + 2 r + 2 d v
with v = cos θ = 1 1 + x 2 . When p 1 2 is a non-positive integer, (5) can be expressed as
K p , r = v p 2 r 2 1 v p 1 2 1 + v p 1 2 d v ,
for which we can use partial fraction expansion if 2 r is an integer. On the other hand, (5) will produce the formula K p , r = q = 0 m m q v 2 q v ( 2 m + 2 r + 3 ) d v or
K p , r = q = 0 , q C 30 m ( 1 ) q m q 2 q C 30 1 + x 2 C 30 q + 1 2 C 31 ln 1 + x 2
when m = p 1 2 is a non-negative integer, where C 30 = m + r + 1 = 1 2 ( p + 2 r + 1 ) and C 31 = I A 0 m C 30 m C 30 ( 1 ) C 30 with A 0 m = { 0 , 1 , , m } .
When p = 0 , we get K 0 , r = d θ cos 2 r + 2 θ from (4). Thus, K 0 , 1 2 = d θ cos θ = ln | tan θ + sec θ | or
K 0 , 1 2 = ln x + 1 + x 2 ,
K 0 , 1 = d θ = θ or
K 0 , 1 = tan 1 x ,
and K 0 , 3 2 = cos θ d θ = sin θ or
K 0 , 3 2 = x 1 + x 2
for r = 1 2 , 1 , and 3 2 , respectively.
and C 31 = I { 0 } ( 0 ) 0 0 ( 1 ) 0 = 1 . Then we obtain K 1 , 1 = q = 0 , q 0 0 ( 1 ) q 0 q 2 q 0 1 + x 2 0 q + 1 2 ln 1 + x 2 or
K 1 , 1 = 1 2 ln 1 + x 2
from (7). Similarly, we get K 1 , 1 = q = 0 , q 2 0 ( 1 ) q 0 q 2 q 2 1 + x 2 2 q or
K 1 , 1 = 1 4 1 + x 2 2
from (7) for ( p , r ) = ( 1 , 1 ) with m = p 1 2 = 0 , C 30 = m + r + 1 = 2 , and C 31 = 0 from I { 0 } ( 2 ) = 0 .
When ( p , r ) = ( 1 , 1 ) , we get 2 m + 2 r + 3 = 1 , and thus K 1 , 1 = v d v 1 v 2 = 1 2 1 v + 1 2 1 + v d v = 1 2 ln | 1 v | + 1 2 ln | 1 + v | or
K 1 , 1 = 1 2 ln x 2 1 + x 2
using (6) by noting that v = cos θ = 1 1 + x 2 .

2.1.2. Substitution 2

With 1 + x 2 = t , we get
K p , r = 1 2 ( t 1 ) p 1 2 t r d t ,
which will produce the formula K p , r = 1 2 q = 0 m m q ( 1 ) m q t q + r d t or
K p , r = C 22 ln 1 + x 2 + 1 2 q = 0 , q C 20 m ( 1 ) m q m q q C 20 1 + x 2 q C 20
when m = p 1 2 is a non-negative integer, where C 22 = 1 2 I A 0 m C 20 m C 20 ( 1 ) m C 20 and C 20 = r 1 .
We get K 3 , 2 = 1 2 t 1 t 2 d t = 1 2 1 t 1 t 2 d t : that is,
K 3 , 2 = 1 2 ln 1 + x 2 + 1 1 + x 2
from (14) or (15).
When ( p , r ) = ( 1 , 1 ) , we get m = p 1 2 = 0 , C 20 = r 1 = 0 , C 22 = 1 2 I { 0 } ( 0 ) 0 0 ( 1 ) 0 = 1 2 , and thus, as obtained already in (11) also, K 1 , 1 = 1 2 ln 1 + x 2 from (15).
When ( p , r ) = ( 1 , 1 ) , we get m = p 1 2 = 0 , C 20 = r 1 = 2 , and C 22 = 0 because I { 0 } ( 2 ) = 0 . Then, from (15), we have K 1 , 1 = 1 2 q = 0 0 ( 1 ) 0 q 0 q q ( 2 ) 1 + x 2 q ( 2 ) = 1 4 1 + x 2 2 as in (12).

2.1.3. Substitution 3

With 1 + x 2 = t , we get
K p , r = t 2 1 p 1 2 t 2 r + 1 d t ,
similar to the second method but more useful especially when r is an integral multiple of 1 2 . When m = p 1 2 is a non-negative integer, (17) will produce (15) again. On the other hand, when p 1 2 is a non-positive integer, (17) can be expressed as
K p , r = t 2 r + 1 t 2 1 p 1 2 d t ,
and subsequently evaluated via partial fraction expansion if 2 r + 1 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 2 r + 1 is an integer thus including the case where r is an integer.
From (17) with ( p , r ) = 1 , 1 2 , we get K 1 , 1 2 = d t = t or
K 1 , 1 2 = 1 + x 2 .
We get K 1 , 1 2 = d t t 2 1 = 1 2 t 1 + 1 2 t + 1 d t or
K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1
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 K p . r .

2.2.1. Integration by Parts 1

When p 1 , with u = x p , v = 1 + x 2 r , u = x p + 1 p + 1 , and v = 2 r x 1 + x 2 r 1 , we get
K p , r = x p + 1 1 + x 2 r p + 1 2 r p + 1 x p + 2 1 + x 2 r 1 d x .
Letting r = 0 in (21), we get the result K p , 0 = x p d x or
K p , 0 = x p + 1 p + 1
for p 1 . Obviously, K 1 , 0 = d x x or
K 1 , 0 = ln | x | .
Next, (21) can be rewritten as
K p , r = x p + 1 p + 1 1 + x 2 r 2 r p + 1 1 + x 2 1 x p 1 + x 2 r 1 d x = x p + 1 p + 1 1 + x 2 r 2 r p + 1 K p , r + 2 r p + 1 K p , r 1 ,
from which we get the following two results.
First, when 2 r p + 1 1 , we get 1 + 2 r p + 1 K p , r = x p + 1 1 + x 2 r p + 1 + 2 r p + 1 K p , r 1 , which can be expressed as
K p , r = x p + 1 1 + x 2 r p + 2 r + 1 + 2 r p + 2 r + 1 K p , r 1
for p + 2 r + 1 0 and p 1 . When r = 0 , (25) is the same as (22). Although we assumed p 1 from the starting point of (21), note that (25) holds even for p = 1 , producing
K 1 , r = 1 2 r 1 + x 2 r + K 1 , r 1
for r 0 . The recursion (26) can of course be obtained alternatively as K 1 , r = 1 x 1 + x 2 r d x = 1 + x 2 1 x 1 + x 2 r 1 d x = x 1 + x 2 r 1 + 1 x 1 + x 2 r 1 d x = K 1 , r 1 + K 1 , r 1 = 1 2 r 1 + x 2 r + K 1 , r 1 , where K 1 , r 1 = x 1 + x 2 r 1 d x = 1 2 r 1 + x 2 r is used.
On the other hand, when 2 r p + 1 = 1 in (24), we get 0 = x p + 1 1 + x 2 r p + 1 + 2 r p + 1 K p , r 1 or
K p , p + 3 2 = x p + 1 p + 1 1 + x 2 p + 1 2
for p 1 .
When p = 0 and r = 1 2 , we get K 0 , 1 2 = x 1 + x 2 + K 2 , 3 2 from (21). Thus, K 2 , 3 2 = K 0 , 1 2 x 1 + x 2 or
K 2 , 3 2 = ln x + 1 + x 2 x 1 + x 2
using the results K 0 , 1 2 = ln x + 1 + x 2 shown in (8).
From (25), we have K 2 , 1 2 = x 3 2 1 + x 2 1 2 K 2 , 3 2 or
K 2 , 1 2 = x 3 + x 2 1 + x 2 1 2 ln x + 1 + x 2
with (28) and subsequently K 2 , 1 2 = x 3 4 1 + x 2 + 1 4 K 2 , 1 2 or
K 2 , 1 2 = 2 x 5 + 3 x 3 + x 8 1 + x 2 1 8 ln x + 1 + x 2
with (29).
When r = 1 , we easily have K 1 , 1 = x 1 + x d x = ln | x | + x 2 2 and K 3 , 1 = x 1 + x 3 d x = ln | x | 1 2 x 2 for p = 1 and p = 3 , respectively. Then, collecting the results (22) and K p , 1 = x p + 1 1 + x 2 p + 3 + 2 x p + 1 ( p + 1 ) ( p + 3 ) = x p + 1 p + 1 + x p + 3 p + 3 from (25), we have
K p , 1 = ln | x | + x 2 ( p + 2 ) 2 ( p + 2 ) , p = 1 , 3 , x p + 1 p + 1 + x p + 3 p + 3 , p 1 , 3 ,
which is the same as that we would obtain from the direct evaluation of x p 1 + x 2 d x apparently.
For p = , 3 , 2 , 1 , 0 , 1 , , we get
K 3 , 0 = x 2 2 1 + x 2 ,
K 2 , 1 2 = x 1 1 + x 2 1 2 ,
{ K 1 , 1 = 1 2 ln x 2 1 + x 2 }
K 0 , 3 2 = x 1 + x 2 1 2 ,
K 1 , 2 = x 2 2 1 + x 2 1 ,
from (27): note that (34), not obtained from (27) but shown in (13), is also included for easy reference, comparison, and convenience.

2.2.2. Integration by Parts 2

When r 1 , with u = x p 1 , v = x 1 + x 2 r , u = ( p 1 ) x p 2 , and v = 1 + x 2 r + 1 2 ( r + 1 ) , we get
K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) x p 2 1 + x 2 r + 1 d x .
If p = 1 , we easily get
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r 1 from (37): for r = 1 , recollect K 1 , 1 = 1 2 ln 1 + x 2 shown in (11).
Subsequently, (37) can be expressed as
K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) 1 + x 2 x p 2 1 + x 2 r d x = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p , r p 1 2 ( r + 1 ) K p 2 , r ,
which can be used to obtain the following two results.
First, when p 1 2 ( r + 1 ) 1 and r 1 , we get 1 + p 1 2 ( r + 1 ) K p , r = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p 2 , r , or
K p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1 p 1 p + 2 r + 1 K p 2 , r
for p + 2 r + 1 0 and r 1 . When p = 1 , (40) is the same as (38). In (37), we have assumed r 1 : yet, producing
K p , 1 = x p 1 p 1 K p 2 , 1 ,
(40) holds true even for r = 1 . The result (41) can also be shown in an alternative way as K p , 1 = x p 1 + x 2 d x = x p 2 + x p x p 2 1 + x 2 d x = x p 2 1 + x 2 1 + x 2 x p 2 1 + x 2 d x = K p 2 , 0 K p 2 , 1 = x p 1 p 1 K p 2 , 1 with K p 2 , 0 = x p 1 p 1 from (22).
Secondly, when p 1 2 ( r + 1 ) = 1 and r 1 , we get 0 = x p 1 2 ( r + 1 ) 1 + x 2 r + 1 p 1 2 ( r + 1 ) K p 2 , r or equivalently K p 2 , p + 1 2 = x p 1 p 1 1 + x 2 p 1 2 for p 1 : this result is the same as (27) when p is replaced with p + 2 .
We have K 0 , 3 2 = 1 2 x 1 + x 2 1 2 K 2 , 3 2 from (40), and thus K 2 , 3 2 = 1 x 1 + x 2 2 K 0 , 3 2 or
K 2 , 3 2 = 2 x 2 + 1 x 1 + x 2
with K 0 , 3 2 = x 1 + x 2 shown in (10).

3. Explicit Formulas from Direct Evaluation

Let us now consider the main problem of obtaining the explicit formulas of the integral K p , r for p an integer and r an integral multiple of 1 2 in this and following sections. We first consider the cases for which direct evaluation is possible.
In the following developments, a = b c and a = b c denote the product and sum, respectively, for a = b , b + 1 , b + 2 , , c even when b is not an integer. We also let a = b c g ( a ) = 0 and a = b c h ( a ) = 1 if c < b . Here, ( p , r ) denotes a point on the pr plane for p integer and r an integral multiple of 1 2 , and often represents K p , r also.

3.1. The Cases p = ± 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0

For r = 0 , from (22) and (23), we easily get
K p , 0 = ln | x | , p = 1 , x p + 1 p + 1 , p 1 .
Next, by combining the results shown in (11) and (38), we have
K 1 , r = 1 2 ln 1 + x 2 , r = 1 , 1 + x 2 r + 1 2 ( r + 1 ) , r 1
for p = 1 . Similarly, collecting the results shown in (13) and (27), we have
K p , p + 3 2 = 1 2 ln x 2 1 + x 2 , p = 1 , x p + 1 p + 1 1 + x 2 p + 1 2 , p 1
for p + 2 r + 3 = 0 .
Next, for p = 1 , the result (A8) shown in Appendix A.1 can be expressed as
K 1 , r = 1 2 ln v r ( x ) + k = 1 h 2 r + 1 h 2 r + 1 k v r k ( x ) k , r = 0 , ± 1 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 h 2 r + 1 1 2 1 + x 2 k 2 r + 1 s r k 2 r + 1 , r = ± 1 2 , ± 3 2 ,
after some steps. Here,
h y = 1 2 | y | 1 2 ,
k y = h y k ,
and
v y ( x ) = x 2 , y = 0 , 1 , , x 2 1 + x 2 , y = 1 , 2 ,
with
s y = 1 , y 0 , 1 , y < 0
the sign of y: note that we have chosen s 0 = 1 , not s 0 = 0 . From (46), we get K 1 , 2 = 1 2 ln v 2 ( x ) + 1 2 v 2 ( x ) or
K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 1 + x 2 ,
for instance.
Similarly, when r = 1 , the result (A17) for K p , 1 shown in Appendix A.2 can be equivalently expressed as
K p , 1 = s p ( 1 ) h p + 1 2 2 2 tan 1 x s p + k = 1 h p + 1 2 ( 1 ) k p 1 2 k p + 1 x 2 ( k p + 1 ) s p , p = 0 , ± 2 , ± 4 , s p ( 1 ) h p 2 ln 1 + x 2 s p + k = 1 h p ( 1 ) k k h p k 1 + x 2 s p k , p = ± 1 , ± 3 , .

3.2. Discussion

For every point on the five lines r = 0 , p = 1 , p = 1 , r = 1 , and p + 2 r + 3 = 0 , the integral K p , r now has readily available formula. The formulas can be used also as the initial conditions (IC’s) in obtaining the formulas K p , r 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 K p , r .

4. Evaluation via Recursions

For the points not on the five lines r = 0 , p = 1 , p = 1 , r = 1 , and p + 2 r + 3 = 0 , 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 K p , r When p + 2 r + 1 = 0

If { p + 2 r + 1 = 0 } { p = 1 } , we easily get K 1 , 0 = 1 x d x = ln | x | as discussed in (23) also. For { p + 2 r + 1 = 0 } { p 1 } , we can obtain K p , p + 1 2 from K p + 2 , p + 3 2 or vise versa for p = 0 , ± 1 , ± 2 , , with the recursion
K p , p + 1 2 = x p + 1 1 + x 2 p + 1 2 p + 1 + K p + 2 , p + 3 2 ,
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 K p , r ’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 K 1 , 0 from K 1 , 1 nor K 1 , 1 from K 1 , 0 can be obtained when p = 1 ) caused by the factors p + 1 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 K 1 , 1 , K 0 , 1 2 , K 1 , 0 , of which the first, second, and third elements can be replaced by any element from K 2 m 1 , m : m = 1 , 2 , , K 2 m , m 1 2 : m = 0 , ± 1 , ± 2 , , and K 2 m 1 , m : m = 0 , 1 , 2 , , respectively.
Now, by adding
K p , p + 1 2 = x p + 1 1 + x 2 p + 1 2 p + 1 + K p + 2 , p + 3 2 ,
K p + 2 , p + 3 2 = x p + 3 1 + x 2 p + 3 2 p + 3 + K p + 4 , p + 5 2 ,
K s 2 , s 1 2 = x s 1 1 + x 2 s 1 2 s 1 + K s , s + 1 2 ,
obtained from (53), we get
K p , p + 1 2 = K s , s + 1 2 + k = p : 2 s 2 x k + 1 1 + x 2 k + 1 2 k + 1
for s = p + 2 m with m a positive integer, where ‘ k = p : 2 ’ denotes ‘ k = p , p + 2 , ’. It is easy to see that the result (57) can also be used for s = p + 2 m with m a negative integer after an interchange of the subscripts p and s. Subsequently, the IC’s K 0 , 1 2 = ln x + 1 + x 2 , K 1 , 1 = 1 2 ln 1 + x 2 , and K 1 , 0 = ln | x | shown in (8), (11), and (23), respectively, can be used to obtain K p , p + 1 2 recursively for p = ± 2 , ± 4 , , for p = 3 , 5 , , and for p = 3 , 5 , , respectively. More specifically, we will eventuslly get
K p , r 1 = v p , r 1 ( x ) + k = L p , r 1 : 2 U p , r 1 w p , r 1 , k ( x ) ,
where r 1 = p + 1 2 as defined in (3),
L p , r 1 = 0 , p = 0 , 2 , , 1 , p = 1 , 3 , , p , p = 1 , 2 ,
denotes the lower bound of the summation on the right-hand side of (58),
U p , r 1 = p 2 , p = 1 , 2 , , 3 , p = 1 , 3 , , 2 , p = 0 , 2 , 4 ,
denotes the upper bound of the summation on the right-hand side of (58),
v p , r 1 ( x ) = ln 1 + x 2 , p = 1 , 3 , , ln | x | , p = 1 , 3 , , ln x + 1 + x 2 , p = 0 , ± 2 , ± 4 , ,
and
w p , r 1 , k ( x ) = s p k + 1 x k + 1 1 + x 2 k + 1 2 .
We get K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 , K 5 , 3 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 x 4 4 1 + x 2 2 , K 2 , 3 2 = ln x + 1 + x 2 x 1 + x 2 , and K 2 , 1 2 = ln | x + 1 + x 2 | 1 + x 2 x from (58). Similarly, we get K 3 , 1 = ln | x | 1 + x 2 2 x 2 and K 5 , 3 = ln | x | 1 + x 2 2 x 2 1 + x 2 2 4 x 4 .

4.2. Other Points of ( p , r )

When p is fixed, to obtain K p , r from K p , r 1 or vice versa for r = 0 , ± 1 2 , ± 1 , . . . , we can use
K p , r = x p + 1 1 + x 2 r p + 2 r + 1 + 2 r p + 2 r + 1 K p , r 1
shown in (25) under the condition p + 2 r + 1 0 . Next, when r is fixed, to obtain K p , r from K p 2 , r or vise versa for p = 0 , ± 1 , ± 2 , . . . , we can use
K p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1 p 1 p + 2 r + 1 K p 2 , r
shown in (40) under the condition p + 2 r + 1 0 .
Clearly, when using the two recursions (63) and (64), it is natural to employ the known formulas of the points on the six lines r = 0 , p = 1 , p = 1 , r = 1 , p + 2 r + 3 = 0 , and p + 2 r + 1 = 0 as the IC’s. From Figure 1, it is observed that there now exist four (if p = , 5 , 4 , 2 , 0 , 2 , 3 , ) and three (if p = 3 ) formulas of K p , r readily available as the candidates of the IC’s when using (63) for p fixed. Similarly, when using (64) for r fixed, four (if r = , 3 , 5 2 , 3 2 , 1 2 , 1 2 , 1 , 3 2 , ) and three (if r = 2 ) formulas of K p , r are readily available as the candidates of the IC’s.

4.2.1. Initial Conditions for the Recursion ( 63)

To obtain K p , r with a fixed value of p 1 via the recursion (63), let r 1 = p + 1 2 as in (3), r L = min r 1 , 0 , and r U = max r 1 , 0 . The recursion (63) implies that K p , r can be obtained from K p , r 1 and vice versa in general: however, when r = 0 and when r = r 1 , neither K p , r from K p , r 1 nor K p , r 1 from K p , r can be obtained. Based on this observation, we divide the points ( p , r ) into three groups such that r G p , L , r G p , B , and r G p , U , where G p , L = , r L 1 2 , G p , B = r L , r U 1 2 , and G p , U = r U , 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 1 2 for r and the recursion (63) describes a relationships between two K p , r ’s with a difference of 1 in the subscript r. In the meantime, an IC K p , r with r an odd multiple of 1 2 for one of the three group sets can be used also in another set across a border r = r L or r = r U when the border is an integer. Likewise, an IC K p , r with r an integer can be used across a border when the border is an odd multiple of 1 2 : 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 K p , r U and K p , r L 1 . Next, if r 1 is an odd multiple of 1 2 (equivalently, if p is an even integer), it suffices to choose K p , r U 1 and K p , r L because one of r L and r U is 0 and the other is an odd multiple of 1 2 . If r 1 is an integer, on the other hand, both r L and r U are integers: then, we could choose K p , r U 1 , K p , or K p , r L , K p , as the remaining two IC’s, where denotes any odd multiple of 1 2 . In short, a complete set of IC’s for the recursion (63) is
I 1 , p = K p , r U , K p , r L 1 , K p , r U 1 , K p , r L , if   p   is   an   even   integer , K p , r U , K p , r L 1 , K p , , K p , r L o r K p , r U , K p , r L 1 , K p , r U 1 , K p , , if   p   is   an   odd   integer ,
In the set I 1 , p , the IC’s K p , r U and K p , r L 1 can be replaced by any element of the sets K p , r U + m m = 0 and K p , r L m m = 1 , respectively. In addition, when r 1 is an integer and an odd multiple of 1 2 , the IC K p , r U 1 can be replaced by any element of the sets K p , r U m m = 1 r U r L and K p , r U m m = 1 , respectively. Similarly, the IC K p , r L can be replaced by any element of the sets K p , r L + m m = 0 r U r L 1 and K p , r L + m m = 0 when r 1 is an integer and an odd multiple of 1 2 , respectively.

4.2.2. Initial Conditions for the Recursion ( 64)

To obtain K p , r with a fixed value of r 1 via the recursion (64), let p 1 = 2 r 1 , p L = min p 1 , 1 , and p U = max p 1 , 1 . Denote by G L , r = , p L 1 , G B , r = p L , p U 1 , and G U , r = p U , 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
I 2 , r = K p U , r , K p L 2 , r , K p U 2 , r , K p L , r , if   r   is   an   odd   multiple   of   1 2 , K p U , r , K p L 2 , r , K , r , K p L , r o r K p U , r , K p L 2 , r , K p U 2 , r , K , r , if   r   is   an   integer ,
where ⊙ denotes any even integer.
In the set I 2 , r , the IC’s K p U , r and K p L 2 , r can be replaced by any element of the sets K p U + 2 m , r m = 0 and K p L 2 m , r m = 1 , respectively. Similarly, the IC K p U 2 , r can be replaced by any element of the sets K p U 2 m , r m = 1 and K p U 2 m , r m = 1 1 2 p U p L when p 1 is an even and an odd integer, respectively. Likewise, the IC K p L , r can be replaced by any element of the sets K p L + 2 m , r m = 0 1 2 p U p L 1 and K p L + 2 m , r m = 0 when p 1 is an odd and an even integers, respectively. Note that 1 2 p U p L = 1 2 p 1 1 = | r + 1 | .

4.2.3. Special Cases

Let us note that, although I 1 , 3 in effect contains only three elements because r L = r U 1 when p = 3 , it will still be a set of a sufficient number of IC’s for solving the recursion (63). Similarly, when r = 2 , the set I 2 , 2 will still be a complete set for solving the recursion (64) although it contains only three elements because p L = p U 2 .
Each of the sets I 1 , 1 for p = 1 and I 2 , 1 for r = 1 contains only two elements because r L = r U = 0 and p L = p U = 1 , respectively: the number two of IC’s will be insufficient for solving the recursions. Yet, when p = 1 and when r = 1 , the integral K p , r 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 K p , r via the Recursion ( 63)

Now, with a p , r = x p + 1 1 + x 2 r p + 2 r + 1 and b p , r = 2 r p + 2 r + 1 , if we add
K p , r = a p , r + b p , r K p , r 1
b p , r K p , r 1 = b p , r a p , r 1 + b p , r b p , r 1 K p , r 2
b p , r b p , r 1 K p , r 2 = b p , r b p , r 1 a p , r 2 + b p , r b p , r 1 b p , r 2 K p , r 3
K p , s + 1 m = s + 2 r b p , m = a p , s + 1 m = s + 2 r b p , m + K p , s m = s + 1 r b p , m
we get
K p , r = k = s + 1 r a p , k m = k + 1 r b p , m + K p , s m = s + 1 r b p , m
for r > s .
Now, note that m = k + 1 r b p , m = 2 k + 2 p + 2 k + 3 2 k + 4 p + 2 k + 5 2 r p + 2 r + 1 = ( 2 r ) ! ! ( p + 2 k + 1 ) ! ! ( p + 2 r + 1 ) ! ! ( 2 k ) ! ! = S ( p , r ) S ( p , k ) , where
S ( a , b ) = ( 2 b ) ! ! ( a + 2 b + 1 ) ! !
with the double factorial defined as
k ! ! = 1 , i f k = 2 , 1 , i f k = 1 , 0 , k ( k 2 ) ! ! , i f k = 1 , 2 , , ( k + 2 ) ! ! k + 2 , i f k = 3 , 4 , .
Some values of k ! ! are shown in Table 1 for easy reference.
Then, for p 1 , we finally get from (71)
K p , r = S ( p , r ) K p , s S ( p , s ) + k = s + 1 r a p , k S ( p , k )
useful when calculating K p , r from the initial condition K p , s for s < r , and
K p , r = S ( p , r ) K p , s S ( p , s ) k = r + 1 s a p , k S ( p , k )
useful when calculating K p , r from the initial condition K p , s for s > r . The two formulas (74) and (75) can be used when { r , s } G p , L , { r , s } G p , B , or { r , s } G p , U , but not when r and s are in different group sets.
Let us now describe in detail how to obtain the integral K p , r for a fixed r based on (74) and (75). The procedures differ slightly depending on the value of r 1 or, equivalently, of p. First, when the set of IC’s is { K p , r U , K p , r U 1 , K p , r L , K p , r L 1 } , that is, when r 1 is an odd multiple of 1 2 or equivalently when p is an even integer, use the initial condition K p , r U in (74) for obtaining K p , r for r = r U + 1 , r U + 2 , ; use the initial condition K p , r L 1 in (75) for obtaining K p , r for r = r L 2 , r L 3 , ; use the initial condition K p , r L in (74) for obtaining K p , r for r = r L + 1 , r L + 2 , ; and use the initial condition K p , r U 1 in (75) for obtaining K p , r for r = r U 2 , r U 3 , . In effect, as mentioned before indirectly, among the two sets K p , r U , K p , r U 1 and K p , r L , K p , r L 1 , one set is used when obtaining K p , r for r odd multiple of 1 2 and the other set for r even multiple of 1 2 .
On the other hand, when the set of IC’s is { K p , r U , K p , r U 1 , K p , r L , K p , } or { K p , r U , K p , r U 1 , K p , r L 1 , K p , } , that is, when r 1 is an integer or equivalently when p is an odd integer, use the initial condition K p , r U in (74) for obtaining K p , r for r = r U + 1 , r U + 2 , and the initial condition K p , r L 1 in (75) for obtaining K p , r for r = r L 2 , r L 3 , : these two steps are the same as those in the first case. The initial condition K p , K p , can next be used in (74) for obtaining K p , r for r = + 1 , + 2 , ; and also in (75) for obtaining K p , r for r = 1 , 2 , . In addition, we need to obtain K p , r for r = r L , r L + 1 , , r U 1 : for that goal, we may use the initial condition K p , r L in (74) for obtaining K p , r for r = r L + 1 , r L + 2 , , r U 1 or use the initial condition K p , r U 1 in (75) for obtaining K p , r for r = r U 2 , r U 3 , , r L . Table 2 summarizes how K p , r can be obtained when the value of p is fixed.
When p = 1 , 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.
When p = 0 , we can obtain { K 0 , r : r = 1 , 2, }, { K 0 , r : r = 1 2 , 3 2 , } , K 0 , r : r = 2 , 3 , , and K 0 , r : r = 5 2 , 7 2 , with the IC’s K 0 , 0 = d x = x , K 0 , 1 2 = ln x + 1 + x 2 from (8), K 0 , 1 = tan 1 x from (9), and K 0 , 3 2 = x 1 + x 2 from (10), respectively. Specifically, we can get
K 0 , r = ( 2 r ) ! ! ( 2 r + 1 ) ! ! v 0 , r ( x ) + k = L 0 , r U 0 , r w 0 , r , k ( x ) ,
where
L 0 , r = 1 , r = 1 , 2 , , 1 2 , r = 1 2 , 3 2 , , r + 1 , r = 0 , 1 2 , 1 , 3 2 , ,
U 0 , r = 1 , r = 1 , 2 , 3 2 , r = 1 2 , 3 2 , , r , r = 0 , 1 2 , 1 , 3 2 , ,
v 0 , r ( x ) = x , r = 0 , 1 , , tan 1 x , r = 1 , 2 , , ln x + 1 + x 2 , r = 1 2 , 1 2 , , x 1 + x 2 , r = 3 2 , 5 2 , ,
and
w 0 , r , k ( x ) = s r ( 2 k 1 ) ! ! ( 2 k ) ! ! x 1 + x 2 k
after some steps by noting that S ( 0 , b ) = ( 2 b ) ! ! ( 2 b + 1 ) ! ! .
Example 2.
It is easy to see that K 0 , 1 = 2 ! ! 3 ! ! 1 + 1 ! ! 2 ! ! 1 + x 2 x or
K 0 , 1 = x 3 3 + x 2 ,
K 0 , 1 2 = 1 ! ! 2 ! ! ln x + 1 + x 2 + 0 ! ! 1 ! ! x 1 + x 2 1 2 or
K 0 , 1 2 = 1 2 x 1 + x 2 + ln x + 1 + x 2 ,
K 0 , 2 = ( 4 ) ! ! ( 3 ) ! ! tan 1 x ( 3 ) ! ! ( 2 ) ! ! x 1 + x 2 1 or
K 0 , 2 = 1 2 tan 1 x + x 1 + x 2 ,
K 0 , 3 2 = 3 ! ! 4 ! ! ln x + 1 + x 2 + 0 ! ! 1 ! ! x 1 + x 2 1 2 + 2 ! ! 3 ! ! x 1 + x 2 3 2 = 1 8 2 x 3 + 5 x 1 + x 2 + 3 ln x + 1 + x 2 ,
and K 0 , 5 2 = ( 5 ) ! ! ( 4 ) ! ! ( 2 ) ! ! ( 3 ) ! ! x 1 1 + x 2 + 1 2 1 + x 2 3 2 or
K 0 , 5 2 = 2 x 2 + 3 x 3 1 + x 2 3 2
based on (76).

4.4. Evaluation of K p , r via the Recursion ( 64)

Following steps similar to those leading to (74) and (75), with details provided in Appendix A.4, we can get
K p , r = T ( p , r ) ( 1 ) p s 2 K s , r T ( s , r ) + k = s + 2 : 2 p ( 1 ) p k 2 c k , r T ( k , r )
and
K p , r = T ( p , r ) ( 1 ) p s 2 K s , r T ( s , r ) k = p + 2 : 2 s ( 1 ) p k 2 c k , r T ( k , r )
useful in the calculation of K p , r p = 0 , ± 1 , ± 2 , for r 1 with the initial condition K s , r when s < p and s > p , respectively, where
c p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1
and
T ( a , b ) = ( a 1 ) ! ! ( a + 2 b + 1 ) ! ! .
The two formulas (86) and (87) can be used when { p , s } G L , r , { p , s } G B , r , or { p , s } G U , r , 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 K p , r for a fixed value of r.
Example 3.
The result (A35) shown in Appendix A.5 for r = 1 2 can be written as
K p , 1 2 = s p ( p 1 ) ! ! p ! ! v p , 1 2 ( x ) + k = L p , 1 2 : 2 U p , 1 2 w p , 1 2 , k ( x ) ,
where
L p , 1 2 = 2 , p = 0 , 2 , , 3 , p = 1 , 3 , , p + 2 , p = 1 , 2 , ,
U p , 1 2 = p , p = 0 , 1 , , 1 , p = 1 , 3 , , 2 , p = 2 , 4 , ,
v p , 1 2 ( x ) = ( 1 ) p 2 ln x + 1 + x 2 , p = 0 , 2 , , ( 1 ) p 1 2 1 + x 2 , p = 1 , 3 , , ( 1 ) p 2 ln 1 + x 2 1 | x | , p = 1 , 3 , , ( 1 ) p + 2 2 1 + x 2 x , p = 2 , 4 , ,
and
w p , 1 2 , k ( x ) = ( k 2 ) ! ! ( 1 ) p k 2 ( k 1 ) ! ! x k 1 1 + x 2 .
Note that we have used 1 2 ln 1 + x 2 1 1 + x 2 + 1 = ln 1 + x 2 1 | x | in (93).
Example 4.
With (90), we can obtain K 3 , 1 2 = 1 3 x 2 2 1 + x 2 , K 5 , 1 2 = 1 15 3 x 4 4 x 2 + 8 1 + x 2 , K 2 , 1 2 = 1 2 ln x + 1 + x 2 + x 2 1 + x 2 , K 4 , 1 2 = 3 8 ln x + 1 + x 2 + x 8 2 x 2 3 1 + x 2 , K 4 , 1 2 = 1 + x 2 x ( 5 ) ! ! ( 4 ) ! ! ( 1 ) 2 2 1 + ( 1 ) 2 2 2 ( 4 ) ! ! ( 3 ) ! ! x 2 = 1 + x 2 3 x 3 2 x 2 1 , and K 6 , 1 2 = 1 + x 2 15 x 5 8 x 4 4 x 2 + 3 , for instance.
We can also obtain K 3 , 1 2 = ( 4 ) ! ! ( 3 ) ! ! 1 ( 1 ) 3 + 1 2 1 2 ln 1 + x 2 1 1 + x 2 + 1 ( 1 ) 1 + 1 2 ( 3 ) ! ! ( 2 ) ! ! 1 + x 2 x 2 = 1 4 ln 1 + x 2 1 1 + x 2 + 1 1 + x 2 2 x 2 and K 5 , 1 2 = ( 6 ) ! ! ( 5 ) ! ! ( 1 ) 5 + 1 2 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 ( 1 ) 1 + 1 2 ( 3 ) ! ! ( 2 ) ! ! x 2 + ( 1 ) 1 + 3 2 ( 5 ) ! ! ( 4 ) ! ! x 4 = 3 16 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 8 x 4 3 x 2 2 .
Example 5.
The result (A40) shown in Appendix A.6 for r = 2 can be expressed as
K p , 2 = s p v p , 2 ( x ) + k = L p , 2 : 2 U p , 2 w p , 2 , k ( x ) ,
where
L p , 2 = 2 , p = 0 , 2 , , 5 , p = 1 , 3 , , p + 2 , p = 1 , 2 , ,
U p , 2 = 0 , p = 0 , 2 , 4 , , 1 , p = 1 , 3 , , p , p = 1 , 2 , ,
v p , 2 ( x ) = 1 2 1 + x 2 , p = 1 , ( 1 ) p + 2 2 p 1 2 tan 1 x + x 1 + x 2 , p = 0 , ± 2 , , s p ( 1 ) p + 1 2 p 1 4 ln 1 + x 2 s p | x | s p 1 x 2 1 + x 2 , p = 1 , ± 3 , ± 5 , ,
and
w p , 2 , k ( x ) = ( 1 ) p k 2 s p ( k 1 ) ( k 3 ) x k 1 1 + x 2 .
Thus, for instance, we have
K 5 , 2 = ln 1 + x 2 + x 2 1 + x 2 + x 4 2 1 + x 2
when p = 5 from (95) or (A36),
K 3 , 2 = ln x 2 1 + x 2 + x 2 1 + x 2 1 2 x 2 1 + x 2
when p = 3 from (95) or (A37),
K 2 , 2 = 1 2 tan 1 x x 1 + x 2
when p = 2 from (95) or (A38), and
K 2 , 2 = 3 2 tan 1 x 3 x 2 + 2 2 x 1 + x 2
when p = 2 from (95) or (A39).
Table 4 shows some explicit formulas of K p , r = x p 1 + x 2 r d x that have been obtained by the steps described in Section 2, Section 3 and Section 4.

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 K p , r = x p 1 + x 2 r d x , where we have focused on the cases of integers for p and integral multiples of 1 2 for r. The cases p = ± 1 , r = 0 , r = 1 , and p + 2 r + 3 = 0 of the integral have first been obtained by direct calculations. For the remaining cases of the integral including the special case of p + 2 r + 1 = 0 , 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 ( p , r ) = ( 1 , 1 ) has already been addressed in (45). When { p = 1 } { r 1 } , we can use partial fraction expansion based on K 1 , r = v 2 r 1 d v 1 v 1 + v from (6) with v = 1 1 + x 2 or
K 1 , r = t 2 r + 1 t 2 1 d t
from (18) with t = 1 + x 2 . In addition, the formula
K 1 , r = 1 2 t r t 1 d t
from (14) with t = 1 + x 2 is more and less convenient than (A1) when r is even and odd, respectively, multiple of 1 2 .
First, for r = 0 , 1 , , we have K 1 , r = 1 2 t r t 1 d t = 1 2 ( v + 1 ) r d v v = 1 2 k = 0 r r k v k 1 d v with v = t 1 = x 2 from (A2). Thus,
K 1 , r = ln | x | + k = 1 r r k 2 k x 2 k .
For example, we get K 1 , 0 = ln | x | and K 1 , 1 = ln | x | + x 2 2 .
Subsequently, for r = 1 , 2 , we have K 1 , r = 1 2 d t t q ( t 1 ) = 1 2 y q 1 y 1 d y with q = r , y = 1 t , and d t = d y y 2 from (A2). Thus, letting v = y 1 , we get K 1 , r = 1 2 y q 1 y 1 d y = 1 2 ln | v | + k = 1 q 1 q 1 k k v k or
K 1 , r = 1 2 ln x 2 1 + x 2 + k = 1 r 1 r 1 k 2 k x 2 1 + x 2 k .
For example, we get K 1 , 1 = 1 2 ln x 2 1 + x 2 and K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 2 1 + x 2 : the latter result can alternatively be obtained as K 1 , 2 = d t t 2 1 t 3 = 1 2 d q q + 1 2 q = 1 2 1 q + 1 q + 1 + 1 ( q + 1 ) 2 d q = 1 2 ln q q + 1 + 1 2 ( q + 1 ) or
K 1 , 2 = 1 2 ln x 2 1 + x 2 + 1 2 1 + x 2
with q = t 2 1 = x 2 from (A1): the last term 1 2 1 + x 2 of (A5) is equivalent to the last term x 2 2 1 + x 2 of K 1 , 2 shown in (51) because x 2 2 1 + x 2 = 1 + x 2 1 2 1 + x 2 = 1 2 + 1 2 1 + x 2 .
When r = m + 1 2 for m = 0 , 1 , , using that t 2 m + 2 t 2 1 = t 2 m + t 2 m 2 + + 1 + 1 t 2 1 = k = 0 m t 2 ( m k ) + 1 2 t 1 + 1 2 t + 1 , we get K 1 , m + 1 2 = t 2 m + 2 t 2 1 d t or
K 1 , m + 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 m 1 + x 2 m k + 1 2 2 ( m k ) + 1
from (A1). For example, K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 when m = 0 and K 1 , 3 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 3 1 + x 2 3 2 + 1 + x 2 when m = 1 .
Subsequently, when r = q + 1 2 for q = 1 , 2 , using (A1) we get K 1 , q + 1 2 = t 2 q + 2 t 2 1 d t = v 2 q 2 1 v 2 1 d v v 2 = v 2 q 2 v 2 1 d v = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 q 2 1 + x 2 q + k + 2 1 2 2 ( q 2 k ) + 1 or
K 1 , q + 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 k = 0 q 2 1 + x 2 q + k + 3 2 2 q + 2 k + 3
by replacing m and 1 + x 2 in (A6) with q 2 (from 2 m + 2 = 2 q 2 we get m = q 2 ) and 1 1 + x 2 , respectively. For example, we get K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 when q = 1 and K 1 , 3 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 1 + x 2 when q = 2 .
Collecting the results (A3), (A4), (A6), and (A7), we have
K 1 , r = ln | x | + k = 1 r r k 2 k x 2 k , r = 0 , 1 , , 1 2 ln x 2 1 + x 2 + k = 1 r 1 r 1 k 2 k x 2 1 + x 2 k , r = 1 , 2 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 + k = 0 r 1 2 1 + x 2 r k 2 ( r k ) , r = 1 2 , 3 2 , , 1 2 ln 1 + x 2 1 1 + x 2 + 1 k = 0 r 3 2 1 + x 2 r + k + 1 2 ( r + k + 1 ) , r = 1 2 , 3 2 , .
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 K 1 , r = K 1 , 0 + 1 2 k = 1 r 1 k 1 + x 2 k or
K 1 , r = ln | x | + 1 2 k = 1 r 1 k 1 + x 2 k
for r = 0 , 1 , . The term k = 1 r 1 k 1 + x 2 k = k = 1 r 1 k j = 0 k k j x 2 j in (A9) can be expressed as k = 1 r 1 k j = 0 k k j x 2 j = k = 1 r 1 k j = 0 r k j x 2 j = j = 0 r x 2 j k = 1 r 1 k k j = j = 1 r x 2 j k = 1 r 1 j k 1 j 1 + x 0 k = 1 r 1 k = j = 1 r x 2 j 1 j t = 0 r 1 t j 1 + C r = j = 1 r x 2 j 1 j r j + C r , where C r = k = 1 r 1 k : we have used that k j = 0 when the integers j and k satisfy j > k 0 [[16] Table 1.4] and that t = 0 r t s = t = s r t s = r + 1 s + 1 [[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 ( 0 , 1 ) , ( p , r ) = ( 1 , 1 ) , and ( 1 , 1 ) have been addressed in (9), (44), and (45), respectively. Let us next consider the remaining cases { p ± 1 , 0 } { r = 1 } . First, recollect that k = 1 m ( 1 ) k + 1 x 2 ( m k ) = ( 1 ) m + 1 1 x 2 m 1 x 2 or
k = 1 m ( 1 ) k + 1 x 2 ( m k ) = ( 1 ) m + 1 + x 2 m 1 + x 2
and ( 1 ) m + 1 + ( 1 ) m = 0 for m = 1 , 2 , . Then, for p = 2 m with m = 1 , 2 , , we have K 2 m , 1 = x 2 m 1 + x 2 d x = k = 1 m ( 1 ) k + 1 x 2 ( m k ) + ( 1 ) m 1 + x 2 d x or
K 2 m , 1 = k = 1 m ( 1 ) k + 1 2 ( m k ) + 1 x 2 ( m k ) + 1 + ( 1 ) m tan 1 x
using (A10). Similarly, when p = 2 m with m = 1 , 2 , , we get K 2 m , 1 = x 2 m 1 + x 2 d x = y 2 m 1 + y 2 d y or
K 2 m , 1 = ( 1 ) m tan 1 1 x k = 1 m ( 1 ) k + 1 x 2 m + 2 k 1 2 ( m k ) + 1
with y = 1 x and d x = d y y 2 . Note that, when x = tan θ or θ = tan 1 x , we have tan 1 1 x = π 2 θ = tan 1 x + π 2 . Thus, for example, K 2 , 1 = 1 x + tan 1 1 x + c 1 from (A12) while it can also be expressed as K 2 , 1 = 1 x tan 1 x + c 2 , which can be derived as K 2 , 1 = 1 t 2 2 t 2 2 1 + t 2 d t = 1 2 1 2 t 2 + t 4 t 2 1 + t 2 d t = 1 2 1 + 3 t 2 + 1 t 2 1 + t 2 d t = 1 2 1 + 1 t 2 + 4 1 + t 2 d t = 1 2 t 1 t 4 tan 1 t = 1 2 1 t 2 t 2 θ = 1 2 2 tan θ 2 tan 1 x or
K 2 , 1 = 1 x tan 1 x .
We also easily get K 2 , 1 = 1 1 1 + x 2 d x or
K 2 , 1 = x tan 1 x .
Secondly, for p = 2 m + 1 with m = 0 , 1 , , we have K 2 m + 1 , 1 = x 2 m + 1 1 + x 2 d x = 1 2 ( t 1 ) m t d t = 1 2 k = 0 m m k ( 1 ) m k t k 1 d t or
K 2 m + 1 , 1 = ( 1 ) m 2 ln 1 + x 2 + k = 1 m m k ( 1 ) m k 2 k 1 + x 2 k
from (14) with t = 1 + x 2 . Similarly, when p = 2 m 1 for m = 0 , 1 , , with y = 1 x and d x = d y y 2 , we get K 2 m 1 , 1 = d x x 2 m + 1 1 + x 2 = y 2 m + 1 1 + y 2 d y , which is basically the same as (A15) with x replaced by y. Thus,
K 2 m 1 , 1 = 1 2 ( 1 ) m + 1 ln 1 + x 2 x 2 + k = 1 m m k ( 1 ) m k + 1 2 k 1 + x 2 x 2 k .
For example, we get K 1 , 1 = 1 2 ln 1 + x 2 when m = 0 and K 3 , 1 = 1 2 1 + x 2 ln 1 + x 2 when m = 1 from (A15), and K 1 , 1 = 1 2 ln 1 + x 2 x 2 = 1 2 ln x 2 1 + x 2 when m = 0 and K 3 , 1 = 1 2 ln 1 + x 2 x 2 1 + x 2 2 x 2 when m = 1 from (A16).
Collecting the results (A11), (A12), (A15), and (A16), we get
K p , 1 = ( 1 ) p 2 tan 1 x + k = 1 p 2 ( 1 ) k + 1 p 2 k + 1 x p 2 k + 1 , p = 0 , 2 , , ( 1 ) p 2 tan 1 1 x k = 1 p 2 ( 1 ) k + 1 p 2 k + 1 1 x p 2 k + 1 , p = 2 , 4 , , 1 2 ( 1 ) p 1 2 ln 1 + x 2 + k = 1 p 1 2 ( 1 ) p 1 2 k 2 k p 1 2 k 1 + x 2 k , p = 1 , 3 , , 1 2 ( 1 ) | p | 1 2 ln 1 + x 2 x 2 + k = 1 | p | 1 2 ( 1 ) | p | 1 2 k + 1 2 k | p | 1 2 k 1 + x 2 x 2 k , p = 1 , 3 , .
Similarly to the case of p = 1 shown in Appendix A.1, the recursion (41) may alternatively be employed to obtain (A17). For example, by adding
K p , 1 = x p 1 p 1 K p 2 , 1 ( 1 ) K p 2 , 1 = ( 1 ) x p 3 p 3 ( 1 ) K p 4 , 1 ( 1 ) 2 K p 4 , 1 = ( 1 ) 2 x p 5 p 5 ( 1 ) 2 K p 6 , 1 ( 1 ) p s 2 K s , 1 = ( 1 ) p s 2 x s 1 s 1 ( 1 ) p s 2 K s 2 , 1
we will get
K p , 1 = ( 1 ) p s 2 K s 2 , 1 + k = 2 : 2 p s + 2 ( 1 ) k 2 2 x p k + 1 p k + 1 .
It is easy to see that (A18), with s = 2 and K 0 , 1 = tan 1 x from (9), is the same as the first line on the right-hand of (A17).

Appendix A.3. the Case p = 1

When p = 1 , with S ( 1 , k ) = ( 2 k ) ! ! ( 2 k + 2 ) ! ! = 1 2 k + 2 and a 1 , k = x 2 1 + x 2 k 2 k + 2 , (74) and (75) can be expressed as K 1 , r = S ( 1 , r ) K 1 , s S ( 1 , s ) + k = s + 1 r a 1 , k S ( 1 , k ) or
K 1 , r = 1 2 r + 2 ( 2 s + 2 ) K 1 , s + x 2 k = s + 1 r 1 + x 2 k
for s < r , and K 1 , r = S ( 1 , r ) K 1 , s S ( 1 , s ) k = r + 1 s a 1 , k S ( 1 , k ) or
K 1 , r = 1 2 r + 2 ( 2 s + 2 ) K 1 , s x 2 k = r + 1 s 1 + x 2 k
for s > r , respectively. In addition, from r 1 = 1 + 1 2 = 1 and r 2 = 0 , we can choose the set { K 1 , 0 , K 1 , 1 , K 1 , 1 2 , K 1 , 2 } of IC’s.
Now, with s = 0 , S ( 1 , 0 ) = 1 2 , and the initial condition K 1 , 0 = x 2 2 from (43), we get K 1 , r = 1 2 r + 2 x 2 + x 2 k = 1 r 1 + x 2 k = x 2 2 r + 2 1 + 1 + x 2 1 1 + x 2 r 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 1 2 ( r + 1 )
for r = 1 , 2 , from (A19). With s = 2 , S ( 1 , 2 ) = 1 2 , and the initial condition K 1 , 2 = x 2 2 1 + x 2 shown in (36), we get K 1 , r = 1 2 r + 2 2 K 1 , 2 x 2 k = r + 1 2 1 + x 2 k = 1 2 r + 2 x 2 1 + x 2 x 2 1 + x 2 r + 1 1 1 + x 2 r 2 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 1 2 ( r + 1 )
for r = 3 , 4 , from (A20).
Similarly, with s = 1 2 , S 1 , 1 2 = 1 , and the initial condition K 1 , 1 2 = 1 + x 2 shown in (19), we get K 1 , r = 1 2 r + 2 1 + x 2 + x 2 k = 1 2 r 1 + x 2 k = 1 2 r + 2 1 + x 2 + x 2 1 + x 2 1 1 + x 2 r + 1 2 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r = 1 2 , 3 2 , from (A19). We can also obtain K 1 , r = 1 2 r + 2 1 + x 2 k = r + 1 1 2 x 2 1 + x 2 k = 1 2 r + 2 1 + x 2 x 2 1 + x 2 r + 1 1 1 + x 2 r 1 2 1 1 + x 2 or
K 1 , r = 1 + x 2 r + 1 2 ( r + 1 )
for r = 3 2 , 5 2 , from (A20).
Combining the results (A21)–(A24), and noting (11), we easily see that the result is the same as the result (44) subject to an integral constant.

Appendix A.4. Derivation of (86) and (87)

With c p , r = x p 1 1 + x 2 r + 1 p + 2 r + 1 and d p , r = p 1 p + 2 r + 1 , if we add
K p , r = c p , r + d p , r K p 2 , r ,
d p , r K p 2 , r = d p , r c p 2 , r + d p 2 , r d p , r K p 4 , r ,
d p , r d p 2 , r K p 4 , r = d p 2 , r d p , r c p 4 , r + d p 4 , r d p 2 , r d p , r K p 6 , r ,
K s 2 , r m = s : 2 p d m , r = c s + 2 , r m = s + 2 : 2 p d m , r + K s , r m = s + 2 : 2 p d m , r ,
we get
K p , r = k = s + 2 : 2 p c k , r m = k + 2 : 2 p d m , r + K s , r m = s + 2 : 2 p d m , r
for p > s . Noting that m = k + 2 : 2 p d m , r = ( k + 1 ) k + 2 r + 3 ( k + 3 ) k + 2 r + 5 ( p 1 ) p + 2 r + 1 = ( 1 ) p k 2 ( p 1 ) ! ! ( p + 2 r + 1 ) ! ! ( k + 2 r + 1 ) ! ! ( k 1 ) ! ! can be rewritten as
m = k + 2 : 2 p d m , r = ( 1 ) p k 2 T ( p , r ) T ( k , r ) ,
we get (86) and (87) from (A29).

Appendix A.5. the Case r = 1 2

When r = 1 2 , we get p 1 = 2 1 2 1 = 0 , p L = min ( 0 , 1 ) = 0 , p U = max ( 0 , 1 ) = 1 , c k , 1 2 = 1 k x k 1 1 + x 2 1 2 , and T k , 1 2 = ( k 1 ) ! ! k ! ! . Let us choose the set { K 1 , 1 2 , K 2 , 1 2 , K 0 , 1 2 , K 1 , 1 2 } of IC’s.
First, from (86), with s = 1 , T 1 , 1 2 = 0 ! ! 1 ! ! = 1 , and K 1 , 1 2 = 1 + x 2 shown in (19), we get K p , 1 2 = ( p 1 ) ! ! p ! ! ( 1 ) p 1 2 1 + x 2 + k = 3 : 2 p ( 1 ) p k 2 c k , r k ! ! ( k 1 ) ! ! or
K p , 1 2 = ( p 1 ) ! ! p ! ! { ( 1 ) p 1 2 1 + x 2 + 1 + x 2 k = 3 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 }
for p = 3 , 5 , ; and with s = 0 , T 0 , 1 2 = ( 1 ) ! ! 0 ! ! = 1 , and K 0 , 1 2 = ln x + 1 + x 2 shown in (8), we get
K p , 1 2 = ( p 1 ) ! ! p ! ! { ( 1 ) p 2 ln x + 1 + x 2 + 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 }
for p = 2 , 4 , .
Next, from (87), with s = 2 , T 2 , 1 2 = ( 3 ) ! ! ( 2 ) ! ! = 1 , and K 2 , 1 2 = 1 + x 2 x shown in (29), we get
K p , 1 2 = ( p 1 ) ! ! p ! ! { ( 1 ) p + 2 2 1 + x 2 x + 1 + x 2 k = p + 2 : 2 2 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 }
for p = 4 , 6 , ; and with s = 1 , T 1 , 1 2 = ( 2 ) ! ! ( 1 ) ! ! = 1 , and K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 shown in (20), we get
K p , 1 2 = ( p 1 ) ! ! p ! ! { ( 1 ) p + 1 2 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 }
for p = 3 , 5 , .
Collecting the results (A31)–(A34), we have
K p , 1 2 = ( p 1 ) ! ! p ! ! 1 + x 2 ( 1 ) p 1 2 + k = 3 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 , p = 1 , 3 , , ( p 1 ) ! ! p ! ! { ( 1 ) p 2 ln x + 1 + x 2 + 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 } , p = 0 , 2 , , ( p 1 ) ! ! p ! ! 1 + x 2 { ( 1 ) p + 2 2 1 x + k = p + 2 : 2 2 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 } , p = 2 , 4 , , ( p 1 ) ! ! p ! ! { 1 2 ( 1 ) p + 1 2 ln 1 + x 2 1 1 + x 2 + 1 + 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 ( k 2 ) ! ! ( k 1 ) ! ! x k 1 } , p = 1 , 3 , .

Appendix A.6. the Case r = −2

When r = 2 , we get p 1 = 3 , p L = 1 , p U = 3 , c p , 2 = x p 1 ( p 3 ) 1 + x 2 , and T k , 2 = ( k 1 ) ! ! ( k 3 ) ! ! = k 1 . We can choose the IC’s K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 from1 (16), K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 1 + x 2 from (103), K 1 , 2 = 1 2 1 + x 2 from (44), and K 0 , 2 = 1 2 tan 1 x + x 1 + x 2 from (83), where we have chosen 0 as ⊙.
First, from (86) with s = 3 , T ( 3 , 2 ) = 2 , and K 3 , 2 = 1 2 ln 1 + x 2 x 2 2 1 + x 2 , we get
K p , 2 = ( p 1 ) { ( 1 ) p 3 2 4 ln 1 + x 2 x 2 1 + x 2 + 1 1 + x 2 k = 5 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) }
for p = 5 , 7 , . Second, from (87) with s = 1 , T ( 1 , 2 ) = 2 , and K 1 , 2 = 1 2 ln x 2 1 + x 2 x 2 2 1 + x 2 , we get
K p , 2 = ( p 1 ) { ( 1 ) p + 1 2 4 ln x 2 1 + x 2 x 2 1 + x 2 1 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) }
for p = 3 , 5 , .
Third, with the IC K 1 , 2 = 1 2 1 + x 2 , we do not have any other formula to obtain: this is a consequence of p L = p U 2 . Fourth, with the IC K 0 , 2 = 1 2 tan 1 x + x 1 + x 2 , we can obtain every formula for p even. Specifically, from (86) with s = 0 and T ( 0 , 2 ) = 1 , we get
K p , 2 = ( p 1 ) { ( 1 ) p 2 2 tan 1 x + x 1 + x 2 + 1 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) }
for p = 2 , 4 , . Similarly, from (87) with s = 0 and T ( 0 , 2 ) = 1 , we get
K p , 2 = ( p 1 ) { ( 1 ) p 2 2 tan 1 x + x 1 + x 2 1 1 + x 2 k = p + 2 : 2 0 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) }
for p = 2 , 4 , .
Combining the results (A36)–(A39) above, we have
K p , 2 = 1 2 1 + x 2 , p = 1 , ( p 1 ) { ( 1 ) p 3 2 4 ln 1 + x 2 x 2 1 + x 2 + 1 1 + x 2 k = 5 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) } , p = 3 , 5 , , ( p 1 ) { ( 1 ) p + 1 2 4 ln x 2 1 + x 2 x 2 1 + x 2 1 1 + x 2 k = p + 2 : 2 1 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) } , p = 1 , 3 , , ( p 1 ) { ( 1 ) p 2 2 tan 1 x + x 1 + x 2 + 1 1 + x 2 k = 2 : 2 p ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) } p = 0 , 2 , , ( p 1 ) { ( 1 ) p 2 2 tan 1 x + x 1 + x 2 1 1 + x 2 k = p + 2 : 2 0 ( 1 ) p k 2 x k 1 ( k 1 ) ( k 3 ) } , p = 2 , 4 , .
Note that (16) can be written in this way because x 2 1 + x 2 = 1 1 1 + x 2 as described after (A5).

References

  1. M. Abramowitz and I. A. Stegun (Ed.), Handbook of Mathematical Functions, Dover, 1972.
  2. F. Beukers, “Gauss’ hypergeometric function”, in Arithmetic and Geometry Around Hypergeometric Functions, Progress in Mathematics 260, Birkhäuser Verlag, Basel, pp. 23—42, 2007.
  3. K. N. Boyadzhiev, A binomial formula for evaluating integrals, arXiv preprint arXiv:2205.08618, 2022. (https://arxiv.org/abs/2205.08618).
  4. P. F. Byrd and M. D. Friedman, Handbook of Elliptic Integrals for Engineers and Scientists, 2nd ed. New York, NY, USA: Springer-Verlag, 1971.
  5. 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.
  6. M. W. Coffey, Integrals in Gradshteyn and Ryzhik: Hyperbolic and trigonometric function, arXiv preprint arXiv:1803.00632, 2018.
  7. K. O. Geddes, S. R. Czapor, and G. Labahn, Algorithms for Computer Algebra. Boston, MA, USA: Kluwer Academic Publishers, 1992.
  8. I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, Seventh Ed., Academic, 2007.
  9. A. Heck and W. Koepf, Introduction to Maple, New York, NY, USA: Springer, 1993.
  10. 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.
  11. 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.
  12. 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.
  13. M. Morrison, C. Hastings, and K. Mischo, Hands-on Start to Wolfram Mathematica, Champaign, IL, USA: Wolfram Media, 2015.
  14. E. Panzer, Feynman integrals and hyperlogarithms, PhD thesis, Humboldt University of Berlin, 2015.
  15. E. Remiddi and J. A. M. Vermaseren, “Harmonic polylogarithms”, International Journal of Modern Physics A, vol. 15, no. 5, pp. 725–754, 2000.
  16. I. Song, S. R. Park, and S. Yoon, Probability and Random Variables: Theory and Applications, Springer, 2022.
  17. 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 r = 0 , p = 1 , p = 1 , r = 1 , and p + 2 r + 3 = 0 , as well as those on the line p + 2 r + 1 = 0 , all have readily available formulas of K p , r .
Figure 1. The points on the five bold lines r = 0 , p = 1 , p = 1 , r = 1 , and p + 2 r + 3 = 0 , as well as those on the line p + 2 r + 1 = 0 , all have readily available formulas of K p , r .
Preprints 226921 g001
Table 1. Some values of k ! !
Table 1. Some values of k ! !
k 9 8 7 6 5 4 3 2 1 0 1 2 3 4 5 6 7 8 9
k ! ! 945 384 105 48 15 8 3 2 1 1 1 1 1 1 2 1 3 1 8 1 15 1 48 1 105
Table 2. Evaluation of K p , r for fixed p.
Table 2. Evaluation of K p , r for fixed p.
Value of p With IC Via formula Calculate K p , r for
If   p   is   even . ( equivalently , if   r 1   is   an   odd multiple   of   1 2 ) K p , r U (74) r = r U + 1 , r U + 2 ,
K p , r L 1 (75) r = r L 2 , r L 3 ,
K p , r U 1 (75) r = r U 2 , r U 3 ,
K p , r L (74) r = r L + 1 , r L + 2 ,
If   p   is   odd . ( equivalently , if   r 1   is   an integer ) K p , r U (74) r = r U + 1 , r U + 2 ,
K p , r L 1 (75) r = r L 2 , r L 3 ,
K p , (74) r = + 1 , + 2 ,
K p , (75) r = 1 , 2 ,
K p , r U 1 (75) r = r U 2 , r U 3 , , r L
K p , r L (74) r = r L + 1 , r L + 2 , , r U 1
Among the last two sets of calculations, only one set is necessary
Note: r 1 = p + 1 2 . r L = min r 1 , 0 . r U = max r 1 , 0 . = any odd multiple of 1 2 .
Table 3. Evaluation of K p , r for fixed r.
Table 3. Evaluation of K p , r for fixed r.
Value of r With IC Via formula Calculate K p , r for
If   r   is   an   odd multiple   of   1 2 . ( equivalently , if   p 1   i s   e v e n ) K p U , r (86) p = p U + 2 , p U + 4 ,
K p L 2 , r (87) p = p L 4 , p L 6 ,
K p U 2 , r (87) p = p U 4 , p U 6 ,
K p L , r (86) p = p L + 2 , p L + 4 ,
If   r   is   an   even multiple   of   1 2 . ( equivalently , if   p 1   is   odd ) K p U , r (86) p = p U + 2 , p U + 4 ,
K p L 2 , r (87) p = p L 4 , p L 6 ,
K , r (86) p = + 2 , + 4 ,
K , r (87) p = 2 , 4 ,
K p U 2 , r (87) p = p U 4 , p U 6 , , p L
K p L , r (86) p = p L + 2 , p L + 4 , , p U 2
Among the last two sets of calculations, only one set is necessary
Note: p 1 = 2 r 1 . p L = min p 1 , 1 . p U = max p 1 , 1 . = any even integer.
Table 4. Explicit formulas of K p , r = x p 1 + x 2 r d x . Here, ‘ = e ’ denotes ‘equivalent to’ α = K 0 , 1 2 = ln x + 1 + x 2 , β = K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 = ln 1 + x 2 1 | x | , and g 3 2 ( x ) = 2 x 3 + 5 x 1 + x 2 .
Table 4. Explicit formulas of K p , r = x p 1 + x 2 r d x . Here, ‘ = e ’ denotes ‘equivalent to’ α = K 0 , 1 2 = ln x + 1 + x 2 , β = K 1 , 1 2 = 1 2 ln 1 + x 2 1 1 + x 2 + 1 = ln 1 + x 2 1 | x | , and g 3 2 ( x ) = 2 x 3 + 5 x 1 + x 2 .
p = 2 p = 1 p = 0 p = 1 p = 2
Eq. (46) Eq. (76) Eq. (44)
r = 5 2 4 x 2 x 2 + 3 3 1 + x 2 3 2 β + 1 1 + x 2 x 2 x 2 + 3 3 1 + x 2 3 2 1 3 1 + x 2 3 2 x 3 3 1 + x 2 3 2
1 x 1 + x 2 3 2 + 1 3 1 + x 2 3 2
r = 2 3 2 tan 1 x 1 2 ln x 2 1 + x 2 1 2 tan 1 x x 2 2 1 + x 2 1 2 tan 1 x
Eq. (95) 3 x 2 + 2 2 x 1 + x 2 1 2 x 2 1 + x 2 + 1 2 x 1 + x 2 1 2 x 1 + x 2
r = 3 2 2 x + 1 x β x 1 + x 2 1 1 + x 2 α
× 1 1 + x 2 + 1 1 + x 2 x 1 + x 2
r = 1 1 x 1 2 ln x 2 1 + x 2 tan 1 x 1 2 ln 1 + x 2 x
Eq. (52) tan 1 x tan 1 x
r = 1 2 1 + x 2 x β α 1 + x 2 x 3 + x 2 1 + x 2
Eq. (90) 1 2 α
r = 0 1 x ln | x | x x 2 2 x 3 3
Eq. (43)
r = 1 2 α β 1 2 α 1 3 1 + x 2 3 2 2 x 5 + 3 x 3 + x 8 1 + x 2
1 + x 2 x + 1 + x 2 + x 2 1 + x 2 1 8 α
r = 1 1 x + x ln | x | + x 2 2 x + x 3 3 x 2 2 + x 4 4 x 3 3 + x 5 5
Eq. (31) = e 1 4 1 + x 2 2
r = 3 2 3 α 2 + 1 2 g 3 2 ( x ) β + 2 1 + x 2 3 α 8 + 1 + x 2 5 2 5 α 16 1 48 g 3 2 ( x )
1 + x 2 5 2 x + 2 3 1 + x 2 3 2 1 8 g 3 2 ( x ) + x 1 + x 2 5 2 6
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.
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.