Related papers: Biases in prime factorizations and Liouville funct…
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
If $p_k$ is the k-th prime, the Firoozbakht conjecture states that the sequence $(p_k)^{1/k}$ is strictly decreasing. We use the table of first-occurrence prime gaps in combination with known bounds for the prime-counting function to verify…
We introduce a novel arithmetic function $w(n)$, a generalization of the Liouville function $\lambda(n)$, as the coefficients of a Dirichlet series. By spatially encoding information in a natural way about the distribution of prime factors…
The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…
In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…
In this contribution, we introduce the multiplicative Jacobi polynomials that arise as one of the solutions of the multiplicative Sturm-Liouville equation \begin{equation*} \frac{d^*}{dx}\left( e^{(1-x^2)\omega(x)}\odot \frac{d^*y}{dx}…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
Under the assumption of the Riemann Hypothesis, the Linear Independence Hypothesis, and a bound on negative discrete moments of the Riemann zeta function, we prove the existence of a limiting logarithmic distribution of the normalisation of…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…
In this paper we study mixed sums of primes and linear recurrences. We show that if m=2(mod 4) and m+1 is a prime then $(m^{2^n-1}-1)/(m-1)\not=m^n+p^a$ for any n=3,4,... and prime power p^a. We also prove that if a>1 is an integer, u_0=0,…
Given an integer $m \geq 2$ and a sufficiently large $q$, we apply a variant of the Maynard--Tao sieve weight to establish the existence of an arithmetic progression with common difference $q$ for which the $m$-th least prime in such…
Let $\lambda(n)$ be the Liouville function. We study the distribution of \[ \frac{1}{x^{1/2}}\sum_{x\leq n\leq 2x}\lambda(f(n)) \] over random polynomials $f$ of fixed degree $d$ and coefficients bounded in magnitude by $H$. In particular…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
We study the distribution of large prime factors of a random element $u$ of arithmetic sequences satisfying simple regularity and equidistribution properties. We show that if such an arithmetic sequence has level of distribution $1$ the…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…