Joestat wants to help you solve the following Permutation example problem using your TI-84 or TI-83 calculator.

Problem 1 : 5 of the movies of the 8 are selected. How many ways can of the 5 movies be selected?

Problem 2 : How many ways can the letters of Mississippi be arranged?

Problem 1 : Solution

First verify the example problem is a permutations:

- Selecting a number of objects (r) from the the total (n)

Without Replacement

(Check) - Order Matters

(Check) - Items are distinguishable from another.

(TYPE) Use:

n = 8

r = 5

Using the TI-84 or TI-83 calculator to compute the permutation:

| [ 8 ] | [MATH] | [ < ] | [ 2 ] | [ 5 ] | [ENTER] |

Problem 2 : Solution

First verify the example problem is a permutations:

- Selecting a number of objects (r) from the the total (n)

Without Replacement

(Check) - Order Matters

(Check) - Items all items are distinguishable from another.

(TYPE) Use:

n1=1

n1=1 (number of M(s) in Mississippi)

n2=4 (number of i(s) in Mississippi)

n3=4 (number of s(s) in Mississippi)

n4=2 (number of p(s) in Mississippi)

Using the TI-84 or TI-83 calculator to compute the permutation not all items distinguishable from another:

| [ 1 ] | [ 1 ] | [MATH] | [ < ] | [ 4 ] | [ / ] | [ ( ] | [ 1 ] | [MATH] | [ < ] | [ 4 ] | [ 4 ] | [MATH] | [ < ] | [ 4 ] | [ 4 ] | [MATH] | [ < ] | [ 4 ] | [ 2 ] | [MATH] | [ < ] | [ 4 ] | [ ) ] | [ENTER] |

Congratulations, you have successfully completed the two basic types of permutations with in this Permutation TI-84 | TI-83 example problem.

Last Modified on September 7, 2013 by Joseph Schumacher
## Leave a Reply