Erdős Problem #675
Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
The question in plain language
A subset of the positive integers has the translation property if every finite initial block of its membership pattern reappears somewhere farther along the number line. The new occurrence must reproduce both the integers that belong to the set and the integers that do not.
Precisely, Erdős Problem #675 defines the property by
The shift \(t_n\) is allowed to change with \(n\). There need not be a single period valid for all positive integers. The problem lists several arithmetic examples and asks which have this property, along with a quantitative question about how far one must shift.
A small example
Take \(A\) to be the squarefree positive integers, those not divisible by a square \(p^2\) of a prime. In the first five positions, membership is
because \(1,2,3,5\) are squarefree but \(4\) is not. The same pattern occurs at positions \(13,14,15,16,17\): only \(16\) is nonsquarefree. Thus \(t_5=12\) is a valid shift; exact enumeration of smaller positive shifts finds none, so it is the least shift for this five-term prefix.
Likewise, an exact finite enumeration gives least squarefree prefix shift \(t_8=28\). These calculations illustrate the definition, but say nothing about how \(t_n\) behaves as \(n\to\infty\).
For contrast, even numbers have the translation property with the same shift \(t_n=2\) for every \(n\). So the existence of repeating finite patterns alone does not imply that the necessary shifts grow rapidly.
What is known
The maintained catalogue distinguishes three questions.
Sums of two squares. Let \(A\) be the positive integers representable as \(a^2+b^2\) for integers \(a,b\). Does every finite membership prefix repeat exactly, after some positive shift? The maintained source lists this as OPEN. For the five-term prefix the least shift is \(48\), and for the eight-term prefix a finite search finds \(96\); neither computation establishes the property for all \(n\).
A partition of primes. Split all primes into two sets \(P\) and \(Q\), each containing at least a positive proportion of the order \(x/\log x\) many primes up to \(x\) for all sufficiently large \(x\). Consider the positive integers whose prime divisors all belong to \(P\). Must that set have the translation property? This is a separate OPEN problem. The hypothesis on both parts of the prime partition matters.
Squarefree numbers. The maintained source states that elementary sieve theory implies qualitative translation for squarefree numbers. It asks how rapidly the least valid shift \(t_n\) must grow and, in particular, whether there exists some constant \(c>0\) such that
for every sufficiently large \(n\). This is much stronger than just knowing that some shift exists for each \(n\).
A wider source-attributed Brun-sieve result concerns sets obtained by excluding integers divisible by members of a family \(B\) of pairwise coprime moduli under a reciprocal-sum hypothesis. The catalogue rendering contains a potentially confusing self-reference in the notation defining the exclusion set; the intended object should be written plainly as
The exact sieve theorem and hypotheses still require examination in their primary form before the generalization is relied upon as a proved input.
GCL's current state
The authenticated original #1946 source return records the three distinct problems, finite minimal-shift fixtures and the source qualification for the sieve claim. The disposition is BOUNDED_TASK_DESIGNED, not a solution of the open cases. The original historical Erdős [Er79] paper and the precise sieve proof were not independently inspected.
This is an unaccepted editorial draft, not a proof that sums of two squares or the prime-restricted integers possess the translation property.
What remains
A bounded mathematical successor should make the squarefree case fully explicit. For positions that must remain nonsquarefree, one can enforce divisibility by carefully chosen squared prime moduli using the Chinese remainder theorem. For positions that must remain squarefree, a sieve argument is needed to show that all required positive positions avoid square factors simultaneously. The CRT alone does not guarantee this.
Record a rigorous bound for the least shift whenever it follows from the construction, and keep any upper bound separate from the proposed much larger lower bound. Exact finite searches for \(n=5\) or \(8\) cannot prove the growth conjecture.
Confirm the original [Er79] text and the accurate Brun-sieve generalization, then complete independent critical review, protected publication, public mathematical-rendering inspection and exact-hash V2 admission.
Sources and claim boundaries
-
Maintained Erdős Problem #675, open questions, squarefree qualitative prior result and sieve attribution.
-
GCL authenticated source return #675, finite exact search fixtures and historical-source limitations.
-
Erdős [Er79]: original primary passage not independently inspected.
-
Classical CRT and sieve theory: conceptual tools, not a newly verified proof of all claimed translation results.
Boundary: finite exact pattern matches and careful qualitative/quantitative separation; no novel translation-property theorem, source-locked sieve proof, Lean certificate, protected merge, deployed MathJax readback or editorial admission.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #1946 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.