Difference between revisions of "2020 AMC 8 Problems/Problem 22"
Sevenoptimus (talk | contribs) m (Removed unnecessary and irrelevant attribution) |
(→Problem 22) |
||
(25 intermediate revisions by 10 users not shown) | |||
Line 1: | Line 1: | ||
− | ==Problem== | + | ==Problem 22== |
When a positive integer <math>N</math> is fed into a machine, the output is a number calculated according to the rule shown below. | When a positive integer <math>N</math> is fed into a machine, the output is a number calculated according to the rule shown below. | ||
Line 7: | Line 7: | ||
==Solution 1== | ==Solution 1== | ||
− | We start with | + | We start with final output of <math>1</math> and work backward, taking cares to consider all possible inputs that could have resulted in any particular output. This produces following set of possibilities each stage: |
− | <cmath>\{1\}\ | + | <cmath>\{1\}\rightarrow\{2\}\rightarrow\{4\}\rightarrow\{1,8\}\rightarrow\{2,16\}\rightarrow\{4,5,32\}\rightarrow\{1,8,10,64\}</cmath> |
− | where, for example, <math>2</math> must come from <math>4</math> (as there is no integer <math>n</math> satisfying <math>3n+1=2</math>), but <math>16</math> could come from <math>32</math> or <math>5</math> (as <math>\frac{32}{2} = 3 \cdot 5 + 1 = 16</math>, and <math>32</math> is even while <math>5</math> is odd). By construction, | + | where, for example, <math>2</math> must come from <math>4</math> (as there is no integer <math>n</math> satisfying <math>3n+1=2</math>), but <math>16</math> could come from <math>32</math> or <math>5</math> (as <math>\frac{32}{2} = 3 \cdot 5 + 1 = 16</math>, and <math>32</math> is even while <math>5</math> is odd). By construction, last set in this sequence contains all the numbers which will lead to number <math>1</math> to end of the <math>6</math>-step process, and sum is <math>1+8+10+64=\boxed{\textbf{(E) }83}</math>. |
==Solution 2 (variant of Solution 1)== | ==Solution 2 (variant of Solution 1)== | ||
Line 21: | Line 21: | ||
On the other hand, if the 4th-to-last number is <math>8</math>, substituting <math>8</math> into the inverse formulae shows that the 5th-to-last number is either <math>16</math> or <math>\frac{7}{3}</math>, but the latter is not an integer. Substituting <math>16</math> shows that if <math>I</math> is even, <math>I=32</math>, but if I is odd, <math>I=5</math>, and both of these are valid. If the 6th-to-last number is <math>32</math>, then the first number must be <math>64</math>, since <math>\frac{31}{3}</math> is not an integer; if the 6th-to-last number is <math>5,</math> then the first number has to be <math>10</math>, as <math>\frac{4}{3}</math> is not an integer. This means that, in total, there are <math>4</math> solutions for <math>N</math>, specifically, <math>1</math>, <math>8</math>, <math>10</math>, and <math>64</math>, which sum to <math>\boxed{\textbf{(E) }83}</math>. | On the other hand, if the 4th-to-last number is <math>8</math>, substituting <math>8</math> into the inverse formulae shows that the 5th-to-last number is either <math>16</math> or <math>\frac{7}{3}</math>, but the latter is not an integer. Substituting <math>16</math> shows that if <math>I</math> is even, <math>I=32</math>, but if I is odd, <math>I=5</math>, and both of these are valid. If the 6th-to-last number is <math>32</math>, then the first number must be <math>64</math>, since <math>\frac{31}{3}</math> is not an integer; if the 6th-to-last number is <math>5,</math> then the first number has to be <math>10</math>, as <math>\frac{4}{3}</math> is not an integer. This means that, in total, there are <math>4</math> solutions for <math>N</math>, specifically, <math>1</math>, <math>8</math>, <math>10</math>, and <math>64</math>, which sum to <math>\boxed{\textbf{(E) }83}</math>. | ||
− | ==Video Solution== | + | ==Video Solution by WhyMath== |
https://youtu.be/ZrDCymOhDdI | https://youtu.be/ZrDCymOhDdI | ||
+ | |||
+ | ~savannahsolver | ||
+ | |||
+ | ==Video Solutions== | ||
+ | https://youtu.be/lhDFmiKNPBg | ||
+ | |||
+ | ==Video Solution by Interstigation== | ||
+ | https://youtu.be/YnwkBZTv5Fw?t=1347 | ||
+ | |||
+ | ~Interstigation | ||
==See also== | ==See also== | ||
{{AMC8 box|year=2020|num-b=21|num-a=23}} | {{AMC8 box|year=2020|num-b=21|num-a=23}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 16:32, 1 May 2021
Contents
Problem 22
When a positive integer is fed into a machine, the output is a number calculated according to the rule shown below.
For example, starting with an input of the machine will output Then if the output is repeatedly inserted into the machine five more times, the final output is When the same -step process is applied to a different starting value of the final output is What is the sum of all such integers
Solution 1
We start with final output of and work backward, taking cares to consider all possible inputs that could have resulted in any particular output. This produces following set of possibilities each stage: where, for example, must come from (as there is no integer satisfying ), but could come from or (as , and is even while is odd). By construction, last set in this sequence contains all the numbers which will lead to number to end of the -step process, and sum is .
Solution 2 (variant of Solution 1)
As in Solution 1, we work backwards from , this time showing the possible cases in a tree diagram:
The possible numbers are those at the "leaves" of the tree (the ends of the various branches), which are , , , and . Thus the answer is .
Solution 3 (algebraic)
We begin by finding the inverse of the function that the machine uses. Call the input and the output . If is even, , and if is odd, . We can therefore see that when is even and when is odd. Therefore, starting with , if is even, , and if is odd, , but the latter is not valid since is not actually odd. This means that the 2nd-to-last number in the sequence has to be . Now, substituting into the inverse formulae, if is even, (which is indeed even), and if is odd, , which is not an integer. This means the 3rd-to-last number in the sequence has to be . Substituting in , if is even, , but if is odd, . Both of these are valid solutions, so the 4th-to-last number can be either or . If it is , then by the argument we have just made, the 5th-to-last number has to be , the 6th-to-last number has to be , and the 7th-to-last number, which is the first number, must be either or . In this way, we have ultimately found two solutions: and .
On the other hand, if the 4th-to-last number is , substituting into the inverse formulae shows that the 5th-to-last number is either or , but the latter is not an integer. Substituting shows that if is even, , but if I is odd, , and both of these are valid. If the 6th-to-last number is , then the first number must be , since is not an integer; if the 6th-to-last number is then the first number has to be , as is not an integer. This means that, in total, there are solutions for , specifically, , , , and , which sum to .
Video Solution by WhyMath
~savannahsolver
Video Solutions
Video Solution by Interstigation
https://youtu.be/YnwkBZTv5Fw?t=1347
~Interstigation
See also
2020 AMC 8 (Problems • Answer Key • Resources) | ||
Preceded by Problem 21 |
Followed by Problem 23 | |
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 AJHSME/AMC 8 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.