Related papers: Small Primes And The Tau Function

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…

In this article, we derive lower bounds for the number of distinct prime divisors of families of non-zero Fourier coefficients of non-CM primitive cusp forms and more generally of non-CM primitive Hilbert cusp forms. In particular, for the…

In this paper we present a probabilistic algorithm to compute the coefficients of modular forms of level one. Focus on the Ramanujan's tau function, we give out the explicit complexity of the algorithm. From a practical viewpoint, the…

Motivated by the recent work of Park on the analogue of the Ramanujan's function $k(\tau)=r(\tau)r^2(2\tau)$ for the Ramanujan's cubic continued fraction, where $r(\tau)$ is the Rogers-Ramanujan continued fraction, we use the methods of Lee…

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…

Let $\tau(n)$ be the Ramanujan $\tau$-function. We prove that for any integer $N$ the diophantine equation $$ \sum_{i=1}^{74000}\tau(n_i)=N $$ has a solution in positive integers $n_1, n_2,..., n_{74000}$ satisfying the condition $$…

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Ramanujan, in his famous first letter to Hardy, claimed a very precise estimate for the number of integers that can be written as a sum of two squares. Far less well-known is that he also made further claims of a similar nature for the…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

An unconditional inequality of the totient function is contributed to the literature. This result is associated with various problems about the distribution of prime numbers.

This note proposes an improved estimate of the coefficient t(n) of the discriminant modular form using elementary method. It improves a well known estimate of the tau function t(n) by Deligne.

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

It is shown that the density of the values set {Tau(n): n <= x} of the nth coefficients Tau(n) of the discriminant function Delta(z), a cusp form of level N = 1 and weight k = 12, has the lower bound #{Tau(n): n <= x} >> x/log x. The…

In this Note we show that given any cusp form \pi on GL(3) over the rationals, there exist an infinite number of primes p which are Ramanujan for \pi, i.e., that the local components \pi_p are tempered for an infinite number of p. It turns…

We explore the modularity of the continued fractions $I(\tau), J(\tau), T_1(\tau), T_2(\tau)$ and $U(\tau)=I(\tau)/J(\tau)$ of order $10$, where $I(\tau)$ and $J(\tau)$ are introduced by Rajkhowa and Saikia, which are special cases of…

We show that for any irrational $\alpha$ and any $\tau<8/23$ there are infinitely many $n$ which are the product of two primes for which $$\|n\alpha\|\leq n^{-\tau}.$$ We also show that for all sufficiently large $b$ there exist 3-digit…

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.