Arithmetic properties of the Ramanujan function

Abstract

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

$$P(\tau )(p)\tau (p^2 )\tau (p^3 )) > (1 + o(1))\frac{{\log \log p\log \log \log p}}{{\log \log \log \log p}}$$

for every primep with τ(ρ) ≠ 0.