Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Problem
Problem
n
n
n
lines are drawn in a plane such that no two of them are parallel and no three of them are concurrent. The number of different points at which these lines will cut, is a.
∑
k
=
1
n
−
1
k
\sum_{k=1}^{n-1} k
∑
k
=
1
n
−
1
k
b.
n
(
n
−
1
)
n(n-1)
n
(
n
−
1
)
c.
n
2
n^2
n
2
d. None of these
Browse the problem library