Related papers: ABC implies that Ramanujan's tau function misses a…

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$.

Let $K$ be a number field or a function field of characteristic 0. If $K$ is a number field, assume the $abc$-conjecture for $K$. We prove a variant of Zsigmondy's theorem for ramified primes in preimage fields of rational functions in…

The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…

In 1947, Lehmer conjectured that the Ramanujan \tau-function \tau(m) is non-vanishing for all positive integers m, where \tau(m) are the Fourier coefficients of the cusp form \Delta of weight 12. It is known that Lehmer's conjecture can be…

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

In this paper we establish several results concerning the generalized Ramanujan primes. For $n\in\mathbb{N}$ and $k \in \mathbb{R}_{> 1}$ we give estimates for the $n$th $k$-Ramanujan prime which lead both to generalizations and to…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

The Bateman--Horn Conjecture predicts how often an irreducible polynomial $f(x) \in \mathbb{Z}[x]$ assumes prime values. We demonstrate that with sufficient averaging in the coefficients of $f$ (viz. exponential in the size of the inputs),…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Let $\mu(n)$ denote the M\"obius function, define $M(x)= \sum_{n\leq x}^{}\mu (n)$. The main result of this paper is to prove that \begin{equation*} \displaystyle\lim_{x \to +\infty}\frac{M(x)}{x}=0 \end{equation*} which is equivalent to…

Let M(q)=\sum c(n) q^n be one of Ramanujan's mock theta functions. We establish the existence of infinitely many linear congruences of the form c(An+B) \equiv 0 (mod \ell^j), where A is a multiple of \ell and an auxiliary prime p. Moreover,…

The null-function $0(a):=0$, $\forall a\in $N, has Ramanujan expansions: $0(a)=\sum_{q=1}^{\infty}(1/q)c_q(a)$ (where $c_q(a):=$ Ramanujan sum), given by Ramanujan, and $0(a)=\sum_{q=1}^{\infty}(1/\varphi(q))c_q(a)$, given by Hardy…

We denote functions mapping n to the Fourier coefficient of q^n in the expansion of a cusp form as Ramanujan functions. We empirically study the eigenvalues of determinants that represent values of these Ramanujan functions. In some cases,…

A celebrated conjecture of Hardy and Littlewood provides with an asymptotic formula for the counting function of the twin primes. We give an unconditional proof of such a formula by means of a finite Ramanujan expansion of the counting…

All the known approximations of the number of primes pi(n) not exceeding any given integer n are derived from real-valued functions that are asymptotic to pi(x), such as x/log x, Li(x) and Riemann's function R(x). The degree of…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

The world of primes has many gaps between evidence and theorems. Here, we review Legendre's conjecture on primes between consecutive squares and recent progress on the weaker question of primes between consecutive larger powers. Assuming…

We confirm the Jamneshan-Tao conjecture for finite abelian groups of rank at most a fixed integer $R$ (i.e. finite abelian groups generated by at most $R$ elements), by proving an inverse theorem for 1-bounded functions of non-trivial…

Let $\tau(n)$ stand for the number of divisors of the positive integer $n$. We obtain upper bounds for $\tau(n)$ in terms of $\log n$ and the number of distinct prime factors of $n$.