prove that : a) n!=n(n-1)n-2! ; b) (n+2) n!=n!+n+1!
Answers
Answered by
4
Answer:
order by
up vote
8
down vote
accepted
Suppose that when n=k (k≥4), we have that k!>2k.
Now, we have to prove that (k+1)!>2k+1 when n=(k+1)(k≥4).
(k+1)!=(k+1)k!>(k+1)2k (since k!>2k)
That implies (k+1)!>2k⋅2 (since (k+1)>2 because of k is greater than or equal to 4)
Therefore, (k+1)!>2k+1
Finally, we may conclude that n!>2n for all integers n≥4
i hope it is help you...................
please brainlylist me and follow me please ❤❤❤❤
Answered by
6
Answer:
your answer is in the attachment
Step-by-step explanation:
hope it's help you XD
Attachments:
Similar questions