Skip to content

Erdős problem 320

Start work

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).

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:111f6676588efe4119c8d315942e73e8085c3dc17242832d3cb4b2e2067c36f6
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON