3 basic counting rule permutations combinations

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: e; Permutations; Combinations Factorial Definition The factorial of a non–negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. Example: 5! = 5 × 4 × 3 × 2 × 1 = 120 Basic Counting Rules Permutations Combinations Convention: 0! = 1 4.4 Notes Permutation Definition (Permutation) Basic Counting Rule; Permutations; Combinations Notes A permutation of r objects from a collection of n objects is any ordered arrangement of r distinct objects from the n objects. Notation: (n)r or n Pr Formula: (n)r = n! (n−r )! Basic Counting Rules Permutations Combinations The special permutation rule states that anything permute itself is equivalent to itself factorial. Example: (3)3...
View Full Document

This note was uploaded on 01/24/2014 for the course STAT 225 taught by Professor Martin during the Spring '08 term at Purdue University-West Lafayette.

Ask a homework question - tutors are online