Moser's circle problem asks how many regions a circle can be divided into by choosing n {\displaystyle n} points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with n {\displaystyle n} points is given by r G = ( n 4 ) + ( n 2 ) + 1 {\displaystyle r_{G}={n \choose 4}+{n \choose 2}+1} , resulting in the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ...
Moser's circle problem asks how many regions a circle can be divided into by choosing n {\displaystyle n} points along the circumference of the circle and joining each pair of points by a straight line. The greatest possible number of regions with n {\displaystyle n} points is given by r G = ( n 4 ) + ( n 2 ) + 1 {\displaystyle r_{G}={n \choose 4}+{n \choose 2}+1} , resulting in the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ...
Source: Wikipedia "Moser's circle problem" · CC BY-SA 4.0
Share this article: X · Bluesky