Question 9 and 10 please help it’s due today and I will mark you brainless
1 answer:
You might be interested in
<h2>Answer with explanation:</h2>
We are asked to prove by the method of mathematical induction that:
where n is a positive integer.
- Let us take n=1
then we have:
Hence, the result is true for n=1.
- Let us assume that the result is true for n=k
i.e.
- Now, we have to prove the result for n=k+1
i.e.
<u>To prove:</u>
Let us take n=k+1
Hence, we have:
( Since, the result was true for n=k )
Hence, we have:
Also, we know that:
(
Since, for n=k+1 being a positive integer we have:
)
Hence, we have finally,
Hence, the result holds true for n=k+1
Hence, we may infer that the result is true for all n belonging to positive integer.
i.e.
where n is a positive integer.
Answer:
1. 144 2. 16 3. 1 4. 3x-6
Step-by-step explanation:
So think of this as a function in a function. So you work from the inside to the outside. So for problem 1, we start with f(4)) [you read it "f of 4"] so what is the solution when x = 4, since f(x) means the function of x so f(4) means 'the function of 4' inside f(x).
Since f(x) = 3x then f(4) = 3(4) [notice how you substitute the 4 everywhere you see a letter x]
so f(4) = 12, now you work the next part h(f(4)) since f(4)=12 then h(12)
So take the h(x) function which is h(x) = then h(12) =
so h(12) = 144