2 years ago

Suppose we want to choose 5 letters, without replacement, from 15 distinct letters.

1 answer:

4 0

$order \: does \: not \:matter \\ sample \: space = 15 \: letters \\ no \: repetition\\ P(A) = 15C5 = 3003 \: ways$

You might be interested in

SOVA2 [1]

Answer: (-6, 3)

Step-by-step explanation:

8 0

2 years ago

Cerrena [4.2K]

Answer:

Step-by-step explanation:

4 0

3 years ago

valentinak56 [21]

Answer: 4(×+1) (×-1)

Step-by-step explanation:

3 0

2 years ago

photoshop1234 [79]

Step-by-step explanation:

use mathaway! it helps a lot

3 0

3 years ago

Softa [21]

Answer:

I think it would be 12440

Step-by-step explanation:

Please give me brainliest

5 0

2 years ago