Suppose we want to choose 4 letters, without replacement, from 17 distinct letters. (a) How many ways can this be done, if the order of the
choices is taken into consideration?
(b) How many ways can this be done, if the order of the choices is not taken into consideration?

3-4

step-by-step explanation:

the answer is 3-4 because both 45 and 60 has a multiple of 15.

45/3=15

60/4=15

therefore the odds against selecting a red is 4-3

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

the answer is c 150

step-by-step explanation: