Problem 1g a deck consists of n cards, numbered 1 through n. the deck is going to be shuffled. assume that all permutations of the n cards are equally likely. let 1 ≤ m1, m2, k1, k2 ≤ n. a) how many permutations are possible? b) in how many permutations does card number m1 falls in place number k1? c) what is the chance that card number m1 falls in place number k1? d) what is the chance that card number m1 falls in place number k1 and card number m2 falls in place number k2? e) for1≤i≤n,. letm bethetotalnumber of matches. fine e(m) and v ar(m). [hint: it is a good move to write m as the sum of indicators. if you have forgotten what those are, see example d on page 129 of your text, or the section entitled the method of indicators starting on page 168 of pitmans probability book. and dont forget the indicators, nor any dependence issues, when you calculate the variance.]

10a^3+277a^2-132a-792

step-by-step explanation:

(2a+11)(5a-12)(foil)

=10a^2-24a+55a-132 =10a^2+31a-132

(10a^2+31a-132)(a+6)

=10a^3+60a^2+31a^2+186a^2-132a-792 =10a^3+277a^2-132a-792

i hope this is what you are looking for : )

step-by-step explanation:

descending order means to order the polynomials from the term with the largest exponent to the term with the smallest exponent.  

therefore, the correct answer is d.  

chase is right because he already been to the swings and he know how far it will be to get there

step-by-step explanation:

answer 1 : option "c"

answer 2 : option "d"

answer 3 : option "b"

answer 4 : option "d"

answer 5 : option "b"

answer 6 : option "a"

answer 7 : option "c"

answer 8 : option "d"

answer 9 : option "c"

answer 10 : option "d"

answer 11 : option "c"

answer 12 option "b"

answer 13 option "c"

answer 14 option "c"

answer 15 option "d"

answer 16 option "a"

answer 17 option "b"

answer 18 option "c"

answer 19 option "a"

answer 20 option "a"

answer 21 option "c"

d