Erdős problem 887 · problems.science

Is there an absolute constant $K$ such that, for every $C > 0$ , if $n$ is sufficiently large then $n$ has at most $K$ divisors in $(n^{\frac{1}{2}}, n^{\frac{1}{2}} + C n^{\frac{1}{4}})$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

887.lean

Retained formal statement1 of 4

Is there an absolute constant $K$ such that, for every $C > 0$ , if $n$ is sufficiently large then $n$ has at most $K$ divisors in $(n^{\frac{1}{2}}, n^{\frac{1}{2}} + C n^{\frac{1}{4}})$ .

FormalConjectures/ErdosProblems/887.leanErdos887.erdos_887.parts.i1 lineExact file

1∀ C > 0, ∀ᶠ (n : ℕ) in Filter.atTop, {d ∈ Finset.Ioo ⌊√↑n⌋₊ ⌈√↑n + C * ↑n ^ (1 / 4)⌉₊ | d ∣ n}.card ≤ sorry

OpenStatement only, no proof

Sources

Search problems.science