Suppose we want to choose 2 letters, without replacement, from the 4 letters A, B, C, and D. (a) How many ways can this be done, if the order of the choices is relevant? (b) How many ways can this be done, if the order of the choices is not relevant?

1/3 + 1/5 = 8/15.

step-by-step explanation:

hope it

linear pair postulates

(b) 240

step-by-step explanation:

first, we use the pythagorean formula using the given side lengths to find x. then we use x to find the side lengths. then we add the side lengths to find the perimeter.

pythagorean theorem formula:

a^2 + b^2 = c^2

(x - 20)^2 + (x - 40)^2 = x^2

x^2 - 40x + 400 + x^2 - 80x + 1600 = x^2

x^2 -120x + 2000 = 0

(x - 100)(x - 20) = 0

x - 100 = 0 or x - 20 = 0

x = 100 or x = 20

we see that the solution x = 20 must be discarded because it will give a negative side length and a side length of 0. the only valid solution is x = 100.

perimeter = sum of the lengths of the sides

perimeter = x + x - 20 + x - 40

perimeter = 3x - 60

replace x with 100.

perimeter = 3(100) - 60

perimeter = 300 - 60

perimeter = 240

i will with my problems and all the other things that need to   be on by the way

step-by-step explanation: