|
|
Line 35: |
Line 35: |
| | | |
| ==Remarks of Solution 2 and Video Solution 3== | | ==Remarks of Solution 2 and Video Solution 3== |
− | Let <math>f(x)=\lfloor x \rfloor \cdot \{x\}</math> and <math>g(x)=a \cdot x^2.</math> | + | ===Graph=== |
| + | Let <math>f(x)=\lfloor x \rfloor \cdot \{x\}.</math> |
| | | |
− | ===Graph===
| |
| We make the following table of values: | | We make the following table of values: |
| | | |
Line 59: |
Line 59: |
| ~MRENTHUSIASM (Graph by Desmos: https://www.desmos.com/calculator/ouvaiqjdzj) | | ~MRENTHUSIASM (Graph by Desmos: https://www.desmos.com/calculator/ouvaiqjdzj) |
| | | |
− | ===Claim=== | + | ===Subtle Arguments=== |
− | For all positive integers <math>n,</math> the first <math>n</math> <b>nonzero</b> solutions to <math>f(x)=g(x)</math> are of the form <cmath>x=m\left(\frac{1-\sqrt{1-4a}}{2a}\right),</cmath> where <math>m=1,2,3,\cdots,n.</math>
| + | Visit the [https://artofproblemsolving.com/wiki/index.php/Talk:2020_AMC_12A_Problems/Problem_25 Discussion Page] for the underlying arguments and additional questions. |
− | | |
− | Equivalently, for <math>x>0,</math> the <math>n</math> intersections of the graphs of <math>f(x)</math> and <math>g(x)</math> occur in the consecutive branches of <math>f(x),</math> namely at <math>x\in[1,2),[2,3),[3,4),\cdots,[n,n+1).</math>
| |
− | | |
− | ~MRENTHUSIASM
| |
− | | |
− | ===Proof by Graph===
| |
− | Clearly, the equation <math>f(x)=g(x)</math> has no negative solutions, and its positive solutions all satisfy <math>x>1.</math> Moreover, none of its solutions is an integer.
| |
− | | |
− | Note that the upper bounds of the branches of <math>f(x)</math> are along the line <math>h(x)=x-1</math> (excluded). <i><b>To prove the claim, we wish to show that for each branch of <math>\boldsymbol{f(x),}</math> there is exactly one solution for <math>\boldsymbol{f(x)=g(x)}</math> (from the branch <math>\boldsymbol{x\in[1,2)}</math> to the branch containing the larger solution of <math>\boldsymbol{g(x)=h(x)}</math>).</b></i> In 8:07-11:31 of [https://www.youtube.com/watch?v=7_mdreGBPvg&t=428s&ab_channel=ArtofProblemSolving Video Solution 3 (Art of Problem-Solving)], Mr. Rusczyk questions whether two solutions of <math>f(x)=g(x)</math> can be in the same branch of <math>f(x),</math> and he concludes that it is impossible in 16:25-16:43.
| |
− | | |
− | We analyze the upper bound of <math>f(x):</math> Let <math>(c,c-1)</math> be one solution of <math>g(x)=h(x).</math> It is clear that <math>c>1.</math> We substitute this point to find <math>a:</math>
| |
− | <cmath>\begin{align*}
| |
− | g(c)&=h(c) \\
| |
− | ac^2&=c-1 \\
| |
− | a&=\frac{c-1}{c^2}.
| |
− | \end{align*}</cmath>
| |
− | | |
− | We substitute this result back to find <math>x:</math>
| |
− | <cmath>\begin{align*}
| |
− | g(x)&=h(x) \\
| |
− | \left(\frac{c-1}{c^2}\right)x^2&=x-1 \\
| |
− | \left(\frac{c-1}{c^2}\right)x^2-x+1&=0 \\
| |
− | x^2-\left(\frac{c^2}{c-1}\right)x+\frac{c^2}{c-1}&=0 \ \ \ \ \ \ \ \ \ \ \ (*) \\
| |
− | (x-c)\left(x-\frac{c}{c-1}\right)&=0 \\
| |
− | x&=c,\ \frac{c}{c-1}.
| |
− | \end{align*}</cmath>
| |
− | By the way, using the precondition that <math>x=c</math> is a root of <math>(*),</math> we can factor its left side easily by the <b>Factor Theorem</b>. Note that <math>g(x)>h(x)</math> for all <math>x>\max{\left\{c, \frac{c}{c-1}\right\}},</math> as quadratic functions always outgrow linear functions.
| |
− | | |
− | Now, we perform casework:
| |
− | | |
− | <ol style="margin-left: 1.5em;">
| |
− | <li><math>c=\frac{c}{c-1}>1\implies c=2</math> (Trivial Case)</li><p>
| |
− | It follows that the graphs of <math>g(x)</math> and <math>h(x)</math> only intersect at the point <math>(2,1),</math> which is not on the graph of <math>f(x).</math> So, the equation <math>f(x)=g(x)</math> has no solutions in this case, as the inequality <math>g(x)<h(x)</math> has no solutions.<p>
| |
− | <li><math>c>\frac{c}{c-1}>1\implies c>2</math> and <math>1<\frac{c}{c-1}<2</math></li><p>
| |
− | It follows that for <math>g(x)=h(x),</math> the smaller solution is <math>x=\frac{c}{c-1}\in(1,2),</math> and <math>g(x)<h(x)</math> holds for all <math>x\in\left(\frac{c}{c-1},c\right).</math><p>
| |
− | By the <b>Intermediate Value Theorem</b>, for each branch of <math>f(x)</math> (where <math>x\in\left[\lfloor t\rfloor,\lfloor t\rfloor+1\right)</math>), we have <math>g(x)</math> in between its left output and its right "output", namely <cmath>0=f\left(\lfloor t\rfloor\right)<g\left(\lfloor x\rfloor\right)<h\left(\lfloor t\rfloor+1\right)=\lfloor t\rfloor.</cmath> Therefore, for the equation <math>f(x)=g(x),</math> there is exactly one solution for each branch of <math>f(x),</math> where <math>x\in\left(\frac{c}{c-1},c\right).</math> Now, the proof of the bolded sentence of paragraph 2 is complete.<p>
| |
− | <li><math>\frac{c}{c-1}>c>1\implies 1<c<2</math> and <math>\frac{c}{c-1}>1</math></li><p>
| |
− | This case uses the same argument as Case 2. The smaller solution is <math>x=c\in(1,2),</math> and for each branch of <math>f(x),</math> where <math>x\in\left(c,\frac{c}{c-1}\right),</math> the equation <math>f(x)=g(x)</math> has exactly one solution.
| |
− | </ol>
| |
| | | |
| ~MRENTHUSIASM | | ~MRENTHUSIASM |
Problem
The number , where and are relatively prime positive integers, has the property that the sum of all real numbers satisfying
is , where denotes the greatest integer less than or equal to and denotes the fractional part of . What is ?
Solution 1
Let be the unique solution in this range. Note that is also a solution as long as , hence all our solutions are for some . This sum must be between and , which gives and . Plugging this back in gives .
Solution 2
First note that when while . Thus we only need to look at positive solutions ( doesn't affect the sum of the solutions).
Next, we breakdown down for each interval , where is a positive integer. Assume , then . This means that when , . Setting this equal to gives
We're looking at the solution with the positive , which is . Note that if is the greatest such that has a solution, the sum of all these solutions is slightly over , which is when , just under . Checking this gives
~ktong
Video Solution 1 (Geometry)
This video shows how things like The Pythagorean Theorem and The Law of Sines work together to solve this seemingly algebraic problem: https://www.youtube.com/watch?v=6IJ7Jxa98zw&feature=youtu.be
Video Solution 2
https://www.youtube.com/watch?v=xex8TBSzKNE ~ MathEx
Video Solution 3 (by Art of Problem Solving)
https://www.youtube.com/watch?v=7_mdreGBPvg&t=428s&ab_channel=ArtofProblemSolving
Created by Richard Rusczyk
Remarks of Solution 2 and Video Solution 3
Graph
Let
We make the following table of values:
We graph by branches:
~MRENTHUSIASM (Graph by Desmos: https://www.desmos.com/calculator/ouvaiqjdzj)
Subtle Arguments
Visit the Discussion Page for the underlying arguments and additional questions.
~MRENTHUSIASM
See Also
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.