Investigation 1: Exploring the Number of Diagonals in Polygons | 探究1：探索多边形的对角线条数

📚 Investigation 1: Exploring the Number of Diagonals in Polygons | 探究1：探索多边形的对角线条数

In this mathematical investigation, we explore the number of diagonals in convex polygons. Starting from simple shapes such as triangles and squares, we gather data, search for patterns, formulate a conjecture, and finally prove it using combinatorics. This investigation demonstrates how a seemingly simple geometric question can lead to elegant algebraic reasoning and offers room for personal engagement through visualisation and extension.

在本数学探究中，我们探索凸多边形的对角线条数。从三角形、正方形等简单图形入手，我们收集数据、寻找规律、提出猜想，并最终使用组合数学加以证明。本探究展示了看似简单的几何问题如何引出优雅的代数推理，同时通过可视化和拓展提供了个人参与的空间。

1. Introduction and Rationale | 引言与探究动机

I have always been fascinated by the hidden order in geometry. When I first drew a regular pentagon and connected its non-adjacent vertices, I noticed a star-like pattern emerging from the diagonals. This made me wonder: is there a formula that predicts how many diagonals any convex polygon has? The question felt accessible yet rich enough for deeper mathematical exploration. This investigation aims to discover, justify, and extend the formula for the number of diagonals in a convex n-sided polygon.

我一直对几何中隐藏的秩序着迷。当我第一次画出一个正五边形并连接它的不相邻顶点时，我注意到对角线构成了一种星形图案。这让我好奇：是否存在一个公式可以预测任意凸多边形有多少条对角线？这个问题看似简单，但足够丰富，可以进行更深入的数学探索。本探究旨在发现、证明并拓展凸 n 边形对角线条数的公式。

2. Defining Diagonals | 对角线的定义

A diagonal of a polygon is a line segment joining two non-adjacent vertices. In a triangle, there are no non-adjacent vertices, so it has zero diagonals. Adjacent vertices are connected by sides, not diagonals. This definition is standard and will be used throughout the investigation. We consider only simple convex polygons to avoid self-intersecting sides.

多边形的对角线是连接两个不相邻顶点的线段。在三角形中，没有不相邻的顶点，所以对角线条数为零。相邻顶点由边连接，不属于对角线。这一定义是标准定义，将在整个探究中使用。我们只考虑简单凸多边形，以避免边自交的情况。

3. Initial Exploration with Simple Polygons | 简单多边形的初步探索

one vertex and drew diagonals to the two non-adjacent vertices; repeating this for all five vertices initially gave 5×2 = 10 segments, but each diagonal was counted twice, so the actual number was 5. I verified this by drawing the complete figure.

首先，我画了几个凸多边形并手动数了对角线。对于三角形（3条边），显然有 0 条对角线。对于四边形（4条边），我画了一个正方形并连接唯一一对不相邻的顶点，得到 2 条对角线。对于五边形（5条边），我从一个顶点出发，向两个不相邻顶点画对角线；对五个顶点都这样做，初步得到 5×2 = 10 条线段，但每条对角线被计数了两次，因此实际数量是 5。我通过画出完整图形验证了这一点。

4. Organising Data | 数据整理

I extended the counting to hexagons (6 sides), heptagons (7 sides), and octagons (8 sides). The results were recorded in a table to help identify patterns.

我将计数扩展到六边形（6条边）、七边形（7条边）和八边形（8条边）。结果记录在表格中，以帮助识别规律。

Number of sides (n)	Number of diagonals (D)
3	0
4	2
5	5
6	9
7	14
8	20

I noticed that the differences between consecutive D values (2, 3, 4, 5, 6) increased by one each time. This suggested a quadratic relationship, typical for the sum of the first (n-3) integers.

我注意到相邻 D 值之间的差（2, 3, 4, 5, 6）每次增加 1。这提示存在二次关系，是前 (n-3) 个整数之和的典型特征。

5. Identifying Patterns | 识别模式

terms of n. The difference pattern pointed toward triangular numbers. Indeed, D(4) = T₁+1? 6×3/2=9; 7×4/2=14; 8×5/2=20. This matched perfectly. I thus conjectured that D = n(n-3)/2.

