Skip to content

Erdős problem 296

Let N1N\geq 1 and let k(N)k(N) be maximal such that there are kk disjoint A1,,Ak{1,,N}A_1,\ldots,A_k\subseteq \{1,\ldots,N\} with nAi1n=1\sum_{n\in A_i}\frac{1}{n}=1 for all ii. Estimate k(N)k(N). Is it true that k(N)=o(logN)k(N)=o(\log 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:4546743cdf44df6216964359b7fab83d43a9affaa20e65870053ba9b597c3015
Metadata
sha256:ee8db320c5a505175ecaf960c5dab49586dc25c099bbaf17ebccae1bf6ecb596
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:883936c8b983206c7e6a0ac2b0b3524242898298e07b77b5e0fdcf5979e5b584
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page