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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.