Ok but where is the options?
Answer:
See proof below
Step-by-step explanation:
The inductive proof consists on the following steps:
1) Base case: for n=0, we will prove that Γ(1)=0!=1. We have that
Hence the base case holds.
2) Inductive step: suppose that Γ(n + 1) = n! for some natural number n. We will prove that Γ((n + 1)+1) = (n+1)!
Use integration by parts, with the following parts:
u=t^{n+1}, du=(n+1)t^n
dv=e^{-t}, v=-e^{-t}
and we used the induction hypotheses on this last line. Also, -t^n e^-t tends to zero as n tends to infiity (the exponential decays faster than any polynomial).
We have proved the statement for n+1, and by mathematical induction, the statement holds for all n.
10 cubed times 300 equals 1,600
Answer:
(x - 7)(x - 4)(x + 4).
Step-by-step explanation:
A(x) = x3 – 7x² – 16x +112
Dividing by x-7:
x^2 - 16 <-------- Quotient
-----------------------------
x-7)x^3 - 7x^2 - 16x + 112
x^3 - 7x^2
0 - 16x + 112
- 16x + 112
..............
so A(x) = (x - 7)(x^2 - 16) x^2 - 16 is the difference of 2 squares so we have:
(x - 7)(x - 4)(x + 4).
Checking by expanding the brackets:
(x - 7)(x - 4)(x + 4)
= x(x - 4)(x + 4) - 7(x - 4)(x + 4)
= x(x^2 - 16) - 7(x^2 - 16)
= x^3 - 16x - 7x^2 + 114
= x^3 - 7x^2 - 16x + 112