Answer:
Scalene Acute Triangle
Step-by-step explanation:
The triangle above is an <em>"acute triangle"</em> because the measurement of each angle is <em>less than 90°</em>. However, there are three types of acute triangle and these are: <em>Equilateral Acute Triangle, Isosceles Acute Triangle and Scalene Acute Triangle.</em>
When all the angles have the same measurement of less than 90°, then it is an Equilateral Acute Triangle. If only two angles have the same measurement, it is an Isosceles Acute Triangle. If <u><em>none of the angles are the same </em></u>but all are less than 90°, which also means that the<u><em> sides are also unequal</em></u>, then it is an Scalene Acute Triangle.
The triangle above has <em>different angle measurements of less than 90°</em>. Therefore, it is an Scalene Acute Triangle.
Answer:

Step-by-step explanation:
Quadratic function is given as 
Let's find a, b and c:
Substituting (0, 6):



Now that we know the value of c, let's derive 2 system of equations we would use to solve for a and b simultaneously as follows.
Substituting (2, 16), and c = 6








=> (Equation 1)
Substituting (3, 33), and c = 6








=> (Equation 2)
Subtract equation 1 from equation 2 to solve simultaneously for a and b.


Replace a with 4 in equation 2.
The quadratic function that represents the given 3 points would be as follows:



Answer :
Yes, the experiment is a binomial experiment because it satisfies all the four characteristics of the binomial experiment :
1. Fixed number of trials
2. Exactly two outcomes
3. Outcomes are independent of each other
4. Probability of all the outcomes remains constant from trial to trial.
Success in the given experiment is that the baby recovers fully.
Hospital is caring for 6 babies , n = 6
p = 0.20 ( Success )
q = 1 - 0.20 = 0.80 ( Not a success )
Value of random variable x is the number of babies which are recovering fully, x = 0, 1, 2, 3, 4, 5 or 6
Answer
-26+4
Usuahaushbsbwjwjaja
Answer:
f(n) = f(n - 1) + 3
Step-by-step explanation:
Substitute
to get the recursive formula.
OPTION 1: f(n) = f(n - 1) + 3
Substituting n = 1.
f(1) = f(1 - 1) + 3 = 0 + 3 = 3.
Substituting n = 2.
f(2) = f(2 - 1) + 3 = f(1) + 3 = 3 + 3 = 6.
Substituting n = 3.
f(3) = f(3 - 1) + 3 = f(2) + 3 = 6 + 3 = 9.
The numbers match the given sequence. So, we say the above recursive formula represents the sequence.
OPTION 2: f(n) = f(n - 1) + 2
Substituting n = 1
f(1) = f(0) + 2
3.
So, this is eliminated.
Similarly, OPTION 3 and OPTION 4 can be eliminated as well.