ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer nn, let Ω(n)\Omega(n) be the number of prime factors counted with multiplicity. For a sequence A\mathscr{A}, let

P(A)={p: p is prime and p∣a for some a∈A}.P(\mathscr{A})=\{p:\ p\text{ is prime and }p\mid a\text{ for some }a\in\mathscr{A}\}.

Let A\mathscr{A} be a primitive sequence of positive integers, with A≠{1}\mathscr{A}\neq\{1\}. Prime-divisor conjecture.

∑a∈A1alog⁡a≤∑p∈P(A)1plog⁡p.\sum_{a\in\mathscr{A}}\frac{1}{a\log a}\leq\sum_{p\in P(\mathscr{A})}\frac{1}{p\log p}.

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 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.