Answer:
161700 ways.
Step-by-step explanation:
The order in which the transistors are chosen is not important. This means that we use the combinations formula to solve this question.
Combinations formula:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
In this question:
3 transistors from a set of 100. So
[tex]C_{100,3} = \frac{100!}{3!(100-3)!} = 161700[/tex]
So 161700 ways.
