Section 2.3: Modeling
A diagonal is a segment that connects two non-consecutive vertices in a polygon. The number of diagonals in a polygon that can be drawn from any vertex in a polygon is three less than the number of sides. To find the total number of diagonals in a polygon, multiply the number of diagonals per vertex (n - 3) by the number of vertices, n, and divide by 2 (otherwise each diagonal is counted twice).
Notes and Powerpoints
lesson_2.3.pdf | |
File Size: | 85 kb |
File Type: |