Negatively triangular
Excerpt: Given four straight line equations, which three enclose a triangle with negative coordinates? Students are asked to create a similar problem for themselves.
Warm-up
Four straight lines have the following equations
How many intersections do you expect?
Some more points…
Three of the four lines above will enclose a triangle where each point on the triangle has negative coordinates.
Which three lines?
Once you have answered these, you will be ready to move to the main problem.
Warm-up solutions
Approach 1
These equations represent straight lines and can therefore be written in the form .
The four equations can be written as:
This shows that none of the lines are parallel. Any two lines that are not parallel will intersect at some point. This means that each of the four lines will intersect with the other three.
Therefore there could be up to six intersections.
Approach 2
If two lines intersect then we can solve their equations simultaneously to find the coordinates of the intersection.
Subtracting three times equation from equation gives , so . We can find by substituting this into equation : we have and so . We can easily check that the point does indeed lie on both lines.
Therefore the coordinates of intersection between lines and are:
Repeating this process for each of the other five pairs yields the following solutions:
Lines and intersect at:
Lines and intersect at:
Lines and intersect at:
Lines and intersect at:
Lines and intersect at:
Therefore there are six intersections.
This approach has the benefit of providing information useful in answering the next part of the problem.
Some more points…
Three of the four lines above will enclose a triangle where each point on the triangle has negative coordinates.
Which three lines?
From approach 2 above we can immediately see that the triangle must have vertices at: , , and . These are the points of intersection between lines , and .
Therefore, the three lines that will enclose a triangle where each point on the triangle has negative coordinates are:
Main problem
You are going to consider how the warm-up problem was created. You will need to create a similar problem with a different set of four straight lines.
-
How can you guarantee that your four lines will intersect to form a triangle where each point on the triangle has negative coordinates?
-
How can you ensure that just one triangle is created with these conditions?
-
How many approaches can you find to create a similar problem?
-
Which of your approaches to this problem is the most effective?
Once you have completed this problem you may like to consider the questions below to extend your thinking:
Question 1
What conditions are there for four straight lines to enclose a square which has only negative coordinates for any point on that square?
Question 2
How do these conditions vary if we wish to enclose other quadrilaterals?
You might like to try a graphical approach to this problem, perhaps using Desmos.
Main solutions
How can you guarantee that your four lines will intersect to form a triangle where each point on the triangle has negative coordinates?
Approach 1
We know that all of the vertices of the triangle need to be located in the bottom left quadrant. If we specify the coordinates of the vertices then we can work out the equations of the lines from there.
We could select any three points in the bottom left quadrant. Let’s take , and as an example. To find the equation of the straight line passing through two points we can use the general form of the equation .
Let’s start with coordinates and . The gradient of the line is .
Then the equation of the line is , or .
Now if we repeat the process with coordinates and we get a gradient of , or . Then the equation of the line is , or .
And finally we repeat the process with coordinates and giving a gradient of . Then the equation of the line is .
That gives us three equations that will intersect to enclose a triangle where each point on the triangle has negative coordinates. We now just need to specify a fourth equation that will not intersect to create another triangle in the bottom left quadrant. This could be done by choosing any line that is restricted to the other three quadrants. For example, .
Approach 2
We could solve this problem algebraically by considering the constraints on the values of the gradient, m and -intercept, c.
If we start by assuming that we have two straight lines and Then solving these two equations simultaneously gives us the coordinates of the point of intersection of the two lines as
Now, we want the coordinates to be negative. If we first consider the -coordinate then we require that either and , or and .
Considering the -coordinate we require that either and , or .
Combining the conditions for both coordinates we have the following:
and and
or
and and .
If we can select two lines that meet these conditions then they will intersect in the third quadrant.
We could then repeat the process to select a third line to intersect with the first two, also in the third quadrant.
Making use of a spreadsheet to select values of and that fit the conditions can be helpful.
