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 statement2 of 6

Let $A=\{a_1 < \cdots\}$ be an infinite sequence of integers. Let $f(n)$ count the number of solutions to $n=\sum_{u\leq i\leq v}a_i.$ Is there an $A$ such that $f(n)\geq 2$ for all large $n$ ?

This also follows from Tao's construction with $f(n) \gg \log n$ [Ta26].

FormalConjectures/ErdosProblems/358.leanErdos358.erdos_358.parts.ii1 lineExact file

1True ↔ ∃ A, StrictMono A ∧ ∀ᶠ (n : ℕ) in Filter.atTop, 2 ≤ Erdos358.f A n

SolvedStatement only, no proof

Sources

Search problems.science