Hubbry Logo
search
logo

Integration by reduction formulae

logo
Community Hub0 Subscribers

Wikipedia

from Wikipedia

In integral calculus, integration by reduction formulae is a method relying on recurrence relations. It is used when an expression containing an integer parameter, usually in the form of powers of elementary functions, or products of transcendental functions and polynomials of arbitrary degree, cannot be integrated directly. Using other methods of integration a reduction formula can be set up to obtain the integral of the same or similar expression with a lower integer parameter, progressively simplifying the integral until it can be evaluated. [1] This method of integration is one of the earliest used.[citation needed]

How to find the reduction formula

[edit]

The reduction formula can be derived using any of the common methods of integration, like integration by substitution, integration by parts, integration by trigonometric substitution, integration by partial fractions, etc. The main idea is to express an integral involving an integer parameter (e.g. power) of a function, represented by In, in terms of an integral that involves a lower value of the parameter (lower power) of that function, for example In-1 or In-2. This makes the reduction formula a type of recurrence relation. In other words, the reduction formula expresses the integral

in terms of

where

Reference works contain the general forms for recursive integration (see, for example Gradshteyn and Ryzhik).

How to compute the integral

[edit]

To compute the integral, we set n to its value and use the reduction formula to express it in terms of the (n – 1) or (n – 2) integral. The lower index integral can be used to calculate the higher index ones; the process is continued repeatedly until we reach a point where the function to be integrated can be computed, usually when its index is 0 or 1. Then we back-substitute the previous results until we have computed In. [2]

Examples

[edit]

Below are examples of the procedure.

Cosine integral

[edit]

Typically, integrals like

can be evaluated by a reduction formula.

, for n = 1, 2 ... 30

Start by setting:

Now re-write as:

Integrating by this substitution:

Now integrating by parts:

solving for In:

so the reduction formula is:

To supplement the example, the above can be used to evaluate the integral for (say) n = 5;

Calculating lower indices:

back-substituting:

where C is a constant.

Exponential integral

[edit]

Another typical example is:

Start by setting:

Integrating by substitution:

Now integrating by parts:

shifting indices back by 1 (so n + 1n, nn – 1):

solving for In:

so the reduction formula is:

An alternative way in which the derivation could be done starts by substituting .

Integration by substitution:

Now integrating by parts:

which gives the reduction formula when substituting back:

which is equivalent to:

Another alternative way in which the derivation could be done by integrating by parts:

Remember:

which gives the reduction formula when substituting back:

which is equivalent to:

Tables of integral reduction formulas

[edit]

Rational functions

[edit]

The following integrals[3] contain:

  • Factors of the linear radical
  • Linear factors and the linear radical
  • Quadratic factors
  • Quadratic factors , for
  • Quadratic factors , for
  • (Irreducible) quadratic factors
  • Radicals of irreducible quadratic factors
Integral Reduction formula
Integral Reduction formula

Integral Reduction formula
Integral Reduction formula
Integral Reduction formula
Integral Reduction formula
Integral Reduction formula

note that by the laws of indices:

Transcendental functions

[edit]

The following integrals[4] contain:

  • Factors of sine
  • Factors of cosine
  • Factors of sine and cosine products and quotients
  • Products/quotients of exponential factors and powers of x
  • Products of exponential and sine/cosine factors
Integral Reduction formula

the formulae can be combined to obtain separate equations in In:

and Jn:

Integral Reduction formula
Integral Reduction formula

References

[edit]

Bibliography

[edit]

Grokipedia

