Difference between revisions of "2022 AMC 10B Problems/Problem 8"
MRENTHUSIASM (talk | contribs) (→Solution 3) |
(→Solution 5 (Very Fast System of Equations)) |
||
(27 intermediate revisions by 14 users not shown) | |||
Line 10: | Line 10: | ||
&\{991,992,993,\ldots,1000\}. | &\{991,992,993,\ldots,1000\}. | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
− | |||
How many of these sets contain exactly two multiples of <math>7</math>? | How many of these sets contain exactly two multiples of <math>7</math>? | ||
<math>\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50</math> | <math>\textbf{(A)}\ 40\qquad\textbf{(B)}\ 42\qquad\textbf{(C)}\ 43\qquad\textbf{(D)}\ 49\qquad\textbf{(E)}\ 50</math> | ||
− | ==Solution 1== | + | ==Solution 1 (Casework)== |
We apply casework to this problem. The only sets that contain two multiples of seven are those for which: | We apply casework to this problem. The only sets that contain two multiples of seven are those for which: | ||
Line 30: | Line 29: | ||
~MRENTHUSIASM | ~MRENTHUSIASM | ||
− | ==Solution 2 | + | ==Solution 2 (Find A Pattern)== |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
We find a pattern. | We find a pattern. | ||
<cmath>\begin{align*} | <cmath>\begin{align*} | ||
Line 48: | Line 38: | ||
&\{991,992,993,\ldots,1000\}. | &\{991,992,993,\ldots,1000\}. | ||
\end{align*}</cmath> | \end{align*}</cmath> | ||
− | + | We can figure out that the first set has <math>1</math> multiple of <math>7</math>. The second set also has <math>1</math> multiple of <math>7</math>. The third set has <math>2</math> multiples of <math>7</math>. The fourth set has <math>1</math> multiple of <math>7</math>. The fifth set has <math>2</math> multiples of <math>7</math>. The sixth set has <math>1</math> multiple of <math>7</math>. The seventh set has <math>1</math> multiple of <math>7</math>. The eighth set has <math>2</math> multiples of <math>7</math>. Disregarding the first set and then calculating this pattern further, we can see (reasonably) that it repeats for each <math>1</math> sets. | |
− | We see that the pattern for the number of multiples per | + | We see that the pattern for the number of multiples per <math>7</math> sets (again, disregarding the first set) goes: <math>1,2,1,2,1,1,2.</math> So, for every <math>7</math> sets after the first, there are three sets with <math>2</math> multiples of <math>7</math>. We calculate <math>\left\lfloor\frac{100-1}{7}\right\rfloor</math> and multiply that by <math>3</math>. (We also disregard the remainder of <math>1</math> since it doesn't add any extra sets with <math>2</math> multiples of <math>7</math>.). We get <math>14\cdot3= \boxed{\textbf{(B) }42}</math>. |
+ | |||
+ | ~(edited by) mihikamishra | ||
+ | |||
+ | ~(edited by) MiniGlasses2009 | ||
+ | |||
+ | ==Solution 3 (Fastest)== | ||
+ | Each set contains exactly <math>1</math> or <math>2</math> multiples of <math>7</math>. | ||
+ | |||
+ | There are <math>\dfrac{1000}{10}=100</math> total sets and <math>\left\lfloor\dfrac{1000}{7}\right\rfloor = 142</math> multiples of <math>7</math>. Thus, there are <math>142-100=\boxed{\textbf{(B) }42}</math> sets with <math>2</math> multiples of <math>7</math>. | ||
+ | |||
+ | ~BrandonZhang202415 | ||
+ | |||
+ | == Solution 4 (Simple Counting, Similar to Solution 1) == | ||
+ | |||
+ | Consecutive multiples of <math>7</math> must differ by <math>7</math>. So, if a set <math>\{\ldots1,\ldots2,\ldots3,(\ldots),\ldots8,\ldots9,\ldots0\}</math> contains two multiples of <math>7</math>, they must end with the digits <math>1</math> and <math>8</math>, <math>2</math> and <math>9</math>, or <math>3</math> and <math>0</math>. This reduces the problem to counting the amount of multiples of <math>7</math> less than <math>1000</math> that end with <math>1</math>, <math>2</math>, and <math>3</math>. | ||
+ | |||
+ | The first multiple of <math>7</math> that ends with <math>1</math> is <math>21</math>. The next multiple that ends with <math>1</math> occurs <math>70</math> later, since that is the smallest multiple of <math>7</math> we can add to <math>21</math> without affecting the last digit. The greatest number of <math>70</math>'s we can add to <math>21</math> while keeping it less than <math>1000</math> is <math>13</math>, because <math>21 + 70(13) = 931</math>. Therefore, the set of multiples of <math>7</math> less than <math>1000</math> ending with <math>1</math> is <math>\{21 + 70(0), 21+70(1),\ldots,21+70(13)\}</math>, meaning there are <math>14</math> of these particular multiples. We can use the same reasoning to count the multiples of <math>7</math> that end with <math>2</math> and <math>3</math>. | ||
+ | |||
+ | The first multiple of <math>7</math> that ends with <math>2</math> is <math>42</math>. The greatest number of <math>70</math>'s we can add to <math>42</math> here is also <math>13</math>, since <math>42 + 70(13) = 952</math>. The set of multiples of <math>7</math> less than <math>1000</math> ending with <math>2</math> is <math>\{42 + 70(0), 42+70(1),\ldots,42+70(13)\}</math>, giving <math>14</math> multiples. | ||
− | ==Video Solution | + | The first multiple of <math>7</math> that ends with <math>3</math> is <math>63</math>. The greatest number of <math>70</math>'s we can add to <math>63</math> here is yet again <math>13</math>, since <math>63 + 70(13) = 973</math>. The set of multiples of <math>7</math> less than <math>1000</math> ending with <math>3</math> is <math>\{63 + 70(0), 63+70(1),\ldots,63+70(13)\}</math>, giving another <math>14</math> multiples. |
+ | |||
+ | In total, there are <math>14 + 14 + 14 = 42</math> of these multiples, and so <math>\boxed{\textbf{(B) }42}</math> sets with two multiples of <math>7</math>. | ||
+ | |||
+ | ~marsus16112 | ||
+ | |||
+ | == Solution 5 (Very Fast System of Equations) == | ||
+ | |||
+ | Let <math>a</math> be the number of sets with <math>1</math> multiple of <math>7</math> and <math>b</math> be the number of sets with <math>2</math> multiples of <math>7</math>. Note that it is impossible for a set to have more than two multiples of <math>7</math>. | ||
+ | |||
+ | Since there are a total of <math>100</math> sets, <math>a+b=100</math>. Also, since there are <math>\lfloor \frac{1000}{7}\rfloor = 142</math> multiples of <math>7</math> between <math>1</math> and <math>1000</math>, we must have <math>a+2b=142</math>. | ||
+ | |||
+ | Solving the system of equations | ||
+ | |||
+ | <cmath>a+b=100</cmath> | ||
+ | <cmath>a+2b=142</cmath> | ||
+ | |||
+ | for <math>b</math> gives us the answer of <math>\boxed{\textbf{(B) }42}</math>. | ||
+ | |||
+ | ~FIREDRAGONMATH16 | ||
+ | ~scrares (minor edit) | ||
+ | |||
+ | ==Solution 6 (reasonable count)== | ||
+ | |||
+ | (Similar to Solution 2, but a little more intuitive and less numbers.) Note that this system loops every cycle of length <math>70</math>, or <math>7</math> such sets. From <math>1</math> to <math>70</math>, the multiples of <math>7</math> are <math>7</math>, <math>14</math>, <math>21</math>, <math>28</math>, <math>35</math>, <math>42</math>, <math>49</math>, <math>56</math>, <math>63</math>, and <math>70</math>; note that <math>(21,28),(42,49),</math> and <math>(63,70)</math> are in the same sets. Thus, for every <math>7</math> sets, we have <math>3</math> sets with exactly two multiples of <math>7</math>. We have <math>100</math> sets, which is <math>98+2=7\cdot14+2</math>; the first <math>98</math> sets contain <math>\dfrac37(7\cdot14)=42</math> desired sets. The last two sets comprise the integers from <math>981</math> to <math>999</math>; the multiples of <math>7</math> here are <math>987</math> and <math>994</math>. Neither of the two last sets contains two multiples of <math>7</math>, so our answer is simply <math>\boxed{\textbf{(D) }42}</math>. | ||
+ | |||
+ | ~Technodoggo | ||
+ | |||
+ | ==Video Solution (🚀Under 3 min🚀)== | ||
https://youtu.be/PdyKJ1p9Y2w | https://youtu.be/PdyKJ1p9Y2w | ||
~Education, the Study of Everything | ~Education, the Study of Everything | ||
+ | |||
+ | ==Video Solution(1-16)== | ||
+ | https://youtu.be/SCwQ9jUfr0g | ||
+ | |||
+ | ~~Hayabusa1 | ||
+ | |||
+ | ==Video Solution by Interstigation== | ||
+ | https://youtu.be/_KNR0JV5rdI?t=884 | ||
== See Also == | == See Also == |
Latest revision as of 04:57, 11 November 2024
- The following problem is from both the 2022 AMC 10B #8 and 2022 AMC 12B #6, so both problems redirect to this page.
Contents
- 1 Problem
- 2 Solution 1 (Casework)
- 3 Solution 2 (Find A Pattern)
- 4 Solution 3 (Fastest)
- 5 Solution 4 (Simple Counting, Similar to Solution 1)
- 6 Solution 5 (Very Fast System of Equations)
- 7 Solution 6 (reasonable count)
- 8 Video Solution (🚀Under 3 min🚀)
- 9 Video Solution(1-16)
- 10 Video Solution by Interstigation
- 11 See Also
Problem
Consider the following sets of elements each: How many of these sets contain exactly two multiples of ?
Solution 1 (Casework)
We apply casework to this problem. The only sets that contain two multiples of seven are those for which:
- The multiples of are and That is, the first and eighth elements of such sets are multiples of
- The multiples of are and That is, the second and ninth elements of such sets are multiples of
- The multiples of are and That is, the third and tenth elements of such sets are multiples of
The first element is for some integer It is a multiple of when
The second element is for some integer It is a multiple of when
The third element is for some integer It is a multiple of when
Each case has sets. Therefore, the answer is
~MRENTHUSIASM
Solution 2 (Find A Pattern)
We find a pattern. We can figure out that the first set has multiple of . The second set also has multiple of . The third set has multiples of . The fourth set has multiple of . The fifth set has multiples of . The sixth set has multiple of . The seventh set has multiple of . The eighth set has multiples of . Disregarding the first set and then calculating this pattern further, we can see (reasonably) that it repeats for each sets. We see that the pattern for the number of multiples per sets (again, disregarding the first set) goes: So, for every sets after the first, there are three sets with multiples of . We calculate and multiply that by . (We also disregard the remainder of since it doesn't add any extra sets with multiples of .). We get .
~(edited by) mihikamishra
~(edited by) MiniGlasses2009
Solution 3 (Fastest)
Each set contains exactly or multiples of .
There are total sets and multiples of . Thus, there are sets with multiples of .
~BrandonZhang202415
Solution 4 (Simple Counting, Similar to Solution 1)
Consecutive multiples of must differ by . So, if a set contains two multiples of , they must end with the digits and , and , or and . This reduces the problem to counting the amount of multiples of less than that end with , , and .
The first multiple of that ends with is . The next multiple that ends with occurs later, since that is the smallest multiple of we can add to without affecting the last digit. The greatest number of 's we can add to while keeping it less than is , because . Therefore, the set of multiples of less than ending with is , meaning there are of these particular multiples. We can use the same reasoning to count the multiples of that end with and .
The first multiple of that ends with is . The greatest number of 's we can add to here is also , since . The set of multiples of less than ending with is , giving multiples.
The first multiple of that ends with is . The greatest number of 's we can add to here is yet again , since . The set of multiples of less than ending with is , giving another multiples.
In total, there are of these multiples, and so sets with two multiples of .
~marsus16112
Solution 5 (Very Fast System of Equations)
Let be the number of sets with multiple of and be the number of sets with multiples of . Note that it is impossible for a set to have more than two multiples of .
Since there are a total of sets, . Also, since there are multiples of between and , we must have .
Solving the system of equations
for gives us the answer of .
~FIREDRAGONMATH16 ~scrares (minor edit)
Solution 6 (reasonable count)
(Similar to Solution 2, but a little more intuitive and less numbers.) Note that this system loops every cycle of length , or such sets. From to , the multiples of are , , , , , , , , , and ; note that and are in the same sets. Thus, for every sets, we have sets with exactly two multiples of . We have sets, which is ; the first sets contain desired sets. The last two sets comprise the integers from to ; the multiples of here are and . Neither of the two last sets contains two multiples of , so our answer is simply .
~Technodoggo
Video Solution (🚀Under 3 min🚀)
~Education, the Study of Everything
Video Solution(1-16)
~~Hayabusa1
Video Solution by Interstigation
https://youtu.be/_KNR0JV5rdI?t=884
See Also
2022 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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 10 Problems and Solutions |
2022 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 5 |
Followed by Problem 7 |
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.