English
Related papers

Related papers: On the first sign change in Mertens' Theorem

200 papers

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Number Theory · Mathematics 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

Logic · Mathematics 2016-08-09 Mario Carneiro

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

Number Theory · Mathematics 2008-10-06 Joseph B. Keller

In this article we study the existence of sign changing solution of the following p-fractional problem with concave-critical nonlinearities: \begin{eqnarray*} (-\Delta)^s_pu &=& \mu |u|^{q-1}u + |u|^{p^*_s-2}u \quad\mbox{in}\quad \Omega,…

Analysis of PDEs · Mathematics 2018-01-22 Mousomi Bhakta , Debangana Mukherjee

A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…

Combinatorics · Mathematics 2025-01-09 Benjamin Bedert , Noah Kravitz

Let $\omega_0, \omega_1,\ldots, \omega_n$ be a full set of outcomes (letters, symbols) and let positive $p_i$, $i=0,\ldots,n$, be their probabilities ($\sum_{i=0}^n p_i=1$). Let us treat $\omega_0$ as a stop symbol; it can occur in…

Probability · Mathematics 2017-05-12 Vladimir V. Bochkarev , Eduard Yu. Lerner

Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$.…

Probability · Mathematics 2012-07-16 Marc Arnaudon , Laurent Miclo

We prove that $$ \sum_{n \leq x} \varphi([x/n])\leq\bigg(\frac{1380}{4009}+\frac{2629}{4009}\cdot\frac1{\zeta(2)}+o(1)\bigg)x\log x $$ as $x\to\infty$, where $\varphi$ denotes the Euler totient function and $[x]$ denotes the integer part of…

Number Theory · Mathematics 2018-10-23 Li-Xia Dai , Hao Pan

We show that the Liouville function changes sign infinitely often for $x^2+d$.

Number Theory · Mathematics 2021-05-24 Anitha Srinivasan

Let $f$ and $g$ be two distinct newforms which are normalized Hecke eigenforms of weights $k_1, k_2 \ge 2$ and levels $N_1, N_2 \ge 1$ respectively. Also let $a_f(n)$ and $a_g(n)$ be the $n$-th Fourier-coefficients of $f$ and $g$…

Number Theory · Mathematics 2018-03-13 Sanoli Gun , Balesh Kumar , Biplab Paul

We show that for every mean zero log-concave real random variable $X$ one has $\|X\|_p \leq \frac{p}{q} \|X\|_q$ for $p \geq q \geq 1$, going beyond the well-known case of symmetric random variables. We also prove that in the class of…

Probability · Mathematics 2022-11-11 Daniel Murawski

In this paper two conjectures are proposed based on which we can prove the first case of Fermat's Last Theorem(FLT) for all primes $p \equiv -1 (\bmod~6)$. With Pollaczek's result {\bf [1]} and the conjectures the first case of FLT can be…

History and Overview · Mathematics 2007-05-23 Joseph Amal Nathan

Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…

Dynamical Systems · Mathematics 2024-05-07 Tomas Persson

Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving upon recent bounds of the first three and…

Number Theory · Mathematics 2019-10-22 Kevin Ford , Ben Green , Sergei Konyagin , James Maynard , Terence Tao

In this note, we prove that for all $x \in (0 , 1)$, we have: $$ \log\Gamma(x) = \frac{1}{2} \log\pi + \pi \boldsymbol{\eta} \left(\frac{1}{2} - x\right) - \frac{1}{2} \log\sin(\pi x) + \frac{1}{\pi} \sum_{n = 1}^{\infty} \frac{\log n}{n}…

Number Theory · Mathematics 2013-12-30 Bakir Farhi

Let $p\geq 1$, $\eps >0$, $r\geq (1+\eps) p$, and $X$ be a $(-1/r)$-concave random vector in $\R^n$ with Euclidean norm $|X|$. We prove that $(\E |X|^{p})^{1/{p}}\leq c (C(\eps) \E|X|+\sigma_{p}(X))$, where $\sigma_{p}(X)=\sup_{|z|\leq…

In this paper, we establish new bounds for classical prime-counting functions. All of our bounds are explicit and assume the Riemann Hypothesis. First, we prove that $|\psi(x) - x|$ and $|\vartheta(x) - x|$ are bounded from above by…

Number Theory · Mathematics 2025-10-03 Ethan Simpson Lee , Paweł Nosal

Let $||X||_p=\text{Tr}[(X^\ast X)^{p/2}]^{1/p}$ denote the $p$-Schatten norm of a matrix $X\in M_{n\times n}(\mathbb{C})$, and $\sigma(X)$ the singular values with $\uparrow$ $\downarrow$ indicating its increasing or decreasing…

Functional Analysis · Mathematics 2021-11-01 Victoria M Chayes

Let $0 < p < 2$. Let $\{X, X_{n}; n \geq 1\}$ be a sequence of independent and identically distributed $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. In this paper, a supplement to the classical laws…

Probability · Mathematics 2020-07-13 Deli Li , Yu Miao

For each 1 < p < infinity, there exists a positive constant c_p, depending only on p, such that the following holds. Let (d_k), (e_k) be real-valued martingale difference sequences. If for for all bounded nonnegative predictable sequences…

Probability · Mathematics 2007-05-23 Stephen Montgomery-Smith , Shih-Chi Shen