Constant sum of squared distances from a circle point to a regular polygon
Loading the math board and drawing, please wait…
In collections
Besondere Punkte/Special Points
This example demonstrates a key geometric invariant: as a point moves on a concentric circle, the sum of the squared distances from the point to the vertices of a regular polygon remains constant. It highlights concepts such as concentric circle geometry, regular polygon vertex construction, Euclidean distance, and the use of squared-distance summation to reveal a position-independent quantity. The construction in GeoGebra is driven by parameters (r, R, n, t) to generate the polygon vertices (V_1…V_12 in a sequence) and the moving point P on the circle, compute each distance (dist) from P to every vertex, then aggregate the squared distances using Sum to form Sd2 (and related displays like Sd, TableText/Textfield, and input/display objects such as CasillaDeEntrada1). Suitable for high-school to early undergrad students studying geometric invariants, algebraic verification, and classroom exploration with dynamic geometry tools.
GeoGebra Commands & Parameters
Point(ec1, t) → PPoint(xAxis) → OSegment(P, O) → r_{1}Polygon(V_1, V_2, n) → Pol, l, i_1, j_1, k_1, V_3, V_4, V_5, V_6, V_7, V_8, V_9, m, V_{10}, V_{11}, V_{12}, p, q, s, e, f_1, g_1, h_1Sequence(Segment[P, Vertex[Pol, i]], i, 1, n) → distSegment(O, V_1) → fSum(dist) → SdSum(dist^(2)) → Sd2TableText(Append[Append["n= " + n, Sequence["\overline{PV_{" + (i) + "}}", i, 1, n]], "Suma"], Append[Append["d_i", (R * dist)], (R * Sd)], Append[Append["d_i^2", Sequence[((R * dist(i)))^(2), i, 1, n]], (R^(2) * Sd2)], "v.|_") → texto2Textfield(R) → CasillaDeEntrada1Textfield(r) → CasillaDeEntrada2
AI Drawing Prompt Reference
Draw a concentric circle and a regular polygon with a point on the circle. Demonstrate that the sum of squared distances from the point to the polygon's vertices remains constant. Start by drawing a circle and its center, then place a point on the circle and construct a regular polygon centered at the same point. Calculate the distance from the point to each vertex, square these distances, and sum them up. Display the result and observe how it changes when adjusting the circle's radius and the number of polygon sides dynamically.
The prompt above was compiled from the original drawing commands and is for reference only.