Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Write as a single sum:

Given $\{a_n\}_n$, $a_i \in \mathbb{Q}$, $0 \lt a_i \le a_{i+1}$

$\sum_{i=1}^{n} \sum_{j=i+1}^{n} \lfloor a_j - a_i \rfloor$

I am not sure if this is possible.

I know that if there is no floor, then the sum can be written as:

$\sum_{i=1}^{n} (2i-n-1) a_i$

share|cite|improve this question

The best I can come up with is this: $[x]=x-\{{x\}}$ where $0\le\{{x\}}\lt1$, so $$\sum_{i=1}^n\sum_{j=i+1}^n[a_j-a_i]=\sum_{i=1}^n(2i-n-1)a_i+O(n^2)$$ I suppose that instead of $O(n^2)$ you could write $Cn^2$ for some $C$, $0\le C\lt1/2$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.