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

When $A =\{a_1 < \cdots\}$ corresponds to the set of primes, it is conjectured that the $\limsup$ of the number of representations $n=\sum_{u\leq i\leq v}a_i$ is infinite.

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

1Filter.limsup (fun n => ↑(Erdos358.f (Nat.nth Nat.Prime) n)) Filter.atTop = ⊤

OpenStatement only, no proof

Sources

Search problems.science