Related papers: On Ramanujan expansions and primes in arithmetic p…

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

One of the questions of distribution of prime numbers is considered in the article. It is shown what error is obtained from the assumption that the asymptotic density of a sequence of primes is a probability. Various forms of an analogue of…

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…

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…

We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…

This research article provides an unconditional proof of an inequality proposed by Srinivasa Ramanujan involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for…

We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…

Let $\tau(n)$ be Ramanujan's tau function, defined by the discriminant modular form \[ \Delta(z) = q\prod_{j=1}^{\infty}(1-q^{j})^{24}\ =\ \sum_{n=1}^{\infty}\tau(n) q^n \,,q=e^{2\pi i z} \] (this is the unique holomorphic normalized…

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

We present a smooth version of Landaus explicit formula for the von Mangoldt arithmetical function. Assuming the validity of the Riemann hypothesis, we show that in order to determine whether a natural number is a prime number, it is…

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

We generalize certain recent results of Ushiroya concerning Ramanujan expansions of arithmetic functions of two variables. We also show that some properties on expansions of arithmetic functions of one and several variables using classical…

This article provides a proof that the Ramanujan's Inequality given by, $$\pi(x)^2 < \frac{e x}{\log x} \pi\Big(\frac{x}{e}\Big)$$ holds unconditionally for every $x\geq \exp(43.5102147)$. In case for an alternate proof of the result stated…

We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…

In the study of Ramanujan sums, the so-called regular $A$-function is a set-valued multiplicative function that tracks certain subsets of the divisor sets of natural numbers. McCarthy provided a generalization of the Ramanujan sum using…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

Let $\varepsilon>0$ be given. For prime power moduli $q=p^k$ with $k\geq 2$ and $p\neq 3$, and assuming the Ramanujan--Petersson conjecture for $\GL_2$ Maass forms, we prove that the Rankin--Selberg coefficients $\{\lambda_f(n)^2\}_{n\geq…

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…