Scribd
Upload
47 views18 pages

Permutation and Combination

The factorial of a non-negative integer n, denoted by n!, is the product of all positive integers up to n, with the special case that 0! equals 1. Factorials are used to determine the number of arrangements of distinct items, exemplified by the arrangement of 3 different books which can be done in 6 ways (3!).

Uploaded by

ezekiel nyamu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
47 views18 pages

Permutation and Combination

The factorial of a non-negative integer n, denoted by n!, is the product of all positive integers up to n, with the special case that 0! equals 1. Factorials are used to determine the number of arrangements of distinct items, exemplified by the arrangement of 3 different books which can be done in 6 ways (3!).

Uploaded by

ezekiel nyamu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

1. Factorial (!

)
The factorial of a non-negative integer n, denoted by n!, is the product of all positive
integers less than or equal to n.

Definition: For a positive integer n: n!=n×(n−1)×(n−2)×⋯×3×2×1

Special Case: 0!=1 (This is a definition that helps formulas work consistently).

Examples:

 1!=1
 2!=2×1=2
 3!=3×2×1=6
 4!=4×3×2×1=24
 5!=5×4×3×2×1=120

Application: Factorials are used to calculate the number of ways to arrange a set of
distinct items in a sequence. If you have n distinct items, there are n! ways to arrange
them.

Example: How many ways can 3 different books be arranged on a shelf? 3!=3×2×1=6
ways.

You might also like