Skip to content

Erdős problem 164

A set A⊂NA\subset \mathbb{N} is primitive if no member of AA divides another. Is the sum ∑n∈A1nlog⁡n\sum_{n\in A}\frac{1}{n\log n} maximised over all primitive sets when AA is the set of primes?

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:51a38881d53c8a575a62976c1901d83a22327deaf274969353a7ae93c2ba087b
Metadata
sha256:ac67d6c7bd409f87e82d1aac0f65a803f97314ca601fa955b1deabab7eea4331
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:17ece88f904954f7422a3d60ac6d18ae9545dab91b1436f16116e0da74109a7b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page