A

B

C

K001

L = (5.849422503632341, -0.17118655626109974)
f = Circle(L, 13)
M = Point(f)
h = Circle(M, 6)
g = Circle(L, 9)
H = Intersect(g, h, 1)
N: H
polígono1, c, a, b = Polygon(L, M, N)
e = TriangleCurve(L, M, N, -A^(4) * B^(3) * c^(4) + A^(3) * B^(4) * c^(4) - a^(2) * A^(4) * B^(2) * c^(2) * C - 2 * A^(4) * b^(2) * B^(2) * c^(2) * C - 2 * a^(2) * A^(3) * B^(3) * c^(2) * C + 2 * A^(3) * b^(2) * B^(3) * c^(2) * C + 2 * a^(2) * A^(2) * B^(4) * c^(2) * C + A^(2) * b^(2) * B^(4) * c^(2) * C + A^(4) * B^(2) * c^(4) * C - A^(2) * B^(4) * c^(4) * C + a^(2) * A^(4) * b^(2) * B * C^(2) - A^(4) * b^(4) * B * C^(2) - a^(2) * A^(3) * b^(2) * B^(2) * C^(2) + A^(3) * b^(4) * B^(2) * C^(2) - a^(4) * A^(2) * B^(3) * C^(2) + a^(2) * A^(2) * b^(2) * B^(3) * C^(2) + a^(4) * A * B^(4) * C^(2) - a^(2) * A * b^(2) * B^(4) * C^(2) + 2 * A^(4) * b^(2) * B * c^(2) * C^(2) + a^(2) * A^(3) * B^(2) * c^(2) * C^(2) - A^(2) * b^(2) * B^(3) * c^(2) * C^(2) - 2 * a^(2) * A * B^(4) * c^(2) * C^(2) - A^(3) * B^(2) * c^(4) * C^(2) + A^(2) * B^(3) * c^(4) * C^(2) + A^(4) * b^(4) * C^(3) + 2 * a^(2) * A^(3) * b^(2) * B * C^(3) + a^(4) * A^(2) * B^(2) * C^(3) - A^(2) * b^(4) * B^(2) * C^(3) - 2 * a^(2) * A * b^(2) * B^(3) * C^(3) - a^(4) * B^(4) * C^(3) - 2 * A^(3) * b^(2) * B * c^(2) * C^(3) - a^(2) * A^(2) * B^(2) * c^(2) * C^(3) + A^(2) * b^(2) * B^(2) * c^(2) * C^(3) + 2 * a^(2) * A * B^(3) * c^(2) * C^(3) - A^(3) * b^(4) * C^(4) - 2 * a^(2) * A^(2) * b^(2) * B * C^(4) + A^(2) * b^(4) * B * C^(4) - a^(4) * A * B^(2) * C^(4) + 2 * a^(2) * A * b^(2) * B^(2) * C^(4) + a^(4) * B^(3) * C^(4) - A^(2) * b^(2) * B * c^(2) * C^(4) + a^(2) * A * B^(2) * c^(2) * C^(4) = 0)
P = Point(e)
polígono2, A', B', C' = TrianguloCeviano(L, M, N, P)
D = Midpoint(C', B')
E = Midpoint(C', A')
F = Midpoint(A', B')
d = Circle(D, E, F)
N' = Center(d)
X_1 = TriangleCenter(L, M, N, 1)
X_2 = TriangleCenter(L, M, N, 2)
X_3 = TriangleCenter(L, M, N, 3)
X_{370} = Trilinear(L, M, N, 1.2775012634146223, 1.2783135735747115, 2.1660621940105225)
i = Line(P, X_3)
I_a = Trilinear(L, M, N, -1, 1, 1)
I_b = Trilinear(L, M, N, -1, 1, -1)
I_c = Trilinear(L, M, N, 1, 1, -1)
M_a = Midpoint(M, N)
M_b = Midpoint(N, L)
M_c = Midpoint(L, M)
X_{1138} = TriangleCenter(L, M, N, 1138)
polígono3, A1, B1, C1 = TrianguloCeviano(L, M, N, X_{370})
j = Cubic(L, M, N, 1)
P2 = Trilinear(L, M, N, 1.13977 / a, (-0.56008) / b, 0.749132 / c)
P5 = Trilinear(L, M, N, 0.446695 / a, 0.615759 / b, -(1.55867 / c))
P20 = Trilinear(L, M, N, 0.221431 / a, -(0.735509 / b), -(0.45325 / c))

Tool: Triangulo Ceviano (command TrianguloCeviano)
Dar ABC y P
Input: A, B, C, P
Output: polígono2, A', B', C'

d = Line(B, C)
e = Line(C, A)
f = Line(A, B)
g = Line(A, P)
h = Line(B, P)
i = Line(C, P)
A' = Intersect(d, g)
B' = Intersect(e, h)
C' = Intersect(f, i)
polígono2, f_1, d_1, e_1 = Polygon(A', B', C')

Tool: puntoRazon
Punto X que divide al segmento de extremos P y Q, según una razón  dada, PX : XQ = m : n
Input: P, Q, m, n
Output: X

X = Dilate(Q, m / (m + n), P)

Tool: EjeRadical
Dar centro, punto y centro, punto
Input: A, B, C, D
Output: i

e = Circle(B, D, A)
E = Center(e)
a = Segment(A, E)
b = Segment(E, C)
B' = Mirror(B, a)
D' = Mirror(D, b)
f = Segment(A, C)
g = Line(B, B')
h = Line(D', D)
F = Intersect(g, h)
i = OrthogonalLine(F, f)