Prime-divisor conjecture for primitive-sequence sums
Statement
For a positive integer , let be the number of prime factors counted with multiplicity. For a sequence , let
Let be a primitive sequence of positive integers, with . Prime-divisor conjecture.
The paper proposes this as one of two conjectures equivalent to the Erdős conjecture, so proving it would resolve the original extremal problem. Its status is open in the supplied material.
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.