Bijection
Intermediate
Let $n$ be a positive integer. Find the number of ordered collection of integers $(a,\ b,\ c,\ d)$ such that $1\le a < b \le c < d\le n+1$
The solution for this problem is available for
$0.99.
You can also purchase a pass for all available solutions for
$99.