n lines are drawn in a plane such that 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. `sum_(k=1)^(n-1)k` b. `n(n-1)` c. `n^2` d. none of these

Similar Questions

Explore conceptually related problems

25 lines are drawn in a plane. Such that no two of them are parallel and no three of them are concurrent. The number of points in which these lines intersect, is:

If n lines are drawn in a plane such that no two of them are parallel and no three of them are concurrent,such that these lines divide the planein 67 parts,then find number of different points at which these lines will cut.

If 20 lines are drawn in a plane such that no two of them are parallel and so three are concurrent,in how many points will they intersect each other?

sum_(k =1)^(n) k(1 + 1/n)^(k -1) =

Total numbers of regions in which |'n:)' coplanar lines can divide the plane,if it is known that no two lines are parallel and no three of them are concurrent,is equal to

`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. `sum_(k=1)^(n-1)k` b. `n(n-1)` c. `n^2` d. none of these

Similar Questions

Recommended Questions