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.

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:847062a0c2df9e146bc05234bdb9872d4292974391062b03a095f3088df70c60
Metadata
sha256:f44dd7577dfd5423e598fe10da1101fa6d98be79ada43b4041b79dfc9bae3601
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:e5b56ed022850c69f910598492691570e07ba474fd43c333d8a9fd5b987dba6b
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb