Skip to content

Erdős problem 650

Start work

Let f(m)f(m) be such that if A⊆{1,…,N}A\subseteq \{1,\ldots,N\} has ∣A∣=m\lvert A\rvert=m then every interval in [1,∞)[1,\infty) of length 2N2N contains ≥f(m)\geq f(m) many distinct integers b1,…,brb_1,\ldots,b_r where each bib_i is divisible by some ai∈Aa_i\in A, where a1,…,ara_1,\ldots,a_r are distinct.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/650.lean

Formal Conjectures

FormalConjectures/ErdosProblems/650.leanErdos650.erdos_650.parts.i1 lineExact file
∀ (m : ℕ), Erdos650.f m = min m ⌈2 * √↑m⌉₊
SolvedStatement only, no proof

Proof manifests naming this Problem

  • Jayyhk Erdős Leanjayyhk:erdos:650
  • PLBY Lean proofsErdosProblems.Erdos650

Reported activity

Reported by these sources. Not reviewed here.

Continue

Start a contributionBrowse the source filesOpen the collection entry