Outline of rules for integrands of the form Trig[a + b x]

n
0:
_
u dx
1.
_
Sin[a + b x]
n
dx
1.
_
Sin[a + b x]
n
dx when n > 0
1:
_
Sin[a + b x] dx
2:
_
Sin[a + b x] dx
3.
_
Sin[a + b x]
n
dx when n > 1
1:
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2
e
2.
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2

1:
_
Sin[a + b x]
2
dx
2:
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2

2.
_
Sin[a + b x]
n
dx when n < 0
1:
_
1
Sin[a + b x]
dx
2.
_
Sin[a + b x]
n
dx when n < -1
1:
_
1
Sin[a + b x]
2
dx
2:
_
Sin[a + b x]
n
dx when n < -1 n , -2
3.
_
Sin[a + b x]
n
dx when n
1:
_
Sin[a + b x]
n
dx when n n > 0
2:
_
Sin[a + b x]
n
dx when n (n > 0)
2.
_
Tan[a + b x]
n
dx
1.
_
Tan[a + b x]
n
dx when n z 1
1:
_
Tan[a + b x] dx
2:
_
Tan[a + b x]
n
dx when n > 1
2.
_
Tan[a + b x]
n
dx when n s -1
x:
_
1
Tan[a + b x]
dx
2:
_
Tan[a + b x]
n
dx when n < -1
3.
_
Tan[a + b x]
n
dx when -1 < n < 1
1:
_
Tan[a + b x] dx
2:
_
1
Tan[a + b x]
dx
3:
_
Tan[a + b x]
n
dx when -1 < n < 1
4:
_
Tan[a + b x]
n
dx when n
3.
_
Sec[a + b x]
n
dx
1.
_
Sec[a + b x]
n
dx when n z 1
1:
_
Sec[a + b x] dx
2.
_
Sec[a + b x]
n
dx when n > 1
1.
_
Sec[a + b x]
n
dx when n > 1 _
n
2
e
1:
_
Sec[a + b x]
2
dx
2:
_
Sec[a + b x]
n
dx when n > 1 _
n
2
e
Rules for integrands of the form trig(a+b x)^n 2
2:
_
Sec[a + b x]
n
dx when n > 1 _
n
2

2.
_
Sec[a + b x]
n
dx when n s -1
x:
_
1
Sec[a + b x]
dx
2:
_
Sec[a + b x]
n
dx when n < -1
3:
_
1
Sec[a + b x]
dx
4:
_
Sec[a + b x]
n
dx when n
Rules for integrands of the form trig(a+b x)^n 3
Rules for integrands of the form Trig[a + b x]
n
0:
_
u dx
If[ShowSteps,
Int[u_,x_Symbol] :=
Int[DeactivateTrig[u,x],x] /;
SimplifyFlag && FunctionOfTrigOfLinearQ[u,x],
Int[u_,x_Symbol] :=
Int[DeactivateTrig[u,x],x] /;
FunctionOfTrigOfLinearQ[u,x]]
1.
_
Sin[a + b x]
n
dx
1.
_
Sin[a + b x]
n
dx when n > 0
1:
_
Sin[a + b x] dx
Reference: G&R 2.01.5, CRC 290, A&S 4.3.113
Reference: G&R 2.01.6, CRC 291, A&S 4.3.114
Derivation: Primitive rule
Basis:
x
Cos[a + b x] = -b Sin[a + b x]
Rule:
_
Sin[a + b x] dx - -
Cos[a + b x]
b
Program code:
Int[sin[a_.+b_.+x_],x_Symbol] :=
-Cos[a+b+x]/b /;
FreeQ[{a,b},x]
Int[cos[a_.+b_.+x_],x_Symbol] :=
Sin[a+b+x]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 4
2:
_
Sin[a + b x] dx
Derivation: Primitive rule
Basis:
x
EllipticE]
a+b x
2
, 2 =
b
2
Cos[a + b x]
Rule:
_
Sin[a + b x] dx - -
2
b
EllipticE_

