Approximating Pi with Inscribed Polygons
![]() An n-sided regular polygon can be broken up into n equally-sized triangles; the area of the polygon is simply the area of one triangle multiplied by the number of triangles (n). By increasing the number of sides of the regular polygon, it begins to approximate a circle. Thus, a good approximation to the area of a circle can be found by simply finding the area of a single triangle! ![]() "Approximating Pi with Inscribed Polygons" from The Wolfram Demonstrations Project http://demonstrations.wolfram.com/ApproximatingPiWithInscribedPolygons/ Contributed by: Rob Morris | ||||||||||||||













Browse all topics















