PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: Very high
[parent] $\displaystyle \sum_{n \le x} (\tau(n))^a=O_a(x(\log x)^{2^a-1})$ for $a \ge 0$ (Theorem)

Within this entry, $\tau$ refers to the divisor function, $\lfloor \, \cdot \, \rfloor$ refers to the floor function, $\log$ refers to the natural logarithm, $p$ refers to a prime, and $k$ and $n$ refer to positive integers.

Theorem   For $a \ge 0$ , $\displaystyle \sum_{n \le x} (\tau(n))^a=O_a(x(\log x)^{2^a-1})$ .

The $O_a$ indicates that the constant implied by the definition of $O$ depends on $a$ . (See Landau notation for more details.)

Proof. Let $a \ge 0$ . Since $(\tau)^a={id}^a\circ \tau$ , ${id}$ is completely multiplicative, and $\tau$ is multiplicative, $(\tau)^a$ is multiplicative. (See composition of multiplicative functions for more details.)

For any $y \ge 0$ ,

$\displaystyle \sum_{p \le y} (\tau(p))^a \log p$ $\displaystyle =\sum_{p \le y} 2^a \log p$
  $\displaystyle =2^a\sum_{p \le y} \log p$
  $\displaystyle \le 2^ay\log 4$ by this theorem.

Also,

$\displaystyle \sum_p \sum_{k \ge 2} \frac{(\tau(p^k))^a}{p^k} \log(p^k)$ $\displaystyle = \sum_p \sum_{k \ge 2} \frac{(k+1)^a}{p^k} \cdot k\log p$
  $\displaystyle \le \sum_p \log p \sum_{k \ge 2} \frac{(k+1)^{a+1}}{p^k}$
  $\displaystyle \le \sum_p \frac{\log p}{p^2} \sum_{k \ge 2} \frac{(2k)^{a+1}}{p^{k-2}}$
  $\displaystyle \le 2^{a+1} \sum_p \frac{1}{p^{\frac{3}{2}}} \sum_{k \ge 2} \frac{k^{a+1}}{2^{k-2}}$
  $\displaystyle \le 2^{a+3} \zeta\left( \frac{3}{2} \right) \sum_{k \ge 2} \frac{k^{a+1}}{2^k}$ , where $\zeta$ denotes the Riemann zeta function.

Since

\begin{displaymath}\begin{array}{ll} \displaystyle \lim_{k \to \infty} \left\ver... ...right)^{a+1} \ \ & \displaystyle = \frac{1}{2}, \end{array}\end{displaymath}

$\displaystyle \sum_{k \ge 2} \frac{k^{a+1}}{2^k}$ converges by the ratio test. Thus, by this theorem, $\displaystyle \sum_{n \le x} (\tau(n))^a=O_a\left(\frac{x}{\log x}\sum_{n \le x} \frac{(\tau(n))^a}{n}\right)$ . Therefore,

$\displaystyle \sum_{n \le x} (\tau(n))^a$ $\displaystyle =O_a\left(\frac{x}{\log x}\sum_{n \le x} \frac{(\tau(n))^a}{n}\right)$
  $\displaystyle =O_a\left(\frac{x}{\log x}\prod_{p \le x}\left( 1+\sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{(\tau(p^k))^a}{p^k} \right) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x} \left( \exp \left( \sum_{p \le x} \sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{(k+1)^a}{p^k} \right) \right) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x} \left( \exp \left( \sum_{p \le x} \sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{(2k)^a}{p^k} \right) \right) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x} \left( \exp \left( 2^a \sum_{p \le x} \sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{k^a}{p^k} \right) \right) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x}(\exp(2^a(\log \log x+O_a(1)))) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x}(\exp(\log(\log x)^{2^a})) \right)$
  $\displaystyle =O_a\left(\frac{x}{\log x}(\log x)^{2^a} \right)$
  $\displaystyle =O_a(x(\log x)^{2^a-1})$ .
$ \qedsymbol$




"$\displaystyle \sum_{n \le x} (\tau(n))^a=O_a(x(\log x)^{2^a-1})$ for $a \ge 0$" is owned by Wkbj79.
(view preamble | get metadata)

View style:

See Also: asymptotic estimates for real-valued nonnegative multiplicative functions, $\displaystyle \sum_{n \le x} y^{\Omega(n)}=O\left( \frac{x(\log x)^{y-1}}{2-y} \right)$ for $1 \le y<2$


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: ratio test, converges, Riemann zeta function, composition of multiplicative functions, multiplicative, completely multiplicative, Landau notation, integers, positive, prime, natural logarithm, floor function, divisor function

This is version 12 of $\displaystyle \sum_{n \le x} (\tau(n))^a=O_a(x(\log x)^{2^a-1})$ for $a \ge 0$, born on 2006-08-13, modified 2007-05-30.
Object id is 8248, canonical name is DisplaystyleSum_nLeXTaunaO_axlogX2a1ForAGe0.
Accessed 1586 times total.

Classification:
AMS MSC11N37 (Number theory :: Multiplicative number theory :: Asymptotic results on arithmetic functions)

Pending Errata and Addenda
None.
[ View all 3 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)