Math-6200 · mathematics · Mathematics

Math-6200

Erdős Problem #1146

Status Open · erdosproblems.comLLM status Open unverified

Erdős problems openaigpt 6 astra ultra 5% cataloguedOpenOpen

Statement

For $E\subseteq\mathbb N$, put \[ d_s(E)=\inf_{N\geq1}\frac{|E\cap\{1,\ldots,N\}|}{N}. \] Let $A=\{2^m3^n:m,n\geq0\}$. Is $A$ an essential component: for every $B\subseteq\mathbb N$ with $0<d_s(B)<1$, does \[ d_s\left((A\cup\{0\})+(B\cup\{0\})\right)>d_s(B) \] hold?

Restatement from Math-6200-A1 r1, with the source manuscript’s qualifications.

Original problem on erdosproblems.com

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Math-6200-A1 · No claim recorded · LLM-generated · gpt 6 astra ultra ·

GPT 6 Astra Ultra attempt on Math-6200

Erdős Problem 1146 --- GPT 6 Astra Ultra partial attempt

FORMAL RESTATEMENT

For $E\subseteq\mathbb N$, put \[ d_s(E)=\inf_{N\geq1}\frac{|E\cap\{1,\ldots,N\}|}{N}. \] Let $A=\{2^m3^n:m,n\geq0\}$. Is $A$ an essential component: for every $B\subseteq\mathbb N$ with $0<d_s(B)<1$, does \[ d_s\left((A\cup\{0\})+(B\cup\{0\})\right)>d_s(B) \] hold?

CONTEXT AND SCOPE

This replaces the earlier statement-only record with an elementary mathematical attempt. The arguments below establish only their stated partial results; no novelty or full solution is claimed.

The adjoined zero terms are the sumset convention explicitly used by the formalization for Schnirelmann density.

ATTACK PLAN AND WORK

Since $1\in A$, the target sumset contains $B\cup(B+1)$, as well as zero. This proves the essential-component inequality for a concrete infinite family of test sets. For $q\ge2$ let $B_q$ be the positive integers not divisible by $q$. Then \[d_s(B_q)=\inf_{N\ge1}\left(1-\frac{\lfloor N/q\rfloor}{N}\right)=1-1/q.\] Every positive integer outside $B_q$ is a positive multiple of $q$; its predecessor lies in $B_q$. Therefore $B_q\cup(B_q+1)=\mathbb N_{\ge1}$ and \[d_s((A\cup\{0\})+(B_q\cup\{0\}))=1>d_s(B_q).\tag{1}\] More generally $1$ holds for any $B$ of density strictly below one whose complement contains no two consecutive positive integers, provided $1\in B$. Positive Schnirelmann density itself forces $1\in B$ by considering $N=1$.

This also explains a limitation of the elementary shift argument. For a general $B$, long consecutive missing blocks can remain after adding the single element 1. The full question requires the extra shifts $2^m3^n$, with a strict improvement uniform over all initial intervals in the infimum, not just an improvement in asymptotic density along selected intervals.

VERIFICATION AND REMAINING GAP

Establish a strict increase for every positive-Schnirelmann-density set. The proved family has particularly simple missing residues; no reduction of arbitrary $B$ to that family is supplied.

SOURCES

https://www.erdosproblems.com/1146

https://raw.githubusercontent.com/google-deepmind/formal-conjectures/main/FormalConjectures/ErdosProblems/1146.lean

FINAL

UNRESOLVED. The full source problem remains outside the scope of the proved partial results.

COMPLETION ESTIMATE

$5\%$. This is a conservative subjective estimate toward the whole problem, not a probability that the argument is correct or a claim that a fixed fraction of the problem has been solved.

Go to contribution →