从表格中，我观察到 D(3)=0, D(4)=2, D(5)=5, D(6)=9, D(7)=14, D(8)=20。我尝试用 n 表达这些数字。差值模式指向三角形数。实际上，D(4) = T₁+1？让我们检验：第 k 个三角形数 Tₖ = k(k+1)/2。对于 n=4，若令 k = n-3 = 1，则 T₁ = 1，但 D=2。对于 n=5，k=2，T₂=3，但 D=5。因此 D = n(n-3)/2 给出：3×0/2=0; 4×1/2=2; 5×2/2=5; 6×3/2=9; 7×4/2=14; 8×5/2=20。完全匹配。于是我猜想 D = n(n-3)/2。

Conjecture: D(n) = n(n − 3)/2

6. Formulating a Conjecture | 提出猜想

er of sides. I decided to test it for a nonagon (n=9) before attempting a proof. According to the formula, D=9×6/2 = 27. Drawing a regular nonagon and systematically counting all diagonals confirmed exactly 27. This gave me confidence that the conjecture is correct.

该猜想指出，对于任意 n ≥ 3 条边的凸多边形，对角线条数由二次表达式 n(n-3)/2 给出。当 n=3 时，该公式得出 0，这很合理；对于 n>3，得出正整数。这意味着对角线条数随边数呈二次增长。在尝试证明之前，我决定用一个九边形（n=9）来检验公式。根据公式，D=9×6/2=27。画出一个正九边形并系统性地数出所有对角线，恰好得到 27 条。这让我确信猜想是正确的。

7. Proving the Conjecture Using Combinatorics | 用组合数学证明猜想

ls. If we multiply n by (n-3), we count each diagonal twice (once from each endpoint). Hence, the total number of distinct diagonals is n(n-3)/2. This argument is valid for all n ≥ 3. The proof relies only on the definition of a convex polygon and basic counting principles, making it rigorous yet accessible.

广告 / Sponsored

为证明该公式，我采用了组合论证。在任意凸 n 边形中，有 n 个顶点。每个顶点可以与其他 (n-1) 个顶点相连，但其中有 2 个是相邻顶点（多边形的边），因此不是对角线。所以从每个顶点出发，有 (n-3) 条可能的对角线。如果将 n 乘以 (n-3)，每条对角线被计数两次（分别从两个端点）。因此，不同对角线的总数为 n(n-3)/2。该论证对所有 n ≥ 3 成立。证明仅依赖于凸多边形的定义和基本的计数原理，因此既严谨又易于理解。

Additionally, I derived the formula using graph theory. The complete graph on n vertices K_n has n(n-1)/2 edges. A polygon is a cycle graph C_n with n edges. Removing the n sides from K_n onfirmed the same result and deepened my understanding of the link between combinatorics and geometry.

此外，我使用图论推导了该公式。n 个顶点上的完全图 K_n 有 n(n-1)/2 条边。多边形是一个具有 n 条边的环图 C_n。从 K_n 中减去 n 条边即得对角线：D = n(n-1)/2 − n = n(n-3)/2。这一替代证明证实了相同的结果，并加深了我对组合数学与几何之间联系的理解。

8. Verification with Further Examples | 用更多例子验证

aw, but the formula gives 100×97/2 = 4850 diagonals. The ability to handle large n illustrates the power of generalisation in mathematics.

我用十边形（n=10）和十二边形（n=12）检验了公式。对于 n=10：D = 10×7/2 = 35。通过绘制并采用系统的颜色编码方案计数，确认了 35 条对角线。对于 n=12：D = 12×9/2 = 54。验证结果一致。我还考虑了一个无法绘制的 100 边形，但公式给出 100×97/2 = 4850 条对角线。处理大 n 的能力展示了数学中推广的力量。

domain is n ≥ 3. This consistency check strengthened the validity of the algebraic model.

此外，我从概念上检验了退化情况。对于 n=2（二边形）或 n=1，在欧氏几何中多边形不存在，但公式给出负值或零，这强化了定义域 n ≥ 3 的条件。这种一致性检验增强了代数模型的有效性。

9. Extension: Diagonals in 3D Shapes | 拓展：3D图形中的对角线

