Can You Find the Volume?
Loading the math board and drawing, please wait…
This example demonstrates how to construct prisms and pyramids using GeoGebra and calculate their volumes. Key math concepts include volume calculation, cross-sectional methods, polygon construction, and relationships between segments and points. The construction involves commands and objects like Prism, Pyramid, Intersect, Point, Midpoint, Segment, Polygon, AngularBisector, PointIn, and Distance. It is suitable for high school solid geometry instruction, helping students understand volume calculation methods and spatial geometric relationships.
GeoGebra Commands & Parameters
Prism(Polygon[(((-b_1)) / 2, ((-b_1)) / 2), (b_1 / 2, ((-b_1)) / 2), 4], (((-b_1)) / 2, ((-b_1)) / 2, b_1)) → a, A, edge2, edge3, edge4, edge5, edge6, edge7, edge8, B, C, face1_1, face2_1, face3_1, face4, face5, edge1Prism(Polygon[(-3, -5, 0), (-3, 5, 0), (-3, -5 + s_4, 4.8)], (3, -5, 0)) → d, H, edge28, edge29, edge30, I, face18, face19, face20, face21, edge25, edge26, edge27Prism(Polygon[(((-b_2)) / 2, ((-b_2)) / 2), (b_2 / 2, ((-b_2)) / 2), 5], (((-b_2)) / 2, ((-b_2)) / 2, h_2)) → b, D, face11, edge9, edge10, edge11, edge12, edge13, edge14, edge15, edge16, edge17, E, edge18, F, G, face6, face7, face8, face9, face10Pyramid(Polygon[((-b_3), 0), Rotate[((-b_3), 0), 60°, (0, 0)], 6], (0, 0, h_3)) → c, face12, edge22, edge23, edge24, face14, face15, face16, face17, face13, edge19, edge20, edge21Prism(Polygon[(((-b_5)) / 2, (-b'_5)), (((-b_5)) / 2, 0), (0, 18 / b_5), (b_5 / 2, 0), (b_5 / 2, (-b'_5))], (((-b_5)) / 2, (-b'_5), s_5)) → e, J, face27, edge31, edge32, edge33, edge34, edge35, edge36, edgeJK, edgeKL, edgeLM, K, edge37, L, M, face22, face24, face25, face26, face23Prism(Polygon[(0, 2.5), (7, 0), (0, -2.5), (-7, 0)], (0, 2.5, s_6)) → f, N, edge39, edge40, edge41, edge42, edgeNO, edgeOP, edge43, O, P, face28, face30, face31, face29, face32, edge38Intersect(xAxis, yAxis) → QPoint(xAxis) → RPoint(xAxis) → SMidpoint(edge11) → ZPoint(edge12) → A_1Segment(E, A_1) → gMidpoint(g) → B_1Intersect(edge6, edge2) → C_1Point(edge3) → D_1Segment(C_1, D_1) → hMidpoint(h) → G_1Polygon(A_2, B_2, C_2) → poly1_1, c_1, a_2, b_4Polygon(D_2, E_2, F_2) → poly2_1, f_1, d_1, e_1Polygon(A_2, E_2, H_1) → poly3_1, h_1, a_3, e_2Polygon(B_2, F_2, G_2) → poly4_1, g_1, b_6, f_2Polygon(B_2, C_2, D_2, F_2) → poly5_1, b_7, c_2, d_2, f_3Polygon(A_2, C_2, D_2, E_2) → poly6_1, a_4, c_3, d_3, e_3Polygon(A_2, B_2, G_2, H_1) → poly7_1, a_5, b_8, g_2, h_4Polygon(E_2, F_2, G_2, H_1) → poly8_1, e_4, f_4, g_3, h_5Segment(G_2, A_2) → i_1Midpoint(i_1) → I_1AngularBisector(F_2, B_2, G_2) → j_1AngularBisector(G_2, F_2, B_2) → k_1Intersect(k_1, j_1) → J_1AngularBisector(A_2, B_2, D_2) → l_1AngularBisector(D_2, A_2, B_2) → m_1PointIn(face19) → Pointface19PointIn(face32) → Pointface32Intersect(edge43, edge38) → K_1Segment(K_1, O) → iMidpoint(i) → L_1Point(edge40) → M_1Segment(P, M_1) → jMidpoint(j) → N_1Point(edge18) → O_1Segment(O_1, E) → kSegment(D, G) → lIntersect(l, k) → P_1Segment(F, P_1) → mSegment(E, G) → pSegment(F, O_1) → qSegment(D, F) → rIntersect(r, p) → Q_1Segment(O_1, Q_1) → sIntersect(s, m) → R_1Segment(R_1, D) → tAngularBisector(edge29, edge30) → n_1, p_1AngularBisector(edge29, edge28) → q_1, r_1Intersect(p_1, r_1) → S_1Point(edge26) → T_1Segment(I, T_1) → s_1Midpoint(s_1) → U_1Point(list1) → V_1Segment(H, V_1) → t_1Midpoint(t_1) → W_1Point(edge25) → Z_1Segment(Z_1, I) → i_2Midpoint(i_2) → H_2Point(edge22) → J_2Segment(I_2, J_2) → j_2Midpoint(j_2) → K_2AngularBisector(edge22, edge23) → k_2, l_2Point(k_2) → L_2Intersect(l_2, k_2) → M_2Midpoint(L_2, M_2) → N_2Distance(edge21, edge22) → oSegment(K_2, M_2) → m_2Polygon((((-b_1)) / 2, ((-b_1)) / 2), (b_1 / 2, ((-b_1)) / 2), 4) → face1Polygon((((-b_2)) / 2, ((-b_2)) / 2), (b_2 / 2, ((-b_2)) / 2), 5) → face2Polygon(((-b_3), 0), Rotate[((-b_3), 0), 60°, (0, 0)], 6) → face3Polygon((-3, -5, 0), (-3, 5, 0), (-3, -5 + s_4, 4.8)) → base4, n_2, p_2, q_2Polygon((0, 2.5), (7, 0), (0, -2.5), (-7, 0)) → base5, r_2, s_2, t_2, i_3