Find the number of positive integer solutions to the following equation: $$x_1+x_2+\cdots+x_5=14$$

Explain why we cannot apply the cut-the-rope technique to count the non-negative integer solutions to the equation $$x_1 + x_2 + \cdots + x_k = n$$

For example, can we allow two cuts in the same interval thus to model one of the $x_i$ is zero?

A total of $2018$ tickets, numbered $1$, $2$, $3$, $\cdots$, $2014$, $2015$ are placed in an empty bag. Alfrid removes ticket $a$ from the bag. Bernice then removes ticket $b$ from the bag. Finally, Charlie removes ticket $c$ from the bag. They notice that $a < b < c$ and $a + b + c = 2018$. In how many ways could this happen?

Let $\mathbb{A}=\{a_1,\ a_2,\ \cdots,\ a_{100}\}$ be a set containing $100$ real numbers, $\mathbb{B}=\{b_1,\ b_2,\ \cdots,\ b_{50}\}$ be a set containing $50$ real numbers, and $\mathcal{F}$ be a mapping from $\mathbb{A}$ to $\mathbb{B}$. Find the number of possible $\mathcal{F}$ if  $\mathcal{F}(a_1) \le \mathcal{F}(a_2)\le\cdots\mathcal{F}(a_1)$, and for every $b_i\in\mathbb{B}$, there exists an element $a_i\in\mathbb{A}$ such that the $\mathcal{F}(a_i)=b_i$.