On a bookshelf, ten volumes of a series of books are arranged in ascending order of volume number, from left to right. In how many ways can four books be picked so that no two consecutive volumes are picked together?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Consider the problem this way: Name the books according to the volume numbers → 1 , 2 , 3 , . . . , 1 0
So, we need to choose 4 numbers among 1 , 2 , 3 , . . . , 1 0 such that no two are consecutive.
Now, there is a trick to find this out. Say, you choose x 1 , x 2 , x 3 a n d x 4 which are some numbers between 1 to 1 0 (inclusive)
Then, 1 ≤ x 1 < x 2 < x 3 < x 4 ≤ 1 0 . And, the min. difference between x 1 and x 2 , x 2 and x 3 and x 3 and x 4 is 2 .
So, we again have: 1 ≤ x 1 < x 2 − 1 < x 3 − 2 < x 4 − 3 ≤ 7 . Now, these numbers can be consecutive. So, we just need to choose x 1 , x 2 − 1 , x 3 − 2 , x 4 − 3 between 1 to 7 (inclusive). And, there are ( 4 7 ) ways to do this.
Hence, the answer is ( 4 7 ) = 3 5