Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 11 - Counting Methods and Probability Theory - 11.2 Permutations - Concept and Vocabulary Check - Page 700: 5

Answer

False. $8!=8(7)(6)(5)(4)(3)(2)(1)$

Work Step by Step

See: Factorial Notation, page 696. $n!=n(n-1)(n-2)\cdots(3)(2)(1)$ and $0!=1$ -------------- The statement is false. To make it true, change each addition sign to multiplication
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.