0
$\begingroup$

I am trying to reproduce the following bound:

$\sum_{1\leq m\leq x, m\neq n}\frac{1}{|\log(m/n)|}=O(x\log(x))$,

for $x\geq 2$ and some $n$, $1\leq n\leq x$ (the implicit constant shouldn't depend on $n$).

I have tried to bound each term by $\frac{1}{|\log(1\pm 1/x)|}$, but this doesn't seem to be good enough. Splitting the sum at $\log(x)$ also didn't help. Any ideas?

Thank you very much for your comments or hints.

  • 0
    I think you may need to split it at kn for some constant k. The sum up to kn will not depend on x, so is negligible as x gets very large (but will grow with n). Above kn you can change over to an integral. Hope this helps-I haven't checked that it works.2010-11-07
  • 0
    sorry, "fixed $n$", was imprecise, I should be able to choose e.g. $n=x$ and this bound should still hold.2010-11-08

2 Answers 2

2

This answer corresponds to the original question, where $n$ was assumed fixed.

Considering the corresponding integral $\int_a^x {\frac{{du}}{{\log (u/n)}}} = n\int_{a/n}^{x/n} {\frac{{du}}{{\log (u)}}} $ (where $a$ is some constant) and the fact that the logaritmic integral function li(x) is $O(x/\log(x))$ as $x \to \infty$, your bound should be $O(x/\log(x))$ (and not $O(x\log(x))$.

  • 0
    Thanks, sorry about the confusion with the "fixed $n$".2010-11-08
0

Assuming $1\leq n \leq x$, split the sum into two parts, $1\leq m

To handle the first part, make the variable change $m\to n-k$, and notice that $$ \sum_{1\leq m \frac{k}{n}$ for $1\leq k \leq n-1$, this last sum is $$ < n \sum_{1\leq k \leq n-1} \frac{1}{k} = O(n\log n) = O(x\log x).$$

The second part can be handled similarly making the variable change $m\to n+k$.

Remark: Out of curiosity, are you computing moments of the Riemann zeta-function?

  • 0
    Thanks very much! At the time of writing the question, I was working through [this paper](http://arxiv.org/abs/math/0612106), so your suspicion was correct.2011-03-06