Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 5 - Section 5.4 - Recursive Algorithms - Exercises - Page 370: 2

Answer

$1! = 1 . 1 = 1$, $2! = 2 . 1! = 2 · 1 = 2$, $3! = 3 . 2! = 3 · 2 = 6$, $4! = 4 . 3! = 4 · 6 = 24$, $5! = 5 . 4! = 5 · 24 = 120$ and $6! = 6 . 5! = 6 . 120 = 720$

Work Step by Step

First, we use the recursive step to write $6! = 6 . 5!$ We then use the recursive step repeatedly to write $5!= 5 . 4!$; $4! = 4 . 3!$; $3! = 3 . 2!$; $2! = 2 . 1!$; and $1! = 1 . 0!$ Inserting the value of $0! = 1$, and working back through the steps, we see that $1! = 1 . 1 = 1$, $2! = 2 . 1! = 2 · 1 = 2$, $3! = 3 . 2! = 3 · 2 = 6$, $4! = 4 . 3! = 4 · 6 = 24$, $5! = 5 . 4! = 5 · 24 = 120$ and $6! = 6 . 5! = 6 . 120 = 720$
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.