Search arXiv⌕ Search

arXiv · 0708.2771

Approximations to Euler's constant

Abstract

We study a problem of finding good approximations to Euler's constant $γ=\lim_{n\to\infty}S_n,$ where $S_n=\sum_{k=1}^n\frac{1}{n}-\log(n+1),$ by linear forms in logarithms and harmonic numbers. In 1995, C. Elsner showed that slow convergence of the sequence $S_n$ can be significantly improved if $S_n$ is replaced by linear combinations of $S_n$ with integer coefficients. In this paper, considering more general linear transformations of the sequence $S_n$ we establish new accelerating convergence formulae for $γ.$ Our estimates sharpen and generalize recent Elsner's, Rivoal's and author's results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kh. Hessami Pilehrood, T. Hessami Pilehrood. 2007-08-21. Approximations to Euler's constant. https://arxiv.org/abs/0708.2771

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

KEEP EXPLORING

Related papers

The integer group determinants for GA(1,p) and related semidirect products

We consider the integer group determinants for groups that are semidirect products of $\mathbb Z_p$ and $\mathbb Z_n$ with $p$ prime and $n\mid p-1$. We give a complete description of the integer group determinants for the general affine groups of degree one GA(1,$p$) when $p=5,7,11$ and $23$, and for $\mathbb Z_7\rtimes \mathbb Z_3,$ $\mathbb Z_{11}\rtimes \mathbb Z_5$ and $\mathbb Z_{13}\rtimes \mathbb Z_6,$ showing that the obvious divisibility and congruence conditions arising from the form of the group determinant when $n=p-1$ or $\frac{1}{2}(p-1)$, can be sufficient as well as necessary for these types of groups (although in the latter case we must work with norms of integers in a quadratic field). For $p=13$ this also happens for the remaining groups of this type, $\mathbb Z_{13}\rtimes_5 \mathbb Z_4$ and $\mathbb Z_{13}\rtimes \mathbb Z_3$, (working in an appropriate cubic and quartic field).

math.NT↗

A Shiu Theorem for Larger and Smoother Functions

In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let $f$ be a nonnegative multiplicative function. We prove that if there exists a $β<1$ such that $f(p^l)\ll (\log\log x)^{lβ}$ for every prime $p$ and every $l>1$, and if $f(n)\ll \max\{n^ε,(\log x)^ε\}$ for every $ε>0$, then $$\sum_{\substack{x\leq n\leq x+y \\ n\equiv a\pmod k}}f(n)\ll \frac{y}{ϕ(k)(\log x)^{1-ε_0}}\exp\left(\sum_{\substack{p\leq x \\ p\nmid k}}\frac{f(p)}{p}\right)$$ for every $ε_0>0$, where $x$, $y$, and $k$ are as they were in Shiu's original paper and $(a,k)=1$. Moreover, we prove that if $f$ is a $Q$-smooth-supported function then there exists a constant $C$ for which $$\sum_{\substack{x\leq n\leq x+y \\ n\equiv a\pmod k}}f(n)\ll \frac{y}{ϕ(k)(\log x)^{1-ε_0}}\exp\left(\sum_{\substack{p\leq x \\ p\nmid k}}\frac{f(p)}{p}\right)ρ(u)^C,$$ where $u=\frac{\log x}{\log Q}$, $ρ$ is the Dickman-de Bruijn function, and $C$ depends on whether we choose the bound of $f(p^l)\leq A_1^l$ or $f(p^l)\ll (\log\log x)^{lβ}$. We also give applications to both the divisor function to large powers and to smooth numbers in short intervals.

math.NT↗

Regularized spectral expansion of a Rankin--Selberg period and moments

We establish a regularized spectral decomposition of the squared magnitude of a maximal degenerate Eisenstein series as a Schwartz distribution on $\mathrm{GL}_n$. Although the original problem is on $\mathrm{GL}_n$, its spectral components are described entirely by the automorphic spectrum of $\mathrm{GL}_2$. As an application, we prove a partial reciprocity formula relating the second moment of $\mathrm{GL}_n\times\mathrm{GL}_n$ Rankin--Selberg central $L$-values and a mixed moment of $L$-values of $\mathrm{GL}_2$. We also prove, assuming the generalized Ramanujan conjecture, an asymptotic formula for the second moment of the above Rankin--Selberg $L$-functions over a conductor-aspect family with an error term of square-root-cancellation strength.

math.NT↗