For (2), start with the base case. When n = 2, we have
(n + 1)! = (2 + 1)! = 3! = 6
2ⁿ = 2² = 4
6 > 4, so the case of n = 2 is true.
Now assume the inequality holds for n = k, so that
(k + 1)! > 2ᵏ
Under this hypothesis, we want to show the inequality holds for n = k + 1. By definition of factorial, we have
((k + 1) + 1)! = (k + 2)! = (k + 2) (k + 1)!
Then by our hypothesis,
(k + 2) (k + 1)! > (k + 2) 2ᵏ = k•2ᵏ + 2ᵏ⁺¹
and k•2ᵏ ≥ 2•2² = 8, so
k•2ᵏ + 2ᵏ⁺¹ ≥ 8 + 2ᵏ⁺¹ > 2ᵏ⁺¹
which proves the claim.
Unfortunately, I can't help you with (3). Sorry!
Answer:
B
Step-by-step explanation:
I believe it is B because it is the only one that doesnt have x values that repeat and give different answers.
Ex. For a, the x value in the first and third coords gives both 1 and 3 as answers.
Every x has to have a unique y value, so
(2,10) (3,12) is ok, but (2,10) (2,12) is not.
Sorry if this doesnt make sense haha
Answer:
1st : neither linear nor nonlinear
2nd: nonlinear
3rd: linear
4th: both linear and nonlinear
Type max and for the vertex (1/2, -1)
Answer:
C.
Step-by-step explanation:
You are multiplying $7 by c calculators.
