Brianchon'sTheorem::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[]:=
ManipulateShowr=2;k=2;d=1;n=6;ρ=;x1=4;y1=6;TableGraphicsBlack,Dashed,Thick,Line{4-d,y1}++-{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},{4-d,y1}++-{(r+ρ)Cos[t1+2πk1+π]+x1-(4-d),(r+ρ)Sin[t1+2πk1+π]+y1-6},t1,0,2π,,TableGraphicsOrange,PointSize[0.008],Point{4-d,y1}++-{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},t1,0,2π,,TableGraphicsOrange,Thick,Line{4-d,y1}++-{(r+ρ)Cos[t1+2πk1]+x1-(4-d),(r+ρ)Sin[t1+2πk1]+y1-6},{4-d,y1}++-(r+ρ)Cost1++2πk1+x1-(4-d),(r+ρ)Sint1++2πk1+y1-6,t1,0,2π,,ContourPlot+-x-12y+==0,{x,0,4},{y,3,9},ContourStyle->{Black,Thick},PerformanceGoal->"Quality",PlotPoints60,GraphicsBlack,PointSize[0.01],Point,6,AxesTrue,BoxRatiosAutomatic,AxesOrigin{0,0},ImageSize900,PlotRange{{-1.5,5},{3,9}},Style["Brianchon's Theorem:",Bold,Medium],{{k1,0,"Valor (k1)"},0,6,0.2},ControlPlacementTop
2Sin
π
n
1-Sin
π
n
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
2
((r+ρ)Sin[t1+2πk1]+y1-6)
2
ρ
2
k
2
((r+ρ)Cos[t1+2πk1+π]+x1-(4-d))
2
((r+ρ)Sin[t1+2πk1+π]+y1-6)
2
ρ
2π
n
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
2
((r+ρ)Sin[t1+2πk1]+y1-6)
2
ρ
2π
n
2
k
2
((r+ρ)Cos[t1+2πk1]+x1-(4-d))
2
((r+ρ)Sin[t1+2πk1]+y1-6)
2
ρ
2
k
2
(r+ρ)Cost1++2πk1+x1-(4-d)
2π
n
2
(r+ρ)Sint1++2πk1+y1-6
2π
n
2
ρ
2π
n
2π
n
2π
n
2
x
2
y
58
11
455
11
43
13
Out[]=

