$m$ men and $n$ women are to be seated in a row so that no two women sit together. If $m > n$,then the number of ways in which they can be seated is

If three distinct vertices are chosen at random from the vertices of a cube,then the probability that they form the vertices of an equilateral triangle is:

Let $l_1$ and $l_2$ be two lines intersecting at $P$. If $A_1, B_1, C_1$ are points on $l_1$,and $A_2, B_2, C_2, D_2, E_2$ are points on $l_2$,and if none of these points coincides with $P$,then the number of triangles formed by these eight points is:

In a plane,there are $37$ straight lines,of which $13$ pass through the point $A$ and $11$ pass through the point $B$. Besides,no three lines pass through one point,no line passes through both points $A$ and $B$,and no two lines are parallel. The number of intersection points the lines have is equal to:

The number of shortest paths from $HOSTEL$ to $ALLEN$ is equal to (as shown in the given figure):

The straight lines $l_1, l_2, l_3$ are parallel and lie in the same plane. $A$ total number of $m$ points are taken on $l_1$,$n$ points on $l_2$,and $k$ points on $l_3$. The maximum number of triangles formed with vertices at these points is: