gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fixed Formatting (#24574)

Browse Source 
Gave better visual representations of equations
This commit is contained in:
Jake Levenson
2019-03-06 12:01:31 -05:00
committed by The Coding Aviator
parent 6eaacf526c
commit 83dd3ba7d8
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
guide/english/mathematics/combinations-and-permutations/index.md
View File

@ -10,19 +10,19 @@ title: Combinations and Permutations
This is an example of a permutation. A permutation is the number of different ordered possibilities that can occur in a given situation. A permutation can be with or without repetition, as can a combination. If we say that there is a permutation for n things with r possibilities, the formulae will be: This is an example of a permutation. A permutation is the number of different ordered possibilities that can occur in a given situation. A permutation can be with or without repetition, as can a combination. If we say that there is a permutation for n things with r possibilities, the formulae will be:
#####**With Repetition:** **With Repetition:**
n^r <a href="https://www.codecogs.com/eqnedit.php?latex=n^r" target="_blank"><img src="https://latex.codecogs.com/gif.latex?n^r" title="n^r" /></a>
#####**Without Repetition:** **Without Repetition:**
n\!/(n-r)\! <a href="https://www.codecogs.com/eqnedit.php?latex=\frac{&space;n!}{(n-r)!}" target="_blank"><img src="https://latex.codecogs.com/gif.latex?\frac{&space;n!}{(n-r)!}" title="\frac{ n!}{(n-r)!}" /></a>
Returning to the problem at the top, what if they were sitting in three identical chairs instead of having rankings? This is an example of a combination. In a combination, order doesn't matter. Therefore, every permutation of the same combination has to be eliminated. This creates two more formulae: Returning to the problem at the top, what if they were sitting in three identical chairs instead of having rankings? This is an example of a combination. In a combination, order doesn't matter. Therefore, every permutation of the same combination has to be eliminated. This creates two more formulae:
#####**With Repetition:** **With Repetition:**
(r+n-1)\!/(r\!(n-1)\!) <a href="https://www.codecogs.com/eqnedit.php?latex=\frac{(r&plus;n-1)!}{r!(n-1)!}" target="_blank"><img src="https://latex.codecogs.com/gif.latex?\frac{(r&plus;n-1)!}{r!(n-1)!}" title="\frac{(r+n-1)!}{r!(n-1)!}" /></a>
#####**Without Repetition:** **Without Repetition:**
n\!/(r\!(n-r)\!) <a href="https://www.codecogs.com/eqnedit.php?latex=\frac{n!}{r!(n-r)!}" target="_blank"><img src="https://latex.codecogs.com/gif.latex?\frac{n!}{r!(n-r)!}" title="\frac{n!}{r!(n-r)!}" /></a>
###Sources ###Sources