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} y^{\omega(n)}=O_y(x(\log x)^{y-1})$ for $y \ge 0$ (Theorem)

Within this entry, $\omega$ refers to the number of distinct prime factors 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 $y \ge 0$ $\displaystyle \sum_{n \le x} y^{\omega(n)}=O_y(x(\log x)^{y-1})$
Proof. Since $y^{\omega(p^k)}=y$ for all $p$ and $k$ the real-valued nonnegative multiplicative function $y^{\omega(n)}$ satisfies the Wirsing condition with $c=y$ and $\lambda=1$ Thus:
$\displaystyle \sum_{n \le x} y^{\omega(n)}$ $\displaystyle =O_y \left( \frac{x}{\log x} \sum_{n \le x} \frac{y^{\omega(n)}}{n} \right)$
  $\displaystyle =O_y \left( \frac{x}{\log x} \prod_{p \le x} \left( 1+\sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{y^{\omega(p^k)}}{p^k} \right) \right)$
  $\displaystyle =O_y \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{y}{p^k} \right) \right) \right)$
  $\displaystyle =O_y \left( \frac{x}{\log x} \left( \exp \left( y \sum_{p \le x} \sum_{k=1}^{\left\lfloor \frac{\log x}{\log p} \right\rfloor } \frac{1}{p^k} \right) \right) \right)$
  $\displaystyle =O_y \left( \frac{x}{\log x} ( \exp (y(\log(\log x)+O(1)))) \right)$
  $\displaystyle =O_y \left( \frac{x}{\log x} ( \exp (\log (\log x)^y)) \right)$
  $\displaystyle =O_y \left( \frac{x}{\log x} (\log x)^y \right)$
  $\displaystyle =O_y(x(\log x)^{y-1})$
$ \qedsymbol$




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

View style:

See Also: asymptotic estimate, $\displaystyle \sum_{n \le x} y^{\Omega(n)}=O\left( \frac{x(\log x)^{y-1}}{2-y} \right)$ for $1 \le y<2$, Wirsing condition


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

Cross-references: Wirsing condition, multiplicative function, integers, positive, prime, natural logarithm, floor function, number of distinct prime factors function

This is version 6 of $\displaystyle \sum_{n \le x} y^{\omega(n)}=O_y(x(\log x)^{y-1})$ for $y \ge 0$, born on 2006-08-22, modified 2007-04-14.
Object id is 8279, canonical name is DisplaystyleSum_nLeXYomeganO_yxlogXy1ForYGe0.
Accessed 1111 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)