Computing the Ramanujan tau function

We show that the Ramanujan tau function τ(n) can be computed by a randomized algorithm that runs in time for every O( ) assuming the Generalized Riemann Hypothesis. The same method also yields a deterministic algorithm that runs in time O( ) (without any assumptions) for every ε > 0 to compute τ(n). Previous algorithms to compute τ(n) require Ω(n) time. Research supported in part by NSF grant CCR-9988202 2000 Mathematics Subject Classification Primary—11-04; Secondary—11Y55, 11F11     

On an inequality of Ramanujan concerning the prime counting function

We discuss on the sign of $\mathcal{R}_{\alpha }(x):=\pi(x)^{2}-\frac{\alpha x}{\log x}\pi(\frac{x}{\alpha })$ for x sufficiently large, and for various values of ??>0. The case ??=e refers to a result due to Ramanujan asserting that $\mathcal{R}_{e}(x)<0$ . Related by this inequality, we obtain a conditional result that gives the number N>530.2 such that $\mathcal{R}_{e}(x)<0$ is valid for x>e ^N . Moreover, we show that under assumption of validity of the Riemann hypothesis, the inequality $\mathcal{R}_{e}(x)<0$ holds for x>138,766,146,692,471,228. Then, in various cases for ??, we find numerical values of x _?? in which $\mathcal{R}_{\alpha }(x)$ is strictly positive or negative for x??x _?? .     

Representation of integer numbers by values of the Ramanujan function

It is proved that each integer number can be expressed as a sum of 7940 values of the Ramanujan tau function.     

An alternate proof of a congruence regarding Ramanujan’s tau function

Ramaunjan’s tau function, denoted δ (n) is defined by the identity (1) below, wherex represents a complex variable such that |x| < 1. Using properties of t-core partitions, we obtain an alternate proof of the congruence (2) below.     

An alternate proof of a congruence regarding Ramanujan’s tau function

Ramaunjan’s tau function, denoted δ (n) is defined by the identity (1) below, wherex represents a complex variable such that |x| < 1. Using properties of t-core partitions, we obtain an alternate proof of the congruence (2) below.     

Discrete fourier transform computation using prime Ramanujan numbers

Ramanujan numbers were introduced in [2] to implement discrete fourier transform (DFT) without using any multiplication operation. Ramanujan numbers are related to π and integers which are powers of 2. If the transform sizeN, is a Ramanujan number, then the computational complexity of the algorithms used for computing isO(N ²) addition and shift operations, and no multiplications. In these algorithms, the transform can be computed sequentially with a single adder inO(N ²) addition times. Parallel implementation of the algorithm can be executed inO(N) addition times, withO(N) number of adders. Some of these Ramanujan numbers of order-2 are related to the Biblical and Babylonian values of π [1]. In this paper, we analytically obtain upper bounds on the degree of approximation in the computation of DFT if JV is a prime Ramanujan number.     

Arithmetic properties of the Ramanujan function

We study some arithmetic properties of the Ramanujan function τ(n), such as the largest prime divisorP (τ(n)) and the number of distinct prime divisors ω (τ (n)) of τ(n) for various sequences ofn. In particular, we show thatP(τ(n)) ≥ (logn)^33/31+o(1) for infinitely many n, and

Identities for the Ramanujan zeta function

We prove formulas for special values of the Ramanujan tau zeta function. Our formulas show that L(Δ,k)$L(\mathrm{\Delta },k)$ is a period in the sense of Kontsevich and Zagier when k?12$k?12$. As an illustration, we reduce L(Δ,k)$L(\mathrm{\Delta },k)$ to explicit integrals of hypergeometric and algebraic functions when k∈{12,13,14,15}$k\in \{12,13,14,15\}$.     

On the value set of the Ramanujan function

We give lower bounds on the number of distinct values of the Ramanujan function τ(n), n ≦ x, and on the number of distinct residues of τ(n), n ≦ x, modulo a prime ℓ. We also show that for any prime ℓ the values τ(n), n ≦ ℓ⁴, form a finite additive basis modulo ℓ. Received: 6 October 2004     

On exponential sums involving the Ramanujan function

Let τ(n) be the arithmetical function of Ramanujan, α any real number, and x≥2. The uniform estimate $$\mathop \Sigma \limits_{n \leqslant x} \tau (n)e(n\alpha ) \ll x^6 \log x$$ is a classical result of J R Wilton. It is well known that the best possible bound would be ?x ⁶. The validity of this hypothesis is proved.     

Odd perfect numbers have a prime factor exceeding

It is proved that every odd perfect number is divisible by a prime greater than .

     

Odd perfect numbers have at least nine distinct prime factors

An odd perfect number, , is shown to have at least nine distinct prime factors. If then must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.

     

On Ramanujan sums of a real variable and a new Ramanujan expansion for the divisor function

The Ramanujan Journal - We show that the absolute convergence of a Ramanujan expansion does not guarantee the convergence of its real variable generalization, which is obtained by replacing the...     

Polynomial values free of large prime factors

For F &isin; Z [ X], let &PSgr; F (x, y) denote the number of positive integers n not exceeding x such that F(n) is free of prime factors > y. Our main purpose is to obtain lower bounds of the form &PSgr; (x, y) >> x for arbitrary F and for y equal to a suitable power of x. Our proofs rest on some results and methods of two articles by the third author concerning localization of divisors of polynomial values. Analogous results for the polynomial values at prime arguments are also obtained.     

On the prime zeta function

The basic properties of the prime zeta function are discussed in some detail. A certain Dirichlet series closely connected with the function is introduced and investigated. Its dependence on the structure of the natural numbers with respect to their factorization is particularly stressed.     

On geometric properties of the generating function for the Ramanujan sequence

The Ramanujan sequence \(\{\theta _{n}\}_{n \ge 0}\), defined as \(\theta _{0}= {1}/{2}\), \({n^{n}} \theta _{n}/{n !} = {e^{n}}/{2} - \sum _{k=0}^{n-1} {n^{k}}/{k !}\, \), \(n \ge 1\), has been studied on many occasions and in many different contexts. Adell and Jodrá (Ramanujan J 16:1–5, 2008) and Koumandos (Ramanujan J 30:447–459, 2013) showed, respectively, that the sequences \(\{\theta _{n}\}_{n \ge 0}\) and \(\{4/135 - n \cdot (\theta _{n}- 1/3 )\}_{n \ge 0}\) are completely monotone. In the present paper, we establish that the sequence \(\{(n+1) (\theta _{n}- 1/3 )\}_{n \ge 0}\) is also completely monotone. Furthermore, we prove that the analytic function \((\theta _{1}- 1/3 )^{-1}\sum _{n=1}^{\infty } (\theta _{n}- 1/3 ) z^{n} / n^{\alpha }\) is universally starlike for every \(\alpha \ge 1\) in the slit domain \(\mathbb {C}\setminus [1,\infty )\). This seems to be the first result putting the Ramanujan sequence into the context of analytic univalent functions and is a step towards a previous stronger conjecture, proposed by Ruscheweyh et al. (Israel J Math 171:285–304, 2009), namely that the function \((\theta _{1}- 1/3 )^{-1}\sum _{n=1}^{\infty } (\theta _{n}- 1/3 ) z^{n} \) is universally convex.     

A new proof of the Ramanujan congruences for the partition function

Let p(n) denote the number of partitions of n. Recall Ramanujan’s three congruences for the partition function,