from Grokipedia
Integration by reduction formulae is a systematic technique in integral calculus used to evaluate indefinite and definite integrals of functions involving powers, such as trigonometric powers or exponential multiples, by recursively expressing the integral in terms of a similar integral with a reduced exponent or parameter, ultimately simplifying it to a computable base case.[1][2][3] This method is particularly valuable for integrals that resist direct antiderivative finding, as it transforms complex expressions into a sequence of easier ones through repeated application, avoiding exhaustive manual integration by parts for higher powers.[2][3] The core principle relies on defining a general integral $ I_n = \int f(x)^n , dx $ or similar, then deriving a relation like $ I_n = g(n, x) + c \cdot I_{n-1} $, where $ g $ is an elementary function and $ c $ is a constant, allowing recursive computation down to $ I_0 $ or $ I_1 $.[1][3] Reduction formulae are typically derived using integration by parts, the product rule in reverse, by strategically choosing $ u $ as the powered term and $ dv $ as the remaining factor to yield the desired reduction.[2][3] For instance, in deriving the formula for $ \int \sin^n x , dx $, set $ u = \sin^{n-1} x $ and $ dv = \sin x , dx $, leading to $ \int \sin^n x , dx = -\frac{\sin^{n-1} x \cos x}{n} + \frac{n-1}{n} \int \sin^{n-2} x , dx $.[3] Similarly, for $ \int x^n e^{ax} , dx $, integration by parts with $ u = x^n $ and $ dv = e^{ax} , dx $ produces $ \int x^n e^{ax} , dx = \frac{x^n e^{ax}}{a} - \frac{n}{a} \int x^{n-1} e^{ax} , dx $.[3] Common applications include integrals of powers of logarithms, such as $ \int (\ln x)^n , dx = x (\ln x)^n - n \int (\ln x)^{n-1} , dx $, which reduces step-by-step to basic forms like $ \int \ln x , dx = x \ln x - x + C $.[2] These formulae appear in standard calculus tables and are essential in fields like physics and engineering for solving differential equations or computing special functions.[1] By providing a patterned approach, they enhance efficiency in symbolic computation and manual evaluation alike.[2][3]

Basic Concepts

Definition of Reduction Formulae

Reduction formulae in integral calculus are recursive relations that express an integral involving a parameter, typically an integer $ n $, in terms of an integral with a reduced value of that parameter, such as $ n-2 $ or $ n-1 $. These formulae take the general form $ I_n = f(n) I_{n-k} + g(n) $, where $ I_n = \int x^n h(x) , dx $ or a similar parameterized integral, and $ f(n) $, $ g(n) $, and $ k $ are functions or constants depending on the specific case, enabling the computation of higher-order integrals by relating them to simpler, lower-order ones.[4][5] The primary purpose of reduction formulae is to evaluate definite or indefinite integrals that do not yield to direct methods for finding antiderivatives, particularly those involving powers of trigonometric, exponential, or polynomial functions, or products thereof. By iteratively applying the recursive relation, the integral is reduced until it reaches a base case that can be computed explicitly, such as $ I_0 $ or $ I_1 $, which often involves elementary functions. Key properties include their recursive structure, which ensures a finite number of steps for integer parameters, the necessity of establishing base cases for termination, and considerations of convergence or validity for specific ranges of $ n $, such as positive even or odd integers.[4][5] These formulae originated in 18th- and 19th-century calculus texts as tools for handling integrals that were non-elementary or cumbersome, building on foundational integration techniques like integration by parts.[6]

Connection to Integration by Parts

Integration by parts is a fundamental integration technique derived from the product rule of differentiation, expressed by the formula
udv=uvvdu.\int u \, dv = uv - \int v \, du.
This method allows the integration of products of functions by transforming the original integral into another that may be simpler to evaluate.[7] The connection to reduction formulae arises when integration by parts is applied to integrals containing a parameter, such as a power nn in the integrand, in a way that generates a recursive relation. By strategically selecting uu as the term involving the parameter (e.g., u=xnu = x^n) and dvdv as the remaining factor (e.g., dv=sinxdxdv = \sin x \, dx for xnsinxdx\int x^n \sin x \, dx), the resulting integral vdu\int v \, du involves the same form but with the parameter reduced (typically by 1), leading to a recursion that can be iterated until the integral simplifies.[8][9] This approach offers significant advantages over performing repeated integration by parts directly, particularly for integrals with high powers, such as polynomials multiplied by exponentials or trigonometric functions. Direct repetition often results in tedious, error-prone calculations with lengthy chains of terms, whereas the recursive structure of reduction formulae encapsulates the process into a compact relation, enabling efficient computation for any value of the parameter.[3] However, deriving reduction formulae via integration by parts has limitations. It requires a careful choice of uu and dvdv to ensure the recursion actually reduces the complexity; an improper selection may lead to integrals that are equally or more difficult. Moreover, this method is not applicable to all indefinite integrals, as it depends on the presence of a suitable parameter that can be systematically diminished.[9][7] Reduction formulae emerge as the direct outcome of this recursive application of integration by parts to parameterized integrals.[10]

