Search arXivSearch

arXiv · math/0502126

Approximate Functional Equation for the Product of Functions and Divisor Problem

Abstract

For functions defined via Dirichlet/generalized Dirichlet series in some half planes of the complex plane, we give a new simple elementary approach to obtain an Approximate Functional Equation(AFE for short) for the product of functions with explicit remainder term. We do this,using a highly generalized identity following Motohashi's approach,wherein he uses a generalisation of Dirichlet's device.We use our method to give an AFE for the product of two Dirichlet L-series corresponding to primitive Dirichlet characters with hitherto unknown estimate for its remainder term.We also consideer AFEs of functions on the real line and the AFEs not only of the r-th power of Dirichlet L-series(or,of Riemann Zeta function)but also of the r-th root of it,where r is a positive integer

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. V. Rane. 2009-02-02. Approximate Functional Equation for the Product of Functions and Divisor Problem. https://arxiv.org/abs/math/0502126

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT