The prime-increment conjecture for the LCM recurrence
Statement
Let be defined by
and
Define the multiplicative increments
Prime-increment conjecture. For every , we have , where denotes the set of prime numbers.
Numerical evidence supports the claim, but a proof for every remains open. The paper proves unconditionally that the claim holds for a set of integers of asymptotic density , using a Companion--Sieve framework, the Bombieri--Vinogradov theorem, and elementary sieve bounds.
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.