Question

Give the difinition, formula, and example problem of permutation, combination & probability... please asap huhu I'll mark you as the brainliest if can do this ​

Answer 1

Answer:

Answer:

Permutation:

In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set.

Formula:

$nPr=\frac{n!}{(n-r)!}$

Example:

Permutations are the different ways in which a collection of items can be arranged. For example, the different ways in which the alphabets A, B and C can be grouped, taken all at a time, are ABC, ACB, BCA, CBA, CAB, BAC. Note that ABC and CBA are not the same as the order of arrangement is different.

Combination:

In mathematics, a combination is a selection of items from a collection, such that the order of selection does not matter.

Formula:

$nCr=\frac{n!}{r!(n-r)!}$

Example:

Combination: Picking a team of 3 people from a group of 10.

C(10,3) = 10!/(7! * 3!) = 10 * 9 * 8 / (3 * 2 * 1) = 120.

Probability:

Probability is the branch of mathematics concerning numerical descriptions of how likely an event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speaking, 0 indicates the impossibility of the event and 1 indicates certainty.

Formula:

Conditional Probability P(A | B) = P(A∩B) / P(B)

Bayes Formula P(A | B) = P(B | A) ⋅ P(A) / P(B)

Example:

Probability is the likelihood or chance of an event occurring. For example, the probability of flipping a coin and its being heads is ½, because there is 1 way of getting a head and the total number of possible outcomes is 2 (a head or tail). We write P(heads) = ½.

Answer 2

~permutation~

Permutation is a term that in mathematics refers to several different meanings in different areas.

Permutation can be permutation with repetition and permutation without repetition.

nPr=

(n−r)!

n!

~Permutation without repetition~

Permutation means to combine the default elements in all possible ways so that each group contains all the default elements.

The number of permutations of a set of n different elements is equal Pn=n×(n-1)×...×2×1=n!

~Permutation with repetition~

If between n given elements there are k1 equals of one kind, k2 equals of another kind,..., ky equals of rth kind, we speak of permutations with repetition.

~combinations without repetition~

In many counting problems, the order of the selected elements is not important.

Each choice of r different elements of an n-member set determines one of its subsets that has r elements, we call it a combination of r-th class without repetition of n elements.

nCr=

r!(n−r)!

n!

~combinations with repetition~

Repetition combinations are combinations in which elements can be repeated.

~Variations without repetition~

A variation of the r-th class in an n-membered set is each ordered r-torque of different elements.

(We can determine this number using the principle of consecutive counting).

~Variations with repetition~

If the elements in ordered r-tuples can be repeated we are talking about variations with repetition.

(We can determine this number using the principle of consecutive counting).