There are $10$ points in a plane,out of which $6$ are collinear. If $N$ is the total number of triangles formed by joining these points,then $N=$

Let $X = \{(a, b) \mid a, b \in \mathbb{Z}, 0 \leq a \leq 20, 0 \leq b \leq 15\}$. Then the number of rectangles with vertices in set $X$ is

$A$ regular polygon of $n$ sides has $170$ diagonals,then $n$ is equal to

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 $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: