Related papers: Higher Mertens constants for almost primes II

Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]

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) =…

We analytically continue the Euler prime product for $\Re(s)>\tfrac{1}{2}$ (except for its pole $s=1$) assuming (RH) by introducing a new factor to the Euler product. We also discuss how to recover the Mertens's 3rd Theorem at $s=1$ case,…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

For k greater than 1 and r different from 0, let pi^k_{2r}(x) denote the number of prime pairs (p,p^k+2r) with p not exceeding (large) x. By the Bateman-Horn conjecture, the function pi^k_{2r}(x) should be asymptotic to…

A permutation is called mod-k-alternating if its entries are restricted to having the same remainder as the index, modulo some integer $k \geq 1.$ In this paper, we find the sign-balance for mod-k-alternating permutations with respect to…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ its $k$-fold iterate. In this note, we improve the upper bound for the number of positive $n\leqslant x$ such that $\phi_{k+1}(n)\geqslant cn$. Comparing with the upper bound which…

We establish upper bounds for shifted moments of modular $L$-functions to a fixed prime level under the generalized Riemann hypothesis.

It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Improving and extending recent results of the author, we conditionally estimate exponential sums with Dirichlet coefficients of L-functions, both over all integers and over all primes in an interval. In particular, we establish new…

Let $p_n$ denote the $n$-th prime, and for any $k \geq 1$ and sufficiently large $X$, define the quantity $$ G_k(X) := \max_{p_{n+k} \leq X} \min( p_{n+1}-p_n, \dots, p_{n+k}-p_{n+k-1} ),$$ which measures the occurrence of chains of $k$…

Improving Importance Sampling estimators for rare event probabilities requires sharp approximations of conditional densities. This is achieved for events E_{n}:=(f(X_{1})+...+f(X_{n}))\inA_{n} where the summands are i.i.d. and E_{n} is a…

Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…

We establish new mean value theorems for primes of size $x$ in arithmetic progressions to moduli as large as $x^{3/5-\epsilon}$ when summed with suitably well-factorable weights. This extends well-known work of Bombieri, Friedlander and…