Suppose we want to choose 2 letters, without replacement from the 5 etters A, B, C, D, and E. (a) How many ways can this be done, if the order of the choices matters?
(6) How many ways can this be done if the order of the choices does not matter

{x = -1/2 ,   y = -1

step-by-step explanation:

solve the following system:

{2 x + y = -2

{10 x - 3 y = -2

in the first equation, look to solve for y:

{2 x + y = -2

{10 x - 3 y = -2

subtract 2 x from both sides:

{y = -2 x - 2

{10 x - 3 y = -2

substitute y = -2 x - 2 into the second equation:

{y = -2 x - 2

{10 x - 3 (-2 x - 2) = -2

10 x - 3 (-2 x - 2) = (6 x + 6) + 10 x = 16 x + 6:

{y = -2 x - 2

{16 x + 6 = -2

in the second equation, look to solve for x:

{y = -2 x - 2

{16 x + 6 = -2

subtract 6 from both sides:

{y = -2 x - 2

{16 x = -8

divide both sides by 16:

{y = -2 x - 2

{x = -1/2

substitute x = -1/2 into the first equation:

{y = -1

{x = -1/2

collect results in alphabetical order:

answer:   {x = -1/2 ,   y = -1

the median is   36 orr sum like dat

step-by-step explanation:

20days louise can read300 pg

step-by-step explanation:

1 day 15 pg 300: 15= 20

x day 300 pg

i believe it’s 165 because if u add 137 and 58 u get 195 and then subtract that from 360 and there’s ur answer