Skip to content

Erdős Problem #844

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: proved (not automatically the live result).
Subject areas: number theory, intersecting family.

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

The product of two squarefree integers contains a squared prime precisely when they share a prime factor. This changes a question about nonsquarefree pairwise products into an extremal problem about intersecting prime-support families.

Among A subset [1,N] satisfying ab NOT squarefree for EVERY a,b in A, including a=b, is maximal size achieved by all even numbers plus all ODD non-squarefree numbers? YES. Since any non-squarefree number can be added without harming the property, the issue reduces to an intersecting family of squarefree integers sharing a prime factor in every pair.

A small example

For N=10, squarefree values are 1,2,3,5,6,7,10; maximal pairwise-sharing-prime squarefree subfamily has size three, e.g. {2,6,10}. The full maximizing candidate adds all nonsquarefree numbers in [1,10], {4,8,9}; A={2,4,6,8,9,10} has cardinality six. Brute force confirms no larger subset at this N.

A finite instance tests the definition, not a claim quantified over every large graph, infinite set or arbitrary coloring.

What is known

Maintained https://www.erdosproblems.com/latex/844 read 2026-10-14: Weisenberg positive proof invokes Chvátal [Ch74] hereditary intersecting family theorem (#701). Alexeev–Mixon–Sawin [AMS25], The independence and clique cover numbers of the squarefree graph, arXiv:2507.01928 (2025), independently prove. Full paper proof and exact hereditary-family mapping require critical source inspection.

If a and b are both squarefree, their product ab has a square factor if and only if gcd(a,b)>1. Any nonsquarefree integer can be added to A without breaking the condition; hence only the squarefree subfamily requires optimization. Chvátal's intersecting-family theorem gives the even squarefree family as a maximizer. Including ALL nonsquarefree numbers then recovers the even-plus-odd-nonsquarefree candidate. Repeated indices a=b are included, so 1 cannot appear.

GCL's current state

The authenticated original RESULT/1 source return records SOURCE_LOCK_READY and preserves its issue-bound mathematical source observations. This explanatory article is REVIEWED under the exact-hash EC-BULK-005-R6 editorial transaction, subject to the protected merge of PR #2676. Its original source-audit status is retained. Editorial acceptance and public MathJax validation do not certify any original research theorem, external Lean file, or complete historical proof.

Unclosed mathematical proof/source qualifications: CHVATAL1974_AND_ALEXEEV_MIXON_SAWIN2025_FULL_PRIMARY_PROOF_PENDING.

What remains

Build squarefree predicate and exhaustive subsets for N=6,8,10; check all products (including equal pair) and candidate maximum. Source-lock Chvátal 1974 hereditary property application and AMS25 proof.

For mathematical proof certification, the complete primary argument and any external formalization must undergo separate independent replay. The bounded finite calculation is recorded in the governed R6 fixture; editorial approval does not discharge the outstanding research obligations.

Sources and claim boundaries

  • Erdős problem #844 and maintained LaTeX/bibliography, read 14 October 2026.
  • Authenticated source-audit return, including original historical bibliography and source proof limitations.
  • Pinned teorth/erdosproblems revision 536408716724a2402bdfa7c1d764bf83d64a8c89, data/problems.yaml. External proofs not independently GCL certified.
  • Editorial decision: exact-hash reviewed explanatory article, protected R6 transaction. Mathematical theorem proof / external Lean certification: NOT CLAIMED. The original SOURCE_LOCK_READY return, primary-source attribution, and proof-review holds remain.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2115 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • 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.

Back to catalogue · Compendium introduction