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.
Where’s the answers ?
Step-by-step explanation:
Answer:
<em>RTS</em><em>=</em><em>(</em><em>1</em><em>8</em><em>0</em><em>-</em><em>1</em><em>1</em><em>2</em><em>)</em><em>/</em><em>2</em>
<em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em>=</em><em>6</em><em>8</em><em>/</em><em>2</em>
<em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em>=</em><em>3</em><em>4</em>
The solution to this system of equations is (-4,0)