ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each positive integer kk, let Pk\mathcal{P}_k be the set of natural numbers with exactly kk prime factors counted with multiplicity, and let F\mathcal{F} denote the Erdős sum in the integers.

Banks–Martin conjecture. The sequence of sums is strictly decreasing:

F(P1)>F(P2)>⋯>F(Pk)>F(Pk+1)>⋯ .\mathcal{F}(\mathcal{P}_1)>\mathcal{F}(\mathcal{P}_2)>\cdots>\mathcal{F}(\mathcal{P}_k)>\mathcal{F}(\mathcal{P}_{k+1})>\cdots.

The conjecture is a refinement of the primitive set problem, comparing sets with a fixed number of prime factors. It was recently disproved by Lichtman.

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.