Difference between revisions of "2020 AMC 10B Problems/Problem 24"
(→Solution) |
(→Solution) |
||
Line 8: | Line 8: | ||
(Quick solution if you’re in a hurry) | (Quick solution if you’re in a hurry) | ||
− | First notice that the graphs of <math>(x+1000)/70</math> and <math>\sqrt[]{n}</math> intersect at 2 points. Then, notice that <math>(n+1000)/70</math> must be an integer. This means that n is congruent to 50 (mod 70). | + | First notice that the graphs of <math>(x+1000)/70</math> and <math>\sqrt[]{n}</math> intersect at 2 points. Then, notice that <math>(n+1000)/70</math> must be an integer. This means that n is congruent to <math>50 (mod 70)</math>. |
− | For the first intersection, testing the first few values of <math>n</math> (adding <math>70</math> to n each time and noticing the left side increases by <math>1</math> each time) yields <math>n=20</math> and <math>n=21</math>. | + | For the first intersection, testing the first few values of <math>n</math> (adding <math>70</math> to <math>n</math> each time and noticing the left side increases by <math>1</math> each time) yields <math>n=20</math> and <math>n=21</math>. |
For the second intersection, using binary search can narrow down the other cases, being <math>n=47</math>, <math>n=48</math>, <math>n=49</math>, and <math>n=50</math>. This results in a total of 6 cases, for an answer of <math>\boxed{\textbf{(C) }6}</math>. | For the second intersection, using binary search can narrow down the other cases, being <math>n=47</math>, <math>n=48</math>, <math>n=49</math>, and <math>n=50</math>. This results in a total of 6 cases, for an answer of <math>\boxed{\textbf{(C) }6}</math>. |
Revision as of 12:17, 8 February 2020
Problem
How many positive integers satisfy(Recall that is the greatest integer not exceeding .)
Solution
(Quick solution if you’re in a hurry)
First notice that the graphs of and intersect at 2 points. Then, notice that must be an integer. This means that n is congruent to .
For the first intersection, testing the first few values of (adding to each time and noticing the left side increases by each time) yields and .
For the second intersection, using binary search can narrow down the other cases, being , , , and . This results in a total of 6 cases, for an answer of .
~DrJoyo
See Also
2020 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
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.