Related papers: On Proving Ramanujan's Inequality using a Sharper …

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

We establish a new bound for the exponential sum \begin{eqnarray*} \sum_{x\in\mathcal{X}}\Big|\sum_{y\in \mathcal{Y}}\gamma(y)\exp(2\pi i a \lambda^{xy}/p)\Big|, \end{eqnarray*} where $\lambda$ is an element of the residue ring modulo a…

Let $ \Lambda $ denote von Mangoldt's function, and consider the averages \begin{align*} A_N f (x) &=\frac{1}{N}\sum_{1\leq n \leq N}f(x-n)\Lambda(n) . \end{align*} We prove sharp $ \ell ^{p}$-improving for these averages, and sparse bounds…

In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which…

Let $Q(n)$ denote the number of integers $1 \leq q \leq n$ whose prime factorization $q= \prod^{t}_{i=1}p^{a_i}_i$ satisfies $a_1\geq a_2\geq \ldots \geq a_t$. Hardy and Ramanujan proved that $$ \log Q(n) \sim \frac{2\pi}{\sqrt{3}}…

The function $ \tan(\pi x / 2) / (\pi x / 2) $ is expanded into a Laurent series of $ 1 - x^2 $, where the coefficients are given explicitly as combinations of zeta function of even integers. This is used to achieve a sequence of upper and…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

Let $\lambda$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_{\alpha} \left | \sum_{x < n \leq x + H} \lambda(n) e(-\alpha n) \right | dx = o ( X H) $$ for all $H \geq X^{\theta}$ with $\theta >…

We reduce the leading term in Lehman's theorem. This improved estimate allows us to refine the main theorem of Bays and Hudson. Entering $2,000,000$ Riemann zeros, we prove that there exists $x$ in the interval $[exp(727.951858),…

Alford, Granville, and Pomerance proved that there are infinitely many Carmichael numbers. In the same paper, they ask if a statement analogous to Bertrand's postulate could be proven for Carmichael numbers. In this paper, we answer this…

The Riemann Hypothesis, originally proposed by the eminent mathematician Bernard Riemann in 1859, remains one of the most profound challenges in number theory. It posits that all non-trivial zeros of the Riemann zeta function {\zeta}(s) are…

The partition function $p(n)$ and many of its related restricted partition functions have recently been shown independently to satisfy log-concavity: $p(n)^2 \geq p(n-1)p(n+1)$ for $n\geq 26$, and satisfy the inequality: $p(n)p(m) \geq…

Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality sum_{d|n}d<e^{gamma}n loglog n is satisfied for n>=5041, where gamma denotes the Euler(-Mascheroni) constant. We show by elementary methods…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

The Riemann Hypothesis states that within the strip region of the complex plane $0 < {\rm Re}(s) < 1$, the Riemann $\xi(s)$ function has zeros only on the critical line ${\rm Re}(s) = \frac{1}{2}$ and none elsewhere. To prove the Riemann…

Let $\mathcal{P}$ be the set of all primes and $\pi(x)$ be the number of primes up to $x$. For any $n\ge 2$, let $P^+(n)$ be the largest prime factor of $n$. For $0<c<1$, let $$T_c(x)=\#\{p\le x:p\in \mathcal{P},P^+(p-1)\ge p^c\}.$$ In this…