Abstract
The factorial function is defined by
\(n! = 1 \cdot 2 \cdot ... \cdot n = \begin{array}{c} \prod \\ {1 \leq i \leq n} \\ \end{array} i\), for integers nāā„ā0.
As the empty product has value 1, we have 0! = 1! = 1. Further, 2! = 2, 3! = 6, 4! = 24, and so on. In combinatorics, n! is known to be the number of permutations of {1, . . . , n}, i.e., the number of ways in which n different objects can be arranged as a sequence.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
Ā© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dietzfelbinger, M. (2004). A. Appendix. In: Primality Testing in Polynomial Time. Lecture Notes in Computer Science, vol 3000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25933-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-25933-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40344-9
Online ISBN: 978-3-540-25933-6
eBook Packages: Springer Book Archive