Let $\mathbb{S}=\{1,\ 2,\ 3,\ \cdots,\ n\}$ and positive integer $m$ satisfying $n + 1\ge 2m$. Find the number of subsets of $\mathbb{S}$ which has $m$ elements and no two elements are consecutive.
The solution for this problem is available for $0.99.
You can also purchase a pass for all available solutions for $99.