College Algebra (6th Edition)

Published by Pearson
ISBN 10: 0-32178-228-3
ISBN 13: 978-0-32178-228-1

Chapter 8 - Sequences, Induction, and Probability - Exercise Set 8.1 - Page 716: 77

Answer

calculate n! by multiplying all positive integers from $n$ down through 1.

Work Step by Step

See p.709: If $n$ is a positive integer, the notation $n!$ (read $n$ factorial'') is the product of all positive integers from $n$ down through 1. $n!=n(n-1)(n-2)\cdots(3)(2)(1)$ Note: $0!$ (zero factorial), by definition, is 1. $0!=1$ ------------------ If n is a positive integer (it is not zero, then), calculate n! by multiplying all positive integers from $n$ down through 1.
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.