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.
Answer:
30 / 5 = 6.
6x3=18
Step-by-step explanation:
Hope this helped! Have a great day!
Whole number can be a integer. rational number can not be a integer that is repeating.