In[]:=
BrianchonTheorem::usage="It states that, given a hexagon circumscribed on a conic section, the lines joining opposite polygon vertices (polygon diagonals) meet in single point.Reference:WolframMathWorld:Brianchon'sTheorem;Personal";
The following animation verifies the theorem:
In[]:=
​​Manipulate​​Showr=2;k=4;d=-3;n=6;ρ=
2Sin
π
n

1-Sin
π
n

;x1=4;y1=6;​​TableGraphicsBlack,Dashed,Thick,InfiniteLine{4-d,y1}+
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
+
2
((r+ρ)Sin[t1+2πk1]+y1-6)
-
2
ρ
{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},{4-d,y1}+
2
k
2
((r+ρ)Cos[t1+2πk1+π]+x1-(4-d))
+
2
((r+ρ)Sin[t1+2πk1+π]+y1-6)
-
2
ρ
{(r+ρ)Cos[t1+2πk1+π]+x1-(4-d),(r+ρ)Sin[t1+2πk1+π]+y1-6},t1,0,2π,
2π
n
,​​TableGraphicsOrange,PointSize[0.015],Point{4-d,y1}+
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
+
2
((r+ρ)Sin[t1+2πk1]+y1-6)
-
2
ρ
{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},t1,0,2π,
2π
n
,​​​​TableGraphicsOrange,Thick,Line{4-d,y1}+
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
+
2
((r+ρ)Sin[t1+2πk1]+y1-6)
-
2
ρ
{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},{4-d,y1}+
2
k

2
(r+ρ)Cost1+
2π
n
+2πk1+x1-(4-d)
+
2
(r+ρ)Sint1+
2π
n
+2πk1+y1-6
-
2
ρ
(r+ρ)Cost1+
2π
n
+2πk1+x1-(4-d),(r+ρ)Sint1+
2π
n
+2πk1+y1-6,t1,0,2π,
2π
n
,​​​​ParametricPlot
128
90
Cosh[t]+
139
45
,
64
3
15
Sinh[t]+6,{t,-π,π},PlotStyle->{Black,Thick},ParametricPlot-
128
90
Cosh[t]+
139
45
,
64
3
15
Sinh[t]+6,{t,-π,π},PlotStyle->{Black,Thick},GraphicsBlack,PointSize[0.015],Point
33
7
,6,AxesTrue,AxesLabel{x,y},BoxRatiosAutomatic,AxesOrigin{0,0},ImageSize700,PlotRange{{0,7},{-5,12}},Style["Brianchon's Theorem:",Bold,Large],{{k1,0,"Valor (k1)"},0,6,0.2},ControlPlacementTop
Out[]=
​
Brianchon's Theorem:
Valor (k1)