Erdős Problem #367 — open problem in number theory

Erdős Problem #367

Let B_2(n) be the 2-full part of n (that is, B_2(n)=n/n' where n' is the product of all primes that divide n exactly once). Is it true that, for every fixed k ≥ 1, Π_n ≤ m < n+k B_2(m) ≪ n^2+o(1)?

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Start working on it Submit a claim Follow

Cite

@misc{cairn-erdos-367,
  title        = {Erdős Problem #367},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/erdos-367}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-09-28}
}

Also: CITATION.cff · Atom feed of results

Claims

Verified

Disputed

Refuted

On the literature board

The problem

The question

Let $B_{2} (n)$ be the $2$ -full part of $n$ (that is, $B_{2} (n) = n / n^{'}$ where $n^{'}$ is the product of all primes that divide $n$ exactly once). Is it true that, for every fixed $k \geq 1$ , $\prod_{n \leq m < n + k} B_{2} (m) ≪ n^{2 + o (1)}$ ?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.ErdosProblems.«367». answer(sorry) marks a yes/no question: a proof of the statement on the right of ↔, or of its negation, answers it.

theorem erdos_367.parts.i : answer(sorry) ↔ ∀ k : ℕ, 1 ≤ k →
    ∃ e : ℕ → ℝ,
      e =o[atTop] (1 : ℕ → ℝ) ∧
      ∀ᶠ n in atTop,
        ((∏ m ∈ .Ico n (n + k), B 2 m : ℕ) : ℝ) ≤ (n : ℝ) ^ (2 + e n)

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already — check erdosproblems.com/367. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

Variants

erdos_367.variants.higher_full_parts — It would also be interesting to find upper and lower bounds for the analogous product with B_r for r ≥ 3, where B_r(n) is the r-full part of n (that is, the…

References

erdosproblems.com/367
[ErGr80] P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, L'Enseignement Mathématique (1980).

Source and licence

Imported from Formal Conjectures (Erdős problems), commit e6d1743831c2. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.