dividing a circle into regions with straight line arcs
with an increasing number of nodes on the circumference
[sometimes known as Moser's circle problem]
successively add points on the circumference of a circle
see how many lines (the maximum number) can be drawn joining these points
and count how many regions the interior of the circle is divided into
try to avoid losing a small region
by not having three lines coincide in the middle
1 region , 2 regions , 4 regions , ...
a clear pattern
does it continue?
not the same problem
cutting a pancake/pizza into the most number of pieces with straight cuts:
No comments:
Post a Comment
Note: only a member of this blog may post a comment.