Erdős problem 358 · problems.science

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

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:2b705eb53c46c85b2c20867bfdf7fefdf4dc823d07a6361bfa3c2f6de42f8753
Metadata: sha256:0465e90ac080ba783377fb5ea348b68ad8d37cdc929570ed251463e7ab0789da
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:6fd3d7ae5dd66164f8d837479a2846424ae949a0e3f1aab9da3ed796141b4048

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207