Deriving Reduction Formulae

Standard Derivation via Integration by Parts

The standard derivation of reduction formulae employs integration by parts, a technique rooted in the product rule for differentiation, to express an integral involving a power nn in terms of a similar integral with a reduced power, typically n2n-2.[7] To derive such a formula generally, begin by defining the integral In=f(x)gn(x)dxI_n = \int f(x) g^n(x) \, dx, where f(x)f(x) and g(x)g(x) are suitable functions. Apply integration by parts by setting u=gn1(x)u = g^{n-1}(x) and dv=g(x)f(x)dxdv = g(x) f(x) \, dx, so that du=(n1)gn2(x)g(x)dxdu = (n-1) g^{n-2}(x) g'(x) \, dx and v=g(x)f(x)dxv = \int g(x) f(x) \, dx. The formula then yields In=uvvduI_n = u v - \int v \, du, which simplifies to an expression relating InI_n to In2I_{n-2} after algebraic manipulation, often using identities like g2(x)+h2(x)=1g^2(x) + h^2(x) = 1 if applicable.[3] A prototypical example is the derivation for In=sinnxdxI_n = \int \sin^n x \, dx, where n>1n > 1. Set u=sinn1xu = \sin^{n-1} x and dv=sinxdxdv = \sin x \, dx, yielding du=(n1)sinn2xcosxdxdu = (n-1) \sin^{n-2} x \cos x \, dx and v=cosxv = -\cos x. Substituting into the integration by parts formula gives:
In=sinn1xcosx(cosx)(n1)sinn2xcosxdx=sinn1xcosx+(n1)sinn2xcos2xdx. \begin{aligned} I_n &= -\sin^{n-1} x \cos x - \int (-\cos x) (n-1) \sin^{n-2} x \cos x \, dx \\ &= -\sin^{n-1} x \cos x + (n-1) \int \sin^{n-2} x \cos^2 x \, dx. \end{aligned}
Now apply the identity cos2x=1sin2x\cos^2 x = 1 - \sin^2 x:
(n1)sinn2x(1sin2x)dx=(n1)In2(n1)In. (n-1) \int \sin^{n-2} x (1 - \sin^2 x) \, dx = (n-1) I_{n-2} - (n-1) I_n.
Solving for InI_n results in the reduction formula:
In=sinn1xcosxn+n1nIn2. I_n = -\frac{\sin^{n-1} x \cos x}{n} + \frac{n-1}{n} I_{n-2}.
[7][3]
When selecting uu and dvdv, prioritize choices where differentiation of uu reduces the power (e.g., from n1n-1 to n2n-2) while integration of dvdv remains straightforward, ensuring the process is recursive. For definite integrals over intervals where boundary terms like uvu v evaluate to zero (such as [0,π][0, \pi] for sinx\sin x), the formula simplifies further without constant adjustments.[3] Common pitfalls include poor selection of uu and dvdv, which may lead to non-recursive integrals that do not reduce the problem's complexity, such as choosing u=gn(x)u = g^n(x) directly, resulting in higher powers upon differentiation.[7]

Derivation Using Differentiation Under the Integral Sign

