<p>Here is a logical way that I learned how to do this problem that can apply for any problems of this type: Once you learn this, it will be very quick for you, but here is an explanation of what I do:</p>
<p>You start off with 2 lines:</p>
<p>Logically, they can only intersect once. making them an X if you wish. Therefore: 1 intersection</p>
<p>Then you move to 3 lines:</p>
<p>Starting from the intersection of the two lines, the next line can intersect both lines once: This gives it three intersections.</p>
<p>If you add another line, starting from the 3 line example, you will quickly see the next line can intersect the other 3 lines once.</p>
<p>What you get is 6 intersections. You should quickly notice by now that the pattern is starting to develop:</p>
<p>That formula is incorrect. That multiples all the numbers from n to (n-1). We want to add them together.</p>
<p>If you want to get into formulas, the correct one is [n(n-1)]/2.</p>
<p>A spent a couple of minutes in powerpoint drawing this for you. I accidentally did 11 lines, but I didn’t feel like redoing it. This is a good way to see how each line actually goes through every other one.</p>
<p>Yes the question would never ask for the lines that are on top of each other. Generally, the question will say something like “ten different lines” and lines on top of each other are the same line.</p>