Skip to content

Erdős problem 1121

If C1,,CnC_1,\ldots,C_n are circles in R2\mathbb{R}^2 with radii r1,,rnr_1,\ldots,r_n such that no line disjoint from all the circles divides them into two non-empty sets then the circles can be covered by a circle of radius r=rir=\sum r_i.

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:847062a0c2df9e146bc05234bdb9872d4292974391062b03a095f3088df70c60
Metadata
sha256:f44dd7577dfd5423e598fe10da1101fa6d98be79ada43b4041b79dfc9bae3601
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:e5b56ed022850c69f910598492691570e07ba474fd43c333d8a9fd5b987dba6b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page