Differentiation under the integral sign provides an alternative approach to deriving reduction formulae by introducing a parameter into the integrand and applying the Leibniz integral rule, which allows interchanging differentiation and integration under suitable conditions. Consider an integral defined as a function of a parameter aa, I(a)=f(x,a)dxI(a) = \int f(x, a) \, dx. Differentiating both sides with respect to aa yields I(a)=fa(x,a)dxI'(a) = \int \frac{\partial f}{\partial a}(x, a) \, dx, assuming the operations can be interchanged, which holds for continuous functions and appropriate domains. Integrating I(a)I'(a) back with respect to aa or evaluating at specific values relates I(a)I(a) to simpler forms, often leading to recursive relations that reduce the complexity of the original integral.[11] A classic example arises in deriving the reduction formula for the Gamma function, defined as Γ(n+1)=0xnexdx\Gamma(n+1) = \int_0^\infty x^n e^{-x} \, dx for positive integers nn. Introduce the parameter t>0t > 0 to form I(t)=0etxdx=1tI(t) = \int_0^\infty e^{-t x} \, dx = \frac{1}{t}. Differentiating both sides n+1n+1 times with respect to tt gives dn+1dtn+1I(t)=(1)n+1(n+1)!t(n+2)=0(x)n+1etxdx\frac{d^{n+1}}{dt^{n+1}} I(t) = (-1)^{n+1} (n+1)! t^{-(n+2)} = \int_0^\infty (-x)^{n+1} e^{-t x} \, dx. Setting t=1t = 1 yields the relation Γ(n+1)=nΓ(n)\Gamma(n+1) = n \Gamma(n), which serves as the reduction formula connecting Γ(n+1)\Gamma(n+1) to the lower-order Γ(n)\Gamma(n). This method extends naturally to non-integer cases for the full Gamma function.[11][12] This technique offers advantages over direct methods like integration by parts, particularly for definite integrals where boundary terms vanish, avoiding complications from indefinite forms, and producing cleaner recursive relations for special functions such as the Gamma or Beta functions. It is especially useful for integrals involving parameters, such as the exponential decay in eaxe^{-a x} where a>0a > 0, or trigonometric integrals expressed via complex exponentials, like sinn(x)dx\int \sin^n(x) \, dx through Euler's formula relating sines to imaginaries of exponentials.[11][12] The method was popularized by Gottfried Wilhelm Leibniz in a 1697 letter to Johann Bernoulli, where it appeared as a tool for evaluating parametric integrals, and later became central to the theory of special functions in the 19th and 20th centuries.[11]

Applying Reduction Formulae

General Computation Process

The general computation process for evaluating integrals using reduction formulae involves a systematic recursive approach that expresses a given integral InI_n in terms of integrals with lower indices, continuing until a solvable base case is reached. This method leverages the derived reduction formula to avoid performing multiple independent integrations by parts, thereby streamlining the calculation for integrals of the form f(x)ng(x)dx\int f(x)^n g(x) \, dx where nn is a positive integer.[13][14] The process follows these key steps:
  1. Identify the form and define InI_n: Recognize the integral as matching the pattern for which a reduction formula has been derived, and denote it as In=unvduI_n = \int u^n v \, du (or the specific variable), where nn is the order to reduce. This sets up the recursive structure.[15][2]
  2. Apply the reduction formula recursively: Substitute the derived formula into InI_n to express it as In=AIn1+BI_n = A I_{n-1} + B, where AA and BB are terms involving the integrand or its antiderivative, then repeat for In1I_{n-1}, In2I_{n-2}, and so on, until the index reaches the base case. Each application reduces the power by one, generating a chain of dependent integrals.[13][14]
  3. Compute the base case: Evaluate the integral at the lowest index directly, such as I0=1dx=x+CI_0 = \int 1 \, dx = x + C for indefinite integrals or the corresponding definite value over specified limits. This provides the foundation for the recursion.[15][2]
  4. Back-substitute to obtain the result: Plug the value of the base case upward through the recursive chain, combining terms to yield the full antiderivative for InI_n or the definite integral value. This yields an explicit expression, often a polynomial times the original function plus a constant.[13][14]
