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 = (n4) + (n2) + 1, giving the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ... (OEIS: ). Though the first five terms match the geometric progression 2n − 1, it diverges at n = 6, showing the risk of generalising from only a few observations.
Attributes | Values |
---|
rdf:type
| |
rdfs:label
| - Dividing a circle into areas (en)
|
rdfs:comment
| - 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 = (n4) + (n2) + 1, giving the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ... (OEIS: ). Though the first five terms match the geometric progression 2n − 1, it diverges at n = 6, showing the risk of generalising from only a few observations. (en)
|
foaf:depiction
| |
dcterms:subject
| |
Wikipage page ID
| |
Wikipage revision ID
| |
Link from a Wikipage to another Wikipage
| |
Link from a Wikipage to an external page
| |
sameAs
| |
dbp:wikiPageUsesTemplate
| |
thumbnail
| |
b
| |
date
| |
p
| |
title
| - Circle Division by Chords (en)
|
url
| |
urlname
| - CircleDivisionbyChords (en)
|
has abstract
| - 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 = (n4) + (n2) + 1, giving the sequence 1, 2, 4, 8, 16, 31, 57, 99, 163, 256, ... (OEIS: ). Though the first five terms match the geometric progression 2n − 1, it diverges at n = 6, showing the risk of generalising from only a few observations. (en)
|
prov:wasDerivedFrom
| |
page length (characters) of wiki page
| |
foaf:isPrimaryTopicOf
| |
is Link from a Wikipage to another Wikipage
of | |
is Wikipage redirect
of | |
is foaf:primaryTopic
of | |