Answer:
66 ways
Step-by-step explanation:
Given that a teacher has a set of 12 problems to use on a math exam. The teacher makes different versions of the exam by putting 10 questions on each exam.
Available questions =12
Problems to be made out of these 12 = 10
Since order does not matter in the question paper having problems, this is a question of combination.
This can be done in 12C10 ways
[tex]=\frac{12!}{2!10!}=66 ways[/tex]