The distinct-prime-divisor conjecture for Mersenne-type numbers
Statement
Let be a positive integer divisible by distinct primes, and suppose that
Distinct-prime-divisor conjecture. If , then is divisible by at least distinct primes.
The preceding lemma gives only the lower bound in the case ; the authors state this stronger bound because they have no examples attaining when .
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.