Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 AMC 12A Problems/Problem 25"
(27 intermediate revisions by 12 users not shown)
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
  
−
How many non-[[empty]] [[subset]]s <math>S</math> of <math>\{1,2,3,\ldots ,15\}</math> have the following two properties?  
+
How many non-[[empty set | empty]] [[subset]]s <math>S</math> of <math>\{1,2,3,\ldots ,15\}</math> have the following two properties?  
  
−
<math>(1)</math>  No two [[consecutive integer]]s belong to <math>S</math>.
+
<math>(1)</math>  No two consecutive [[integer]]s belong to <math>S</math>.
  
 
<math>(2)</math>  If <math>S</math> contains <math>k</math> [[element]]s, then <math>S</math> contains no number less than <math>k</math>.
 
<math>(2)</math>  If <math>S</math> contains <math>k</math> [[element]]s, then <math>S</math> contains no number less than <math>k</math>.
  
−
<math> \mathrm{(A) \ } 277\qquad \mathrm{(B) \ } 311\qquad \mathrm{(C) \ } 376\qquad \mathrm{(D) \ } 377</math><math>\mathrm{(E) \ }  405</math>
+
<math> \mathrm{(A) \ } 277\qquad \mathrm{(B) \ } 311\qquad \mathrm{(C) \ } 376\qquad \mathrm{(D) \ } 377\qquad \mathrm{(E) \ }  405</math>
  
−
== Solution ==
+
== Solution 1==
 
This question can be solved fairly directly by casework and pattern-finding.  We give a somewhat more general attack, based on the solution to the following problem:
 
This question can be solved fairly directly by casework and pattern-finding.  We give a somewhat more general attack, based on the solution to the following problem:
  
 
How many ways are there to choose <math>k</math> elements from an ordered <math>n</math> element [[set]] without choosing two consecutive members?
 
How many ways are there to choose <math>k</math> elements from an ordered <math>n</math> element [[set]] without choosing two consecutive members?
  
−
Note that if <math>n < 2k - 1</math>, the answer will be 0.  Otherwise, the <math>k</math> elements we choose define <math>k + 1</math> boxes into which we can drop the <math>n - k</math> remaining elements, with the caveat that each of the middle <math>k - 1</math> boxes must have at least one element. This is equivalent to dropping <math>n - 2k + 1</math> elements into <math>k + 1</math> boxes, where each box is allowed to be empty.  And this is equivalent to arranging <math>n - k + 1</math> objects, <math>k</math> of which are dividers, which we can do in <math>\displaystyle F(n, k) = {n - k + 1 \choose k}</math> ways.
+
You want to choose <math>k</math> numbers out of <math>n</math> with no consecutive numbers. For each configuration, we can subtract <math>i-1</math> from the <math>i</math>-th element in your subset. This converts your configuration into a configuration with <math>k</math> elements where the largest possible element is <math>n-k+1</math>, with no restriction on consecutive numbers. Since this process is easily reversible, we have a [[bijection]].
 +
Without consideration of the second condition, we have:
 +
<math>{15 \choose 1} + {14 \choose 2} + {13 \choose 3} + ... + {9 \choose 7} + {8 \choose 8}</math>
  
