Related papers: An induction property for prime counting functions

In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results…

We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to…

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

A semiprime is a natural number which can be written as the product of two primes. The asymptotic behaviour of the function $\pi_2(x)$, the number of semiprimes less than or equal to $x$, is studied. Using a combinatorial argument,…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Let $L$ be a finite Galois extension of the number field $K$. We unconditionally bound the least prime ideal of $K$ occurring in the Chebotarev Density Theorem as a power of the discriminant of $L$ with an explicit exponent. We also…

We introduce the weighted prime sum $S(x) = \sum_{p \le x} \sqrt{(\log p)/p}$ and the derived quantity $E(x) = S(x)^2 - M(x)$, where $M(x) = \sum_{p \le x} (\log p)/p$. We prove that the order-of-magnitude estimate $S(x) \asymp \sqrt{x /…

In this paper we consider suitable families of power series distributed random variables, and we study their asymptotic behavior in the fashion of large (and moderate) deviations. We also present two examples of fractional counting…

We note an interesting and under-expressed fact from Chebyshev's initial bounding for the prime counting function, $\pi(x) := \# \{p \leq x : p \text{ prime}\},$ based upon a selection of fixed coefficients $d\in D$ to show $\psi(x) \asymp…

Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…

We set general conditions under which the general poverty index, which summarizes all the available indices, is asymptotically represented with some empirical processes. This representation theorem offers a general key, in most directions,…

Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

A formalism is presented to obtain closed evolution equations for asymptotic probability distribution functions of turbulence magnitudes. The formalism is derived for a generic evolution equation, so that the final result can be easily…

We introduce the sequence $(a_n) \subset (0,1]$ and prove that the asymptotic behaviour of $\sum_{k=1}^n a_k$ is the same than $\pi(n)$, the prime-counting function. We also obtain that $\pi(n) \sim n a_n$ and we estimate…

Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…

In this paper we prove an approximate formula expressed in terms of elementary functions for the implied volatility in the Heston model. The formula consists of the constant and first order terms in the large maturity expansion of the…

Let f(t) be a rational function of degree at least 2 with rational coefficients. For a given rational number x_0, define x_{n+1}=f(x_n) for each nonnegative integer n. If this sequence is not eventually periodic, then the difference…

We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.

This paper is concerned with the existence of invariant measure for 3D stochastic primitive equations driven by linear multiplicative noise under non-periodic boundary conditions. The common method is to apply Sobolev imbedding theorem to…