CAIE
FP1
2009
June
Q7
8 marks
Challenging +1.2
7 Let
$$I _ { n } = \int _ { 0 } ^ { 1 } t ^ { n } \mathrm { e } ^ { - t } \mathrm {~d} t$$
where \(n \geqslant 0\). Show that, for all \(n \geqslant 1\),
$$I _ { n } = n I _ { n - 1 } - \mathrm { e } ^ { - 1 }$$
Hence prove by induction that, for all positive integers \(n\),
$$I _ { n } < n ! .$$
CAIE
FP1
2010
June
Q5
9 marks
Challenging +1.2
5 Let
$$I _ { n } = \int _ { 1 } ^ { \mathrm { e } } x ( \ln x ) ^ { n } \mathrm {~d} x$$
where \(n \geqslant 1\). Show that
$$I _ { n + 1 } = \frac { 1 } { 2 } \mathrm { e } ^ { 2 } - \frac { 1 } { 2 } ( n + 1 ) I _ { n }$$
Hence prove by induction that, for all positive integers \(n , I _ { n }\) is of the form \(A _ { n } \mathrm { e } ^ { 2 } + B _ { n }\), where \(A _ { n }\) and \(B _ { n }\) are rational numbers.
CAIE
FP1
2012
November
Q5
8 marks
Challenging +1.2
5 Let \(I _ { n }\) denote \(\int _ { 0 } ^ { \infty } x ^ { n } \mathrm { e } ^ { - 2 x } \mathrm {~d} x\). Show that \(I _ { n } = \frac { 1 } { 2 } n I _ { n - 1 }\), for \(n \geqslant 1\).
Prove by mathematical induction that, for all positive integers \(n , I _ { n } = \frac { n ! } { 2 ^ { n + 1 } }\).