Suppose we want to choose 6 letters, without replacement, from 15 distinct letters. (A) how many ways can this be done, if the order of choices is not taken into consideration? (B) How many ways can this be done, if the order of choices is taken into consideration?

Below in bold.

Step-by-step explanation:

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.

f(x) = y

f(-3) = -5

step-by-step explanation:

the barter