<img src="https://d5nxst8fruw4z.cloudfront.net/atrk.gif?account=iA1Pi1a8Dy00ym" style="display:none" height="1" width="1" alt="" />
Skip Navigation
You are reading an older version of this FlexBook® textbook: CK-12 Probability and Statistics Concepts Go to the latest version.

Chapter 8: Combinations and Permutations

Difficulty Level: At Grade Created by: CK-12

The mathematics of combinations, “combinatorics”, is a study in it’s own right, but it is also an important part of the mathematics of probability. There are two basic divisions of combinatorics: permutations, which are groupings of items where the order of the items is important, and combinations, where only the identity of the items is important, regardless of the order in which they appear.

A combination lock is actually a permutation lock

In this chapter, you will study both kinds of groupings, and you will learn to calculate the number of possible unique ways to combine or arrange items of all kinds.

Chapter Outline

Chapter Summary

Students were introduced to the concepts of combinatorics. The differences between permutations and combinations were discussed. Students practiced the use of the formulas for calculating the number of possible combinations or permutations in various situations allowing or disallowing repeats and/or indistinguishable members.

Image Attributions


Difficulty Level:

At Grade

Date Created:

Jun 17, 2013

Last Modified:

Jan 26, 2015
Files can only be attached to the latest version of chapter
Please wait...
Please wait...
Image Detail
Sizes: Medium | Original

Original text