Difference between revisions of "2020 AMC 12A Problems/Problem 25"
MRENTHUSIASM (talk | contribs) m (→Remarks) |
MRENTHUSIASM (talk | contribs) m |
||
Line 62: | Line 62: | ||
~MRENTHUSIASM (inspired by Math Jams's <b>2020 AMC 10/12A Discussion</b>) | ~MRENTHUSIASM (inspired by Math Jams's <b>2020 AMC 10/12A Discussion</b>) | ||
− | ==Solution 2== | + | ==Solution 2 (Condensed Version of Solution 1)== |
+ | Let <math>1<k<2</math> be the unique solution in this range. Note that <math>ck</math> is also a solution as long as <math>ck < c+1</math>, hence all our solutions are <math>k, 2k, ..., bk</math> for some <math>b</math>. This sum <math>420</math> must be between <math>\frac{b(b+1)}{2}</math> and <math>\frac{(b+1)(b+2)}{2}</math>, which gives <math>b=28</math> and <math>k=\frac{420}{406}=\frac{30}{29}</math>. Plugging this back in gives <math>a=\frac{29 \cdot 1}{30^2} = \frac{29}{900} \implies \boxed{\textbf{C}}</math>. | ||
+ | |||
+ | ==Solution 3== | ||
First note that <math>\lfloor x\rfloor \cdot \{x\}<0</math> when <math>x<0</math> while <math>ax^2\ge 0\forall x\in \mathbb{R}</math>. Thus we only need to look at positive solutions (<math>x=0</math> doesn't affect the sum of the solutions). | First note that <math>\lfloor x\rfloor \cdot \{x\}<0</math> when <math>x<0</math> while <math>ax^2\ge 0\forall x\in \mathbb{R}</math>. Thus we only need to look at positive solutions (<math>x=0</math> doesn't affect the sum of the solutions). | ||
Next, we breakdown <math>\lfloor x\rfloor\cdot \{x\}</math> down for each interval <math>[n,n+1)</math>, where <math>n</math> is a positive integer. Assume <math>\lfloor x\rfloor=n</math>, then <math>\{x\}=x-n</math>. This means that when <math>x\in [n,n+1)</math>, <math>\lfloor x\rfloor \cdot \{x\}=n(x-n)=nx-n^2</math>. Setting this equal to <math>ax^2</math> gives | Next, we breakdown <math>\lfloor x\rfloor\cdot \{x\}</math> down for each interval <math>[n,n+1)</math>, where <math>n</math> is a positive integer. Assume <math>\lfloor x\rfloor=n</math>, then <math>\{x\}=x-n</math>. This means that when <math>x\in [n,n+1)</math>, <math>\lfloor x\rfloor \cdot \{x\}=n(x-n)=nx-n^2</math>. Setting this equal to <math>ax^2</math> gives | ||
Line 75: | Line 78: | ||
<cmath>a=\frac{116}{3600}=\frac{29}{900} \implies \boxed{\textbf{(C) }929}</cmath> | <cmath>a=\frac{116}{3600}=\frac{29}{900} \implies \boxed{\textbf{(C) }929}</cmath> | ||
~ktong | ~ktong | ||
− | |||
− | |||
− | |||
==Remark== | ==Remark== |
Revision as of 07:38, 14 June 2021
Contents
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 (Comprehensive Solution in Algebra)
Let and denote the whole part and the fractional part of respectively, for which and
We rewrite the given equation as Since it follows that from which
We expand and rearrange as which is a quadratic with either or
For simplicity purposes, we will treat as some fixed nonnegative integer so that is a quadratic with By the quadratic formula, we have
If then We get which does not affect the sum of the solutions. Therefore, we consider the case for
Recall that so From the discriminant, we require that or Combining this with the precondition we need
We consider each part of separately:
From note that and By Descartes' rule of signs, we deduce that must have two positive roots, so is always valid.
Alternatively, from and note that all values of for which satisfy We deduce that both roots in must be positive, so is always valid.
We rewrite as From it follows that The larger root is which contradicts So, we take the smaller root, from which for some constant We rewrite as in which is valid as long as Note that the solutions of are generated at up to some value such that
Now, we express in terms of and The sum of all solutions to the original equation is As we conclude that is slightly above so that is slightly below or is slightly below By observations, we get Substituting this back into produces which satisfies as required.
Finally, we solve for in Since we obtain from which The answer is
~MRENTHUSIASM (inspired by Math Jams's 2020 AMC 10/12A Discussion)
Solution 2 (Condensed Version of 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 3
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
Remark
Let and
We make the following table of values:
We graph (in red, by branches) and (in blue, for ) as shown below.
Graph in Desmos: https://www.desmos.com/calculator/ouvaiqjdzj
~MRENTHUSIASM
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
See Also
2020 AMC 12A (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 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.