(4) let s = {a, b,c, d,e}. (a) list all of the 2-permutations of s in an organized manner. how many are there?
(b) list all of the 2-combinations of s in an organized manner. how many are there?
(c) list all of the 3-combinations of s in an organized manner. how many are there?
(d) on the previous page, you should have gotten the same number of 2-combinations of s as 3-combinations. explain why we should expect these numbers to be the same.

Answer with Step-by-step explanation:

We are given that a set S={a,b,c,d,e}

a.We have n=5

We have to find the number of 2-permutations of S in an organised manner

Using permutation formula

r=2

Hence, the total number 2- permutations of S =20

{a,b},{b,c},{c,d},{d,e},{a,c},{a,d},{a,e},{b,d},{b,e},{c,e},{b,a},{c,b},{d,c},{e,d},{c,a},{d,a},{e,a},{d,b},{e,b},{e,c}.

b.We have to find the 2- combinations of S in an organised manner

By using combination formula

n=5,r=2

Hence, the number of 2 -combinations of S =10

{a,b},{b,c},{c,d},{d,e},{a,c},{a,d},{a,e},{b,d},{b,e},{c,e}.

c.We have n=5 r=3

Using combination formula

Hence, the total number of 3- combinations of S =10

{a,b,c},{b,c,d},{c,d,e},{a,b,d},{a,b,e},{b,c,e},{a,c,d},{a,d,e},{b,d,e},{a,c,e}.

d.Number of 2 -combinations of S=Number of 3- combinations of S=10

Combinations is a selection of r elements out of n elements.

When we select 3 elements  out of 5 then we get total number of combinations of S=10 and when we select 2 elements out of 5 then we get total number of combinations of S=10

By combinations formula

can you add an image ?

step-by-step explanation:

y do u put "subscirbe to ence" on a app for ppl who need with their work?