PlanetMath (more info)
 Math for the people, by the people.
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
Dirichlet hyperbola method (Definition)

Let $ f$, $ g$, and $ h$ be multiplicative functions such that $ f=g*h$, where $ *$ denotes the convolution of $ g$ and $ h$. The Dirichlet hyperbola method (typically shortened to hyperbola method) is a way to calculate $ \displaystyle \sum_{n \le x} f(n)$ by using the fact that $ f=g*h$:

$\displaystyle \sum_{n \le x} f(n) = \sum_{n \le x} \sum_{ab=n} g(a)h(b) = \sum_... ...le \frac{x}{b}} g(a)h(b) - \sum_{a \le \sqrt{x}} \sum_{b \le \sqrt{x}} g(a)h(b)$

Note that, since $ ab=n \le x$, not both of $ a$ and $ b$ can be larger than $ \sqrt{x}$. The Dirichlet hyperbola method follows from this fact as well as the inclusion-exclusion principle.

This method for calculating $ \displaystyle \sum_{n \le x} f(n)$ is advantageous when the sums in terms of $ g$ and $ h$ are easier to handle and when $ \vert g(n)-h(n)\vert$ is relatively small for most $ n \in \mathbb{N}$.

As an example, the sum $ \displaystyle \sum_{n \le x} \tau(n)$ will be calculated using the Dirichlet hyperbola method.

Note that $ \tau=1*1$. Thus:

\begin{displaymath}\begin{array}{ll} \displaystyle \sum_{n \le x} \tau(n) & \dis... ...laystyle = x \log x + (2 \gamma - 1)x + O(\sqrt{x}) \end{array}\end{displaymath}



"Dirichlet hyperbola method" is owned by Wkbj79.
(view preamble)

View style:

See Also: convolution method, $\tau$ function, Euler's constant

Other names:  hyperbola method
Log in to rate this entry.
(view current ratings)

Cross-references: sums, inclusion-exclusion principle, multiplicative functions
There are 2 references to this entry.

This is version 11 of Dirichlet hyperbola method, born on 2006-06-10, modified 2007-06-28.
Object id is 7990, canonical name is DirichletHyperbolaMethod.
Accessed 1830 times total.

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

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)