Abstract

We prove a number of results regarding odd values of the Ramanujan ττ-function. For example, we prove the existence of an effectively computable positive constant κκ such that if τ(n)τ(n) is odd and n≥25n \ge 25 then either P(τ(n))  >  κ⋅log⁡log⁡log⁡nlog⁡log⁡log⁡log⁡n P(τ(n)) \; > \; κ\cdot \frac{\log\log\log{n}}{\log\log\log\log{n}} or there exists a prime p∣np \mid n with τ(p)=0τ(p)=0. Here P(m)P(m) denotes the largest prime factor of mm. We also solve the equation τ(n)=±3b15b27b311b4τ(n)=\pm 3^{b_1} 5^{b_2} 7^{b_3} 11^{b_4} and the equations τ(n)=±qbτ(n)=\pm q^b where 3≤q<1003\le q < 100 is prime and the exponents are arbitrary nonnegative integers. We make use of a variety of methods, including the Primitive Divisor Theorem of Bilu, Hanrot and Voutier, bounds for solutions to Thue--Mahler equations due to Bugeaud and Győry, and the modular approach via Galois representations of Frey-Hellegouarch elliptic curves.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.