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:
3x>18
Step-by-step explanation:
Three times the number x will be called 3x. If an expression is more or greater than a number, we use the greater symbol: >
So, we can write,
3x>18
Answer:
80cm/s
Step-by-step explanation:
120/1.5=80cm/s
can u pls mark as brainliest :)
Answer:
x = -2
Step-by-step explanation:
6 - 2(x + 6) = 3x +4
6 -2x - 12 = 3x + 4
6 - 12 - 2x = 3x + 4
-6 -2x = 3x +4
-6 - 4 - 2x = 3x + 4 - 4
-10 -2x = 3x
-10 -2x + 2x = 3x + 2x
-10 = 5x
-10 / 5 = 5x/5
x = -2
I hope this helps!!
Hello :)
A Fibonacci Sequence is a series of number . It is the sum of two preceding numbers.
Hope this helps <33