Maths Olympiad Prep

Library / HMMT February /142 of 1302

HMMT February

Algebra Difficulty 4.8 AIME Find the answer United States

Problem:
Let ⌊z⌋\lfloor z\rfloor denote the greatest integer less than or equal to zz. Compute
∑j=−10001000⌊2025j+0.5⌋. \sum_{j = -1000}^{1000} \left\lfloor \frac{2025}{j + 0.5} \right\rfloor.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:
The key idea is to pair up the terms ⌊2025x⌋\left\lfloor \frac{2025}{x} \right\rfloor and ⌊2025x⌋\left\lfloor \frac{2025}{x} \right\rfloor. There are 1000 such pairs and one lone term, ⌊20251000.5⌋=2\left\lfloor \frac{2025}{1000.5} \right\rfloor = 2. Thus,
∑j=−10001000⌊2025j+0.5⌋=2+∑x∈{0.5,1.5,…,999.5}(⌊2025x⌋+⌊2025−x⌋). \sum_{j = -1000}^{1000} \left\lfloor \frac{2025}{j + 0.5} \right\rfloor = 2 + \sum_{x \in \{0.5,1.5, \ldots , 999.5\}} \left(\left\lfloor \frac{2025}{x} \right\rfloor + \left\lfloor \frac{2025}{-x} \right\rfloor \right).
We note that
Therefore,
As xx ranges in the set {0.5,1.5,2.5,…,999.5}\{0.5, 1.5, 2.5, \ldots , 999.5\}, 2x2x ranges in the set {1,3,5,…,1999}\{1, 3, 5, \ldots , 1999\}. This set includes all 15 odd divisors of 4050 except for 2025. Thus, there are 14 values of xx for which ⌊2025x⌋+⌊2025−x⌋\left\lfloor \frac{2025}{x} \right\rfloor + \left\lfloor \frac{2025}{- x} \right\rfloor evaluates to 0, and the remaining 1000−14=9861000 - 14 = 986 values of xx make it evaluate to −1-1. Therefore,
∑j=−10001000⌊2025j+0.5⌋=2+∑x∈{0.5,1.5,…,999.5}(⌊2025x⌋+⌊2025−x⌋)=2+986⋅(−1)=−984. \sum_{j = -1000}^{1000} \left\lfloor \frac{2025}{j + 0.5} \right\rfloor = 2 + \sum_{x \in \{0.5,1.5, \ldots , 999.5\}} \left(\left\lfloor \frac{2025}{x} \right\rfloor + \left\lfloor \frac{2025}{-x} \right\rfloor \right) = 2 + 986 \cdot (-1) = \boxed{-984}.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.