20 POINTS AND BRAINLIEST! There are 2 Senators from each of 50 states. We wish to make a 3-Senator committee in which no two members are from the same state. A) How many ways can we choose three states to be represented?

A) 19,600

Step-by-step explanation:

A) How many ways can we choose three states to be represented?

To solve for the above question, we would be using the Combination formula

The combination formula is given as:

C(n , r) = nCr = n!/r! (n - r)!

Where n = 50

We are told that we are to make a 3-Senator committee in which no two members are from the same state. So,

r = 3 ( senator committee)

nCr = n!/r! (n - r)!

50C3 = 50! / 3! (50 - 3)!

50C3 = 50! / 3! × 47!

50C3 = 19,600

Therefore, the number of ways can we choose three states to be represented is 19,600 ways.

what are the options? ?

step-by-step explanation:

"a" determine whether sage found the correct quotient. show your work

step-by-step explanation: