Precalculus: Concepts Through Functions, A Unit Circle Approach to Trigonometry (3rd Edition)

Published by Pearson
ISBN 10: 0-32193-104-1
ISBN 13: 978-0-32193-104-7

Chapter 12 - Counting and Probability - Section 12.2 Permutations and Combinations - 12.2 Assess Your Understanding - Page 874: 6

Answer

$C(n, r)=\dfrac{n!}{(n-r)!r!}$

Work Step by Step

If we want to arrange $r$ elements out of $n$ where order does not matter (which is called combination), not allowing repetition, we can do this in $C(n, k)=\dfrac{n!}{(n-r)!r!}$ different ways.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.