Joestat wants you to complete the following combination TI-84 and TI-83 examples. Joestat owns 8 distinguishable movies.
Problem 1 : 5 of the movies of the 8 are selected. How many ways 5 movies be selected?
(Note: Since the question give no on order mattering, we can assume that order doesn’t matter and we are working with a combination.)
Problem 1 : Solution
First verify that it is a combination problem:
- Selecting a number of objects (r) from the the total (n)
- Order Doesn’t Matters
- Items are distinguishable from another.
n = 8
r = 5
Using the TI-84 or TI-83 calculator to compute the combination problem:
| [ 8 ] | [MATH] | [ LEFT ] | [ 3 ] | [ 5 ] | [ENTER] |
Congratulations, in this example you have successfully solved a combination problem using your TI-84 and Ti-83 calculator. If you follow the instructions you should be able to solve all simple combinations.
Last Modified on September 7, 2013 by