From bc9ade6a7d7db8c9f07c0449010966e753befedd Mon Sep 17 00:00:00 2001 From: Shashank Rai Date: Wed, 1 Dec 2021 09:46:03 +0530 Subject: [PATCH] bd (#44298) --- .../project-euler/problem-199-iterative-circle-packing.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md index 1a935ed55a..d2fc26383f 100644 --- a/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md +++ b/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-199-iterative-circle-packing.md @@ -10,7 +10,7 @@ dashedName: problem-199-iterative-circle-packing Three circles of equal radius are placed inside a larger circle such that each pair of circles is tangent to one another and the inner circles do not overlap. There are four uncovered "gaps" which are to be filled iteratively with more tangent circles. -a diagram of non-overlapping concentric circles +a diagram of non-overlapping circles At each iteration, a maximally sized circle is placed in each gap, which creates more gaps for the next iteration. After 3 iterations (pictured), there are 108 gaps and the fraction of the area which is not covered by circles is 0.06790342, rounded to eight decimal places.