Afrikaans
Akan
Albanian
Amharic
Arabic
Armenian
Azerbaijani
Basque
Belarusian
Bemba
Bengali
Bihari
Bosnian
Breton
Bulgarian
Cambodian
Catalan
Cebuano
Cherokee
Chichewa
Chinese (Simplified)
Chinese (Traditional)
Corsican
Croatian
Czech
Danish
Dutch
English
Esperanto
Estonian
Ewe
Faroese
Filipino
Finnish
French
Frisian
Ga
Galician
Georgian
German
Greek
Guarani
Gujarati
Haitian Creole
Hausa
Hawaiian
Hebrew
Hindi
Hmong
Hungarian
Icelandic
Igbo
Indonesian
Interlingua
Irish
Italian
Japanese
Javanese
Kannada
Kazakh
Kinyarwanda
Kirundi
Kongo
Korean
Krio (Sierra Leone)
Kurdish
Kurdish (Soranรฎ)
Kyrgyz
Laothian
Latin
Latvian
Lingala
Lithuanian
Lozi
Luganda
Luo
Luxembourgish
Macedonian
Malagasy
Malay
Malayalam
Maltese
Maori
Marathi
Mauritian Creole
Moldavian
Mongolian
Myanmar (Burmese)
Montenegrin
Nepali
Nigerian Pidgin
Northern Sotho
Norwegian
Norwegian (Nynorsk)
Occitan
Oriya
Oromo
Pashto
Polish
Portuguese (Brazil)
Portuguese (Portugal)
Punjabi
Quechua
Romanian
Romansh
Runyakitara
Russian
Samoan
Scots Gaelic
Serbian
Serbo-Croatian
Sesotho
Setswana
Seychellois Creole
Shona
Sindhi
Sinhalese
Slovak
Slovenian
Somali
Spanish
Spanish (Latin American)
Sundanese
Swahili
Swedish
Tajik
Tamil
Tatar
Telugu
Thai
Tigrinya
Tonga
Tshiluba
Tumbuka
Turkish
Turkmen
Twi
Uighur
Ukrainian
Urdu
Uzbek
Vietnamese
Welsh
Wolof
Xhosa
Yiddish
Yoruba
Zulu
Narrator: Hello, everyone.
The purpose of this video is
to briefly summarize what we learned about combinatorics
in this part of the course.
Okay, we use permutations with variations
when we must arrange a set of objects.
In such cases, the order in which we pick them is crucial.
The major difference between the two is
that, in permutations,
you always arrange the entire set of elements
in the sample space.
For instance, we would use permutations
when we need to arrange the four runners
we have already chosen for our relay.
We have four runners and four positions.
So we rely on permutations.
If, however, we had to pick four out of six people
on the team
and then decide who runs which leg,
we would require using variations.
Alternatively, if we only care
about which four out of the six runners made it
into the team,
we would be dealing with combinations.
In this instance, we do not care who runs which leg.
So order is irrelevant.
Perfect.
Another important topic we discussed is
that there are two types of variations and combinations,
with and without repetition.
When we explore those without repetition,
we see a clear relationship between permutations,
variations, and combinations.
The number of combinations equals the number of variations
divided by the number of permutations.
That is because we count
all the permutations of a given set of numbers
as a single combination,
but as separate variations.
We also define formulas we use to compute their values.
P = n!
V = n!/(n - p)!
And C = n!/p! x (n - p)!.
Recall that these formulas change
when we include repeating values.
V-bar = n to the power of p.
And C-bar = (n + p - 1)!/p!(n-1)!
Great.
Furthermore, we talked about how combinations are symmetric.
Choosing p-many elements out of a set of n-many elements
can be done in the exact same way
as choosing (n - p) many elements.
The reason is we can reverse the problem
and actually choose the elements to be omitted.
So far, we've studied
a significant amount of probability theory.
In the next section,
we will deepen our knowledge
by learning how to deal with multiple events,
introducing you to Bayesian Notation,
independent and dependent events,
and how to compute the probabilities for these events.
See you there
and thanks for watching.
Can't find what you're looking for?
Get subtitles in any language from opensubtitles.com, and translate them here.