3.4: Summary

Combinatorics · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY-NC-SA, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    • The number of \(r\)-permutations of \(n\) objects is \(\dfrac{n!}{(n − r)!}\).
    • The number of \(r\)-combinations of \(n\) objects is \(\binom{n}{r} = \dfrac{n!}{r!(n−r)!}\).
    • The Binomial Theorem
    • Important definitions:
      • permutation, \(r\)-permutation
      • \(n\) factorial
      • \(r\)-combination
      • \(n\) choose \(r\)
      • binomial coefficients
    • Notation:
      • \(n!\)
      • \(\binom{n}{r}\)

    This page titled 3.4: Summary was last modified on Tue, 01 Sep 2026 03:36:10 GMT and is shared under a CC BY-NC-SA license and was authored, remixed, and/or curated by Joy Morris.