Infinitely many. There are infinitely many lines from the apex to the base. Every point on each of these lines is on the surface of the cone.
There are 66 lines. As no 3 points are co-linear, every line passes through exactly two of the points. Thus every point is joined by one of the lines to every other point. So it looks like there are 12 × 11 = 132 lines. However, the line joining point A to point B is the same as the line joining point B to point A; in other words, every line has been counted twice, once for one of the points it passes through and again by the other point it passes through. Therefore there are half the number of lines discovered above, name 132 ÷ 2 = 66 lines. This is the same as the "handshake problem" where everyone at a party shakes hands with everyone else at the party and the question is how many handshakes are there; the points are the people and the lines are the handshakes.
There is no specific name for lines that meet at one point, but lines that meet at a point, the point is called the intersection point.
An inequality determines a region of space in which the solutions for that particular inequality. For a system of inequalities, these regions may overlap. The solution set is any point in the overlap. If the regions do not overlap then there is no solution to the system.
Two lines that meet at one point is called an intersection. More than two seperae lines can be intersected at one point.
coincidental -Lines that share the same solution sets.
They will be a set of lines meeting at one point - the solution.
Contour lines cannot overlap because each line represents a specific elevation on the terrain. If contour lines were to overlap, it would imply that a particular point has multiple elevations, which is not possible. Contour lines must always represent a single and distinct elevation value.
Those two statements are linear equations, not lines. If the equations are graphed, each one produces a straight line. The lines intersect at the point (-1, -2).
Cartesian coordinate system
Yes. Incidentally, every point is a point of concurrency (for some set of lines).
121
Yes. Every point in the Cartesian plane is a point of concurrency for some set of lines.
It would depend on what you were measuring as to how it would be graphed (distance from starting point vs time, distance to a certain point vs time, horizontal location vs vertical location, etc).
The set of points the graphed equations have in common. This is usually a single point but the lines can be coincident in which case the solution is a line or they can be parallel in which case there are no solutions to represent.
When graphed, a function has any shape so that all vertical lines will cross the graph in at most one point. A relation does not have this condition. One or more vertical lines may (not must) pass thru a relation in more points.
Infinitely many. There are infinitely many lines from the apex to the base. Every point on each of these lines is on the surface of the cone.