For definite integrals, the process mirrors the indefinite case but requires specifying the limits of integration from the outset, such as In=abunvduI_n = \int_a^b u^n v \, du. Boundary terms arising from integration by parts in the reduction formula must be evaluated at the upper and lower limits bb and aa, respectively, and subtracted appropriately to ensure the recursive integrals retain the same limits. This preserves the definite nature throughout the recursion until the base case is computed over [a,b][a, b].[16][17] To avoid errors, coefficients from each recursive step must be tracked meticulously, as misapplication can propagate inaccuracies through the chain; for high values of nn, symbolic computation tools like computer algebra systems are recommended to automate the recursion and substitution. Overall, this approach enhances efficiency by condensing what would otherwise require nn separate integrations by parts into a single recursive framework, significantly reducing computational effort for higher-order integrals.[15][13] For instance, it is particularly useful in evaluating trigonometric integrals like powers of sine or cosine.[16]

Examples for Trigonometric Integrals

One common application of reduction formulae involves integrals of powers of the sine function, sinnxdx\int \sin^n x \, dx. The reduction formula for this integral, derived using integration by parts, is
In=sinnxdx=sinn1xcosxn+n1nIn2, I_n = \int \sin^n x \, dx = -\frac{\sin^{n-1} x \cos x}{n} + \frac{n-1}{n} I_{n-2},
where n>1n > 1, with base cases I0=1dx=x+CI_0 = \int 1 \, dx = x + C and I1=sinxdx=cosx+CI_1 = \int \sin x \, dx = -\cos x + C.[18] To derive this, apply integration by parts with u=sinn1xu = \sin^{n-1} x and dv=sinxdxdv = \sin x \, dx, so du=(n1)sinn2xcosxdxdu = (n-1) \sin^{n-2} x \cos x \, dx and v=cosxv = -\cos x. This yields In=sinn1xcosx+(n1)sinn2xcos2xdxI_n = -\sin^{n-1} x \cos x + (n-1) \int \sin^{n-2} x \cos^2 x \, dx. Substituting cos2x=1sin2x\cos^2 x = 1 - \sin^2 x and rearranging gives the formula.[19] For a concrete example, consider the definite integral 0π/2sin4xdx\int_0^{\pi/2} \sin^4 x \, dx. Using the formula twice reduces it as follows:
I4=sin3xcosx4+34I2,I2=sinxcosx2+12I0. I_4 = -\frac{\sin^3 x \cos x}{4} + \frac{3}{4} I_2, \quad I_2 = -\frac{\sin x \cos x}{2} + \frac{1}{2} I_0.
Evaluating the definite integral, the boundary terms vanish at the limits (since cos(π/2)=0\cos(\pi/2) = 0 and sin0=0\sin 0 = 0):
0π/2sin4xdx=340π/2sin2xdx=34120π/21dx=3412π2=3π16. \int_0^{\pi/2} \sin^4 x \, dx = \frac{3}{4} \int_0^{\pi/2} \sin^2 x \, dx = \frac{3}{4} \cdot \frac{1}{2} \int_0^{\pi/2} 1 \, dx = \frac{3}{4} \cdot \frac{1}{2} \cdot \frac{\pi}{2} = \frac{3\pi}{16}.
In the indefinite case, the full antiderivative retains the boundary terms, such as I4=sin3xcosx438sinxcosx+38x+CI_4 = -\frac{\sin^3 x \cos x}{4} - \frac{3}{8} \sin x \cos x + \frac{3}{8} x + C, requiring evaluation of those terms at specific limits if needed. For the definite integral over [0,π/2][0, \pi/2], the vanishing boundaries simplify the recursion to a scalar multiple of the base integral I0I_0.[18] A similar reduction formula applies to powers of the cosine function, cosnxdx=sinxcosn1xn+n1ncosn2xdx\int \cos^n x \, dx = \frac{\sin x \cos^{n-1} x}{n} + \frac{n-1}{n} \int \cos^{n-2} x \, dx for n>1n > 1, with base cases J0=x+CJ_0 = x + C and J1=sinx+CJ_1 = \sin x + C. This is derived analogously via integration by parts, setting u=cosn1xu = \cos^{n-1} x and dv=cosxdxdv = \cos x \, dx, leading to v=sinxv = \sin x and substitution of sin2x=1cos2x\sin^2 x = 1 - \cos^2 x.[18] For instance, to evaluate 0π/2cos3xdx\int_0^{\pi/2} \cos^3 x \, dx, apply the formula:
J3=sinxcos2x3+23J1. J_3 = \frac{\sin x \cos^2 x}{3} + \frac{2}{3} J_1.
The boundary term evaluates to zero over [0,π/2][0, \pi/2] (since sin0=0\sin 0 = 0 and cos(π/2)=0\cos(\pi/2) = 0), so
0π/2cos3xdx=230π/2cosxdx=23[sinx]0π/2=23(10)=23. \int_0^{\pi/2} \cos^3 x \, dx = \frac{2}{3} \int_0^{\pi/2} \cos x \, dx = \frac{2}{3} [\sin x]_0^{\pi/2} = \frac{2}{3} (1 - 0) = \frac{2}{3}.
The indefinite integral includes the boundary term, J3=sinx13sin3x+CJ_3 = \sin x - \frac{1}{3} \sin^3 x + C, but for this symmetric interval, definite evaluation leverages the zero boundaries to directly multiply the base case result. This contrast highlights how definite integrals often simplify computations by eliminating non-integral terms in the recursion.[18]