r question for three-dimensional polyhedra. A polyhedron has vertices, edges, and faces. A 'diagonal' his matched the known property of a cube. The general formula for a convex polyhedron with v vertices, e edges, and f faces requires careful consideration of coplanar vertices. I explored the formula for prisms: an n-sided prism has 2n vertices, n² + n edges, and faces include n quadrilaterals and 2 n-gons. The total space diagonals equal the total vertex pairs minus edges minus all face diagonals. For a triangular prism (n=3): total pairs = 6C2 = 15; edges = 9; each triangular face has 0 diagonals, each rectangular face has 2 diagonals × 3 = 6; so space diagonals = 15 − 9 − 6 = 0. For a square prism (cube): 8C2 − 12 − 6 face diagonals = 28 − 12 − 6 = 10? agonals. This discrepancy arises because in a cube, the face diagonals are not independent— the formula works when correctly accounting for all face diagonals. This extension showed the complexity of 3D geometry and the need for careful definitions, echoing the importance of clarity observed in the polygon investigation.

这项探究自然地引导我提出对于三维多面体的类似问题。多面体有顶点、棱和面。多面体的“对角线”是连接两个不在同一面上的顶点的线段。对于一个立方体，有 8 个顶点，连接顶点的线段总数为 8C2 = 28。减去 12 条棱和 2×6 = 12 条面对角线（每个面有 2 条对角线），得到 28 − 12 − 12 = 4 条空间对角线。这与立方体的已知性质相符。对于有 v 个顶点、e 条棱和 f 个面的凸多面体的一般公式，需要仔细考虑共面顶点。我探索了棱柱的公式：n 棱柱有 2n 个顶点，n² + n 条棱，面包括 n 个四边形和 2 个 n 边形。总空间对角线数等于总顶点对数减去棱数再减去所有面对角线数。对于三棱柱（n=3）：总对数 = 6C2 = 15；棱数 = 9；每个三角形面有 0 条对角线，每个矩形面有 2 条对角线 × 3 = 6；因此空间对角线 = 15 − 9 − 6 = 0。对于四棱柱（立方体）：8C2 − 12 − 6 面对角线 = 28 − 12 − 6 = 10？等等，得到 10，但我们知道立方体只有 4 条空间对角线。这一差异的产生是因为在立方体中，面对角线不是独立的——一些不是棱的顶点对已经被计为面对角线。正确计数：减去棱（12）和所有面对角线（6 个面 × 2 = 12），得到 28 − 12 − 12 = 4。我最初的错误是使用了 6 条面对角线；实际上，6 个正方形面每个都有 2 条对角线，共 12 条。所以当正确计入所有面对角线时，公式是有效的。这一拓展显示了 3D 几何的复杂性以及精确定义的必要性，回应了在多边形探究中观察到的清晰性的重要性。

10. Reflection and Evaluation | 反思与评价

This investigation was rewarding because it started with a simple geometric observation and led to a general formula that I could prove in multiple ways. The combinatorial proof was particularly satisfying as it connected counting principles with geometry. The extension to 3D was challenging but highlighted the importance of precise definitions. If I were to extend this further, I would explore the number of intersection points of diagonals inside a convex polygon, which involves more advanced combinatorics and the concept of combinations of vertices. Overall, the investigation deepened my appreciation for the unity of algebra and geometry and improved my skills in generalising and proving conjectures. The process also reminded me that visual patterns often hide elegant algebraic structures waiting to be uncovered.

这项探究很有收获，因为它从一个简单的几何观察出发，引出了一个我可以用多种方式证明的一般公式。组合证明尤其令人满意，因为它将计数原理与几何联系起来。向 3D 的拓展具有挑战性，但突显了精确定义的重要性。如果要进一步拓展，我会探究凸多边形内对角线交点的数量，这涉及更高级的组合数学和顶点组合的概念。总的来说，这次探究加深了我对代数与几何统一性的认识，并提高了我推广和证明猜想的能力。这个过程也提醒我，直观的图案背后往往隐藏着等待被发现的优雅代数结构。

ing on the process, I realised that time spent on systematic data collection and pattern recognition was crucial for forming a correct conjecture. I also learned that verifying with extreme cases (like n=100) provides a powerful check for algebraic models.

就 IB 评分标准而言，我相信这项探究通过选题和拓展展现了个人参与，通过清晰的定义和有序的数据展现了良好的数学交流，并通过证明和验证展现了恰当的数学运用。反思整个过程，我意识到花在系统数据收集和模式识别上的时间对于形成正确的猜想至关重要。我还学到，用极端情况（如 n=100）进行验证是对代数模型的有力检验。

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）