math.NT — Number Theory
The invariant of Gallardo and Rahavandrainy at Mersenne prime exponents, and the case
A Mersenne prime polynomial is an irreducible polynomial over of the form with . Gallardo and Rahavandrainy conjectured that, apart from two exceptions, always has an irreducible factor which is not a Mersenne prime. For a prime they proved it for every outside an exceptional set , defined through an integer and an odd integer read off the leading coefficients of , and later they proved it for every Mersenne prime number ; their method does not reach . We compute exactly when is a Mersenne prime number: if , and if . Consequently consists of the Mersenne primes of degree or , is empty, and , are described by and respectively. For this reduces the conjecture to the Mersenne primes with . A direct computation shows that has a non-Mersenne irreducible factor for every Mersenne prime of degree at most , and that in that range. Hence the conjecture holds whenever divides and , and a counterexample with would need . A script attached as an ancillary file checks these computations, and reproduces the table of exceptional sets of Gallardo and Rahavandrainy.