Skip to main content
Post Undeleted by reuns
added 127 characters in body
Source Link
reuns
  • 3.4k
  • 1
  • 12
  • 22

$\tau(n) \le k$ implies that $n=\prod_{i=1}^j p_i$ with $j\le k$, thus $$\sum_{n=1,\tau(n)\le k}^\infty n^{-s} \le (1+\sum_{p \ prime} p^{-s})^k=\sum_n c_k(n) n^{-s}$$$$\sum_{n=1,\tau(n)\le k}^\infty n^{-s} \le (1+\sum_{p \ prime} p^{-s})^k=\sum_n a_k(n) n^{-s}$$

(a coefficient-wise bound)

$\pi(x)=O(x/\log x)$ implies$1+\pi(x)=O(x/\log x)=O(\sum_{n\le x} 1/\log n)$ and $x/\log x=O(\pi(x))$ imply that $\sum_{n\le x} c_n(k) =o(x)$ thus$$f_k(x)=\sum_{n\le x} a_k(n) =\sum_{n\le x} \frac1{\log n}f_{k-1}(x/n)$$ $$\sum_{n\le x,\tau(n)\le k} 1=o(x)$$$$=O(\sum_{n\le x} \frac1{\log n} \frac{x/n}{\log x/n}(\log \log x/n)^{k-1})=O(\frac{x (\log\log x)^{k-1}}{\log x})$$

$\tau(n) \le k$ implies that $n=\prod_{i=1}^j p_i$ with $j\le k$, thus $$\sum_{n=1,\tau(n)\le k}^\infty n^{-s} \le (1+\sum_{p \ prime} p^{-s})^k=\sum_n c_k(n) n^{-s}$$

(a coefficient-wise bound)

$\pi(x)=O(x/\log x)$ implies that $\sum_{n\le x} c_n(k) =o(x)$ thus $$\sum_{n\le x,\tau(n)\le k} 1=o(x)$$

$\tau(n) \le k$ implies that $n=\prod_{i=1}^j p_i$ with $j\le k$, thus $$\sum_{n=1,\tau(n)\le k}^\infty n^{-s} \le (1+\sum_{p \ prime} p^{-s})^k=\sum_n a_k(n) n^{-s}$$

(a coefficient-wise bound)

$1+\pi(x)=O(x/\log x)=O(\sum_{n\le x} 1/\log n)$ and $x/\log x=O(\pi(x))$ imply that $$f_k(x)=\sum_{n\le x} a_k(n) =\sum_{n\le x} \frac1{\log n}f_{k-1}(x/n)$$ $$=O(\sum_{n\le x} \frac1{\log n} \frac{x/n}{\log x/n}(\log \log x/n)^{k-1})=O(\frac{x (\log\log x)^{k-1}}{\log x})$$

Post Deleted by reuns
Source Link
reuns
  • 3.4k
  • 1
  • 12
  • 22

$\tau(n) \le k$ implies that $n=\prod_{i=1}^j p_i$ with $j\le k$, thus $$\sum_{n=1,\tau(n)\le k}^\infty n^{-s} \le (1+\sum_{p \ prime} p^{-s})^k=\sum_n c_k(n) n^{-s}$$

(a coefficient-wise bound)

$\pi(x)=O(x/\log x)$ implies that $\sum_{n\le x} c_n(k) =o(x)$ thus $$\sum_{n\le x,\tau(n)\le k} 1=o(x)$$