**Problem: **Show that the number of ways in which four distinct integers can be chosen from 1,2,…n such that no two are consecutive is equal to .

**Solution:** suppose we chose a>b>c>d four integers from 1,2,…n such that no two are consecutive.So d<c-1<b-2<a-3.

Now d,(c-1),(b-2),(a-3) are four distinct integers from 1,2,…(n-3),which may be consecutive or not.

So number of ways to chose four numbers such that no two are consecutive from 1,2,…n = number of ways to chose four distinct numbers from 1,2,…(n-3).

Now number of ways to chose 4 ways from 1,2,…(n-3) = .

**Conclusion: ** Number of ways to chose four distinct integers from 1,2,…n such that no two are consecutive is