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.

the length of o'p' is .

step-by-step explanation:

it is given that the quadrilateral m'n'o'p' is the image of quadrilateral mnop after dilation.

the center of dilation is origin and the scale factor is 1.5.

in dilation the image and preimge are similar figures. it means the sides of image and preimage are proportional.

the scale factor is defined as

the scale factor is 1.5.

multiply both sides by op.

note: if the value of op is given, then multiply the value of op with 1.5 to get the length of side o'p'.

therefore length of o'p' is .

days of the week

step-by-step explanation:

javier earned more money then kyle, so that won't always be a constant term, but the days of the week do not change so that term is always constant.

edit: i meant