Difference between revisions of "2021 Fall AMC 10B Problems/Problem 19"
(→Solution 1) |
Cyberhacker (talk | contribs) (→Solution 6 (Intuition)) |
||
(11 intermediate revisions by 9 users not shown) | |||
Line 6: | Line 6: | ||
We can rewrite <math>N</math> as <math>\frac{7}{9}\cdot 9999\ldots999 = \frac{7}{9}\cdot(10^{313}-1)</math>. | We can rewrite <math>N</math> as <math>\frac{7}{9}\cdot 9999\ldots999 = \frac{7}{9}\cdot(10^{313}-1)</math>. | ||
When approximating values, as we will shortly do, the minus one will become negligible so we can ignore it. | When approximating values, as we will shortly do, the minus one will become negligible so we can ignore it. | ||
− | When we take the power of ten out of the square root, we’ll be multiplying by another power of ten, so the leading digit will not change. Thus the leading digit of <math>f(r)</math> will be equal to the leading digit of <math>\sqrt[r]{\frac{7}{9} \cdot 10^{313( | + | When we take the power of ten out of the square root, we’ll be multiplying by another power of ten, so the leading digit will not change. Thus the leading digit of <math>f(r)</math> will be equal to the leading digit of <math>\sqrt[r]{\frac{7}{9} \cdot 10^{313(\mod r)}}</math>. |
− | Then <math>f(2)</math> is the first digit of <math>\sqrt{\frac{7}{9}\cdot(10)} = \sqrt{\frac{70}{9}} = \sqrt{7.\ldots} \approx 2</math> | + | Then <math>f(2)</math> is the first digit of <math>\sqrt{\frac{7}{9}\cdot(10)} = \sqrt{\frac{70}{9}} = \sqrt{7. \ldots} \approx 2</math> |
<math>f(3) - \sqrt[3]{\frac{7}{9} \cdot 10} = \sqrt[3]{\frac{70}{9}} = \sqrt[3]{7.\ldots} \approx 1</math>. | <math>f(3) - \sqrt[3]{\frac{7}{9} \cdot 10} = \sqrt[3]{\frac{70}{9}} = \sqrt[3]{7.\ldots} \approx 1</math>. | ||
Line 18: | Line 18: | ||
<math>f(6) - \sqrt[6]{\frac{7}{9} \cdot 10} = \sqrt[6]{\frac{70}{9}} = \sqrt[6]{7.\ldots} \approx 1</math>. | <math>f(6) - \sqrt[6]{\frac{7}{9} \cdot 10} = \sqrt[6]{\frac{70}{9}} = \sqrt[6]{7.\ldots} \approx 1</math>. | ||
− | The final answer is therefore <math>2+1+1+3+1 | + | The final answer is therefore <math>2+1+1+3+1 = \boxed{\textbf{(A) }8}</math>. |
− | ~KingRavi | + | Note: in all of the divisions, we omitted the decimal places, because they are irrelevant to finding the leading digit. |
+ | |||
+ | ~KingRavi, mathboy282 | ||
== Solution 2 == | == Solution 2 == | ||
Line 65: | Line 67: | ||
First, we compute <math>f \left( 2 \right)</math>. | First, we compute <math>f \left( 2 \right)</math>. | ||
− | Because <math>N > 4 \cdot 10^{312}</math>, <math>\sqrt{N} > 2 \cdot 10^{ | + | Because <math>N > 4 \cdot 10^{312}</math>, <math>\sqrt{N} > 2 \cdot 10^{156}</math>. |
− | Because <math>N < 9 \cdot 10^{312}</math>, <math>\sqrt{N} < 3 \cdot 10^{ | + | Because <math>N < 9 \cdot 10^{312}</math>, <math>\sqrt{N} < 3 \cdot 10^{156}</math>. |
Therefore, <math>f \left( 2 \right) = 2</math>. | Therefore, <math>f \left( 2 \right) = 2</math>. | ||
Line 114: | Line 116: | ||
==Solution 5 (Guessing)== | ==Solution 5 (Guessing)== | ||
− | Benford's Law states that in random numbers, the leading digit is more likely to be <math>1,2,</math> or <math>3</math> rather than <math> | + | Benford's Law states that in random numbers, the leading digit is more likely to be <math>1,2,</math> or <math>3</math> rather than <math>8</math> or <math>9</math>. From here, we can eliminate C, D, E. It is better to guess between A and B than not guess at all since your expected score from doing this is <math>3</math> points. |
~MathFun1000 | ~MathFun1000 | ||
+ | |||
+ | ==Solution 6 (Intuition)== | ||
+ | |||
+ | To begin with, you can test some numbers and find a pattern. For <math>f(2)</math>, we get the leading digit of <math>\sqrt{7}</math> is 2, and the leading digit of <math>\sqrt{77}</math> is 8. With each <math>7</math> afterward, it repeats in a loop: <math>2</math> for <math>7</math>, <math>8</math> for <math>77</math>, <math>2</math> for <math>777</math>, <math>8</math> for <math>777</math>, and so on. Since the problem states that <math>N</math> is a <math>313</math>-digit number, we get the leading digit as <math>2</math> for <math>f(2)</math>. For <math>f(3)</math>, it repeats in a loop of <math>3</math> (<math>\text{3rd}</math> root means it repeats every <math>3</math> times). In this case, you would get the leading digit for the <math>\text{3rd}</math> root of <math>7</math> to be 1, <math>77</math> it will be 4, and for <math>777</math> it will be 9. Since <math>N</math> is <math>1</math> more than a multiple of 3, the leading digit for <math>f(3)</math> is <math>1</math>. Likewise, we can find the leading digits for <math>f(4)</math> to be <math>1</math>, <math>f(5)</math> to be <math>3</math>, and <math>f(6)</math> to be <math>1</math>: | ||
+ | |||
+ | For <math>f(2)</math>: <math>7: \boxed{2},\hspace{0.085in} 77: 8 ...</math> | ||
+ | |||
+ | For <math>f(3)</math>: <math>7: \boxed{1},\hspace{0.085in} 77: 4,\hspace{0.085in} 777: 9 ...</math> | ||
+ | |||
+ | For <math>f(4)</math>: <math>7: \boxed{1},\hspace{0.085in} 77: 2,\hspace{0.085in} 777: 5,\hspace{0.085in} 7777: 9 ...</math> | ||
+ | |||
+ | For <math>f(5)</math>: <math>7: 1,\hspace{0.085in} 77: 2,\hspace{0.085in} 777: \boxed{3},\hspace{0.085in} 7777: 6,\hspace{0.085in} 77777: 9 ...</math> | ||
+ | |||
+ | For <math>f(6)</math>: <math>7: \boxed{1},\hspace{0.085in} 77: 2,\hspace{0.085in} 777: 3,\hspace{0.085in} 7777: 4,\hspace{0.085in} 77777: 6,\hspace{0.085in} 777777: 9 ...</math> | ||
+ | |||
+ | Remember that it loops every <math>r</math> times; the boxed numbers are where <math>N</math> falls. Thus, the desired sum is <math>2+1+1+3+1 = \boxed{\textbf{(A) }8}</math> | ||
+ | |||
+ | ~[https://artofproblemsolving.com/community/user/cyberhacker cyberhacker] | ||
+ | |||
+ | ==Video Solution by Interstigation== | ||
+ | https://youtu.be/CqyVowe6qN4 | ||
+ | |||
+ | ~Interstigation | ||
+ | |||
+ | ==Video Solution 2 by WhyMath== | ||
+ | https://youtu.be/QEc1GhZnDuo | ||
+ | |||
+ | ~savannahsolver | ||
==See Also== | ==See Also== | ||
{{AMC10 box|year=2021 Fall|ab=B|num-a=20|num-b=18}} | {{AMC10 box|year=2021 Fall|ab=B|num-a=20|num-b=18}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Latest revision as of 06:52, 28 October 2024
Contents
Problem
Let be the positive integer , a -digit number where each digit is a . Let be the leading digit of the th root of . What is
Solution 1
We can rewrite as . When approximating values, as we will shortly do, the minus one will become negligible so we can ignore it. When we take the power of ten out of the square root, we’ll be multiplying by another power of ten, so the leading digit will not change. Thus the leading digit of will be equal to the leading digit of .
Then is the first digit of
.
.
.
.
The final answer is therefore .
Note: in all of the divisions, we omitted the decimal places, because they are irrelevant to finding the leading digit.
~KingRavi, mathboy282
Solution 2
For notation purposes, let be the number with digits, and let be the leading digit of . As an example, , because , and the first digit of that is .
Notice that for all numbers ; this is because , and dividing by does not affect the leading digit of a number. Similarly, In general, for positive integers and real numbers , it is true that Behind all this complex notation, all that we're really saying is that the first digit of something like has the same first digit as and .
The problem asks for
From our previous observation, we know that Therefore, . We can evaluate , the leading digit of , to be . Therefore, .
Similarly, we have Therefore, . We know , so .
Next, and , so .
We also have and , so .
Finally, and , so .
We have that .
~ihatemath123
Solution 3 (Condensed Solution 1)
Since is a digit number and is around , we have is . is the same story, so is . It is the same as as well, so is also . However, is mod , so we need to take the 5th root of , which is between and , and therefore, is . is the same as , since it is more than a multiple of . Therefore, we have which is .
~Arcticturn
Solution 4
First, we compute .
Because , . Because , .
Therefore, .
Second, we compute .
Because , . Because , .
Therefore, .
Third, we compute .
Because , . Because , .
Therefore, .
Fourth, we compute .
Because , . Because , .
Therefore, .
Fifth, we compute .
Because , . Because , .
Therefore, .
Therefore,
Therefore, the answer is .
~Steven Chen (www.professorchenedu.com)
Solution 5 (Guessing)
Benford's Law states that in random numbers, the leading digit is more likely to be or rather than or . From here, we can eliminate C, D, E. It is better to guess between A and B than not guess at all since your expected score from doing this is points.
~MathFun1000
Solution 6 (Intuition)
To begin with, you can test some numbers and find a pattern. For , we get the leading digit of is 2, and the leading digit of is 8. With each afterward, it repeats in a loop: for , for , for , for , and so on. Since the problem states that is a -digit number, we get the leading digit as for . For , it repeats in a loop of ( root means it repeats every times). In this case, you would get the leading digit for the root of to be 1, it will be 4, and for it will be 9. Since is more than a multiple of 3, the leading digit for is . Likewise, we can find the leading digits for to be , to be , and to be :
For :
For :
For :
For :
For :
Remember that it loops every times; the boxed numbers are where falls. Thus, the desired sum is
Video Solution by Interstigation
~Interstigation
Video Solution 2 by WhyMath
~savannahsolver
See Also
2021 Fall AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 18 |
Followed by Problem 20 | |
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.