#2
#3
Need help for my discrete math class

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!

he has now walked a total of what?

if i know what this is maybe i can

step-by-step explanation: