A bound on the number of distinct prime factors of Mersenne numbers
Statement
Let be prime and set . Write for the number of distinct prime factors of . The distinct-factor bound conjecture. There exists such that, for every prime ,
This is motivated by sieve heuristics for integers whose prime factors satisfy congruence restrictions; it would imply that only finitely many primes violate the displayed bound.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.