0% found this document useful (0 votes)
195 views2 pages

Reduction Formula Example

1. This document presents reduction formulas for integrals of the form ∫(x2 + 1)n dx, where n is an integer constant. 2. It derives two recursive formulas: one for positive n and one for negative n. 3. As an example, it uses the formulas to evaluate ∫(x2 + 1)2 dx and ∫(x2 + 1)-2 dx.

Uploaded by

Er Puneet Goyal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
195 views2 pages

Reduction Formula Example

1. This document presents reduction formulas for integrals of the form ∫(x2 + 1)n dx, where n is an integer constant. 2. It derives two recursive formulas: one for positive n and one for negative n. 3. As an example, it uses the formulas to evaluate ∫(x2 + 1)2 dx and ∫(x2 + 1)-2 dx.

Uploaded by

Er Puneet Goyal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

REDUCTION FORMULA, AN EXAMPLE

Reduction formula for x2 + 1 We try to match with and v = x. So x2 + 1


n n

dx (n is a constant)
n n1

udv . Choose u = (x2 + 1) and dv = dx then du = n (x2 + 1)

2x

dx =

x2 + 1

x
n

x n x2 + 1 x2 x2 + 1 x2 + 1

n1

2xdx dx
n1

= x x2 + 1 = x x2 + 1

2n 2n

n1

x2 + 1

dx

[we use x2 = x2 + 1 1 above] = x x2 + 1 So, rearranging we have (2n + 1) x2 + 1


n n

2n

x2 + 1

dx + 2n

x2 + 1

n1

dx

dx = x x2 + 1

2n

x2 + 1

n1

dx.

Hence, we have two recursive formulae: x +1 and x +1


2 n1 2 n

x (x2 + 1) 2n dx = 2n + 1 2n + 1

x2 + 1

n1

1 dx (n = ), 2

x (x2 + 1) 2n + 1 dx = 2n 2n

x2 + 1

dx (n = 0).

In application, the rst formula is for positive n, the second is for negative n. Example: To nd x2 + 1
2

dx, [this is a polynomial, we can expand the bracket, (x2 + 1) =


1

x4 + 2x2 + 1] or if we want to use a recursive formula, especially for bigger power, we can use

REDUCTION FORMULA, AN EXAMPLE

the rst formula with n = 2: x2 + 1


2

dx =

x (x2 + 1) 4 5 5

x2 + 1 dx =

x (x2 + 1) 4 5 5

x3 +x +C 3

Example: To nd (x2 dx = + 1)2 x2 + 1


2

dx

we can use the second formula with n = 1: x2 + 1


2

dx =

1 x (x2 + 1) x2 + 1 2 2 x dx 1 = 2 2 2 (x + 1) 2 x +1 x 1 arctan x + C. 2 (x2 + 1) 2

dx

You might also like