A few days ago
Cramer

Geometry math question?

When there are 3 points, there are 3 segments that can connect them, when there are 4 points, there are 6 segments that can connect them, when there are 5 points, 10 segments can connect them, when there are 6 points, 15 segements can connect them. When there are n points, who many segments can connect them?

Top 1 Answers
A few days ago
Anonymous

Favorite Answer

This is the number of combinations of 2 from n, written C(n,2) or nC2.

The formula to evaluate this is:

n! / 2!(n – 2)!

which can be reduced to:

n(n – 1)/2.

0