The method of exhaustion (methodus exhaustionibus, or méthode des anciens) is a method of finding the area of a shape by inscribing inside it a sequence of polygons whose areas converge to the area of the containing shape. If the sequence is correctly constructed, the difference in area between the n-th polygon and the containing shape will become arbitrarily small as n becomes large. As this difference becomes arbitrarily small, the possible values for the area of the shape are systematically "exhausted" by the lower bound areas successively established by the sequence members.

Property Value
dbo:abstract
• The method of exhaustion (methodus exhaustionibus, or méthode des anciens) is a method of finding the area of a shape by inscribing inside it a sequence of polygons whose areas converge to the area of the containing shape. If the sequence is correctly constructed, the difference in area between the n-th polygon and the containing shape will become arbitrarily small as n becomes large. As this difference becomes arbitrarily small, the possible values for the area of the shape are systematically "exhausted" by the lower bound areas successively established by the sequence members. The method of exhaustion typically required a form of proof by contradiction, known as reductio ad absurdum. This amounts to finding an area of a region by first comparing it to the area of a second region (which can be “exhausted” so that its area becomes arbitrarily close to the true area). The proof involves assuming that the true area is greater than the second area, and then proving that assertion false, and then assuming that it is less than the second area, and proving that assertion false, too. (en)
dbo:thumbnail
dbo:wikiPageID
• 1721284 (xsd:integer)
dbo:wikiPageRevisionID
• 702816660 (xsd:integer)
dct:subject
http://purl.org/linguistics/gold/hypernym
rdf:type
rdfs:comment
• The method of exhaustion (methodus exhaustionibus, or méthode des anciens) is a method of finding the area of a shape by inscribing inside it a sequence of polygons whose areas converge to the area of the containing shape. If the sequence is correctly constructed, the difference in area between the n-th polygon and the containing shape will become arbitrarily small as n becomes large. As this difference becomes arbitrarily small, the possible values for the area of the shape are systematically "exhausted" by the lower bound areas successively established by the sequence members. (en)
rdfs:label
• Method of exhaustion (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is foaf:primaryTopic of