Suppose we want to choose 5 letters, without replacement, from 9 distinct letters. (If necessary, consult a list of formulas.) (

Question

3 years ago

7

a) How many ways can this be done, if order of the choices is not relevant? .

1 answer:

lara [203] · Answer 1 · 2022-05-11T07:21:55+03:00

Answer:

A.This is the number of combinations of 6 from 15

= 15C6

= 15! / (15-6)! 6!

= 5,005 ways.

B. This is the number of permutaions of 6 from 15:

= 15! / (15-6)!

= 3,603,600 ways.

Step-by-step explanation:

This was someone else's work not mine sorry here's creditssss :))