5
$\begingroup$

Let $x$ and $y$ be given real numbers. We may suppose that $2\leqslant x \leqslant y$ and that $u:= \log(y)/\log(x)$ remains bounded in a compact set away from $1$ as $x,y\to\infty$. An integer $n$ is said to be $x$-rough if all its prime factors are at least $x$. Let us denote the set of all $x$ rough numbers as $R_x$.

I am interested in obtaining asymptotic formula for the sum $$ \sum_{n\leqslant y,\ n\in R_x} \frac{1}{n}. $$

In fact, for my purpose, an upper bound of the correct order of magnitude should suffice. A naive upper bound maybe obtained as follows; From Buchstab's theorem (see Chapter 7 of Montgomery-Vaughan) states that there are $\sim w(u)y/\log(x)$ integers $n\leqslant y$ such that $n\in R_x$. Here $w(u)$ is a weight function depending only on $u$. Therefore

$$ \sum_{n\leqslant y,\ n\in R_x} \frac{1}{n}\leqslant 1+ \sum_{n=x}^{x + w(u) y/\log(x)} \frac{1}{n} \ll (u-1)\log(x) - \log\log(x) + \mathcal{O}_u(1). $$

I am inclined to believe that this is not the correct order of magnitude. For example if $u\leqslant 2$, then the sum is over primes and the growth is $\sim \log\log(x)$.

The analogous question regarding smooth numbers seems to have received a lot of attention (see this question and the references therein).

Any help in this regard is greatly appreciated.

$\endgroup$
2
  • 1
    $\begingroup$ Please use a high-level tag like "nt.number-theory". I added this tag now. Regarding high-level tags, see meta.mathoverflow.net/q/1075 $\endgroup$ Commented Sep 3, 2024 at 12:02
  • 1
    $\begingroup$ It seems the sum you want is bounded above by $\prod_{x < p \le y} (1+1/p+1/p^2+\dots) = \prod_{x < p \le y} (1-1/p)^{-1} \ll \log{y}/\log{x}$, by Mertens' theorem. $\endgroup$ Commented Sep 3, 2024 at 15:11

1 Answer 1

12
$\begingroup$

(I am going to switch your $x$ and $y$ for aesthetic purposes.)

The correct upper bound is $\log x/\log y$, which in particular is bounded if $y$ is a power of $x$.

Let $\Phi(x,y)$ be the number of $y$-rough integers up to $x$. By integration by parts, your sum is $$\sum_{\substack{n \le x \\ n \text{ is }y\text{-rough}}}\frac{1}{n} = \int_{1^-}^{x} \frac{d\Phi(t,y)}{t} = \frac{\Phi(x,y)}{x}+\int_{1}^{x} \frac{\Phi(t,y)}{t^2}dt .$$

We have the classical bound $\Phi(t,y) \ll \frac{t}{\log y}$ if $y \le t$, and otherwise $\Phi(t,y)=1$. It follows that, for $y \le x$, $$\sum_{\substack{n \le x \\ n \text{ is }y\text{-rough}}}\frac{1}{n} \ll \frac{1}{\log y}+\frac{1}{\log y}\int_{y}^{x} \frac{dt}{t} + \int_{1}^{y} \frac{dt}{t^2} \ll \frac{\log(x/y)+1}{\log y} \ll u $$ where $u:=\log x/\log y$ as usual.

A lower bound of $\gg u$ can be exhibited as well. Indeed, just use $\Phi(t,y)\gg \frac{t}{\log y}$ for $y \le \sqrt{t}$ in the argument above to obtain that your sum is $\gg \frac{\log(x/y^2)}{\log y} =u-2 \gg u$ if $u \ge 3$. If $u<3$ one has the trivial lower bound $1$ (since $1$ is $y$-rough) which is $\gg u$.

Some comments:

  • For $x\ge y >\sqrt{x}$, your sum is just a sum over primes and the number $1$ (which is $y$-rough for every $y$), as you observed, in which case Mertens' Theorem implies that your sum is $1+\sum_{y\le p \le x} \frac{1}{p} = 1+\log \log x - \log \log y + o(1) = 1+ \log u +o(1)$, which is bounded. For $y>x$, your sum is identically $1$.
  • For $y=x^{o(1)}$ I believe the asymptotics can be shown to be $\prod_{p<y}(1-\tfrac{1}{p}) \log x$ (in the above proof use $\Phi(t,y)\sim t\prod_{p<y}(1-\tfrac{1}{p})$ for $y=t^{o(1)}$, which is a consequence of the fundamental lemma of sieve theory, say). If this $y$ also satisfies $y\to \infty$ then this is $\sim e^{-\gamma} u$ by Mertens' Theorem.
  • For bounded $u=\log x/\log y \ge 2$, one should be able to show that the asymptotics is of the shape $u f(u)$ where $f$ satisfies a delay differential equation and $\lim_{u\to \infty} f(u)=e^{-\gamma}$. This can be proved by using the precise asymptotics for $\Phi(x,y)$ in terms of the Buchstab function.
$\endgroup$

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.