−
Now, looking at our original question, we see that the thing we want to calculate is just <math>F(15, 1) + F(14, 2) + F(13, 3) + F(12, 4) + F(11, 5) = {15\choose 1} + {13\choose2} + {11\choose 3} + {9\choose 4} + {7 \choose 5} = 15 + 78 + 165 + 126 + 21 = 405 \Longrightarrow \mathrm{(E)}</math>
+
Now we examine the second condition. It simply states that no element in our original configuration (and hence also the modified configuration, since we don't move the smallest element) can be less than <math>k</math>, which translates to subtracting <math>k - 1</math> from the "top" of each [[binomial coefficient]].
 +
Now we have, after we cancel all the terms <math>{n \choose k}</math> where <math>n < k</math>,
 +
<math>{15 \choose 1} + {13 \choose 2} + {11 \choose 3} + {9 \choose 4} + {7 \choose 5}=  15 + 78 + 165 + 126 + 21 = \boxed{405} \Longrightarrow \mathrm{(E)}</math>
 +
 
 +
==Solution 2==
 +
Another way of visualizing the solution above would be to use <math>|</math>'s and <math>-</math>'s. Denote <math>|</math> as the numbers we have chosen and <math>-</math> as other numbers. Taking an example, assuming we are picking two numbers, we imagine the shape <math>| - |</math>. This notation forces a number between the two chosen numbers, which blocks the two numbers we picked from being consecutive. Now we consider the orientations with this shape. We have <math>15 - 3 = 12</math> remaining numbers.
 +
 
 +
We need to find the number of ways to place the remaining <math>12 -</math>'s. We can find this by utilizing stars and bars, with the following marker being placed to represent groups: *| - *|*. Now, we have to place <math>12</math> numbers within <math>3</math> groups, which is <math>{14 \choose 2}</math>. The same concept can be used for the remaining numbers. The rest of the solution continues as above.
 +
 
 +
Solution by: Everyoneintexas
 +
 
 +
==Solution 3==
 +
We have the same setup as in the previous solution.
 +
 
 +
Note that if <math>n < 2k - 1</math>, the answer will be 0.  Otherwise, the <math>k</math> elements we choose define <math>k + 1</math> boxes (which divide the nonconsecutive numbers) into which we can drop the <math>n - k</math> remaining elements, with the caveat that each of the middle <math>k - 1</math> boxes must have at least one element (since the numbers are nonconsecutive).  This is equivalent to dropping <math>n - 2k + 1</math> elements into <math>k + 1</math> boxes, where each box is allowed to be empty.  And this is equivalent to arranging <math>n - k + 1</math> objects, <math>k</math> of which are dividers, which we can do in <math>F(n, k) = {n - k + 1 \choose k}</math> ways.
 +
 
 +
Now, looking at our original question, we see that the thing we want to calculate is just <math>F(15, 1) + F(14, 2) + F(13, 3) + F(12, 4) + F(11, 5) = {15\choose 1} + {13\choose2} + {11\choose 3} + {9\choose 4} + {7 \choose 5} = 15 + 78 + 165 + 126 + 21  
 +
= 405 \Longrightarrow \mathrm{(E)}</math>
 +
 
 +
==Solution 4==
 +
Let <math>s</math> be the numbers of elements in a subset. First we examine the second condition. No elements less than <math>s</math> can be put in a subset of size <math>s</math>, therefore the "lowest" element that can go into the subset is <math>s</math>, whereas the "highest" element that can go into the subset is <math>15</math>. This is a total of <math>15-s+1</math> or <math>16-s</math> possible elements.
 +
 
 +
Now we consider the first condition. No consecutive elements are allowed. This means that if an element <math>e</math> is put into the subset, both <math>e-1</math> and <math>e+1</math> are no longer possibilities. Assume that all subsets are ordered from least to greatest (we are looking for the number of combinations, so we can order these combinations however we want). Then the first element will be <math>s</math> (as a reminder, the lowest possible element in a subset is <math>s</math>), the second element will be at least <math>s+2</math>, and so on. After <math>s</math> elements are chosen, we will have skipped <math>s-1</math> elements (these are the elements that were "eliminated" as they were consecutive). Therefore, we ignore exactly <math>s-1</math> elements (if we ignore more or less elements, then <math>s</math> changes) Since we must ignore <math>s-1</math> elements, we can simply remove those beforehand. (<math>16-s)-(s-1) = 17-2s</math> possible elements
 +
 
 +
Now we look for the bounds of <math>s</math>. We are looking for non-empty subsets, so <math>s\ge1</math>. If <math>s</math> is too large, there will not be enough non-consecutive terms between <math>s</math> and <math>15</math>. Specifically, the highest element in a subset using "optimal" selection will be <math>s+2(s-1)</math> or <math>3s-2</math>. If <math>3s-1>15</math>, that means s is too large. Therefore <math>3s-2\le15</math>; solving for <math>s</math> yields <math>s\le5</math>. Now we know that <math>1 \le s \le 5</math>.
 +
 
 +
We want to know the number of ways to arrange <math>17-2s</math> "balls" into <math>s</math> identical "boxes" with at most <math>1</math> ball per box, for <math>s=1</math> to <math>s=5</math>. This is equivalent to <math>\sum_{s=1}^{5}{17-2s \choose s} = 405</math>, or <math>\boxed{\text{E}}</math>.
 +
 
 +
==Solution 5 (Clever bash)==
 +
We will split the problem into cases, and maybe one could then generalize this to arbitrary <math>n</math>.
 +
 
 +
<math>\bold{Case 1}:</math> (<math>n=15, k=1</math>). Then this is easy. We have <math>\binom{15}{1}=15</math>.
 +
 
 +
<math>\bold{Case 2}:</math> (<math>n=14, k=2</math>). Now we have something tricky. To get a good grasp on this case, let us consider the smallest element; <math>2</math>, in the first spot. We then have <math>15-1=14</math> numbers left. However, we cannot have the digit <math>3</math>. Hence we have to choose <math>2</math> numbers from <math>14-1=13</math> integers left. This can be done in <math>\binom{13}{2}=78</math> ways.
 +
 
 +
<math>\bold{Case 3}:</math> (<math>n=13, k=3</math>). As in the last case, we can use the smallest element to get a good grasp on this case. Put the digit <math>3</math> in the first spot. Then there are <math>11</math> integers left for the second spot. But in total, we have to avoid <math>2</math> elements for each subset of cardinality <math>3</math> <math>{a,b,c}</math>. So we have to choose <math>3</math> elements from <math>13-2=11</math> elements, which can be done in <math>\binom{11}{3}=165</math> ways.
 +
 
 +
<math>\bold{Case 4}:</math> (<math>n=12, k=4</math>). As in the previous case, we have to avoid <math>3</math> numbers, and choose <math>4</math> from them. Which is choosing <math>4</math> elements from <math>12-3=9</math> elements, which can be done in <math>\binom{9}{4}=126</math> ways.
 +
 
 +
<math>\bold{Case 5}:</math> (<math>n=11, k=4</math>). Now you are accustomed to the strategy. We remove <math>4</math> integers leaving <math>\binom{7}{5}=21</math> ways.
 +
 
 +
Adding up all of the cases yields <math>405</math>, as in <math>\boxed{E)405}</math>.
 +
 
 +
