Difference between revisions of "2018 AMC 10B Problems/Problem 25"
m (→Solution 9) |
m (→Solution 7) |
||
(14 intermediate revisions by 9 users not shown) | |||
Line 1: | Line 1: | ||
− | {{duplicate|[[2018 AMC 10B Problems|2018 AMC 10B #25]] and [[2018 AMC 12B Problems|2018 AMC 12B #24]]}} | + | {{duplicate|[[2018 AMC 10B Problems#Problem 25 | 2018 AMC 10B #25]] and [[2018 AMC 12B Problems#Problem 24|2018 AMC 12B #24]]}} |
== Problem == | == Problem == | ||
Line 7: | Line 7: | ||
==Solution 1== | ==Solution 1== | ||
− | This rewrites itself to <math>x^2=10,000\{x\}</math>. | + | This rewrites itself to <math>x^2=10,000\{x\}</math> where <math>\lfloor x \rfloor + \{x\} = x</math>. |
Graphing <math>y=10,000\{x\}</math> and <math>y=x^2</math> we see that the former is a set of line segments with slope <math>10,000</math> from <math>0</math> to <math>1</math> with a hole at <math>x=1</math>, then <math>1</math> to <math>2</math> with a hole at <math>x=2</math> etc. | Graphing <math>y=10,000\{x\}</math> and <math>y=x^2</math> we see that the former is a set of line segments with slope <math>10,000</math> from <math>0</math> to <math>1</math> with a hole at <math>x=1</math>, then <math>1</math> to <math>2</math> with a hole at <math>x=2</math> etc. | ||
Line 39: | Line 39: | ||
</asy> | </asy> | ||
− | Now notice that when <math>x=\pm 100</math> | + | Now notice that when <math>x=\pm 100</math> the graph has a hole at <math>(\pm 100,10,000)</math> which the equation <math>y=x^2</math> passes through and then continues upwards. Thus our set of possible solutions is bounded by <math>(-100,100)</math>. We can see that <math>y=x^2</math> intersects each of the lines once and there are <math>99-(-99)+1=199</math> lines for an answer of <math>\boxed{\text{(C)}~199}</math>. |
− | |||
− | |||
− | |||
− | |||
==Solution 2== | ==Solution 2== | ||
Line 87: | Line 83: | ||
Note (not by author): this solution seems to be invalid at first, because one can not determine whether <math>x</math> is an integer or not. However, it actually works because although <math>x</math> itself might not be an integer, it is very close to one, so there are 199 potential <math>x</math>. | Note (not by author): this solution seems to be invalid at first, because one can not determine whether <math>x</math> is an integer or not. However, it actually works because although <math>x</math> itself might not be an integer, it is very close to one, so there are 199 potential <math>x</math>. | ||
+ | |||
+ | Another Note (not by author of previous note): we can actually determine that <math>x</math>=0 is the only possible integer value of <math>x</math> is we set <math>x</math>=<math>\lfloor x \rfloor</math> we end up with <math>x</math>=0 ~YJC64002776 | ||
==Solution 4== | ==Solution 4== | ||
− | Notice the given equation is | + | Notice the given equation is equivalent to <math>(\lfloor x \rfloor+\{x\})^2=10,000\{x\} </math> |
− | Now we | + | Now we know that <math>\{x\} < 1</math> so plugging in <math>1</math> for <math>\{x\}</math> we can find the upper and lower bounds for the values. |
<math>(\lfloor x \rfloor +1)^2 = 10,000(1)</math> | <math>(\lfloor x \rfloor +1)^2 = 10,000(1)</math> | ||
Line 103: | Line 101: | ||
==Solution 5== | ==Solution 5== | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
Firstly, if <math>x</math> is an integer, then <math>10,000\lfloor x \rfloor=10,000x</math>, so <math>x</math> must be <math>0</math>. | Firstly, if <math>x</math> is an integer, then <math>10,000\lfloor x \rfloor=10,000x</math>, so <math>x</math> must be <math>0</math>. | ||
Line 131: | Line 112: | ||
<math>0<10,000x<10,000</math> | <math>0<10,000x<10,000</math> | ||
− | Therefore, <math>0<x^2+10,000\lfloor x \rfloor <1</math>, which overlaps with <math>0<10,000x<10,000</math>. This means that there is at least one real solution between <math>0</math> and <math>1</math>. Since <math>x^2+10,000\lfloor x \rfloor </math> increases | + | Therefore, <math>0<x^2+10,000\lfloor x \rfloor <1</math>, which overlaps with <math>0<10,000x<10,000</math>. This means that there is at least one real solution between <math>0</math> and <math>1</math>. Since <math>x^2+10,000\lfloor x \rfloor </math> increases quadratically and <math>10,000x</math> increases linearly, there is only one solution for this case. |
Similarly, if <math>1<x<2</math>, then we know the following: | Similarly, if <math>1<x<2</math>, then we know the following: | ||
Line 149: | Line 130: | ||
~Owen1204 | ~Owen1204 | ||
− | ==Solution | + | ==Solution 6 (General Equation)== |
− | General solution to this type of equation <math>f(x, \lfloor x \rfloor) = 0</math> | + | General solution to this type of equation <math>f(x, \lfloor x \rfloor) = 0</math>: |
1. solve <math>f(x, \lfloor x \rfloor) = 0</math> for <math>x</math> to get <math>x = g(\lfloor x \rfloor )</math> | 1. solve <math>f(x, \lfloor x \rfloor) = 0</math> for <math>x</math> to get <math>x = g(\lfloor x \rfloor )</math> | ||
Line 186: | Line 167: | ||
So the number of <math>k</math>'s values is <math>99-(-101)-1=199</math>. Because <math>x=5000-100\sqrt{2500-k}</math>, for each value of <math>k</math>, there is a value for <math>x</math>. The answer is <math>\boxed{\textbf{(C)} 199}</math> | So the number of <math>k</math>'s values is <math>99-(-101)-1=199</math>. Because <math>x=5000-100\sqrt{2500-k}</math>, for each value of <math>k</math>, there is a value for <math>x</math>. The answer is <math>\boxed{\textbf{(C)} 199}</math> | ||
− | ~isabelchen | + | ~[https://artofproblemsolving.com/wiki/index.php/User:Isabelchen isabelchen] |
+ | |||
+ | ==Solution 7== | ||
+ | Subtracting <math>10000\lfloor x\rfloor</math> from both sides gives <math>x^2=10000(x-\lfloor x\rfloor)=10000\{x\}</math>. Dividing both sides by <math>10000</math> gives <math>\left(\frac{x}{100}\right)^2=\{x\}<1</math>. <math>\left(\frac{x}{100}\right)^2<1</math> when <math>-100<x<100</math> so the answer is <math>\boxed{199}</math>. | ||
+ | |||
+ | ~randomdude10807 | ||
==Video Solution== | ==Video Solution== |
Latest revision as of 11:51, 29 January 2024
- The following problem is from both the 2018 AMC 10B #25 and 2018 AMC 12B #24, so both problems redirect to this page.
Contents
Problem
Let denote the greatest integer less than or equal to . How many real numbers satisfy the equation ?
Solution 1
This rewrites itself to where .
Graphing and we see that the former is a set of line segments with slope from to with a hole at , then to with a hole at etc. Here is a graph of and for visualization.
Now notice that when the graph has a hole at which the equation passes through and then continues upwards. Thus our set of possible solutions is bounded by . We can see that intersects each of the lines once and there are lines for an answer of .
Solution 2
Same as the first solution, .
We can write as . Expanding everything, we get a quadratic in in terms of :
We use the quadratic formula to solve for :
Since , we get an inequality which we can then solve. After simplifying a lot, we get that .
Solving over the integers, , and since is an integer, there are solutions. Each value of should correspond to one value of , so we are done.
Solution 3
Let where is the integer part of and is the fractional part of . We can then rewrite the problem below:
From here, we get
Solving for
Because , we know that cannot be less than or equal to nor greater than or equal to . Therefore:
There are elements in this range, so the answer is .
Note (not by author): this solution seems to be invalid at first, because one can not determine whether is an integer or not. However, it actually works because although itself might not be an integer, it is very close to one, so there are 199 potential .
Another Note (not by author of previous note): we can actually determine that =0 is the only possible integer value of is we set = we end up with =0 ~YJC64002776
Solution 4
Notice the given equation is equivalent to
Now we know that so plugging in for we can find the upper and lower bounds for the values.
And just like , we see that , and since is an integer, there are solutions. Each value of should correspond to one value of , so we are done.
Solution 5
Firstly, if is an integer, then , so must be .
If , then we know the following:
Therefore, , which overlaps with . This means that there is at least one real solution between and . Since increases quadratically and increases linearly, there is only one solution for this case.
Similarly, if , then we know the following:
By following similar logic, we can find that there is one solution between ad .
We can also follow the same process to find that there are negative solutions for as well.
There are not an infinite amount of solutions, so at one point there will be no solutions when for some integer . For there to be no solutions in a given range means that the range of does not intersect the range of . will always be positive, and is less than less than , so when , the equation will have no solutions. This means that there are positive solutions, negative solutions, and for a total of solutions.
~Owen1204
Solution 6 (General Equation)
General solution to this type of equation :
1. solve for to get 2. apply , solve to get the domain of 3. get from the domain of because is integer, then get from by Note: function maps to its floor. By solving , we get function , mapping 's floor to
,
If , , it contradicts
So
Let ,
So the number of 's values is . Because , for each value of , there is a value for . The answer is
Solution 7
Subtracting from both sides gives . Dividing both sides by gives . when so the answer is .
~randomdude10807
Video Solution
https://www.youtube.com/watch?v=vHKPbaXwJUE
See Also
2018 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 24 |
Followed by Last Problem | |
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 |
2018 AMC 12B (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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.