English
Related papers

Related papers: Sign changes in Mertens' first and second theorems

200 papers

The function $\sum_{p\leq x} \frac{1}{p} - \log\log(x) - M$ is known to change sign infinitely often, but so far all calculated values are positive. In this paper we prove that the first sign change occurs well before $\exp(495.702833165)$.

Number Theory · Mathematics 2015-11-09 Jan Büthe

Rosser and Schoenfeld remarked that the product $\prod_{p\leq x}(1-1/p)^{-1}$ exceeds $e^{\gamma} \log x$ for all $2\leq x\leq 10^8$, and raised the question whether the difference changes sign infinitely often. This was confirmed in a…

Number Theory · Mathematics 2015-02-09 Youness Lamzouri

We provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.

Number Theory · Mathematics 2022-05-31 Marco Aymone , Winston Heap , Jing Zhao

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…

Number Theory · Mathematics 2026-03-25 Rodrigo Angelo , Max Wenqiang Xu

Let $V(T)$ denote the number of sign changes in $\psi(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq \gamma_{1}/\pi + 1.867\cdot 10^{-30}$, where $\gamma_{1} = 14.13\ldots$ denotes the ordinate of…

Number Theory · Mathematics 2019-11-07 Thomas Morrill , Dave Platt , Tim Trudgian

For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.

Number Theory · Mathematics 2007-05-23 Ernie Croot

The Mertens' first theorem gives us the following asymptotic formula \begin{equation*} \sum_{\substack{p\leq x\\ p~prime}}\frac{lnp}{p}=lnx+O(1), \end{equation*} and the Mertens' second theorem indicates that there exists a constant…

Number Theory · Mathematics 2021-06-15 Tianfang Qi , Su Hu

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

Number Theory · Mathematics 2024-01-26 Marco Aymone

Let $f$ be a Rademacher random multiplicative function. Let $$M_f(u):=\sum_{n \leq u} f(n)$$ be the partial sum of $f$. Let $V_f(x)$ denote the number of sign changes of $M_f(u)$ up to $x$. We show that for any constant $c > 2$, $$V_f(x) =…

Number Theory · Mathematics 2023-11-29 Nick Geis , Ghaith Hiary

Let $f$ be a holomorphic or Maass Hecke cusp form for the full modular group and write $\lambda_f(n)$ for the corresponding Hecke eigenvalues. We are interested in the signs of those eigenvalues. In the holomorphic case, we show that for…

Number Theory · Mathematics 2015-04-23 Kaisa Matomäki , Maksym Radziwill

Let $f\in S_k(\Gamma_{0}(N))$ be a normalized Hecke eigenform of even integral weight $k$ and level $N$. Let $j\ge1$ be a positive integer. We prove that for almost all primes $p$, $p\nmid N$, and for all characters $\chi_{0}=\pm 1\pmod N$,…

Number Theory · Mathematics 2018-01-16 Mezroui Soufiane

Let $\theta(x) = \sum_{p\leq x} \log p$. We show that $\theta(x)<x$ for $2<x< 1.39\cdot 10^{17}$. We also show that there is an $x<\exp(727.951332668)$ for which $\theta(x) >x.$

Number Theory · Mathematics 2014-07-09 Dave Platt , Tim Trudgian

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

Number Theory · Mathematics 2025-12-19 Petr Kucheriaviy

We prove that the existence of exceptional real zeroes of Dirichlet $L$-functions would lead to cancellations in the sum $\sum_{p\leq x} \Kl(1, p)$ of Kloosterman sums over primes, and also to sign changes of $\Kl(1, n)$, where $n$ runs…

Number Theory · Mathematics 2019-05-07 Sary Drappeau , James Maynard

For a half integral weight modular form $f$ we study the signs of the Fourier coefficients $a(n)$. If $f$ is a Hecke eigenform of level $ N$ with real Nebentypus character, and $t$ is a fixed square-free positive integer with $a(t)\neq 0$,…

Number Theory · Mathematics 2007-09-14 Jan Hendrik Bruinier , Winfried Kohnen

This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…

Number Theory · Mathematics 2013-07-11 N. A. Carella

Let $\omega^*(n) = \{d|n: d=p-1, \mbox{$p$ is a prime}\}$. We show that, for each integer $k\geq2$, $$ \sum_{n\leq x}\omega^*(n)^k \asymp x(\log x)^{2^k-k-1}, $$ where the implied constant may depend on $k$ only. This confirms a recent…

Number Theory · Mathematics 2025-06-02 Mikhail R. Gabdullin

We prove that the Kloosterman sum $S(1,1;c)$ can change sign infinitely often as $c$ runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K.…

Number Theory · Mathematics 2014-06-06 Ping Xi

We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant…

Number Theory · Mathematics 2012-12-27 Alessandro Languasco , Alessandro Zaccagnini

We study congruences modulo powers of a prime $p$ between pairs of $p$-new modular Hecke eigenforms of level $\Gamma_0(p)$ and same weight $k$. Based on explicit computations, we conjecture that every such eigenform $f$ admits a twin to…

Number Theory · Mathematics 2026-02-18 Andrea Conti , Peter Mathias Gräf
‹ Prev 1 2 3 10 Next ›