Examples for Exponential Integrals

One prominent example of a reduction formula arises in the integration of products of polynomials and exponentials, specifically for the indefinite integral $ I_n = \int x^n e^{ax} , dx $, where $ a \neq 0 $ is a constant. Applying integration by parts with $ u = x^n $ and $ dv = e^{ax} , dx $ yields the recursive relation $ I_n = \frac{x^n e^{ax}}{a} - \frac{n}{a} I_{n-1} $, allowing computation by successive reduction to the base case $ I_0 = \frac{e^{ax}}{a} + C $.[20] To illustrate, consider the computation of $ \int x^3 e^x , dx $, setting $ a = 1 $. Using the formula iteratively:
I3=x3ex3I2, I_3 = x^3 e^x - 3 I_2,
I2=x2ex2I1, I_2 = x^2 e^x - 2 I_1,
I1=xexI0,I0=ex+C. I_1 = x e^x - I_0, \quad I_0 = e^x + C.
Substituting backward gives $ I_3 = e^x (x^3 - 3x^2 + 6x - 6) + C $. For definite integrals, the reduction formula connects to the Gamma function via $ \Gamma(n+1) = \int_0^\infty x^n e^{-x} , dx $ for positive integer $ n $, where setting $ a = -1 $ and applying the recursion with boundary terms vanishing at the limits yields $ \Gamma(n+1) = n \Gamma(n) $, confirming $ \Gamma(n+1) = n! $.[21] These techniques extend to the incomplete Gamma function, defined as $ \gamma(s, x) = \int_0^x t^{s-1} e^{-t} , dt $, where similar recursive relations reduce the order for finite upper limits, facilitating numerical evaluation in applications like probability distributions.[22]

Common Reduction Formulae Tables

Formulae for Powers of Trigonometric Functions

