Skip to content

Erdős problem 320

Let S(N)S(N) count the distinct values of ∑n∈A1/n\sum_{n\in A} 1/n over A⊆{1,…,N}A\subseteq\{1,\dots,N\}. Estimate S(N)S(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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:359f0bc303a71f1bd040d25ec56fff09f9fe4e5202c3b2a6715e560c1378b7c6
Metadata
sha256:ab84b8c8082d29a2f26649d14be58bf4856852e29d79a1c6404367730ea3a109
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:111f6676588efe4119c8d315942e73e8085c3dc17242832d3cb4b2e2067c36f6
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page