Related papers: Derived Ramanujan Primes : R'_{n}

This note shows that the prime values of the Ramanujan tau function $\tau(n)=\pm p$ misses every prime $p\leq 8.0\times 10^{25}$.

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math.…

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}}…

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

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…

In this paper, for a positive integer $n\ge 1$, we look at the size and prime factors of the iterates of the Ramanujan $\tau$ function applied to $n$.

An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

For a primitive Hecke-Maass cusp form $\phi$ of level $N$ with the $n$-th Hecke eigenvalue $\lambda_{\phi}(n)$ and a prime number $p\nmid N$, the celebrated Ramanujan conjecture at $p$ asserts the following sharp upper bound: \[…

We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

A natural number $n$ is called semi-prime if it is a product of two primes or a square of a prime. We denote $\mathbb{P}_2$ the set of all semi-primes. Our goal is to prove that for fixed integer number $a$ and sufficiently large $x$ the…

Let p be an odd prime, such that p_n<p/2<p_{n+1}, where p_n is the n-th prime. We study the following question: with what probability does there exist a prime in the interval (p, 2p_{n+1})? After the strong definition of the probability…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan's theorem and define highest abundant numbers that are extreme with respect…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

Using the simple properties of Riemman integrable functions, Ramanujan's formula for sum of the square roots of first n natural numbers has been generalized to include r'th roots where r is any real number greater than 1.As an application…

In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…