From 12a08c18b8fdaeada77ab60fe2d8bc9b9c7afa65 Mon Sep 17 00:00:00 2001 From: Neel Parikh Date: Fri, 15 Nov 2024 19:20:19 -0800 Subject: [PATCH] Part1: Combinatorics: Fix formatting --- chapters/part1/combinatorics/index.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/chapters/part1/combinatorics/index.html b/chapters/part1/combinatorics/index.html index 7d4e2171..f6d8cbb2 100644 --- a/chapters/part1/combinatorics/index.html +++ b/chapters/part1/combinatorics/index.html @@ -26,7 +26,7 @@

Permutations of Distinct Objects

Definition: Permutation Rule

-

A permutation is an ordered arrangement of n distinct objects. Those $n$ objects can +

A permutation is an ordered arrangement of $n$ distinct objects. Those $n$ objects can be permuted in $n \cdot (n – 1) \cdot (n – 2) \cdots 2 \cdot 1 = n!$ ways.

@@ -194,7 +194,7 @@

Combinations of Distinct Objects

Definition: Combinations

-

A combination is an unordered selection of r objects from a set of n objects. If all objects +

A combination is an unordered selection of $r$ objects from a set of $n$ objects. If all objects are distinct, and objects are not "replaced" once selected, then the number of ways of making the selection is:

$$