The other day, my math teacher was recapping on maximum intersection made by "n" lines. He reminded us that the formula for finding the maximum intersections is
n(n-1)/2.
In another thread I posted I talked with a member about the sum of all whole numbers from A to B. He showed a formula that gives you the sum of all whole numbers from 1 through n, like this
n(n+1)/2
I realized then that If you wanted to find the sum of all numbers from 1 to n-1 the formula was the exact same as the maximum intersections formula
n(n-1)/2
This means that given "n" lines the most intersections possible is n(n-1)/2 OR n-1 + n-2 + n-3...+1
I thought this was very interesting!
n(n-1)/2.
In another thread I posted I talked with a member about the sum of all whole numbers from A to B. He showed a formula that gives you the sum of all whole numbers from 1 through n, like this
n(n+1)/2
I realized then that If you wanted to find the sum of all numbers from 1 to n-1 the formula was the exact same as the maximum intersections formula
n(n-1)/2
This means that given "n" lines the most intersections possible is n(n-1)/2 OR n-1 + n-2 + n-3...+1
I thought this was very interesting!