Maximum regions from three lines
Maximum regions from three lines
The video could not load. Check your connection and try again, or download it directly.
Download video
Open Chinese transcript
- 这是纸上的二维圆形模型,不移动圆形,也不是三维切蛋糕。三条直线要满足指定相交条件。
- 圆内还没有线时只有1个区域。第一条直线穿过圆,新增1区,总共2区。
- 第二条与第一条在圆内相交,被分成2段,每段切开一个旧区,新增2区,共4区。
- 第三条分别与前两条相交,两个交点不同,所以圆内部分分成3段。
- 第三条新增3区,得到4加3等于7区。画面中三个交点都在圆内且不共点。
- 所以最多7区。若交点重合或在圆外,新增区域会减少,不能套用这个数。
Sources for this explanation
Logical thinking
Add the number of segments made by each new line under the stated intersection conditions.
Worked example
In a fixed 2D circle, draw 3 lines whose pairwise intersections are distinct and inside, with no triple concurrency. Maximum regions?
The lines add 1, then 2, then 3 new regions, for 1+1+2+3=7 under the stated intersection conditions.
Try one question
Three lines give 7; the fourth has 4 segments and adds 4, giving 11.