Dividing a circle into areas
id:
dividing-a-circle-into-areas-205-15023444
title:
Dividing a circle into areas
text:
In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem, has a solution by an inductive method. The greatest possible number of regions, rG = + + 1, giving the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256,... (OEIS: A000127). Though the first five terms match the geometric progression 2n − 1, it deviates at n = 6, showing the
brand slug:
wiki
category slug:
encyclopedia
description:
Problem in geometry
original url:
https://en.wikipedia.org/wiki/Dividing_a_circle_into_areas
date created:
2003-12-13T08:02:54Z
date modified:
2024-09-10T14:59:15Z
main entity:
{"identifier":"Q5284051","url":"https://www.wikidata.org/entity/Q5284051"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/46/Circle_division_by_chords.svg","width":512,"height":768}
fields total:
13
integrity:
16