4
-
1
2
(a + b x), 2_
Program code:
Int[Sqrt[sin[a_.+b_.+x_]],x_Symbol] :=
-2+EllipticE[Pi/4-(a+b+x)/2,2]/b /;
FreeQ[{a,b},x]
Int[Sqrt[cos[a_.+b_.+x_]],x_Symbol] :=
2+EllipticE[(a+b+x)/2,2]/b /;
FreeQ[{a,b},x]
3.
_
Sin[a + b x]
n
dx when n > 1
1:
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2
e
Derivation: Integration by substitution
Basis: If
n-1
2
e , then Sin[a + b x]
n
= -
1
b
[1 - Cos[a + b x]
2
|
n-1
2

x
Cos[a + b x]
Rule: If n > 1 _
n-1
2
e , then
_
Sin[a + b x]
n
dx - -
1
b
Subst_
_
[1 - x
2
|
n-1
2
dx, x, Cos[a + b x]_
Program code:
Int[sin[a_.+b_.+x_]^n_,x_Symbol] :=
-1/b+Subst[Int[Expand[(1-x^2)^((n-1)/2),x],x],x,Cos[a+b+x]] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && OddQ[n]
Rules for integrands of the form trig(a+b x)^n 5
Int[cos[a_.+b_.+x_]^n_,x_Symbol] :=
1/b+Subst[Int[Expand[(1-x^2)^((n-1)/2),x],x],x,Sin[a+b+x]] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && OddQ[n]
2.
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2

1:
_
Sin[a + b x]
2
dx
Reference: G&R 2.513.5, CRC 296
Reference: G&R 2.513.11, CRC 302
Derivation: Sine recurrence 3a with A -> 0, B - a, C - b, m - 1, n - -1
Note: Although this is just a special case of the following rule, it is simpler and saves a trivial step.
Rule:
_
Sin[a + b x]
2
dx -
x
2
-
Cos[a + b x] Sin[a + b x]
2 b
Program code:
Int[sin[a_.+b_.+x_]^2,x_Symbol] :=
x/2 - Cos[a+b+x]+Sin[a+b+x]/(2+b) /;
FreeQ[{a,b},x]
Int[cos[a_.+b_.+x_]^2,x_Symbol] :=
x/2 + Cos[a+b+x]+Sin[a+b+x]/(2+b) /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 6
2:
_
Sin[a + b x]
n
dx when n > 1 _
n-1
2

Reference: G&R 2.510.2 with q - 0, CRC 299
Reference: G&R 2.510.5 with p - 0, CRC 305
Derivation: Sine recurrence 3a with A -> 0, B - a, C - b, m - m - 1, n - -1
Rule: If n > 1 _
n-1
2
, then
_
Sin[a + b x]
n
dx - -
Cos[a + b x] Sin[a + b x]
n-1
b n
+
n - 1
n
_
Sin[a + b x]
n-2
dx
Program code:
Int[sin[a_.+b_.+x_]^n_,x_Symbol] :=
-Cos[a+b+x]+Sin[a+b+x]^(n-1)/(b+n) +
(n-1)/n+Int[Sin[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && Not[OddQ[n]]
Int[cos[a_.+b_.+x_]^n_,x_Symbol] :=
Sin[a+b+x]+Cos[a+b+x]^(n-1)/(b+n) +
(n-1)/n+Int[Cos[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && Not[OddQ[n]]
Rules for integrands of the form trig(a+b x)^n 7
2.
_
Sin[a + b x]
n
dx when n < 0
1:
_
1
Sin[a + b x]
dx
Derivation: Primitive rule
Basis:
x
EllipticF]
a+b x
2
, 2 =
b
2 Cos[a+b x]
Rule:
_
1
Sin[a + b x]
dx - -
2 EllipticF]

4
-
1
2
(a + b x), 2
b
Program code:
Int]1/Sqrt[sin[a_.+b_.+x_]],x_Symbol :=
-2+EllipticF[Pi/4-(a+b+x)/2,2]/b /;
FreeQ[{a,b},x]
Int]1/Sqrt[cos[a_.+b_.+x_]],x_Symbol :=
2+EllipticF[(a+b+x)/2,2]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 8
2.
_
Sin[a + b x]
n
dx when n < -1
1:
_
1
Sin[a + b x]
2
dx
Reference: G&R 2.526.2, CRC 308
Reference: G&R 2.526.10, CRC 312
Derivation: Integration by substitution
Basis:
1
Sin[a+b x]
2
= -
1
b

x
Cot[a + b x]
Rule:
_
1
Sin[a + b x]
2
dx - -
Cot[a + b x]
b
Program code:
Int]1/sin[a_.+b_.+x_]^2,x_Symbol :=
-Cot[a+b+x]/b /;
FreeQ[{a,b},x]
Int]1/cos[a_.+b_.+x_]^2,x_Symbol :=
Tan[a+b+x]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 9
2:
_
Sin[a + b x]
n
dx when n < -1 n , -2
Reference: G&R 2.510.3 with q - 0, CRC 309
Reference: G&R 2.510.6 with p - 0, CRC 313
Derivation: Sine recurrence 3a with A -> 0, B - a, C - b, m - m - 1, n - -1 inverted
Rule: If n < -1, then
_
Sin[a + b x]
n
dx -
Cos[a + b x] Sin[a + b x]
n+1
b (n + 1)
+
n + 2
n + 1
_
Sin[a + b x]
n+2
dx
Program code:
Int[sin[a_.+b_.+x_]^n_,x_Symbol] :=
Cos[a+b+x]+Sin[a+b+x]^(n+1)/(b+(n+1)) +
(n+2)/(n+1)+Int[Sin[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1 && n,-2
Int[cos[a_.+b_.+x_]^n_,x_Symbol] :=
-Sin[a+b+x]+Cos[a+b+x]^(n+1)/(b+(n+1)) +
(n+2)/((n+1))+Int[Cos[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1 && n,-2
3.
_
Sin[a + b x]
n
dx when n
1:
_
Sin[a + b x]
n
dx when n n > 0
Note: Although not essential, this rule results in slightly smaller exponents.
Rule: If n A n > 0, then
_
Sin[a + b x]
n
dx - -
Cos[a + b x] Sin[a + b x]
n-1
b [Sin[a + b x]
2
|
n-1
2
Hypergeometric2F1_
1
2
,
1 - n
2
,
3
2
, Cos[a + b x]
2
_
Program code:
Int[sin[a_.+b_.+x_]^n_,x_Symbol] :=
-Cos[a+b+x]+Sin[a+b+x]^(n-1)/(b+(Sin[a+b+x]^2)^((n-1)/2))+
Hypergeometric2F1[1/2,(1-n)/2,3/2,Cos[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]] && RationalQ[n] && n>0
Rules for integrands of the form trig(a+b x)^n 10
Int[cos[a_.+b_.+x_]^n_,x_Symbol] :=
Sin[a+b+x]+Cos[a+b+x]^(n-1)/(b+(Cos[a+b+x]^2)^((n-1)/2))+
Hypergeometric2F1[1/2,(1-n)/2,3/2,Sin[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]] && RationalQ[n] && n>0
2:
_
Sin[a + b x]
n
dx when n (n > 0)
Rule: If n (n > 0), then
_
Sin[a + b x]
n
dx - -
Cos[a + b x] Sin[a + b x]
n+1
b [Sin[a + b x]
2
|
n+1
2
Hypergeometric2F1_
1
2
,
1 - n
2
,
3
2
, Cos[a + b x]
2
_
Program code:
Int[sin[a_.+b_.+x_]^n_,x_Symbol] :=
-Cos[a+b+x]+Sin[a+b+x]^(n+1)/(b+(Sin[a+b+x]^2)^((n+1)/2))+
Hypergeometric2F1[1/2,(1-n)/2,3/2,Cos[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]] && Not[RationalQ[n] && n>0]
Int[cos[a_.+b_.+x_]^n_,x_Symbol] :=
Sin[a+b+x]+Cos[a+b+x]^(n+1)/(b+(Cos[a+b+x]^2)^((n+1)/2))+
Hypergeometric2F1[1/2,(1-n)/2,3/2,Sin[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]] && Not[RationalQ[n] && n>0]
Rules for integrands of the form trig(a+b x)^n 11
2.
_
Tan[a + b x]
n
dx
1.
_
Tan[a + b x]
n
dx when n z 1
1:
_
Tan[a + b x] dx
Reference: G&R 2.526.17, CRC 292, A&S 4.3.115
Reference: G&R 2.526.33, CRC 293, A&S 4.3.118
Derivation: Integration by substitution
Basis: Tan[a + b x] = -
1
b Cos[a+b x]

x
Cos[a + b x]
Rule:
_
Tan[a + b x] dx - -
Log[Cos[a + b x]]
b
Program code:
Int[tan[a_.+b_.+x_],x_Symbol] :=
-Log[RemoveContent[Cos[a+b+x],x]]/b /;
FreeQ[{a,b},x]
Int[cot[a_.+b_.+x_],x_Symbol] :=
Log[RemoveContent[Sin[a+b+x],x]]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 12
2:
_
Tan[a + b x]
n
dx when n > 1
Reference: G&R 2.510.1, CRC 423, A&S 4.3.129
Reference: G&R 2.510.4, CRC 427, A&S 4.3.130
Derivation: Algebraic expansion
Basis: Tan[z]
n
= Sec[z]
2
Tan[z]
n-2
- Tan[z]
n-2
Rule: If n > 1, then
_
Tan[a + b x]
n
dx -
Tan[a + b x]
n-1
b (n - 1)
-
_
Tan[a + b x]
n-2
dx
Program code:
Int[tan[a_.+b_.+x_]^n_,x_Symbol] :=
Tan[a+b+x]^(n-1)/(b+(n-1)) -
Int[Tan[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1
Int[cot[a_.+b_.+x_]^n_,x_Symbol] :=
-Cot[a+b+x]^(n-1)/(b+(n-1)) -
Int[Cot[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1
2.
_
Tan[a + b x]
n
dx when n s -1
x:
_
1
Tan[a + b x]
dx
Note: This rule not necessary since Mathematica automatically simplifies
1
Tan[z]
to Cot[z].
Rule:
_
1
Tan[a + b x]
dx -
_
Cot[a + b x] dx -
Log[Sin[a + b x]]
b
Program code:
(+ Int]1/tan[a_.+b_.+x_],x_Symbol :=
Log[RemoveContent[Sin[a+b+x],x]]/b /;
FreeQ[{a,b},x] +)
Rules for integrands of the form trig(a+b x)^n 13
(+ Int]1/cot[a_.+b_.+x_],x_Symbol :=
-Log[RemoveContent[Cos[a+b+x],x]]/b /;
FreeQ[{a,b},x] +)
2:
_
Tan[a + b x]
n
dx when n < -1
Reference: G&R 2.510.4, CRC 427'
Reference: G&R 2.510.1, CRC 423'
Derivation: Algebraic expansion
Basis: Tan[z]
n
= Sec[z]
2
Tan[z]
n
- Tan[z]
n+2
Rule: If n < -1, then
_
Tan[a + b x]
n
dx -
Tan[a + b x]
n+1
b (n + 1)
-
_
Tan[a + b x]
n+2
dx
Program code:
Int[tan[a_.+b_.+x_]^n_,x_Symbol] :=
Tan[a+b+x]^(n+1)/(b+(n+1)) -
Int[Tan[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1
Int[cot[a_.+b_.+x_]^n_,x_Symbol] :=
-Cot[a+b+x]^(n+1)/(b+(n+1)) -
Int[Cot[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1
Rules for integrands of the form trig(a+b x)^n 14
3.
_
Tan[a + b x]
n
dx when -1 < n < 1
1:
_
Tan[a + b x] dx
Derivation: Algebraic expansion
Basis: z =
1+z
2 z
-
1-z
2 z
Rule:
_
Tan[a + b x] dx -
1
2
_
1 + Tan[a + b x]
Tan[a + b x]
dx -
1
2
_
1 - Tan[a + b x]
Tan[a + b x]
dx
Program code:
Int[Sqrt[tan[a_.+b_.+x_]],x_Symbol] :=
1/2+Int[(1+Tan[a+b+x])/Sqrt[Tan[a+b+x]],x] - 1/2+Int[(1-Tan[a+b+x])/Sqrt[Tan[a+b+x]],x] /;
FreeQ[{a,b},x]
Int[Sqrt[cot[a_.+b_.+x_]],x_Symbol] :=
1/2+Int[(1+Cot[a+b+x])/Sqrt[Cot[a+b+x]],x] - 1/2+Int[(1-Cot[a+b+x])/Sqrt[Cot[a+b+x]],x] /;
FreeQ[{a,b},x]
2:
_
1
Tan[a + b x]
dx
Derivation: Algebraic expansion
Basis:
1
z
=
1+z
2 z
+
1-z
2 z
Rule:
_
1
Tan[a + b x]
dx -
1
2
_
1 + Tan[a + b x]
Tan[a + b x]
dx +
1
2
_
1 - Tan[a + b x]
Tan[a + b x]
dx
Program code:
Int]1/Sqrt[tan[a_.+b_.+x_]],x_Symbol :=
1/2+Int[(1+Tan[a+b+x])/Sqrt[Tan[a+b+x]],x] + 1/2+Int[(1-Tan[a+b+x])/Sqrt[Tan[a+b+x]],x] /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 15
Int]1/Sqrt[cot[a_.+b_.+x_]],x_Symbol :=
1/2+Int[(1+Cot[a+b+x])/Sqrt[Cot[a+b+x]],x] + 1/2+Int[(1-Cot[a+b+x])/Sqrt[Cot[a+b+x]],x] /;
FreeQ[{a,b},x]
3:
_
Tan[a + b x]
n
dx when -1 < n < 1
Derivation: Integration by substitution
Basis: If k e
+
, then Tan[a + b x]
n
=
k
b
Subst_
x
k (n+1)-1
1+x
2 k
, x, Tan[a + b x]
1/k
_
x
Tan[a + b x]
1/k
Note: Comment out this rule if you prefer antiderivative expressed in terms of a single hypergeometric function.
Rule: If -1 < n < 1, let k = Denominator[n], then
_
Tan[a + b x]
n
dx -
k
b
Subst_
_
x
k (n+1)-1
1 + x
2 k
dx, x, Tan[a + b x]
1/k
_
Program code:
Int[tan[a_.+b_.+x_]^n_,x_Symbol] :=
Module[{k=Denominator[n]},
k/b+Subst[Int[x^(k+(n+1)-1)/(1+x^(2+k)),x],x,Tan[a+b+x]^(1/k)]] /;
FreeQ[{a,b},x] && RationalQ[n] && -1<n<1
Int[cot[a_.+b_.+x_]^n_,x_Symbol] :=
Module[{k=Denominator[n]},
-k/b+Subst[Int[x^(k+(n+1)-1)/(1+x^(2+k)),x],x,Cot[a+b+x]^(1/k)]] /;
FreeQ[{a,b},x] && RationalQ[n] && -1<n<1
Rules for integrands of the form trig(a+b x)^n 16
4:
_
Tan[a + b x]
n
dx when n
Derivation: Integration by substitution
Rule: Tan[a + b x]
n
=
Tan[a+b x]
n
b [1+Tan[a+b x]
2
|

x
Tan[a + b x]
Rule: If n , then
_
Tan[a + b x]
n
dx -
1
b
Subst_
_
x
n
1 + x
2
dx, x, Tan[a + b x]_ -
Tan[a + b x]
n+1
b (n + 1)
Hypergeometric2F1_1,
n + 1
2
,
n + 3
2
, -Tan[a + b x]
2
_
Program code:
Int[tan[a_.+b_.+x_]^n_,x_Symbol] :=
Tan[a+b+x]^(n+1)/(b+(n+1))+Hypergeometric2F1[1,(n+1)/2,(n+3)/2,-Tan[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]]
Int[cot[a_.+b_.+x_]^n_,x_Symbol] :=
-Cot[a+b+x]^(n+1)/(b+(n+1))+Hypergeometric2F1[1,(n+1)/2,(n+3)/2,-Cot[a+b+x]^2] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]]
Rules for integrands of the form trig(a+b x)^n 17
3.
_
Sec[a + b x]
n
dx
1.
_
Sec[a + b x]
n
dx when n z 1
1:
_
Sec[a + b x] dx
Reference: G&R 2.526.9, CRC 294, A&S 4.3.117
Reference: G&R 2.526.1, CRC 295, A&S 4.3.116
Derivation: Integration by substitution
Basis: Sec[a + b x] =
1
b [1-Sin[a+b x]
2
|

x
Sin[a + b x]
Rule:
_
Sec[a + b x] dx -
ArcTanh[Sin[a + b x]]
b
Program code:
Int[sec[a_.+b_.+x_],x_Symbol] :=
(+ ArcCoth[Sin[a+b+x]]/b +)
ArcTanh[Sin[a+b+x]]/b /;
FreeQ[{a,b},x]
Int[csc[a_.+b_.+x_],x_Symbol] :=
(+ -ArcCoth[Cos[a+b+x]]/b /; +)
-ArcTanh[Cos[a+b+x]]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 18
2.
_
Sec[a + b x]
n
dx when n > 1
1.
_
Sec[a + b x]
n
dx when n > 1 _
n
2
e
1:
_
Sec[a + b x]
2
dx
Reference: G&R 2.526.10, CRC 312
Reference: G&R 2.526.2, CRC 308
Derivation: Integration by substitution
Basis: Sec[a + b x]
2
=
1
b

x
Tan[a + b x]
Note: Although this is just a special case of the following rule, it is simpler and saves a trivial step.
Rule:
_
Sec[a + b x]
2
dx -
Tan[a + b x]
b
Program code:
Int[sec[a_.+b_.+x_]^2,x_Symbol] :=
Tan[a+b+x]/b /;
FreeQ[{a,b},x]
Int[csc[a_.+b_.+x_]^2,x_Symbol] :=
-Cot[a+b+x]/b /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 19
2:
_
Sec[a + b x]
n
dx when n > 1 _
n
2
e
Derivation: Integration by substitution
Basis: If
n
2
e , then Sec[a + b x]
n
=
1
b
[1 + Tan[a + b x]
2
|
n
2
-1

x
Tan[a + b x]
Note: This rule is used for even n since it requires fewer steps and results in a simpler antiderivative than the recursive rule.
Rule: If n > 1 _
n
2
e , then
_
Sec[a + b x]
n
dx -
1
b
Subst_
_
[1 + x
2
|
n
2
-1
dx, x, Tan[a + b x]_
Program code:
Int[sec[a_.+b_.+x_]^n_,x_Symbol] :=
1/b+Subst[Int[ExpandIntegrand[(1+x^2)^(n/2-1),x],x],x,Tan[a+b+x]] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && EvenQ[n]
Int[csc[a_.+b_.+x_]^n_,x_Symbol] :=
-1/b+Subst[Int[ExpandIntegrand[(1+x^2)^(n/2-1),x],x],x,Cot[a+b+x]] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && EvenQ[n]
2:
_
Sec[a + b x]
n
dx when n > 1 _
n
2

Reference: CRC 313
Reference: CRC 309
Derivation: Secant recurrence 3a with A -> 0, B - a, C - b, m - m - 1, n - -1
Rule: If n > 1 _
n
2
, then
_
Sec[a + b x]
n
dx -
Sin[a + b x] Sec[a + b x]
n-1
b (n - 1)
+
n - 2
n - 1
_
Sec[a + b x]
n-2
dx
Program code:
Int[sec[a_.+b_.+x_]^n_,x_Symbol] :=
Sin[a+b+x]+Sec[a+b+x]^(n-1)/(b+(n-1)) +
(n-2)/(n-1)+Int[Sec[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && Not[EvenQ[n]]
Rules for integrands of the form trig(a+b x)^n 20
Int[csc[a_.+b_.+x_]^n_,x_Symbol] :=
-Cos[a+b+x]+Csc[a+b+x]^(n-1)/(b+(n-1)) +
(n-2)/(n-1)+Int[Csc[a+b+x]^(n-2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n>1 && Not[EvenQ[n]]
2.
_
Sec[a + b x]
n
dx when n s -1
x:
_
1
Sec[a + b x]
dx
Note: This rule not necessary since Mathematica automatically simplifies
1
Sec[z]
to Cos[z].
Rule:
_
1
Sec[a + b x]
dx -
_
Cos[a + b x] dx -
Sin[a + b x]
b
Program code:
(+ Int]1/sec[a_.+b_.+x_],x_Symbol :=
Sin[a+b+x]/b /;
FreeQ[{a,b},x] +)
(+ Int]1/csc[a_.+b_.+x_],x_Symbol :=
-Cos[a+b+x]/b /;
FreeQ[{a,b},x] +)
Rules for integrands of the form trig(a+b x)^n 21
2:
_
Sec[a + b x]
n
dx when n < -1
Reference: CRC 305
Reference: CRC 299
Derivation: Secant recurrence 1a with A - 1, B - 0, C - 0, n - 0
Rule: If n < -1, then
_
Sec[a + b x]
n
dx - -
Sin[a + b x] Sec[a + b x]
n+1
b n
+
n + 1
n
_
Sec[a + b x]
n+2
dx
Program code:
Int[sec[a_.+b_.+x_]^n_,x_Symbol] :=
-Sin[a+b+x]+Sec[a+b+x]^(n+1)/(b+n) +
(n+1)/n+Int[Sec[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1
Int[csc[a_.+b_.+x_]^n_,x_Symbol] :=
Cos[a+b+x]+Csc[a+b+x]^(n+1)/(b+n) +
(n+1)/n+Int[Csc[a+b+x]^(n+2),x] /;
FreeQ[{a,b},x] && RationalQ[n] && n<-1
3:
_
1
Sec[a + b x]
dx
Derivation: Piecewise constant extraction
Basis:
x
F[x] F[x]
-1
= 0
Rule:
_
1
Sec[a + b x]
dx - Cos[a + b x] Sec[a + b x]
_
Cos[a + b x] dx
Program code:
Int]1/Sqrt[sec[a_.+b_.+x_]],x_Symbol :=
Sqrt[Cos[a+b+x]]+Sqrt[Sec[a+b+x]]+Int[Sqrt[Cos[a+b+x]],x] /;
FreeQ[{a,b},x]
Rules for integrands of the form trig(a+b x)^n 22
Int]1/Sqrt[csc[a_.+b_.+x_]],x_Symbol :=
Sqrt[Csc[a+b+x]]+Sqrt[Sin[a+b+x]]+Int[Sqrt[Sin[a+b+x]],x] /;
FreeQ[{a,b},x]
4:
_
Sec[a + b x]
n
dx when n
Derivation: Piecewise constant extraction
Basis:
x
[F[x]
n
[F[x]
-1
|
n
| = 0
Rule: If n , then
_
Sec[a + b x]
n
dx - Cos[a + b x]
n
Sec[a + b x]
n
_
1
Cos[a + b x]
n
dx
Program code:
Int[sec[a_.+b_.+x_]^n_,x_Symbol] :=
Cos[a+b+x]^n+Sec[a+b+x]^n+Int[1/Cos[a+b+x]^n,x] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]]
Int[csc[a_.+b_.+x_]^n_,x_Symbol] :=
Sin[a+b+x]^n+Csc[a+b+x]^n+Int[1/Sin[a+b+x]^n,x] /;
FreeQ[{a,b,n},x] && Not[IntegerQ[n]]
Rules for integrands of the form trig(a+b x)^n 23