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:
-12x + 12 = 32............................. the equation
Step-by-step explanation:
to determine the equation in this 12(1-x) = 36 expression is quite simple, you only need to open the bracket .
solution
12(1-x) = 36
12 - 12x = 32
-12x + 12 = 32............................. the equation
we can further evaluate for the value of x
-12x = 32 - 12
-12x = 20
divide both sides by the coefficient of x which is -12
-12x = 20
-12x/-12 = 20/-12
x = -1.67
Answer:
0.013
Step-by-step explanation:
Use binomial probability:
P = nCr pʳ (1−p)ⁿ⁻ʳ
where n is the number of trials,
r is the number of successes,
and p is the probability of success.
Given n = 6, p = 0.69, and r = 0 or 1:
P = ₆C₀ (0.69)⁰ (1−0.69)⁶⁻⁰ + ₆C₁ (0.69)¹ (1−0.69)⁶⁻¹
P = (1) (1) (0.31)⁶ + (6) (0.69) (0.31)⁵
P = 0.013
Step-by-step explanation:
![A =(125^{2} + 25^{2} ) (5^{2} - 1)\\A = [(5^{3})^{2} + (5^{2})^{2} ] . (5^{2} - 1)\\A = (5^{6} + 5^{4} ). (5^{2} - 1)\\A = [5^{4} . ( 5^{2} + 5)].(5^{2} - 1) \\A = 5^{4} . (25+ 5). (5^{2} - 1)\\A = 5^{4} . 30. (5^{2} - 1)\\](https://tex.z-dn.net/?f=A%20%3D%28125%5E%7B2%7D%20%2B%2025%5E%7B2%7D%20%29%20%285%5E%7B2%7D%20-%201%29%5C%5CA%20%3D%20%5B%285%5E%7B3%7D%29%5E%7B2%7D%20%20%2B%20%285%5E%7B2%7D%29%5E%7B2%7D%20%5D%20.%20%285%5E%7B2%7D%20-%201%29%5C%5CA%20%3D%20%285%5E%7B6%7D%20%20%2B%205%5E%7B4%7D%20%29.%20%285%5E%7B2%7D%20-%201%29%5C%5CA%20%3D%20%5B5%5E%7B4%7D%20.%20%28%205%5E%7B2%7D%20%20%2B%205%29%5D.%285%5E%7B2%7D%20-%201%29%20%5C%5CA%20%3D%205%5E%7B4%7D%20.%20%2825%2B%205%29.%20%285%5E%7B2%7D%20-%201%29%5C%5CA%20%3D%205%5E%7B4%7D%20.%2030.%20%285%5E%7B2%7D%20-%201%29%5C%5C)
Since 30 is divisible by 3
Thus, A is divisible by 3
Good luck!