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

Question

Suppose we want to choose 5 letters, without replacement, from 9 distinct letters. (If necessary, consult a list of formulas.) (a) How many ways can this be done, if order of the choices is not relevant? .​

in progress 0
Xavia 4 years 2021-09-04T18:00:09+00:00 1 Answers 243 views 0

Answers ( )

  1. hongcuc2
    0
    2021-09-04T18:02:01+00:00
    Reply

    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 :))

    https://brainly.com/question/15145413

Leave an answer

Browse

Giải phương trình 1 ẩn: x + 2 - 2(x + 1) = -x . Hỏi x = ? ( )