Skip to content

Erdős problem 1189

For irreducible covering sets of size kk, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.

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:e8b9b6528310b38d6f3b7fc8006297a5b45541f370a12644bd36db9cb69dcfe4
Metadata
sha256:004950628941bf8670ce92673574f9cda9dc1c86f90cec9e50604ac3f1ee6741
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:8286a4abcb603265f4b3cfa37fc5577659c4c2ce6664a71afa33fd5208f8b788
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207
Upstream sourceInspect recordsSource JSON

Search problems.science

Find a Problem, Result, source, or page