Quadrilateral Angle Sum Theorems Demo
Loading the math board and drawing, please wait…
In collections
Polygons & Angles
Polygons & Angles
Polygons & Angles ( s n attar)
Polygons & Angles
Polygons & Angles
Polygons & Angles
Polygons & Angles
Geometry: Polygons & Angles
Geometry: Polygons & Angles
This applet informally demonstrates to students that the sum of the interior angles of any quadrilateral is 360 degrees, and explores properties of exterior angles. It involves core math concepts like polygon angle sum theorem and exterior angle properties. Constructed using GeoGebra commands such as Ray, Point, Circle, Intersect, Segment, Angle, CircleSector, Vector, Translate, Dilate, Rotate, Mirror, Line, Polygon. Suitable for middle school and above students to visually grasp quadrilateral angle properties and enhance spatial reasoning.
GeoGebra Commands & Parameters
Ray(P, A) → h_1Point(h_1) → RRay(A, R) → j_1Ray(A, B) → aCircle(A, 1.5) → gIntersect(g, j_1) → I_1,Intersect(g, a, 1) → HSegment(P, A) → l_1Intersect(g, l_1, 1) → H_1Segment(P, C) → k_1Circle(C, 1.5) → kIntersect(k, k_1) → Z,Ray(B, C) → bIntersect(k, b) → M, NRay(C, A) → cPoint(a) → D_1Point(b) → E_1Point(c) → F_1Ray(A, F_1) → dRay(B, D_1) → eRay(C, E_1) → fPoint(e) → DPoint(f) → EAngle(C, B, A) → βAngle(A, C, B) → γAngle(D, B, C) → εAngle(E, C, A) → ζCircle(B, 1.5) → hIntersect(g, c, 1) → GIntersect(g, c, 2) → IIntersect(h, b, 1) → JIntersect(h, a, 1) → KIntersect(h, a, 2) → LIntersect(k, c) → O,CircleSector(C, Z, M) → rCircleSector(B, J, K) → qCircleSector(B, L, J) → tVector(B, C) → uCircleSector(A, I_1, H) → c_1Vector(A, C) → vTranslate(q, u) → q'Segment(B, C) → lDilate(C, If[0 < j ≤ 1, j, 0], B) → C'Vector(B, C') → wTranslate(q, w) → q'_1Rotate(q'_1, If[0 < j, (((-j) * 180))°, 180*°], C') → d_1Mirror(q', C) → q''Dilate(A, If[1 < j ≤ 2, 2 - j, 0], C) → C'_1Vector(A, C'_1) → mCircleSector(A, H, H_1) → pTranslate(p, m) → p'Dilate(C, If[0 < n ≤ 1, n, 0], B) → C'_2Dilate(A, If[1 < n ≤ 2, 2 - n, 0], C) → A'Vector(B, C'_2) → u_1Vector(A, A') → v_1If(0 < n ≤ 1, Translate[t, u_1], Translate[t, u]) → e_1If(1 < n ≤ 2, Translate[c_1, v_1], Translate[c_1, v]) → f_1Ray(C, P) → g_1Point(g_1) → QRay(P, Q) → i_1Point(i_1) → SPoint(j_1) → TCircle(P, 1.5) → p_1Intersect(p_1, l_1) → U,Intersect(p_1, i_1) → V,Intersect(p_1, k_1) → W,CircleSector(P, U, W) → q_1Intersect(k, b, 2) → A_1Intersect(k, r, 1) → B_1Line(P, b) → b_1Intersect(p_1, b_1) → C_1, G_1Angle(B, A, P) → αVector(P, C) → iRotate(p', If[1 < j ≤ 2, 0*°, 0*°], C'_1) → p''Dilate(P, If[2 < j ≤ 3, 3 - j, 0], C) → P'Vector(P, P') → w_1Translate(q_1, w_1) → r_1Rotate(r_1, If[2 < j ≤ 3, (((j - 2) * 180))°, 180*°], P') → s_1CircleSector(C, N, Z) → sCircleSector(P, V, U) → t_1Dilate(P, If[2 < n ≤ 3, 3 - n, 0], C) → P'_1Vector(P, P'_1) → m_1If(2 < n ≤ 3, Translate[t_1, m_1], Translate[t_1, w_1]) → e_2Angle(H, A, I_1) → δAngle(V, P, U) → ηAngle(U, P, W) → θPolygon(A, B, C, P) → poly1, a_2, b_2, c_2, p_2