Let $f(x)$ is real valued function.
How to calulate or at least find lower and upper bound of sum: $$\sum_{1\le n \le x}\left\lfloor f(n) \right\rfloor$$? For example when $f(n)=\frac{x}{n}$
Here are my ideas:
- Is it possible to rewrite the sum so that it will depend only from for example $f(x)$? Like in this case: Find a formula for $\sum\limits_{k=1}^n \lfloor \sqrt{k} \rfloor$
- Because $\left\lfloor y \right\rfloor=y-\{y\}$ and $\{y\}$ can be expressed as a Fourier series so it is sufficent to evaluate the following: $\sum_{1\le n \le x}\{ f(n) \}$. It is (only) mentioned here : https://www.encyclopediaofmath.org/index.php/Trigonometric_sums,_method_of
- Because $g(y)=\left\lfloor f(y) \right\rfloor$ is integrable so maybe schould i use a integral?
I hope that you have also some ideas.
Since $\left\lfloor f(n) \right\rfloor\leq f(n)$ for all $n$ and $\left\lfloor f(n) \right\rfloor\geq f(n)-1$ for all $n$, the obvious upper and lower bounds are
$$\sum_{1\le n \le x} (f(n)-1)\leq \sum_{1\le n \le x}\left\lfloor f(n) \right\rfloor\leq \sum_{1\le n \le x}f(n)$$