Related papers: Generalized Ramanujan Primes

In 1982, Erd\"os and van Lint showed an estimate for the average of the ratio of the smallest and largest prime divisor of $n$. In this note, we apply C.H. Jia's method to give an estimate for the average of positive integer power of the…

We show that for all large enough $x$ the interval $[x,x+x^{1/2}\log^{1.39}x]$ contains numbers with a prime factor $p > x^{18/19}.$ Our work builds on the previous works of Heath-Brown and Jia (1998) and Jia and Liu (2000) concerning the…

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on…

For any $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Let $p$ be an odd prime. In this paper, we…

For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and…

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

Assuming the Riemann hypothesis, this article discusses a new elementary argument that seems to prove that the maximal prime gap of a finite sequence of primes p_1, p_2, ..., p_n <= x, satisfies max {p_(n+1) - p_n : p_n <= x} <=…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

An integer is a primitive root modulo a prime $p$ if it generates the whole multiplicative group $(\mathbb{Z}/p\mathbb{Z})^*$. In 1927 Artin conjectured that an integer $a$ which is not $-1$ or a square is a primitive root for infintely…

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

For a binomial random variable $\xi$ with parameters $n$ and $b/n$, it is well known that the median equals $b$ when $b$ is an integer. In 1968, Jogdeo and Samuels studied the behaviour of the relative difference between ${\sf P}(\xi=b)$…

In 1962, Bateman and Horn conjectured precise asymptotics for the count of positive integers n \le x for which f_1(n), ..., f_k(n) are all prime, where (f_1, ..., f_k) is an admissible k-tuple of polynomials in one variable. We prove that…

Sondow et al have studied Ramanujan primes (RPs) and observed numerically that, while half of all primes are RPs asymptotically, one obtains runs of consecutives RPs (resp. non-RPs) which are statistically significantly longer than one…