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:
is the number of different combinations of x objects from a set of n elements, given by the following formula.

In this question:
3 transistors from a set of 100. So

So 161700 ways.
Lacey, because you have to do the opposite when you want to get rid of a number. She subtracted 20 because it was originally positive 20. Chris messed up and did not do the opposite, subtraction, and instead he added 20
Answer:
t
Step-by-step explanation:
( im not really sure) i think it would be a, sorry if im wrong!