Permutations Notes Spring

# Permutations Notes Spring - 2 of 6 1.2 Permutations and...

This preview shows pages 1–4. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

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

Unformatted text preview: 2 of 6 1.2 Permutations and Combinations n items can be arranged in n ! ways. Factorial: factorial(x) Finds x ! (There is a limitation on how large x can be. a ) a The factorial function cannot compute values beyond x ≈ 170 due to how it’s implemented using the gamma function. The lfactorial(x) function can do larger numbers, it returns ln( x !). R Command Example 1 . To find 10! in R: R: f a c t o r i a l (10) [ 1 ] 3628800 1.2 Permutations and Combinations PERMUTATIONS Question 2 . How many ways can you select k = 4 students out of n = 10 when order matters? Anthony Tanbakuchi MAT167 Permutations and Combinations 3 of 6 Permutations. Definition 1.3 The number of ways (permutations) that you can select k items from n total items (all unique) when order matters is: n P k = n ! ( n- k )! (2) COMBINATIONS Question 3 . How many ways can you select k = 4 students out of n = 10 when order does not matter? (Hint: how many ways can you arrange 4 items?) Anthony Tanbakuchi MAT167 4 of 6 1.3 Summary1....
View Full Document

## This note was uploaded on 02/10/2012 for the course MAT 1670 taught by Professor Tanbakuchi during the Spring '11 term at University of Florida.

### Page1 / 5

Permutations Notes Spring - 2 of 6 1.2 Permutations and...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online