Reduction formulae for integrals of powers of trigonometric functions are derived using integration by parts and allow recursive computation by reducing the power nn to lower powers. These formulae are particularly useful for indefinite integrals of sinnx\sin^n x, cosnx\cos^n x, tannx\tan^n x, and secnx\sec^n x. For even and odd powers, the recursions apply generally, though explicit closed forms often differ: even powers typically reduce to multiple angles via identities, while odd powers allow direct substitution after recursion.[19][23] The standard reduction formula for sinnxdx\int \sin^n x \, dx is:
sinnxdx=sinn1xcosxn+n1nsinn2xdx,n>1. \int \sin^n x \, dx = -\frac{\sin^{n-1} x \cos x}{n} + \frac{n-1}{n} \int \sin^{n-2} x \, dx, \quad n > 1.
This holds for both even and odd n>1n > 1, with base cases sinxdx=cosx+C\int \sin x \, dx = -\cos x + C and 1dx=x+C\int 1 \, dx = x + C. For even nn, repeated application yields a sum of cosines of multiple angles; for odd nn, it facilitates substitution u=cosxu = \cos x.[19] Similarly, for cosnxdx\int \cos^n x \, dx:
cosnxdx=cosn1xsinxn+n1ncosn2xdx,n>1. \int \cos^n x \, dx = \frac{\cos^{n-1} x \sin x}{n} + \frac{n-1}{n} \int \cos^{n-2} x \, dx, \quad n > 1.
The sign difference arises from the integration by parts choice, with analogous base cases cosxdx=sinx+C\int \cos x \, dx = \sin x + C. Even powers reduce to sines of multiple angles, while odd powers suit u=sinxu = \sin x.[23] For powers of tangent, the reduction is:
tannxdx=tann1xn1tann2xdx,n2. \int \tan^n x \, dx = \frac{\tan^{n-1} x}{n-1} - \int \tan^{n-2} x \, dx, \quad n \geq 2.
This derives from writing tannx=tann2x(sec2x1)\tan^n x = \tan^{n-2} x (\sec^2 x - 1) and integrating by parts, with base case tanxdx=lncosx+C\int \tan x \, dx = -\ln|\cos x| + C. It applies to both even and odd n2n \geq 2.[24] An analogous formula exists for secant powers:
secnxdx=secn2xtanxn1+n2n1secn2xdx,n3. \int \sec^n x \, dx = \frac{\sec^{n-2} x \tan x}{n-1} + \frac{n-2}{n-1} \int \sec^{n-2} x \, dx, \quad n \geq 3.
Derived similarly using secnx=secn2x(sec2x1)+secn2x\sec^n x = \sec^{n-2} x (\sec^2 x - 1) + \sec^{n-2} x, with base case secxdx=lnsecx+tanx+C\int \sec x \, dx = \ln|\sec x + \tan x| + C. Even and odd cases reduce recursively to these bases.[24] When evaluating definite integrals over [0,π/2][0, \pi/2], these recursions connect to Wallis' formula, which gives explicit products for 0π/2sinnxdx=0π/2cosnxdx\int_0^{\pi/2} \sin^n x \, dx = \int_0^{\pi/2} \cos^n x \, dx: for even n=2kn = 2k, π213(2k1)242k\frac{\pi}{2} \cdot \frac{1 \cdot 3 \cdot \dots \cdot (2k-1)}{2 \cdot 4 \cdot \dots \cdot 2k}; for odd n=2k+1n = 2k+1, 242k35(2k+1)\frac{2 \cdot 4 \cdot \dots \cdot 2k}{3 \cdot 5 \cdot \dots \cdot (2k+1)}. This arises by applying the reduction iteratively until reaching known integrals like 0π/21dx=π/2\int_0^{\pi/2} 1 \, dx = \pi/2.[25]
FunctionReduction FormulaValid forBase Cases
sinnx\sin^n xsinnxdx=sinn1xcosxn+n1nsinn2xdx\int \sin^n x \, dx = -\frac{\sin^{n-1} x \cos x}{n} + \frac{n-1}{n} \int \sin^{n-2} x \, dxn>1n > 1n=1n=1: cosx+C-\cos x + C
n=0n=0: x+Cx + C
cosnx\cos^n xcosnxdx=cosn1xsinxn+n1ncosn2xdx\int \cos^n x \, dx = \frac{\cos^{n-1} x \sin x}{n} + \frac{n-1}{n} \int \cos^{n-2} x \, dxn>1n > 1n=1n=1: sinx+C\sin x + C
n=0n=0: x+Cx + C
tannx\tan^n xtannxdx=tann1xn1tann2xdx\int \tan^n x \, dx = \frac{\tan^{n-1} x}{n-1} - \int \tan^{n-2} x \, dxn2n \geq 2n=1n=1: lncosx+C-\ln|\cos x| + C
secnx\sec^n xsecnxdx=secn2xtanxn1+n2n1secn2xdx\int \sec^n x \, dx = \frac{\sec^{n-2} x \tan x}{n-1} + \frac{n-2}{n-1} \int \sec^{n-2} x \, dxn3n \geq 3n=2n=2: tanx+C\tan x + C
n=1n=1: lnsecx+tanx+C\ln|\sec x + \tan x| + C

