Answer: Exact Form:
−19
Decimal Form:
−0.¯1
Step-by-step explanation:
In one tray, we have 1/5. Since one is purple out of the 5 colors.
So in 20 trays, we have:
(1/5) x 20 = 20/5 = 4
Answer:
m = 5
Step-by-step explanation:
Since the points are collinear, they all lie on the same line and have the same slope between them.
Calculate the slope m using the slope formula
m = 
with (x₁, y₁ ) = (2, 3) and (x₂, y₂ ) = (3, 6)
m =
=
= 3
Now calculate the slope using 2 other points and equate to 3
(x₁, y₁ ) = (3, 6) and (x₂, y₂ ) = (m, 12)
m =
=
= 3 ( multiply both sides by m - 3 )
6 = 3(m - 3) ← divide both sides by 3
2 = m - 3 ( add 3 to both sides )
5 = m
You get vertical asymptotes because the x-value causes you to try to divide by 0.
If you look at the denominator, the x-values of 0, 1, and -5 all will make the denominator equal to 0, making the whole function explode.
You find these by solving 3x(x-1)(x+5)=0.
That's your answer: 0, 1, and -5
We will investigate how to determine Hamilton paths and circuits
Hamilton path: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex can be different.
Hamilton circuit: A path that connect each vertex/point once without repetition of a point/vertex. However, the starting and ending point/vertex must be the same!
As the starting point we can choose any of the points. We will choose point ( F ) and trace a path as follows:

The above path covers all the vertices/points with the starting and ending point/vertex to be ( F ). Such a path is called a Hamilton circuit per definition.
We will choose a different point now. Lets choose ( E ) as our starting point and trace the path as follows:

The above path covers all the vertices/points with the starting and ending point/vertex are different with be ( E ) and ( C ), respectively. Such a path is called a Hamilton path per definition.
One more thing to note is that all Hamilton circuits can be converted into a Hamilton path like follows:

The above path is a hamilton path that can be formed from the Hamilton circuit example.
But its not necessary for all Hamilton paths to form a Hamilton circuit! Unfortunately, this is not the case in the network given. Every point is in a closed loop i.e there is no loose end/vertex that is not connected by any other vertex.