6
$\begingroup$

Define $ rad(n):=\prod_{p|n}p $ and $a_n:=\frac{n}{rad(n)}.$ For example $a_n=1$ whenever n is a squarefree integer. The associated Dirichlet series $$F(s):=\sum_{n} \frac{a_n}{n^s}=\prod_{p} (1+\frac{1}{p^s} \frac{1}{1-p^{1-s}})$$ has abscissa of convergence $s_0=1.$ Are there any results regarding the distribution of $a_n$, e.g. whether $\sum \limits_{n \leq x} a_n \ll x (\log x)^A $ for some real constant $A>0$ ?

$\endgroup$
1
  • $\begingroup$ Please use a high-level tag like "nt.number-theory". I added this tag now. $\endgroup$
    – GH from MO
    Commented Aug 26, 2023 at 5:08

2 Answers 2

10
$\begingroup$

This problem was studied by De Bruijn, see

N. G. de Bruijn and J. H. van Lint, "On the number of integers $\le x$ whose prime factors divide $n$", Acta Arith. 8 (1963) 349–356

The main result is that $$\log\left(S(x)\right)=\log\left(\sum_{n\le x} \frac{1}{rad(n)}\right)\sim \left(\frac{8\log x}{\log \log x}\right)^{1/2}$$ and that $$\sum_{n\le x} \frac{n}{rad(n)}=o\left(xS(x)\right).$$ See also the article "Idempotents and Nilpotents Modulo n" for a discussion of this and similar problems (and more complete references).

$\endgroup$
1
  • $\begingroup$ I take it the appearances of $n$ in the last term of the first display should instead be $x$? $\endgroup$ Commented Aug 19, 2011 at 12:52
4
$\begingroup$

A complete answer is at Asymptotic behavior of a "strange" arithmetic function. The sum $\sum_{n \leq x} a_n$ is not $O(x (\log x)^A)$ for any $A$, due to the precise asymptotics stated there for the sum.

$\endgroup$
0

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .