Erdős problem 358 · problems.science

When $A_n = n$ , the function $f$ defined above counts the number of odd divisors of $n$ .

Sources

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

6 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

358.lean

Retained formal statement3 of 6

It is conjectured that if $A =\{a_1 < \cdots\}$ and $g$ counts the number of representations $n=\sum_{u\leq i\leq v}a_i$ such that the sum has at least two terms, then for all $n$ we have $1 \leq g(n)$ for sufficiently large $n$ .

FormalConjectures/ErdosProblems/358.leanErdos358.erdos_358.variants.one_le1 lineExact file

1∃ A, StrictMono A ∧ ∀ᶠ (n : ℕ) in Filter.atTop, 1 ≤ Erdos358.g A n

OpenStatement only, no proof

Sources

Search problems.science