Difference between revisions of "2007 AMC 12A Problems/Problem 25"
(corrected an argument) |
Baijiangchen (talk | contribs) (→Solution) |
||
Line 34: | Line 34: | ||
Therefore, the number of spacy subsets is <math>\binom 64 + \binom 83 + \binom{10}2 + \binom{12}1 + \binom{14}0 = 129</math>. | Therefore, the number of spacy subsets is <math>\binom 64 + \binom 83 + \binom{10}2 + \binom{12}1 + \binom{14}0 = 129</math>. | ||
+ | === Solution 3 === | ||
+ | A shifting argument is also possible, and is similiar in spirit to Solution 2. Clearly we can have at most <math>4</math> elements. Given any arrangment, we subract <math>2i-2</math> from the <math>i-th</math> element in our subset, when the elements are arranged in increasing order. This creates a [[bijection]] with the number of size <math>k</math> subsets of the set of the first <math>14-2k</math> positive integers. For instance, the arrangment o | | o | | o | | | o | corresponds to the arrangment o o o | o |. Notice that there is no longer any restriction on consectutive numbers. Therefore, we can easily plug in the possible integers 0, 1, 2, 3, 4, 5 for <math>k</math>: <math>{14 \choose 0} + {12 \choose 1} + {10 \choose 2} + {8 \choose 3} + {6 \choose 4} = \boxed{129}</math> | ||
− | === Solution | + | In general, the number of subsets of size <math>n</math> with no <math>k</math> consecutive numbers is <math>\sum^{\floor{\frac{n}{k}}}_{i=0}{{(k-1)(i-1) \choose i}}</math>. |
+ | |||
+ | === Solution 4 === | ||
As a last resort, we can [[brute force]] the result by repeated [[casework]]. Luckily, 12 is not a very large number, so solving it this way is still possible. | As a last resort, we can [[brute force]] the result by repeated [[casework]]. Luckily, 12 is not a very large number, so solving it this way is still possible. | ||
Revision as of 22:38, 18 February 2012
Problem
Call a set of integers spacy if it contains no more than one out of any three consecutive integers. How many subsets of including the empty set, are spacy?
Contents
[hide]Solution
Solution 1
Let denote the number of spacy subsets of . We have .
The spacy subsets of can be divided into two groups:
- those not containing . Clearly .
- those containing . We have , since removing from any set in produces a spacy set with all elements at most equal to and each such spacy set can be constructed from exactly one spacy set in .
Hence,
From this recursion, we find that
1 | 2 | 3 | 4 | 6 | 9 | 13 | 19 | 28 | 41 | 60 | 88 | 129 |
Solution 2
Since each of the elements of the subsets must be spaced at least two apart, a divider counting argument can be used.
From the set we choose at most four numbers. Let those numbers be represented by balls. Between each of the balls there are at least two dividers. So for example, o | | o | | o | | o | | represents .
For subsets of size there must be dividers between the balls, leaving dividers to be be placed in spots between the balls. The number of way this can be done is .
Therefore, the number of spacy subsets is .
Solution 3
A shifting argument is also possible, and is similiar in spirit to Solution 2. Clearly we can have at most elements. Given any arrangment, we subract from the element in our subset, when the elements are arranged in increasing order. This creates a bijection with the number of size subsets of the set of the first positive integers. For instance, the arrangment o | | o | | o | | | o | corresponds to the arrangment o o o | o |. Notice that there is no longer any restriction on consectutive numbers. Therefore, we can easily plug in the possible integers 0, 1, 2, 3, 4, 5 for :
In general, the number of subsets of size with no consecutive numbers is $\sum^{\floor{\frac{n}{k}}}_{i=0}{{(k-1)(i-1) \choose i}}$ (Error compiling LaTeX. Unknown error_msg).
Solution 4
As a last resort, we can brute force the result by repeated casework. Luckily, 12 is not a very large number, so solving it this way is still possible.
See also
2007 AMC 12A (Problems • Answer Key • Resources) | |
Preceded by Problem 24 |
Followed by Last question |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |