From the first 1 5 natural numbers , 5 are selected so that no two of them are consecutive. If the number of such selections is 3 3 x k , find k .
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.
n(choosing 5 non-consecutive numbers from 15 consecutive ones)
= (15 – 5 + 1)C5
= 11C5
= 11! / 5!6!
= 33k
k = 14
There are four spaces between the five chosen numbers. We cannot choose from these four spaces. Therefore, we have (15-4) choose 5 possibilities, which is equal to 33*14.
IF we define b j = a j − j for 1 ≤ j ≤ 5 , then a 1 , a 2 , . . . , a 5 is an increasing sequence of nonconsecutive integers between 1 and 1 5 if and only if b 1 , b 2 , . . . . , b 5 is an increasing sequence of integers between 0 and 1 0 . Thus we want the number of ways of choosing 5 distinct numbers from 1 1 , namely ( 5 1 1 ) = 4 6 2 = 3 3 × 1 4 .
Problem Loading...
Note Loading...
Set Loading...
stars and bars technique
Let
example:
∗ ∣ ∗ ∣ ∗ ∗ ∣ ∗ ∗ ∗ ∣ ∗ ∣ ∗ ∗
Count from left to right, the selected numbers are 2 , 4 , 7 , 1 1 , 1 3
Construct the solution:
As no two of them are consecutive, we first put a star in-between the bars
Then there are remains 6 stars to be placed in 6 sections (urns).
The number of required selections
= the number of ways to arrange 6 stars into 6 urns
= ( 6 − 1 6 + 6 − 1 )
= 1 × 2 × 3 × 4 × 5 1 1 × 1 0 × 9 × 8 × 7 = 3 3 × 1 4
∴ k = 1 4