$l_1, l_2, l_3$ are three parallel lines in the same plane. If there are $m$ points on $l_1$,$n$ points on $l_2$,and $k$ points on $l_3$,what is the maximum number of triangles that can be formed with vertices at these points?
- A$^{m+n+k}C_3$
- B$^{m+n+k}C_3 - ^mC_3 - ^nC_3 - ^kC_3$
- C$^mC_3 + ^nC_3 + ^kC_3$
- DNone of these
Explore More
Similar Questions
The total number of possible ways in which a person can go from $A(0,0)$ to $B(3,3)$ if he can travel only to the right or upward along the grid lines is:
Let $P$ be a closed polygon with $10$ sides and $10$ vertices (assume that the sides do not intersect except at the vertices). Let $k$ be the number of interior angles of $P$ that are greater than $180^{\circ}$. The maximum possible value of $k$ is
DifficultKVPY 2013
View SolutionThe number of rectangles that can be obtained by joining four of $12$ vertices of a $12$-sided regular polygon is:
There are $10$ points in a plane of which no three points are collinear except $4$ points. The number of distinct triangles that can be formed by joining these points such that at least one of the vertices of every triangle formed is from the given $4$ collinear points is:
Find the total number of rectangles on a normal chessboard.
Vedclass Products
For Students
Vedclass Test Series
Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.
Start Free TrialFor Teachers
Exam Paper Generator
Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.
Try FreeFor Institutes
Online Exam Module
Live online exams with unlimited students, 360° analytics & white-label branding.
See Demo