Formulae for Powers Involving Exponentials

Reduction formulae for integrals of the form xneaxdx\int x^n e^{ax} \, dx, where nn is a positive integer and a0a \neq 0 is a constant, allow recursive computation by reducing the power nn. These are particularly useful in applications such as probability distributions and differential equations involving exponential growth or decay. The formulae can be derived via repeated integration by parts and yield both recursive and explicit closed-form expressions for the indefinite integral. The standard recursive reduction formula is
xneaxdx=xneaxanaxn1eaxdx, \int x^n e^{ax} \, dx = \frac{x^n e^{ax}}{a} - \frac{n}{a} \int x^{n-1} e^{ax} \, dx,
with the base case eaxdx=eaxa+C\int e^{ax} \, dx = \frac{e^{ax}}{a} + C.[13][26] Applying the recursion nn times produces an explicit non-recursive form:
xneaxdx=eaxk=0n(1)kn!(nk)!ak+1xnk+C. \int x^n e^{ax} \, dx = e^{ax} \sum_{k=0}^n (-1)^k \frac{n!}{(n-k)! \, a^{k+1}} x^{n-k} + C.
An equivalent summation, reindexed by letting m=nkm = n - k, is
xneaxdx=eaxk=0n(1)nkn!k!ank+1xk+C. \int x^n e^{ax} \, dx = e^{ax} \sum_{k=0}^n (-1)^{n-k} \frac{n!}{k! \, a^{n-k+1}} x^k + C.
This form highlights the polynomial multiplier to eaxe^{ax}.
nnxneaxdx\int x^n e^{ax} \, dx (up to +C+C)
0eaxa\frac{e^{ax}}{a}
1eax(xa1a2)e^{ax} \left( \frac{x}{a} - \frac{1}{a^2} \right)
2eax(x2a2xa2+2a3)e^{ax} \left( \frac{x^2}{a} - \frac{2x}{a^2} + \frac{2}{a^3} \right)
3eax(x3a3x2a2+6xa36a4)e^{ax} \left( \frac{x^3}{a} - \frac{3x^2}{a^2} + \frac{6x}{a^3} - \frac{6}{a^4} \right)
These explicit expressions follow the general sum and are obtained by direct computation for small nn.[27] A common variant arises when a=1a = -1, yielding xnexdx\int x^n e^{-x} \, dx, which appears in the incomplete gamma function but remains elementary for integer nn via the above formulae. For definite integrals over [0,)[0, \infty) with a>0a > 0, the boundaries eliminate boundary terms in the recursion, giving
0xneaxdx=n!an+1. \int_0^\infty x^n e^{-ax} \, dx = \frac{n!}{a^{n+1}}.
This is a special case of the gamma function representation Γ(n+1)=n!=0xnexdx\Gamma(n+1) = n! = \int_0^\infty x^n e^{-x} \, dx, scaled by the substitution t=axt = ax.[28][29] In contrast, integrals like xnex2dx\int x^n e^{-x^2} \, dx (Gaussian exponential) lack elementary antiderivatives for general nn, though recursive relations exist; for n=0n=0, it relates directly to the error function erf(x)=2π0xet2dt\operatorname{erf}(x) = \frac{2}{\sqrt{\pi}} \int_0^x e^{-t^2} \, dt.[30] Extensions of reduction formulae apply to more complex exponentials combined with special functions, such as Bessel functions, where recursions reduce orders in integrals like xμJν(ax)ebxdx\int x^\mu J_\nu(ax) e^{bx} \, dx. These are cataloged in authoritative compendia for non-elementary evaluations.[31]

References

User Avatar
No comments yet.