ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P=(pn)n≥1\mathscr{P}={(p_n)}_{n\geq 1} be the sequence of primes, and let Card⁡A\operatorname{Card}\mathscr{A} denote the cardinality of a sequence A\mathscr{A}. Let A\mathscr{A} be a primitive sequence of positive integers, meaning that no term divides any other, with A≠{1}\mathscr{A}\neq\{1\}. Cardinality-bounded prime-sum conjecture.

∑a∈A1alog⁡a≤∑n=1Card⁡A1pnlog⁡pn.\sum_{a\in\mathscr{A}}\frac{1}{a\log a}\leq\sum_{n=1}^{\operatorname{Card}\mathscr{A}}\frac{1}{p_n\log p_n}.

The paper presents this as another conjecture equivalent to the Erdős conjecture. It remains 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.