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

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

FormalConjectures/ErdosProblems/358.leanErdos358.f_id1 lineExact file

1Erdos358.f id = fun n => {d ∈ n.divisors | Odd d}.card

TextbookStatement only, no proof