What is the number of ways to choose 8 numbers from the first 2 5 natural numbers such that any two chosen numbers differ by at least 2 ?
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.
Let
First arrange each bar is separated by 1 star
∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣
For the remaining 10 stars,
e.g. if we put 4 at the front and 6 at the end
∗ ∗ ∗ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∗ ∗ ∗ ∗ ∗
count from left to right, the chosen numbers will be 5 , 7 , 9 , 1 1 , 1 3 , 1 5 , 1 7 , 1 9
The remaining 10 stars are free to put into 9 urns
(urn 1) ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ ∗ ∣ (urn 9)
The number of ways to choose 88 numbers from the first 25 natural numbers such that any two chosen numbers differ by at least 2
= The number of ways to put 10 stars into 9 urns
= ( 8 1 8 ) = 4 3 7 5 8
Problem Loading...
Note Loading...
Set Loading...
Let a 1 < a 2 < a 3 < a 4 < a 5 < a 6 < a 7 < a 8 be the 8 numbers satisfying the conditions above. We take ( b 1 , b 2 , b 3 , b 4 , b 5 , b 6 , b 7 , b 8 ) = ( a 1 , a 2 − 1 , a 3 − 2 , a 4 − 3 , a 5 − 4 , a 6 − 5 , a 7 − 6 , a 8 − 7 ) . Then ( b 1 , b 2 , b 3 , b 4 , b 5 , b 6 , b 7 , b 8 ) are 8 distinct numbers from the first 1 8 natural numbers. Conversely, from any 8 distinct numbers b 1 < b 2 < b 3 < b 4 < b 5 < b 6 < b 7 < b 8 , we can reconstruct ( a 1 , a 2 , a 3 , a 3 , a 4 , a 5 , a 6 , a 7 , a 8 ) = ( b 1 , b 2 + 1 , b 3 + 2 , b 4 + 3 , b 5 + 4 , b 6 + 5 , b 7 + 6 , b 8 + 7 ) to obtain 8 numbers satisfying the conditions of the problem. Thus we found a one-to-one mapping between the set of 8 numbers satisfying the given conditions and the set of 1 8 distinct numbers from the first 1 8 positive integers. Therefore the answer is ( 8 1 8 ) = 4 3 7 5 8 .