Permutation :The number of ways to choose a sample of r elements from a set of n distinct objects where order does matter and replacements are not allowed.

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

Factorial : There are n! ways of arranging n distinct objects into an ordered sequence.

Considering a situation when n = r in a permutation, nPr reduces to n!, a simple factorial of n.

Proof: 3P3 = 3!

n = 3 and r = 3

$3P3 = \frac{3!}{(3-3)!}$

$3P3 = \frac{3!}{(0)!}$

But 0! = 1

3P3 = 3!

3 0

3 years ago

Read 2 more answers

5 to 7 and please solve with equations thx

padilas [110]

Answer:

Step-by-step explanation:

5) x + 5.4 < -1.6

x < -1.6 - 5.4

x < -7

6) x + 7.5 > -2.5

x > -2.5 - 7.5

x > -10

7) 3 ≤ 1/3 + x

x ≥ 3 - 1/3

x ≥ 5/3

4 0

3 years ago

Read 2 more answers