Hello!
I have quick question please if you don't mind. A professor writes 40 discrete mathematics true/false
questions. Of the statements in these questions, 17 are
true. If the questions can be positioned in any order, how
many different answer keys are possible?
My answer: I assumed that $C(40,17)$ for true answers since their order does not matter as long as he/she got it right and then I multiplied them by $C(40,23)$ for false questions, so it would be $C(40,17) \times C(40,23)$ since I did not see or understand from the answer that it's meant correct answers. Please correct me if I a…