Infosys
Company
Numerical Ability
Geometry
If an equilateral triangle is partitioned into n convex polygons, determine the maximum number of edges present in the resulting figure. The diagram below shows a partitioning into 3 polygons with 8 edges (which is not necessarily the maximum) and 6 vertices.
You may find a result of Euler applicable to this problem. The result states that if a polygon is partitioned into n polygons, then v-e+n=1 where v is the number of vertices and e is the number of edges in the resulting figure.
Read Solution (Total 0)
Infosys Other Question