Number of triangles formed by $m$ lines

geometry combinatorics

There are $n$ parallel lines. Each pair of the $m-n$ forms a triangle with each of the $n$. So the triangles are ${m-n \choose 2}n=\frac 12(m-n)(m-n-1)n$

Related

Is $f(x)=x+\frac{x}{x+1}$ uniformly continuous on $(0,\infty)$
Not primary ideal having a prime radical
Induction: prove $\,a^{2^n} \equiv 1\pmod{2^{n+2}}\,$ via congruences
Does dividing by zero ever make sense? [duplicate]
Is the set of all possible binary strings countable?
Placing $9$ black and $9$ white rooks on $ 6\times6$ board without any attacks between different colours
Characterisation of norm convergence
$(a,b)=d \overset{?}{\implies} (a^3,b^3)=d^3$
Any $B \subset \{10,11,...,99\}$, with $|B| =10$ has two subsets such that $\sum_{a \in B_1} a = \sum_{b \in B_2} b$
Uniform convergence of $\sum (-1)^nf_n(x)$ on $[0,1]$ where $f_n(x)=x^n(1-x)$.
Prove that $|a|\leq \max\{|b|,|c|\}$ if $b\leq a \leq c$
Generating function for gamma function (or factorial)