Skip to content

Part1: Combinatorics: Fix formatting #88

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nparikh1129 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Part1: Combinatorics: Fix formatting #88

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions chapters/part1/combinatorics/index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ <h2 id="perm_distinct">Permutations of Distinct Objects</h2>
<div class="bordered">
<p><b><i>Definition</i></b>: Permutation Rule</p>

<p>A permutation is an ordered arrangement of n distinct objects. Those $n$ objects can
<p>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.</p>
</div>
</p>
Expand Down Expand Up @@ -194,7 +194,7 @@ <h2 id="comb_distinct">Combinations of Distinct Objects</h2>
<div class="bordered">
<p><b><i>Definition</i></b>: Combinations</p>

<p>A combination is an unordered selection of r objects from a set of n objects. If all objects
<p>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:</p>
<p class="mathLeft">
$$
Expand Down