Difference between revisions of "2005 AIME I Problems/Problem 12"
(10 intermediate revisions by 5 users not shown) | |||
Line 2: | Line 2: | ||
For [[positive integer]]s <math> n, </math> let <math> \tau (n) </math> denote the number of positive integer [[divisor]]s of <math> n, </math> including 1 and <math> n. </math> For example, <math> \tau (1)=1 </math> and <math> \tau(6) =4. </math> Define <math> S(n) </math> by <math> S(n)=\tau(1)+ \tau(2) + \cdots + \tau(n). </math> Let <math> a </math> denote the number of positive integers <math> n \leq 2005 </math> with <math> S(n) </math> [[odd integer | odd]], and let <math> b </math> denote the number of positive integers <math> n \leq 2005 </math> with <math> S(n) </math> [[even integer | even]]. Find <math> |a-b|. </math> | For [[positive integer]]s <math> n, </math> let <math> \tau (n) </math> denote the number of positive integer [[divisor]]s of <math> n, </math> including 1 and <math> n. </math> For example, <math> \tau (1)=1 </math> and <math> \tau(6) =4. </math> Define <math> S(n) </math> by <math> S(n)=\tau(1)+ \tau(2) + \cdots + \tau(n). </math> Let <math> a </math> denote the number of positive integers <math> n \leq 2005 </math> with <math> S(n) </math> [[odd integer | odd]], and let <math> b </math> denote the number of positive integers <math> n \leq 2005 </math> with <math> S(n) </math> [[even integer | even]]. Find <math> |a-b|. </math> | ||
− | == Solution == | + | __TOC__ |
+ | == Solution 1== | ||
It is well-known that <math>\tau(n)</math> is odd if and only if <math>n</math> is a [[perfect square]]. (Otherwise, we can group [[divisor]]s into pairs whose product is <math>n</math>.) Thus, <math>S(n)</math> is odd if and only if there are an odd number of perfect squares less than <math>n</math>. So <math>S(1), S(2)</math> and <math>S(3)</math> are odd, while <math>S(4), S(5), \ldots, S(8)</math> are even, and <math>S(9), \ldots, S(15)</math> are odd, and so on. | It is well-known that <math>\tau(n)</math> is odd if and only if <math>n</math> is a [[perfect square]]. (Otherwise, we can group [[divisor]]s into pairs whose product is <math>n</math>.) Thus, <math>S(n)</math> is odd if and only if there are an odd number of perfect squares less than <math>n</math>. So <math>S(1), S(2)</math> and <math>S(3)</math> are odd, while <math>S(4), S(5), \ldots, S(8)</math> are even, and <math>S(9), \ldots, S(15)</math> are odd, and so on. | ||
So, for a given <math>n</math>, if we choose the positive integer <math>m</math> such that <math>m^2 \leq n < (m + 1)^2</math> we see that <math>S(n)</math> has the same parity as <math>m</math>. | So, for a given <math>n</math>, if we choose the positive integer <math>m</math> such that <math>m^2 \leq n < (m + 1)^2</math> we see that <math>S(n)</math> has the same parity as <math>m</math>. | ||
+ | It follows that the numbers between <math>1^2</math> and <math>2^2</math>, between <math>3^2</math> and <math>4^2</math>, and so on, all the way up to the numbers between <math>43^2</math> and <math>44^2 = 1936</math> have <math>S(n)</math> odd. These are the only such numbers less than <math>2005</math> (because <math>45^2 = 2025 > 2005</math>). | ||
− | + | == Solution 2 == | |
+ | Notice that the difference between consecutive squares are consecutively increasing odd numbers. Thus, there are <math>3</math> numbers between <math>1</math> (inclusive) and <math>4</math> (exclusive), <math>5</math> numbers between <math>4</math> and <math>9</math>, and so on. The number of numbers from <math>n^2</math> to <math>(n + 1)^2</math> is <math>(n + 1 - n)(n + 1 + n) = 2n + 1</math>. Whenever the lowest square beneath a number is odd, the parity will be odd, and the same for even. Thus, <math>a = [2(1) + 1] + [2(3) + 1] \ldots [2(43) + 1] = 3 + 7 + 11 \ldots 87</math>. <math>b = [2(2) + 1] + [2(4) + 1] \ldots [2(42) + 1] + 70 = 5 + 9 \ldots 85 + 70</math>, the <math>70</math> accounting for the difference between <math>2005</math> and <math>44^2 = 1936</math>, inclusive. Notice that if we align the two and subtract, we get that each difference is equal to <math>2</math>. Thus, the solution is <math>|a - b| = |b - a| = |2 \cdot 21 + 70 - 87| = \boxed{025}</math>. | ||
+ | |||
+ | == Solution 3 == | ||
+ | Similarly, <math>b = (3^2 - 2^2) + (5^2 - 4^2) + \ldots + (45^2 - 44^2) - 19</math>, where the <math>-19</math> accounts for those numbers between <math>2005</math> and <math>2024</math>. | ||
Thus <math>a = (2^2 - 1^2) + (4^2 - 3^2) + \ldots + (44^2 - 43^2)</math>. | Thus <math>a = (2^2 - 1^2) + (4^2 - 3^2) + \ldots + (44^2 - 43^2)</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 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>= \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| =\boxed{025}</math>. | ||
+ | |||
+ | == Solution 4 == | ||
+ | Let <math>\Delta n</math> denote the sum <math>1+2+3+ \dots +n-1+n</math>. We can easily see from the fact "It is well-known that <math>\tau(n)</math> is odd if and only if <math>n</math> is a perfect square.", that | ||
− | + | <math>a = (2^2-1^2) + (4^2-3^2) \dots (44^2 - 43^2) = (2+1)(2-1)+(4+3)(4-3) \dots (44+43)(44-43) = 1+2+3...44 = \Delta 44</math>. | |
+ | <math>b = 3^2-2^2+5^2-4^2...2006-44^2 = (3+2)(3-2) \dots (43+42)(43-42) + 1 + (2005 - 44^2) = \Delta 43 + 69</math>. | ||
− | + | <math>a-b = \Delta 44-\Delta 43-69 = 44-69 = -25</math>. They ask for <math>|a-b|</math>, so our answer is <math>|-25| = \boxed{025}</math> | |
− | + | -Alexlikemath | |
== See also == | == See also == | ||
− | + | {{AIME box|year=2005|n=I|num-b=11|num-a=13}} | |
− | |||
− | |||
[[Category:Intermediate Number Theory Problems]] | [[Category:Intermediate Number Theory Problems]] | ||
+ | {{MAA Notice}} |
Latest revision as of 01:29, 4 May 2021
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 1
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 2
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 3
Similarly, , where the accounts for those numbers between and .
Thus .
Then, . We can apply the formula . From this formula, it follows that and so that
- . Thus,
.
Solution 4
Let denote the sum . We can easily see from the fact "It is well-known that is odd if and only if is a perfect square.", that
.
.
. They ask for , so our answer is
-Alexlikemath
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 |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.