Difference between revisions of "2005 AIME I Problems/Problem 12"
(solution w/ slightly less math involved) |
Baijiangchen (talk | contribs) m (→Solution 2) |
||
Line 20: | Line 20: | ||
Then <math>|a - b| = |2(2^2 + 4^2 + \ldots + 44^2) - 2(1^2 + 3^2 + 5^2 + \ldots 43^2) + 1^2 - 45^2 + 19|</math>. | Then <math>|a - b| = |2(2^2 + 4^2 + \ldots + 44^2) - 2(1^2 + 3^2 + 5^2 + \ldots 43^2) + 1^2 - 45^2 + 19|</math>. | ||
− | We | + | We know the difference between two perfect squares are consecutive odd numbers. |
+ | Since we want all <math>(n+1)^2-n^2</math> where <math>n</math> is odd in order to find <math>a</math>, we want all <math>2n+1</math> for odd numbers from <math>1</math> to <math>43</math>. We can easily evaluate this sum, which is <math>990</math>. | ||
+ | Obviously <math>a+b=2005</math>, so <math>b=1015</math> and <math>|a - b|=\boxed{025}</math>. | ||
+ | |||
+ | Alternatively we can apply the formula <math>1^2 + 2^2 + \ldots + n^2 = \frac{n(n + 1)(2n + 1)}{6}</math>. From this formula, it follows that <math>2^2 + 4^2 + \ldots + (2n)^2 = \frac{2n(n + 1)(2n + 1)}{3}</math> and so that | ||
:<math>1^2 + 3^2 + \ldots +(2n + 1)^2 = (1^2 + 2^2 + \ldots +(2n + 1)^2) - (2^2 + 4^2 + \ldots + (2n)^2)</math> | :<math>1^2 + 3^2 + \ldots +(2n + 1)^2 = (1^2 + 2^2 + \ldots +(2n + 1)^2) - (2^2 + 4^2 + \ldots + (2n)^2)</math> | ||
:<math>= \frac{(2n + 1)(2n + 2)(4n + 3)}{6} - \frac{2n(n + 1)(2n + 1)}{3} = \frac{(n + 1)(2n + 1)(2n + 3)}{3}</math>. Thus, | :<math>= \frac{(2n + 1)(2n + 2)(4n + 3)}{6} - \frac{2n(n + 1)(2n + 1)}{3} = \frac{(n + 1)(2n + 1)(2n + 3)}{3}</math>. Thus, | ||
− | <math>|a - b| = \left| 2\cdot \frac{44\cdot23\cdot45}{3} - 2\cdot \frac{22 \cdot 43 \cdot 45}{3} - 45^2 + 20\right| = |-25| = 025</math>. | + | <math>|a - b| = \left| 2\cdot \frac{44\cdot23\cdot45}{3} - 2\cdot \frac{22 \cdot 43 \cdot 45}{3} - 45^2 + 20\right| = |-25| =\boxed{025}</math>. |
== See also == | == See also == |
Revision as of 22:16, 13 November 2011
Problem
For positive integers let denote the number of positive integer divisors of including 1 and For example, and Define by Let denote the number of positive integers with odd, and let denote the number of positive integers with even. Find
Solution
It is well-known that is odd if and only if is a perfect square. (Otherwise, we can group divisors into pairs whose product is .) Thus, is odd if and only if there are an odd number of perfect squares less than . So and are odd, while are even, and are odd, and so on.
So, for a given , if we choose the positive integer such that we see that has the same parity as .
It follows that the numbers between and , between and , and so on, all the way up to the numbers between and have odd. These are the only such numbers less than (because ).
Solution 1
Notice that the difference between consecutive squares are consecutively increasing odd numbers. Thus, there are numbers between (inclusive) and (exclusive), numbers between and , and so on. The number of numbers from to is . Whenever the lowest square beneath a number is odd, the parity will be odd, and the same for even. Thus, . , the accounting for the difference between and , inclusive. Notice that if we align the two and subtract, we get that each difference is equal to . Thus, the solution is .
Solution 2
Similarly, , where the accounts for those numbers between and .
Thus .
Then .
We know the difference between two perfect squares are consecutive odd numbers. Since we want all where is odd in order to find , we want all for odd numbers from to . We can easily evaluate this sum, which is . Obviously , so and .
Alternatively we can apply the formula . From this formula, it follows that and so that
- . Thus,
.
See also
2005 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |