Difference between revisions of "2007 iTest Problems/Problem 40"
(Created page with "== Problem == Let <math>S</math> be the sum of all <math>x</math> such that <math>1\leq x\leq 99</math> and <math>\{x^2\}=\{x\}^2</math>. Compute <math>\lfloor S\rfloor</math>. ...") |
Rockmanex3 (talk | contribs) (Solution to Problem 40 - a lot of work) |
||
Line 4: | Line 4: | ||
== Solution == | == Solution == | ||
+ | |||
+ | Rewrite <math>x</math> as <math>\lfloor x \rfloor + \{ x \}</math>. That results in | ||
+ | <cmath>\{ 2 \lfloor x \rfloor \{ x \} + \{ x \}^2 \} = \{ x \}^2</cmath> | ||
+ | Note that if <math>2 \lfloor x \rfloor \{ x \}</math> is not an integer, than both sides can not equal each other. Thus, to find all solutions where <math>1 \le x \le 99</math>, find the values where <math>2 \lfloor x \rfloor \{ x \}</math> is an integer. | ||
+ | |||
+ | * The easier case is when <math>x</math> is an integer. If <math>x</math> is an integer, then <math>\{ x \} = 0</math>, so both sides equal each other. Therefore, every integer from <math>1</math> to <math>99</math> is a solution. | ||
+ | * The harder case is when <math>x</math> is not an integer. Let <math>x = n \frac{a}{b}</math>, where <math>n</math> is an integer from <math>1</math> to <math>98</math>, and <math>a</math> and <math>b</math> are [[relatively prime]] integers, where <math>0 < a < b</math>. That means <math>2 \lfloor x \rfloor \{ x \} = 2n \cdot \frac{a}{b}</math>. Since <math>a</math> and <math>b</math> are relatively prime, <math>b</math> must be a factor of <math>2n</math>. That means every mixed number in the form <math>n \frac{c}{2n}</math>, where <math>0 < c < 2n</math> works. | ||
+ | |||
+ | With that taken in consideration, the sum <math>S</math> equals | ||
+ | <cmath>(1 + 1\frac{1}{2}) + (2 + 2\frac{1}{4} \cdots) \cdots (98 + 98\frac{1}{196} \cdots) + 99</cmath> | ||
+ | The arithmetic series sum formula can be used to simplify things further. If the first term is <math>n</math>, common difference is \frac{1}{2n}, and last term is <math>n - \frac{1}{2n}</math>, the sum of the terms in the series is <math>\frac{2n(2n+1 - \frac{1}{2n})}{2} = 2n^2 + n - \frac{1}{2}</math>. Now <math>S</math> equals | ||
+ | <cmath>\sum_{n=1}^{98} (2n^2 + n - \frac{1}{2} ) + 99</cmath> | ||
+ | <cmath>2 \sum_{n=1}^{98} (n^2) + \sum_{n=1}^{98} (n) - 98 \cdot \frac{1}{2} + 99</cmath> | ||
+ | <cmath>2 \cdot \frac{98 \cdot 99 \cdot 197}{6} + \frac{99 \cdot 98}{2} - 49 + 99</cmath> | ||
+ | <cmath>49 \cdot 33 \cdot 397 + 50</cmath> | ||
+ | <cmath>641999</cmath> | ||
+ | Thus, <math>S = \boxed{641999}</math>. | ||
+ | |||
+ | ==See Also== | ||
+ | {{iTest box|year=2007|num-b=39|num-a=41}} | ||
+ | |||
+ | [[Category:Intermediate Algebra Problems]] | ||
+ | |||
+ | [[Category:Intermediate Number Theory Problems]] |
Revision as of 13:59, 16 June 2018
Problem
Let be the sum of all such that and . Compute .
Solution
Rewrite as . That results in Note that if is not an integer, than both sides can not equal each other. Thus, to find all solutions where , find the values where is an integer.
- The easier case is when is an integer. If is an integer, then , so both sides equal each other. Therefore, every integer from to is a solution.
- The harder case is when is not an integer. Let , where is an integer from to , and and are relatively prime integers, where . That means . Since and are relatively prime, must be a factor of . That means every mixed number in the form , where works.
With that taken in consideration, the sum equals The arithmetic series sum formula can be used to simplify things further. If the first term is , common difference is \frac{1}{2n}, and last term is , the sum of the terms in the series is . Now equals Thus, .
See Also
2007 iTest (Problems, Answer Key) | ||
Preceded by: Problem 39 |
Followed by: Problem 41 | |
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 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 • 51 • 52 • 53 • 54 • 55 • 56 • 57 • 58 • 59 • 60 • TB1 • TB2 • TB3 • TB4 |