Difference between revisions of "2020 AMC 10B Problems/Problem 24"
Countmath1 (talk | contribs) m (→Solution 9) |
m (→Solution 1) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 27: | Line 27: | ||
This means that for <math>n = 400</math> and <math>n = 2500</math>, the equation will hold without the floor function. | This means that for <math>n = 400</math> and <math>n = 2500</math>, the equation will hold without the floor function. | ||
− | Now we can simply check the multiples of 70 around 400 and 2500 in the original equation | + | Now we can simply check the multiples of 70 around 400 and 2500 in the original equation, which we abbreviate as <math>L=R</math>. |
− | For <math>n = 330</math>, | + | For <math>n = 330</math>, <math>L=19</math> but <math>18^2 < 330 < 19^2</math> so <math>R=18</math> |
− | For <math>n = 400</math>, | + | For <math>n = 400</math>, <math>L=20</math> and <math>R=20</math> |
− | For <math>n = 470</math>, | + | For <math>n = 470</math>, <math>L=21</math>, <math>R=21</math> |
− | For <math>n = 540</math>, | + | For <math>n = 540</math>, <math>L=22</math> but <math>540 > 23^2</math> so <math>R=23</math> |
Now we move to <math>n = 2500</math> | Now we move to <math>n = 2500</math> | ||
− | For <math>n = 2430</math>, | + | For <math>n = 2430</math>, <math>L=49</math> and <math>49^2 < 2430 < 50^2</math> so <math>R=49</math> |
− | For <math>n = 2360</math>, | + | For <math>n = 2360</math>, <math>L=48</math> and <math>48^2 < 2360 < 49^2</math> so <math>R=48</math> |
− | For <math>n = 2290</math>, | + | For <math>n = 2290</math>, <math>L=47</math> and <math>47^2 < 2360 < 48^2</math> so <math>R=47</math> |
− | For <math>n = 2220</math>, | + | For <math>n = 2220</math>, <math>L=46</math> but <math>47^2 < 2220</math> so <math>R=47</math> |
− | For <math>n = 2500</math>, | + | For <math>n = 2500</math>, <math>L=50</math> and <math>R=50</math> |
− | For <math>n = 2570</math>, | + | For <math>n = 2570</math>, <math>L=51</math> but <math>2570 < 51^2</math> so <math>R=50</math> |
Therefore we have 6 total solutions, <math>n = 400, 470, 2290, 2360, 2430, 2500 = \boxed{\textbf{(C) 6}}</math> | Therefore we have 6 total solutions, <math>n = 400, 470, 2290, 2360, 2430, 2500 = \boxed{\textbf{(C) 6}}</math> | ||
Line 106: | Line 106: | ||
~KingRavi | ~KingRavi | ||
− | ==Solution | + | ==Solution 6 == |
Set <math>x=\sqrt{n}</math> in the given equation and solve for <math>x</math> to get <math>x^2 = 70 \cdot \lfloor x \rfloor - 1000</math>. Set <math>k = \lfloor x \rfloor \ge 0</math>; since <math>\lfloor x \rfloor^2 \le x^2 < (\lfloor x \rfloor + 1)^2</math>, we get <cmath>k^2 \le 70k - 1000 < k^2 + 2k + 1.</cmath> | Set <math>x=\sqrt{n}</math> in the given equation and solve for <math>x</math> to get <math>x^2 = 70 \cdot \lfloor x \rfloor - 1000</math>. Set <math>k = \lfloor x \rfloor \ge 0</math>; since <math>\lfloor x \rfloor^2 \le x^2 < (\lfloor x \rfloor + 1)^2</math>, we get <cmath>k^2 \le 70k - 1000 < k^2 + 2k + 1.</cmath> | ||
Line 119: | Line 119: | ||
~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] | ||
− | ==Solution | + | ==Solution 7 == |
Latest revision as of 09:26, 9 March 2024
- The following problem is from both the 2020 AMC 10B #24 and 2020 AMC 12B #21, so both problems redirect to this page.
Contents
[hide]Problem
How many positive integers satisfy (Recall that is the greatest integer not exceeding .)
Solution 1
We can first consider the equation without a floor function:
Multiplying both sides by 70 and then squaring:
Moving all terms to the left:
Now we can determine the factors:
This means that for and , the equation will hold without the floor function.
Now we can simply check the multiples of 70 around 400 and 2500 in the original equation, which we abbreviate as .
For , but so
For , and
For , ,
For , but so
Now we move to
For , and so
For , and so
For , and so
For , but so
For , and
For , but so
Therefore we have 6 total solutions,
Solution 2
This is my first solution here, so please forgive me for any errors.
We are given that
must be an integer, which means that is divisible by . As , this means that , so we can write for .
Therefore,
Also, we can say that and
Squaring the second inequality, we get .
Similarly solving the first inequality gives us or
is larger than and smaller than , so instead, we can say or .
Combining this with , we get are all solutions for that give a valid solution for , meaning that our answer is . -Solution By Qqqwerw
Solution 3
We start with the given equationFrom there, we can start with the general inequality that . This means thatSolving each inequality separately gives us two inequalities:Simplifying and approximating decimals yields 2 solutions for one inequality and 4 for the other. Hence, the answer is .
~Rekt4
Solution 4
Let be uniquely of the form where . Then, Rearranging and completeing the square gives This gives us Solving the left inequality shows that . Combing this with the right inequality gives that which implies either or . By directly computing the cases for using , it follows that only yield and invalid from . Since each corresponds to one and thus to one (from and the original form), there must be 6 such .
~the_jake314
Solution 5
Since the right-hand-side is an integer, so must be the left-hand-side. Therefore, we must have ; let . The given equation becomes
Since for all real , we can take with to get We can square the inequality to get The left inequality simplifies to , which yields The right inequality simplifies to , which yields
Solving , and , we get , for values .
Solving , and , we get , for values .
Thus, our answer is
~KingRavi
Solution 6
Set in the given equation and solve for to get . Set ; since , we get The left inequality simplifies to , which yields The right inequality simplifies to , which yields Solving , and , we get , for values .
Solving , and , we get , for values .
Thus, our answer is
Solution 7
If is a perfect square, we can write for a positive integer , so The given equation turns into
so or , so
If is not square, then we can say that, for a positive integer , we have
To solve this inequality, we take the intersection of the two solution sets to each of the two inequalities and . To solve the first one, we have
The second inequality yields
Notation wise, we need all integers such that
or
For the first one, since our uppoer bound is a little less than , the that works is . For the second, our lower bound is a little more than , so the that work are and .
total solutions for , since each value of corresponds to exactly one value of .
-Benedict T (countmath1)
Video Solutions
Video Solution 1
On The Spot STEM: https://youtu.be/BEJybl9TLMA
Video Solution 2
https://www.youtube.com/watch?v=VWeioXzQxVA&list=PLLCzevlMcsWNcTZEaxHe8VaccrhubDOlQ&index=9 ~ MathEx
Video Solution 3 by the Beauty of Math
https://youtu.be/4RVYoeiyC4w?t=62
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 |
2020 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 20 |
Followed by Problem 22 |
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.