Related papers: Small Primes And The Tau Function

We study the prime values of Ramanujan's tau function $\tau(n)$. Lehmer found that $n=251^2=63001$ is the smallest $n$ such that $\tau(n)$ is prime: $$\tau(251^2)=-80561663527802406257321747.$$ We prove that in most arithmetic progressions…

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

We study some arithmetic properties of the Ramanujan function $\tau(n)$, such as the largest prime divisor $P(\tau(n))$ and the number of distinct prime divisors $\omega(\tau(n))$ of $\tau(n)$ for various sequences of $n$. In particular, we…

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 a number of results regarding odd values of the Ramanujan $\tau$-function. For example, we prove the existence of an effectively computable positive constant $\kappa$ such that if $\tau(n)$ is odd and $n \ge 25$ then either \[…

Lehmer conjectured that Ramanujan's tau function never vanishes. As a variation of this conjecture, it is proved that \begin{equation*} \tau(n)\neq \pm \ell, \pm 2\ell, \pm 2\ell^2, \end{equation*} where $\ell<100$ is an odd prime, by…

Lehmer conjectured that Ramanujan's tau-function never vanishes. In a related direction, a folklore conjecture asserts that infinitely many primes arise as absolute values of Ramanujan's tau-function. Recently, Xiong showed that these prime…

Let $\tau$ denote the Ramanujan tau function. One is interested in possible prime values of $\tau$ function. Since $\tau$ is multiplicative and $\tau(n)$ is odd if and only if $n$ is an odd square, we only need to consider $\tau(p^{2n})$…

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

In this paper we prove Lehmer's conjecture on Ramanujan's tau function, namely tau(n) not equal to zero for n >= 1 by investigating the additive group structure attached to tau(n) with the aid of the pigeonhole principle and unique…

Ramanujan showed that $\tau(p) \equiv p^{11}+1 \pmod{691}$, where $\tau(n)$ is the $n$-th Fourier coefficient of the unique normalized cusp form of weight $12$ and full level, and the prime $691$ appears in the numerator of…

A natural variant of Lehmer's conjecture that the Ramanujan $\tau$-function never vanishes asks whether, for any given integer $\alpha$, there exist any $n \in \mathbb{Z}^+$ such that $\tau(n) = \alpha$. A series of recent papers excludes…

The possible values of the nth Fourier coefficients a(n) of some cusp forms f(z) of weight k => 12 are studied in this article. In particular, the values of the tau function are investigated in some details, and proved that tau(p) =! 0 for…

In this paper we attempt to prove Lehmer's conjecture on Ramanujan's tau function, namely tau(n) is never zero, for each n larger than zero by investigating the additive group structure attached to tau(n) with the aid of unique…

For $n\ge 1$, the $n^{\rm th}$ Ramanujan prime is defined as the smallest positive integer $R_n$ such that for all $x\ge R_n$, the interval $(\frac{x}{2}, x]$ has at least $n$ primes. We show that for every $\epsilon>0$, there is a positive…

In the spirit of Lehmer's speculation that Ramanujan's tau-function never vanishes, it is natural to ask whether any given integer $\alpha$ is a value of $\tau(n)$. For odd $\alpha$, Murty, Murty, and Shorey proved that $\tau(n)\neq \alpha$…

Towards the end of his life Ramanujan wrote a manuscript on properties of the partition and tau functions, some parts of which remained unpublished until very recently. Nevertheless, this manuscript gave rise to a lot of subsequent work. In…

Two inequalities concerning the symmetry of the zeta-function and the Ramanujan $\tau$-function are improved through the use of some elementary considerations.

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that for all $x \geq R_n$ the interval $(x/2, x]$ contains at least $n$ primes. In this paper we undertake a study of the sequence $(\pi(R_n))_{n \in \mathbb{N}}$, which…

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then the interval $(x/2,x]$ contains at least $n$ primes. We sharpen Laishram's theorem that $R_n < p_{3n}$ by proving that the maximum of…