n阶完全图边和顶点关系。_正N边型的完全图被分割成几个多边形-CSDN博客

本文链接：https://blog.csdn.net/weixin_33044131/article/details/113491938

本文探讨了正N边形完全图在不允许对角线重合的情况下的多边形分割问题。通过欧拉示性数公式和组合数公式，分析了N边形的线、点数量及其关系。正奇边形的完全图解决方案相对直接，而正偶边形则涉及到特殊的交点数目计算。通过OEIS得到的公式用于计算正N边形的构成点数，揭示了交点个数并非随N增大而单调增的有趣现象。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

正N边型的完全图被分割成几个多边形？

这篇文章被分为四个部分

一、知识铺垫

二、在不允许对角线重合的情况下，N边形可以分为多少个多边形

三、正N边形可以分为多少个图形

四、附录（在附录进行总结）

一、知识铺垫

1.组合数公式(Combinatorial Number Formual)

$equation?tex=C_%7Bn%7D%5E%7Bm%7D%3D%5Cfrac%7Bn%21%7D%7Bm%21%28n-m%29%21%7D$

这个公式用于示意在

个元素中，取

个元素，共有多少种取法。

2.欧拉示性数公式(Euler's Characteristic Formual)

柯西的证明

其中

equation?tex=V-Vertex%2C%5C%2CF-Face%2C%5C%2CE-Edge

即

是顶点的意思，

是面的意思，

是棱（边）的意思。

这个公式表示了三维几何体内各个元素的关系，亦表示了平面内各个元素的关系，这是由于你可以把一个平面图看作底面为平面的三维几何体的俯视图。

在平面内，

的数量要加上图形外的一个面，

会被交点分割，如下图

欧拉示性数公式

二、在不允许三个及以上的对角线相交于一点的情况下，N边形可以分为多少个多边形

这个问题很类似于分圆问题，感兴趣的小伙伴可以去看一看。

我们把这个问题简化一下，就引出以下两个问题：

1.N边形（非正）的完全图有多少条线（不包括边）？

2.N边形（非正）的完全图有多少个点（不包括顶点）？

3.第1问中所得得线被第2问中所得得点分为几段？

解决前两个问题还是很简单的。

两点连成一线，我们在

个点中选取

个点连成一条线，即每个线都可以用一个二元数表示，在

个元素中选取

个元素任意组合，那么有

equation?tex=e%28n%29%3DC_%7Bn%7D%5E%7B2%7D

两线交于一点，但是并不是所有的线都交与N边形内，如下图

不应该的点L

我们可以让每一个交点都对应一个四元数，即一组直线（两个直线）的每个端点为一元，四元即可对应一个交点，即在

个元素选取

个元素任意组合，我们就有了

equation?tex=V_%5Calpha%28n%29%3DC_%7Bn%7D%5E%7B4%7D%2Bn

Then, 来求边的数量。

每增加一个交点等价于增加两条边，每个交点由已知的直线构成，然后这两个直线又被分成四小份。

For Instance,

条线（线段）交于

点，会被分割成

，也就是

小段。

3线2点图片来源于分圆问题

条线交于

点，会被分割成

，也就是

小段

4线3点图片来源于分圆问题

在我们的图像中，

条线交于

个点，那么有

equation?tex=E_%5Calpha%28n%29%3DC_%7Bn%7D%5E%7B2%7D%2B2C_%7Bn%7D%5E%7B4%7D

根据欧拉示性数公式，有

equation?tex=F_%5Calpha%28n%29%3DE_%5Calpha%28n%29-V_%5Calpha%28n%29%2B2%3DC_%7Bn%7D%5E%7B2%7D%2BC_%7Bn%7D%5E%7B4%7D-n%2B2

展开一下，得到

$equation?tex=F_%5Calpha%28n%29%3D%5Cfrac%7Bn%5E4-6n%5E3%2B23n%5E2-42n%2B48%7D%7B24%7D$

由于我们只关注多边形以内的部分，我们在最后的结果上减去

，那么N边形（非正）完全图就被分为了

个多边形。

三、正N边形可以分为多少个图形

由于正奇边形不会有三个及以上的连线交于同一点，如此，正奇边形的完全图便完解了。

正偶边形呢？

正六边形完全图

Generally Speaking, 正偶边形都会有若干条线交与同一点。

-----------------------------------------------------------------------------------------------

（这可真不是一个简易的解法 >_<）

-----------------------------------------------------------------------------------------------

Now, 思考另一个问题，如果

条直线交于

点，随后使其均不交于

点，会多出来多少个面？

答案是

，如下图

同时交于1点的4条直线段

均不交于1点的4条直线段

That's So Easy, 但又引出一个问题：正偶边形的特殊交点数目各几何？

我们现在把由大于等于

条线的同一交点叫做特殊交点，并将其表示为

，其中

为交点数量，该类交点由

条直线同时相交构成。

接着引出以下函数

equation?tex=F_N%28p%2Cq%29%3DpC_%7Bq-1%7D%5E%7B2%7D

equation?tex=F_%5CDelta%28n%29%3D%5Csum_%7Bi%3D3%7D%7BF_N%28n%2Ci%29%7D

通过统计得到：

正四边形

正六边形

正八边形

正十边形

正十二边形

正十四边形

现在令

equation?tex=F%28n%29%3DF_%5Calpha%28n%29-F_%5CDelta%28n%29

我们自然而然地对

展开讨论。

很明显，想要知道

，有必要从简单问题入手，可以先讨论

。

为了讨论正偶边形，我们引入一个函数

equation?tex=%5CDelta%28m%2Cn%29%3D1%5C%2C%28n%5C%2Cmod%5C%2Cm%3D0%29%5C%5C+%5CDelta%28m%2Cn%29%3D0%5C%2C%28n%5C%2Cmod%5C%2Cm%5Cne0%29

是个判断类型的函数，可以给出它的简易计算式

$equation?tex=%5CDelta%28m%2Cn%29%3D%5B%5Cleft%7C+cos%5C%2C%5Cfrac%7Bn%5Cpi%7D%7Bm%7D+%5Cright%7C%5D$

对于正偶边形，均有

例如正十边形与正十四边形，他们有

，不过特殊的是，他们除数为不为

的偶数。

对于这类仅有（除数为偶数）

的正偶边形的完全图仅有过中心的直线上的交点，又分为两种——

$equation?tex=%281%2C%5Cfrac+%7Bn%7D%7B2%7D%29$

正十四边形完全图局部

我们对

进行分析——

当

条直线均不交于

点时，共有

个交点，比起

条直线同时交于

点，多了

个交点。

那么对于仅有（除数为偶数）

的这类正偶边形，有

equation?tex=V_%5CDelta%28n%29%3D2nx%2BC_%7Bn%2F2%7D%5E2-1

equation?tex=%5Ctext%7B%2A+%7D%5C%2CC_3%5E2-1%3D2

现在令

equation?tex=n%3D2p%2C%5C%2Cp%5Cin+%7B%E2%84%99%7D%5C%2C+and%5C%2C+p%3E3

参考数据

将

和图片中参考数据带入得到

equation?tex=V_%5CDelta%2810%29%3D20x%2B9%3D49

equation?tex=V_%5CDelta%2814%29%3D28x%2B20%3D244

equation?tex=V_%5CDelta%2822%29%3D44x%2B54%3D1374

equation?tex=V_%5CDelta%2826%29%3D52x%2B77%3D2469

equation?tex=V_%5CDelta%2834%29%3D68x%2B135%3D6119

equation?tex=x_%7B10%7D%3D2%2C%5C%2Cx_%7B14%7D%3D8%2C%5C%2Cx_%7B22%7D%3D30%2C%5C%2Cx_%7B26%7D%3D46%2C%5C%2Cx_%7B34%7D%3D88%5C%2C......

（

的数值仅为假设数值，作为逆推关系式的工具，并不为真实数值）

我们可以猜测

的数值与

的数值有关，就令

equation?tex=x%3Dan%5E3%2Bbn%5E2%2Bcn%2Bd%2Ben%5E%7B-1%7D

将

的数值与其对应

的数值分别带入得到一个方程组——

equation?tex=2%3D10%5E3a%2B10%5E2b%2B10c%2Bd%2B10%5E%7B-1%7De+%5C%5C+8%3D14%5E3a%2B14%5E2b%2B14c%2Bd%2B14%5E%7B-1%7De+%5C%5C+30%3D22%5E3a%2B22%5E2b%2B22c%2Bd%2B22%5E%7B-1%7De+%5C%5C+46%3D26%5E3a%2B26%5E2b%2B26c%2Bd%2B26%5E%7B-1%7De+%5C%5C+88%3D34%5E3a%2B34%5E2b%2B34c%2Bd%2B34%5E%7B-1%7De

解得

$equation?tex=a%3D0%2C%5C%2Cb%3D%5Cfrac%7B5%7D%7B48%7D%2C%5C%2Cc%3D-1%2C%5C%2Cd%3D%5Cfrac%7B19%7D%7B12%7D%2C%5C%2Ce%3D0$

最终发现

$equation?tex=x%3D%5Cfrac%7B5%7D%7B48%7Dn%5E2-n%2B%5Cfrac%7B19%7D%7B12%7D%3D%5Cfrac%7B5n%5E2-48n%2B76%7D%7B48%7D$

于是可以得出与

的积项为

$equation?tex=%5Cfrac%7B-5n%5E3%2B45n%5E2-70n%2B24%7D%7B24%7D$

用同样的方法便可以得出与

、与

的积项等。

值得一提的是，在下面的文章中，也提到了

时，内心角平分线上的交点个数一般等于过中心点的对角线上的交点个数，原因固然与此有关。

https://wenku.baidu.com/view/978b3eb1f111f18583d05abd.html

In Addition, 如果你对统计情有独钟的话，我认为上面的文章会帮助到你。

Luckily, 我从OEIS得到了一个公式来计算以计算正N边形构成点数目的计算公式：

$equation?tex=V%28n%29%3DC_%7Bn%7D%5E%7B4%7D%2Bn%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B45n%5E2-70n%2B24%7D%7B24%7D%29%5C%5C+%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-3n%7D%7B2%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-45n%5E2%2B262n%7D%7B6%7D%29%5C%5C+%2B%5CDelta%2812%2Cn%29%2842n%29%2B%5CDelta%2818%2Cn%29%2860n%29%5C%5C+%2B%5CDelta%2824%2Cn%29%2835n%29%2B%5CDelta%2830%2Cn%29%28-38n%29%5C%5C+%2B%5CDelta%2842%2Cn%29%28-82n%29%2B%5CDelta%2860%2Cn%29%28-330n%29%5C%5C+%2B%5CDelta%2884%2Cn%29%28-144n%29%2B%5CDelta%2890%2Cn%29%28-96n%29%5C%5C+%2B%5CDelta%28120%2Cn%29%28-144n%29%2B%5CDelta%28210%2Cn%29%28-96n%29$

由于公式太长，为了能让手机用户看到，我把他分成了七行。

可以用同样的方法得到

$equation?tex=E%28n%29%3DE_%5Calpha%28n%29-E_%5CDelta%28n%29+%5C%5C+%3DC_n%5E2%2B2C_%7Bn%7D%5E%7B4%7D%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B44n%5E2-60n%7D%7B16%7D%29+%5C%5C++%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-9n%7D%7B4%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-143n%5E2%2B834n%7D%7B12%7D%29+%5C%5C++%2B%5CDelta%2812%2Cn%29%28%5Cfrac%7B133n%7D%7B2%7D%29%2B%5CDelta%2818%2Cn%29%2892n%29+%5C%5C++%2B%5CDelta%2824%2Cn%29%2854n%29%2B%5CDelta%2830%2Cn%29%28-74n%29+%5C%5C++%2B%5CDelta%2842%2Cn%29%28-132n%29%2B%5CDelta%2860%2Cn%29%28-520n%29+%5C%5C++%2B%5CDelta%2884%2Cn%29%28-222n%29%2B%5CDelta%2890%2Cn%29%28-146n%29+%5C%5C++%2B%5CDelta%28120%2Cn%29%28-222n%29%2B%5CDelta%28210%2Cn%29%28-146n%29++$

我有一个对这个命题十分美妙的证明，这里空白太小，写不下。[手动滑稽]

Okay, 根据欧拉示性数公式，我们最终得出

$equation?tex=F%28n%29%3DE%28n%29-V%28n%29%2B2%3D+%5C%5C+C_%7Bn%7D%5E%7B2%7D%2BC_%7Bn%7D%5E%7B4%7D-n%2B2%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B42n%5E2-40n-48%7D%7B48%7D%29+%5C%5C++%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-3n%7D%7B4%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-53n%5E2%2B310n%7D%7B12%7D%29+%5C%5C++%2B%5CDelta%2812%2Cn%29%28%5Cfrac%7B49n%7D%7B2%7D%29%2B%5CDelta%2818%2Cn%29%2832n%29+%5C%5C++%2B%5CDelta%2824%2Cn%29%2819n%29%2B%5CDelta%2830%2Cn%29%28-36n%29+%5C%5C++%2B%5CDelta%2842%2Cn%29%28-50n%29%2B%5CDelta%2860%2Cn%29%28-190n%29+%5C%5C++%2B%5CDelta%2884%2Cn%29%28-78n%29%2B%5CDelta%2890%2Cn%29%28-48n%29+%5C%5C++%2B%5CDelta%28120%2Cn%29%28-78n%29%2B%5CDelta%28210%2Cn%29%28-48n%29++$

那么，正N边形完全图就被分为了

个多边形。

Interestingly, 即使在正偶边形中，总交点的个数也并不随着N的增大而严格单调增。

For Example, 正二十八边形内交点个数为

个，而正三十边形内交点个数为

个。

我最后准备了一片Python代码来计算它，如下

#  Creating By KebRainy

def delta(m,n):
    if n % m == 0:
        return 1
    return 0

def vertex(n):
    return (n**4 - 6*n**3 + 11*n**2 + 18*n)/24 + (-5*n**3 + 45*n**2 - 70*n + 24)*delta(2,n)/24 - (3*n/2)*delta(4,n) + (-45*n**2 + 262*n)*delta(6,n)/6 + 42*n*delta(12,n) + 60*n*delta(18,n) + 35*n*delta(24,n) - 38*n*delta(30,n) - 82*n*delta(42,n) - 330*n*delta(60,n) - 144*n*delta(84,n) - 96*n*delta(90,n) - 144*n*delta(120,n) - 96*n*delta(210,n)

def face(n):
    return (n**4 - 6*n**3 + 23*n**2 - 42*n + 48)/24 + delta(2, n)*(-5*n**3 + 42*n**2 - 40*n - 48)/48 - delta(4, n)*(3*n/4) + delta(6, n)*(-53*n**2 + 310*n)/12 + delta(12, n)*(49*n/2) + delta(18, n)*(32*n) + delta(24, n)*19*n - delta(30, n)*36*n - delta(42, n)*50*n - delta(60, n)*190*n - delta(84, n)*78*n - delta(90, n)*48*n - delta(120, n)*78*n - delta(210, n)*48*n

def edge(n):
    return (2*n**4 - 12*n**3 + 34*n**2 - 24*n)/24 + delta(2, n)*(-5*n**3 + 44*n**2 - 60*n)/16 - delta(4, n)*(9*n/4) + delta(6, n)*(-143*n**2 + 834*n)/12 + delta(12, n)*(133*n/2) + delta(18, n)*(92*n) + delta(24, n)*54*n - delta(30, n)*74*n - delta(42, n)*132*n - delta(60, n)*520*n - delta(84, n)*222*n - delta(90, n)*146*n - delta(120, n)*222*n - delta(210, n)*146*n

n = int(input("请输入要解析的正N边形: N="))
print("正 %d 边形完全图点统计为: %d " % (n, vertex(n)))
print("正 %d 边形完全图面统计为: %d " % (n, face(n)))
print("正 %d 边形完全图棱统计为: %d " % (n, edge(n)))

四、附录

$equation?tex=%5Calpha%5C%2C%E2%80%94%5C%2CPrinciple++%5C%5C+++The%5C%2C+complete%5C%2C+graph%5C%2C+of%5C%2C+the%5C%2C+positive%5C%2C+N-gon%5C%2C++%5C%5C+is%5C%2C+divided%5C%2C+into%5C%2C+F%28n%29-1%5C%2C+polygons.++%5C%5C++F%28n%29%3DE%28n%29-V%28n%29%2B2%3DF_%5Calpha%28n%29-F_%5CDelta%28n%29++%5C%5C++----------+++%5C%5C+++%5Cbeta%5C%2C%E2%80%94%5C%2CCalculation+%5C%5C+++F_%5CDelta%28n%29%3D%5Csum_%7Bi%3D3%7D%7BN%28n%2Ci-1%29%7D++%5C%5C++N%28n%2Cm%29%3DnC_%7Bm-1%7D%5E%7B2%7D++%5C%5C++%28n%2C+m%29%5C%2C+means%5C%2C+that%5C%2C+there%5C%2C+are%5C%2C+n%5C%2C+points%5C%2C+++%5C%5C++where%5C%2C+m%5C%2C+lines%5C%2C+intersect%5C%2C+at%5C%2C+one%5C%2C+point%5C%2C+at%5C%2C+the%5C%2C+same%5C%2C+time.%5C%5C+++%5C%5C+++V_%5Calpha%28n%29%3DC_%7Bn%7D%5E%7B4%7D%2Bn+%5C%5C+++E_%5Calpha%28n%29%3DC_%7Bn%7D%5E%7B2%7D%2B2C_%7Bn%7D%5E%7B4%7D++%5C%5C++F_%5Calpha%28n%29%3DC_%7Bn%7D%5E%7B2%7D%2BC_%7Bn%7D%5E%7B4%7D-n%2B2+++%5C%5C+++----------+++%5C%5C+++%5Cgamma%5C%2C%E2%80%94%5C%2CFormula+%5C%5C+++V%28n%29%3DC_%7Bn%7D%5E%7B4%7D%2Bn-%5Csum_%7Bi%3D1%7D%7B%5CDelta%282i%2Cn%29%5Calpha_i%7D+%5C%5C+%3D%5Cfrac%7Bn%5E4-6n%5E3%2B11n%5E2%2B18n%7D%7B24%7D%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B45n%5E2-70n%2B24%7D%7B24%7D%29+%5C%5C++%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-3n%7D%7B2%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-45n%5E2%2B262n%7D%7B6%7D%29+%5C%5C++%2B%5CDelta%2812%2Cn%29%2842n%29%2B%5CDelta%2818%2Cn%29%2860n%29+%5C%5C++%2B%5CDelta%2824%2Cn%29%2835n%29%2B%5CDelta%2830%2Cn%29%28-38n%29+%5C%5C++%2B%5CDelta%2842%2Cn%29%28-82n%29%2B%5CDelta%2860%2Cn%29%28-330n%29+%5C%5C++%2B%5CDelta%2884%2Cn%29%28-144n%29%2B%5CDelta%2890%2Cn%29%28-96n%29+%5C%5C++%2B%5CDelta%28120%2Cn%29%28-144n%29%2B%5CDelta%28210%2Cn%29%28-96n%29++%5C%5C++E%28n%29%3DC_n%5E2%2B2C_%7Bn%7D%5E%7B4%7D-%5Csum_%7Bi%3D1%7D%7B%5CDelta%282i%2Cn%29%5Cbeta_i%7D+%5C%5C+%3D%5Cfrac%7B2n%5E4-12n%5E3%2B34n%5E2-24n%7D%7B24%7D%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B44n%5E2-60n%7D%7B16%7D%29+%5C%5C++%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-9n%7D%7B4%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-143n%5E2%2B834n%7D%7B12%7D%29+%5C%5C++%2B%5CDelta%2812%2Cn%29%28%5Cfrac%7B133n%7D%7B2%7D%29%2B%5CDelta%2818%2Cn%29%2892n%29+%5C%5C++%2B%5CDelta%2824%2Cn%29%2854n%29%2B%5CDelta%2830%2Cn%29%28-74n%29+%5C%5C++%2B%5CDelta%2842%2Cn%29%28-132n%29%2B%5CDelta%2860%2Cn%29%28-520n%29+%5C%5C++%2B%5CDelta%2884%2Cn%29%28-222n%29%2B%5CDelta%2890%2Cn%29%28-146n%29+%5C%5C++%2B%5CDelta%28120%2Cn%29%28-222n%29%2B%5CDelta%28210%2Cn%29%28-146n%29++%5C%5C++F%28n%29%3DC_n%5E2%2BC_%7Bn%7D%5E%7B4%7D-n%2B2-%5Csum_%7Bi%3D1%7D%7B%5CDelta%282i%2Cn%29%5Cgamma_i%7D+%5C%5C+%3D%5Cfrac%7Bn%5E4-6n%5E3%2B23n%5E2-42n%2B48%7D%7B24%7D%2B%5CDelta%282%2Cn%29%28%5Cfrac%7B-5n%5E3%2B42n%5E2-40n-48%7D%7B48%7D%29+%5C%5C++%2B%5CDelta%284%2Cn%29%28%5Cfrac%7B-3n%7D%7B4%7D%29%2B%5CDelta%286%2Cn%29%28%5Cfrac%7B-53n%5E2%2B310n%7D%7B12%7D%29+%5C%5C++%2B%5CDelta%2812%2Cn%29%28%5Cfrac%7B49n%7D%7B2%7D%29%2B%5CDelta%2818%2Cn%29%2832n%29+%5C%5C++%2B%5CDelta%2824%2Cn%29%2819n%29%2B%5CDelta%2830%2Cn%29%28-36n%29+%5C%5C++%2B%5CDelta%2842%2Cn%29%28-50n%29%2B%5CDelta%2860%2Cn%29%28-190n%29+%5C%5C++%2B%5CDelta%2884%2Cn%29%28-78n%29%2B%5CDelta%2890%2Cn%29%28-48n%29+%5C%5C++%2B%5CDelta%28120%2Cn%29%28-78n%29%2B%5CDelta%28210%2Cn%29%28-48n%29++%5C%5C++%5CDelta%28m%2Cn%29%3D%5B%5Cleft%7C+cos%5C%2C%5Cfrac%7Bn%5Cpi%7D%7Bm%7D+%5Cright%7C%5D+%5C%5C++----------++%5C%5C++Thanks%5C%2C+For%5C%2C+Reading%21$