025-paradoja-curry-1

Puzzle

Puzzle

Solución

A = (-12, -9)
B = (12, -9)
C = (27, -9)
D = (12, 0)
E = (12, -6)
F = (18, -6)
G = (18, -3)
H = (27, -3)
I = (27, 0)
J = (27, 6)
polígono1, d, a_2, b_3 = Polygon(A, B, D)
polígono2, b_1, c, h, g, f, e = Polygon(B, C, H, G, F, E)
polígono3, h_1, i, d_1, e_1, f_1, g_1 = Polygon(H, I, D, E, F, G)
polígono4, d_2, i_1, j = Polygon(I, J, D)
K = (3, -33)
L = Point(Circle[K, d_2])
M = Rotate(L + (i_1, 0), Angle[D - J] + Angle[L - K] - Angle[J - I], L)
polígono5, m, k, l = Polygon(K, L, M)
N = (3, -27)
O = Point(Circle[N, d])
P = Rotate(O + (a_2, 0), Angle[D - B] + Angle[O - N] - Angle[B - A], O)
polígono6, p, n, o = Polygon(N, O, P)
Q = (18, -30)
R = Point(Circle[Q, h_1])
S = Rotate(R + (i, 0), Angle[D - I] + Angle[R - Q] - Angle[I - H], R)
T = Rotate(S + (d_1, 0), Angle[E - D] + Angle[S - R] - Angle[D - I], S)
U = Rotate(T + (e_1, 0), Angle[F - E] + Angle[T - S] - Angle[E - D], T)
V = Rotate(U + (f_1, 0), Angle[G - F] + Angle[U - T] - Angle[F - E], U)
polígono7, q, r, s, t, u, v = Polygon(Q, R, S, T, U, V)
W = (12, -33)
Z = Point(Circle[W, b_1])
A_1 = Rotate(Z + (c, 0), Angle[H - C] + Angle[Z - W] - Angle[C - B], Z)
B_1 = Rotate(A_1 + (h, 0), Angle[G - H] + Angle[A_1 - Z] - Angle[H - C], A_1)
C_1 = Rotate(B_1 + (g, 0), Angle[F - G] + Angle[B_1 - A_1] - Angle[G - H], B_1)
D_1 = Rotate(C_1 + (f, 0), Angle[E - F] + Angle[C_1 - B_1] - Angle[F - G], C_1)
polígono8, w, z, a_1, b_2, c_1, d_3 = Polygon(W, Z, A_1, B_1, C_1, D_1)
E_1 = (12, -9)
F_1 = Point(Circle[E_1, b_1])
G_1 = Rotate(F_1 + (c, 0), Angle[H - C] + Angle[F_1 - E_1] - Angle[C - B], F_1)
H_1 = Rotate(G_1 + (h, 0), Angle[G - H] + Angle[G_1 - F_1] - Angle[H - C], G_1)
I_1 = Rotate(H_1 + (g, 0), Angle[F - G] + Angle[H_1 - G_1] - Angle[G - H], H_1)
J_1 = Rotate(I_1 + (f, 0), Angle[E - F] + Angle[I_1 - H_1] - Angle[F - G], I_1)
polígono9, e_2, f_2, g_2, h_2, i_2, j_1 = Polygon(E_1, F_1, G_1, H_1, I_1, J_1)
K_1 = (27, -3)
L_1 = Point(Circle[K_1, h_1])
M_1 = Rotate(L_1 + (i, 0), Angle[D - I] + Angle[L_1 - K_1] - Angle[I - H], L_1)
N_1 = Rotate(M_1 + (d_1, 0), Angle[E - D] + Angle[M_1 - L_1] - Angle[D - I], M_1)
O_1 = Rotate(N_1 + (e_1, 0), Angle[F - E] + Angle[N_1 - M_1] - Angle[E - D], N_1)
P_1 = Rotate(O_1 + (f_1, 0), Angle[G - F] + Angle[O_1 - N_1] - Angle[F - E], O_1)
polígono10, k_1, l_1, m_1, n_1, o_1, p_1 = Polygon(K_1, L_1, M_1, N_1, O_1, P_1)
Q_1 = (27, 0)
R_1 = Point(Circle[Q_1, d_2])
S_1 = Rotate(R_1 + (i_1, 0), Angle[D - J] + Angle[R_1 - Q_1] - Angle[J - I], R_1)
polígono11, s_1, q_1, r_1 = Polygon(Q_1, R_1, S_1)
T_1 = (-12, -9)
U_1 = Point(Circle[T_1, d])
V_1 = Rotate(U_1 + (a_2, 0), Angle[D - B] + Angle[U_1 - T_1] - Angle[B - A], U_1)
polígono12, v_1, t_1, u_1 = Polygon(T_1, U_1, V_1)
a = true
c2, p_2, l_3, m_2, z_1 = Polygon(P, L, M, Z)
W_1 = (27, 6)
Z_1 = Point(Circle[W_1, Segment[R_1, D]])
A_2 = Rotate(Z_1 + (Segment[D, T_1], 0), Angle[T_1 - D] + Angle[Z_1 - W_1] - Angle[D - R_1], Z_1)
B_2 = Rotate(A_2 + (Segment[T_1, F_1], 0), Angle[F_1 - T_1] + Angle[A_2 - Z_1] - Angle[T_1 - D], A_2)
C_2 = Intersect(d_2, i_1)
D_2 = Intersect(a_2, b_3)
E_2 = Intersect(d, b_3)
F_2 = Intersect(b_1, c)
c1, c_2, j_2, k_2, l_2 = Polygon(C_2, D_2, E_2, F_2)
G_2 = (27, 6)
H_2 = Point(Circle[G_2, Segment[C_2, D_2]])
I_2 = Rotate(H_2 + (Segment[D_2, E_2], 0), Angle[E_2 - D_2] + Angle[H_2 - G_2] - Angle[D_2 - C_2], H_2)
J_2 = Rotate(I_2 + (Segment[E_2, F_2], 0), Angle[F_2 - E_2] + Angle[I_2 - H_2] - Angle[E_2 - D_2], I_2)
c3, n_2, q_2, r_2, s_2 = Polygon(G_2, H_2, I_2, J_2)