Let $A$ be a finite set and $$B=\{ n \geq 1 : a\mid n\textrm{ for some }a\in A\}.$$ Is it true that, for every $m>n\geq \max(A)$, $$\frac{\lvert B\cap [1,m]\rvert }{m}< 2\frac{\lvert B\cap [1,n]\rvert}{n}?$$

No current result

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

1True ↔2  ∀ (A : Finset ℕ),3    A.Nonempty →4      0 ∉ A →5        1 ∉ A →6          ∀ (n m : ℕ),7            m > n →8              A.max ≤ ↑n →9                ↑{x ∈ Finset.Icc 1 m | x ∈ {n | n ≥ 1 ∧ ∃ a ∈ A, a ∣ n}}.card / ↑m <10                  2 * ↑{x ∈ Finset.Icc 1 n | x ∈ {n | n ≥ 1 ∧ ∃ a ∈ A, a ∣ n}}.card / ↑n

Reported activity

Reported by these sources. Not reviewed here.

• AI building on literature

  Erdős AI contributions wiki · 27 Nov, 2025

  Machine

  Aristotle

  Open the source record

• AI collaborating with humans

  Erdős AI contributions wiki · 20 Mar, 2026

  Machine

  Aristotle, GPT-5.4

  People

  Przemek Chojecki

  Open the source record