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: No information on entry rating
[parent] $\displaystyle x\log^2x=O\left(\sum_{n \le x} 2^{\Omega(n)} \right)$ (Theorem)

Within this entry, $\Omega$ refers to the number of (nondistinct) prime factors function, $\tau$ refers to the divisor function, $\mu$ refers to the Möbius function, $\lfloor \, \cdot \, \rfloor$ refers to the floor function, $\log$ refers to the natural logarithm, $p$ refers to a prime, and $d$ $k$ $\ell$ $m$ and $n$ refer to positive integers.

Theorem   $\displaystyle x\log^2x=O\left(\sum_{n \le x} 2^{\Omega(n)} \right)$
Proof.
$\displaystyle \sum_{n \le x} 2^{\Omega(n)}$ $\displaystyle =\sum_{\substack{2^km \le x \\ m { is odd}}} 2^{\Omega(2^km)}$
   
  $\displaystyle =\sum_{2^k \le x} 2^{\Omega(2^k)} \sum_{\substack{m \le \frac{x}{2^k} \\ m { is odd}}} 2^{\Omega(m)}$ since $2^{\Omega}$ is multiplicative
   
  $\displaystyle \ge \sum_{k \le \frac{\log x}{\log 2}} 2^k \sum_{\substack{m \le \frac{x}{2^k} \\ m { is odd}}} \tau(m)$
   
  $\displaystyle \ge \sum_{k \le \frac{\log x}{\log 2}} 2^k \sum_{\substack{d \le \frac{x}{2^k} \\ d { is odd}}} \, \sum_{\substack{\ell \le \frac{x}{2^kd} \\ \ell { is odd}}} 1$ by the convolution method
   
  $\displaystyle \ge \sum_{k \le \frac{\log x}{\log 2}} 2^k \sum_{\substack{d \le \frac{x}{2^k} \\ d { is odd}}} \frac{x}{2^{k+2}d}$
   
  $\displaystyle \ge \frac{x}{4} \sum_{k \le \frac{\log x}{\log 2}} \sum_{\substack{d \le \frac{x}{2^k} \\ d { is odd}}} \frac{1}{d}$
   
  $\displaystyle \ge \frac{x}{4} \sum_{k \le \frac{\log x}{\log 2}} \left( \frac{1}{x} \sum_{\substack{d \le \frac{x}{2^k} \\ d { is odd}}} 1-\int_1^{\frac{x}{2^k}} \frac{-1}{t^2} \left( \sum_{\substack{d \le t \\ d { is odd}}} 1 \right) \, dt \right)$ by summation by parts
   
  $\displaystyle \ge \frac{x}{4} \sum_{k \le \frac{\log x}{\log 2}} \left( \frac{1}{x} \cdot \frac{x}{2^{k+2}}+\int_1^{\frac{x}{2^k}} \frac{1}{t^2} \cdot \frac{t}{2} \, dt \right)$
   
  $\displaystyle \ge \frac{x}{4} \sum_{k \le \frac{\log x}{\log 2}} \left( \frac{1}{2^{k+2}}+\frac{1}{2}\int_1^{\frac{x}{2^k}} \frac{1}{t} \, dt \right)$
   
  $\displaystyle \ge \frac{x}{4} \sum_{k \le \frac{\log x}{\log 2}} \left( \frac{1}{2^{k+2}}+\frac{1}{2}\log\left( \frac{x}{2^k} \right) \right)$
   
  $\displaystyle \ge \frac{x}{16} \sum_{k \le \frac{\log x}{\log 2}} \left( \frac{1}{2^k}+\log x-k\log 2 \right)$
   
  $\displaystyle \ge \frac{x}{16} \left( \frac{1}{2} \left( \frac{1-\left( \frac{1}{2} \right)^{\left\lfloor \frac{\log x}{\log 2} \right\rfloor +1}}{1-\frac{1}{2}} \right)+\log x \left\lfloor \frac{\log x}{\log 2} \right\rfloor -\log 2 \left( \frac{ \left\lfloor \frac{\log x}{\log 2} \right\rfloor^2+\left\lfloor \frac{\log x}{\log 2} \right\rfloor }{2} \right) \right)$
   
  $\displaystyle \ge \frac{x}{16} \left\lfloor \frac{\log x}{\log 2} \right\rfloor \left( \log x-\frac{1}{2}\log 2 \left( \left\lfloor \frac{\log x}{\log 2} \right\rfloor +1 \right) \right)$
   
  $\displaystyle \ge \frac{x}{16} \left\lfloor \frac{\log x}{\log 2} \right\rfloor \left( \log x-\frac{1}{2}\log 2 \left( \frac{\log x}{\log 2}+1 \right) \right)$
   
  $\displaystyle \ge \frac{x}{16} \left\lfloor \frac{\log x}{\log 2} \right\rfloor \left( \log x-\frac{1}{2}\log x-\frac{1}{2}\log 2 \right)$
   
  $\displaystyle \ge \frac{x}{32} \left\lfloor \frac{\log x}{\log 2} \right\rfloor \log \left( \frac{x}{2} \right)$

Since, for $x$ sufficiently large, $\displaystyle \log x=O\left( \log \left( \frac{x}{2} \right) \right)$ and $\displaystyle \log x=O\left( \left\lfloor \frac{\log x}{\log 2} \right\rfloor \right)$ it follows that $\displaystyle x\log^2x=O\left(\sum_{n \le x} 2^{\Omega(n)} \right)$ $ \qedsymbol$




"$\displaystyle x\log^2x=O\left(\sum_{n \le x} 2^{\Omega(n)} \right)$" is owned by Wkbj79.
(view preamble | get metadata)

View style:

See Also: asymptotic estimate, convolution method, $\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: convolution method, multiplicative, integers, positive, prime, natural logarithm, floor function, Möbius function, divisor function
There is 1 reference to this entry.

This is version 13 of $\displaystyle x\log^2x=O\left(\sum_{n \le x} 2^{\Omega(n)} \right)$, born on 2006-08-09, modified 2007-06-27.
Object id is 8236, canonical name is DisplaystyleXlog2xOleftsum_nLeX2OmeganRight.
Accessed 1168 times total.

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

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

No messages.

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