Note also that we only went up to cardinality or <math>k=5</math>, or else for greater <math>k</math>, we would always have consecutive numbers.
 +
 
 +
EDIT: I have coincidentally found a video solution using the exact same method: https://www.youtube.com/watch?v=mqE9P2JEs-k
 +
(Also if you think I am copying, why would I have then posted the video, hm? Explain that)!
 +
 
 +
== Video Solutions ==
 +
https://www.youtube.com/watch?v=KpABvGFJANU (by Challenge 25)
  
 
== See also ==
 
== See also ==
−
* [[2006 AMC 12A Problems/Problem 24 | Previous problem]]
 
 
* [[2006 AMC 12A Problems]]
 
* [[2006 AMC 12A Problems]]
 +
 +
{{AMC12 box|year=2006|ab=A|num-b=24|after=Last Question}}
 +
{{MAA Notice}}
  
 
[[Category:Intermediate Combinatorics Problems]]
 
[[Category:Intermediate Combinatorics Problems]]

Revision as of 10:52, 27 September 2022

Problem

How many non- empty subsets $S$ of $\{1,2,3,\ldots ,15\}$ have the following two properties?

$(1)$ No two consecutive integers belong to $S$.

$(2)$ If $S$ contains $k$ elements, then $S$ contains no number less than $k$.

$\mathrm{(A) \ } 277\qquad \mathrm{(B) \ } 311\qquad \mathrm{(C) \ } 376\qquad \mathrm{(D) \ } 377\qquad \mathrm{(E) \ } 405$

Solution 1

This question can be solved fairly directly by casework and pattern-finding. We give a somewhat more general attack, based on the solution to the following problem:

How many ways are there to choose $k$ elements from an ordered $n$ element set without choosing two consecutive members?

You want to choose $k$ numbers out of $n$ with no consecutive numbers. For each configuration, we can subtract $i-1$ from the $i$-th element in your subset. This converts your configuration into a configuration with $k$ elements where the largest possible element is $n-k+1$, with no restriction on consecutive numbers. Since this process is easily reversible, we have a bijection. Without consideration of the second condition, we have: ${15 \choose 1} + {14 \choose 2} + {13 \choose 3} + ... + {9 \choose 7} + {8 \choose 8}$

