Edges are a small amount of baby hair on the edge of the yest of your hair
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:
Number 4 i think
Step-by-step explanation:
Take the derivitive
f'(x)=3x^2+12x
find where it equals zero
it equal zero at x=0 and x=-4
find the y values
f(0)=-36
f(-4)=-4
the critical points are (0,-36) and (-4,-4)
make sign chart
evalutat f'(x) at x=-5 and x=-1 and x=1, and see their signs
f'(-5)=(+)
f'(-1)=(-)
f'(1)=(+)
see below attachment
max is where sign changes from (+) to (-)
min is where sign changes from (-) to (+)
so
max at (-4,-4)
min at (0,-36)
none of the options are correct, do you have te right problem?
<h3>
Answer: 4</h3>
===========================================
Explanation:
For now, ignore the variables. Let's just focus on the coefficients 12 and 16.
The GCF of 12 and 16 is 4 because this is the largest factor they have in common.
12 = 4*3
16 = 4*4
You could create a factor tree to get the prime factorization of each number
12 = 2*2*3
16 = 2*2*2*2
Each factor tree has two copies of '2' leading to the GCF 2*2 = 4.
--------
Now let's go back to the variables. The term 12n and 16w^3 do not have any variables in common. So the final answer won't have any variables in it. If both terms had say a 'w' in them, then w would somehow be involved in the GCF. But that's not the case here. So we just stick to 4 as our answer.
--------
Side note: If you had 12n+16w^3 and you wanted to factor, then you would factor out the GCF 4 to get 12n+16w^3 = 4(3n+4w^3). Use the distribution rule to confirm this.