Banks–Martin conjecture for Erdős sums

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.

Sources & referencesView supporting material

Primary source

Andrés Gómez-Colunga, Charlotte Kavaler, Nathan McNew and Mirilla Zhu, “On the Erdős primitive set conjecture in function fields”, arXiv:2007.02301 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.