Now we examine the second condition. It simply states that no element in our original configuration (and hence also the modified configuration, since we don't move the smallest element) can be less than $k$, which translates to subtracting $k - 1$ from the "top" of each binomial coefficient. Now we have, after we cancel all the terms ${n \choose k}$ where $n < k$, ${15 \choose 1} + {13 \choose 2} + {11 \choose 3} + {9 \choose 4} + {7 \choose 5}= 15 + 78 + 165 + 126 + 21 = \boxed{405} \Longrightarrow \mathrm{(E)}$

Solution 2

Another way of visualizing the solution above would be to use $|$'s and $-$'s. Denote $|$ as the numbers we have chosen and $-$ as other numbers. Taking an example, assuming we are picking two numbers, we imagine the shape $| - |$. This notation forces a number between the two chosen numbers, which blocks the two numbers we picked from being consecutive. Now we consider the orientations with this shape. We have $15 - 3 = 12$ remaining numbers.

We need to find the number of ways to place the remaining $12 -$'s. We can find this by utilizing stars and bars, with the following marker being placed to represent groups: *| - *|*. Now, we have to place $12$ numbers within $3$ groups, which is ${14 \choose 2}$. The same concept can be used for the remaining numbers. The rest of the solution continues as above.

Solution by: Everyoneintexas

Solution 3

We have the same setup as in the previous solution.

Note that if $n < 2k - 1$, the answer will be 0. Otherwise, the $k$ elements we choose define $k + 1$ boxes (which divide the nonconsecutive numbers) into which we can drop the $n - k$ remaining elements, with the caveat that each of the middle $k - 1$ boxes must have at least one element (since the numbers are nonconsecutive). This is equivalent to dropping $n - 2k + 1$ elements into $k + 1$ boxes, where each box is allowed to be empty. And this is equivalent to arranging $n - k + 1$ objects, $k$ of which are dividers, which we can do in $F(n, k) = {n - k + 1 \choose k}$ ways.

Now, looking at our original question, we see that the thing we want to calculate is just $F(15, 1) + F(14, 2) + F(13, 3) + F(12, 4) + F(11, 5) = {15\choose 1} + {13\choose2} + {11\choose 3} + {9\choose 4} + {7 \choose 5} = 15 + 78 + 165 + 126 + 21 = 405 \Longrightarrow \mathrm{(E)}$

Solution 4

Let $s$ be the numbers of elements in a subset. First we examine the second condition. No elements less than $s$ can be put in a subset of size $s$, therefore the "lowest" element that can go into the subset is $s$, whereas the "highest" element that can go into the subset is $15$. This is a total of $15-s+1$ or $16-s$ possible elements.

Now we consider the first condition. No consecutive elements are allowed. This means that if an element $e$ is put into the subset, both $e-1$ and $e+1$ are no longer possibilities. Assume that all subsets are ordered from least to greatest (we are looking for the number of combinations, so we can order these combinations however we want). Then the first element will be $s$ (as a reminder, the lowest possible element in a subset is $s$), the second element will be at least $s+2$, and so on. After $s$ elements are chosen, we will have skipped $s-1$ elements (these are the elements that were "eliminated" as they were consecutive). Therefore, we ignore exactly $s-1$ elements (if we ignore more or less elements, then $s$ changes) Since we must ignore $s-1$ elements, we can simply remove those beforehand. ($16-s)-(s-1) = 17-2s$ possible elements

Now we look for the bounds of $s$. We are looking for non-empty subsets, so $s\ge1$. If $s$ is too large, there will not be enough non-consecutive terms between $s$ and $15$. Specifically, the highest element in a subset using "optimal" selection will be $s+2(s-1)$ or $3s-2$. If $3s-1>15$, that means s is too large. Therefore $3s-2\le15$; solving for $s$ yields $s\le5$. Now we know that $1 \le s \le 5$.

We want to know the number of ways to arrange $17-2s$ "balls" into $s$ identical "boxes" with at most $1$ ball per box, for $s=1$ to $s=5$. This is equivalent to $\sum_{s=1}^{5}{17-2s \choose s} = 405$, or $\boxed{\text{E}}$.

Solution 5 (Clever bash)

We will split the problem into cases, and maybe one could then generalize this to arbitrary $n$.

$\bold{Case 1}:$ ($n=15, k=1$). Then this is easy. We have $\binom{15}{1}=15$.

$\bold{Case 2}:$ ($n=14, k=2$). Now we have something tricky. To get a good grasp on this case, let us consider the smallest element; $2$, in the first spot. We then have $15-1=14$ numbers left. However, we cannot have the digit $3$. Hence we have to choose $2$ numbers from $14-1=13$ integers left. This can be done in $\binom{13}{2}=78$ ways.

$\bold{Case 3}:$ ($n=13, k=3$). As in the last case, we can use the smallest element to get a good grasp on this case. Put the digit $3$ in the first spot. Then there are $11$ integers left for the second spot. But in total, we have to avoid $2$ elements for each subset of cardinality $3$ ${a,b,c}$. So we have to choose $3$ elements from $13-2=11$ elements, which can be done in $\binom{11}{3}=165$ ways.

$\bold{Case 4}:$ ($n=12, k=4$). As in the previous case, we have to avoid $3$ numbers, and choose $4$ from them. Which is choosing $4$ elements from $12-3=9$ elements, which can be done in $\binom{9}{4}=126$ ways.

$\bold{Case 5}:$ ($n=11, k=4$). Now you are accustomed to the strategy. We remove $4$ integers leaving $\binom{7}{5}=21$ ways.

Adding up all of the cases yields $405$, as in $\boxed{E)405}$.

Note also that we only went up to cardinality or $k=5$, or else for greater $k$, we would always have consecutive numbers.

EDIT: I have coincidentally found a video solution using the exact same method: https://www.youtube.com/watch?v=mqE9P2JEs-k (Also if you think I am copying, why would I have then posted the video, hm? Explain that)!

Video Solutions

https://www.youtube.com/watch?v=KpABvGFJANU (by Challenge 25)

See also

2006 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

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_AMC_12A_Problems/Problem_25&oldid=178484"