A Hindu Square Root Algorithm: Geometric Demonstration by Cutting Squares
Loading the math board and drawing, please wait…
This example demonstrates an ancient Hindu algorithm for finding square roots, which can be physically performed by cutting down a square. It illustrates how successive geometric adjustments to a square's side length converge to the square root of a given number. Core mathematical concepts include square roots, rational approximation, linear equations, and geometric dilation. The construction uses GeoGebra commands such as Intersect, Polygon, Textfield, and Segment, creating multiple polygons (poly1 to poly4) with side variables (a, b, c, d, etc.), along with objects like Guess1, NextGuess, and InputBox1/InputBox2 for user input. Text fields (text1-3) display the iterative steps. This is suitable for middle or high school mathematics, or for history of mathematics lessons, helping students visualize iterative approximation and the connection between geometry and arithmetic.
GeoGebra Commands & Parameters
Intersect(xAxis, yAxis) → APolygon(A, (Guess1, 0), 4) → poly1, a, b, c, d, B, CPolygon(A, (Guess2, 0), 4) → poly2, e, f, g, n, D, EPolygon(A, (Guess3, 0), 4) → poly3, h, i, j, p, F, GPolygon(A, (Guess4, 0), 4) → poly4, k, l, m, q, H, ITextfield(Guess1) → InputBox1Textfield(N) → InputBox2Polygon(A, (Guess5, 0), 4) → poly5, r, s, t, a_1, J, KPolygon(A, (Guess6, 0), 4) → poly6, b_1, c_1, d_1, e_1, L, MSegment((Guess2, 0), (Guess2, Guess1)) → f_1Segment((Guess3, 0), (Guess3, Guess2)) → g_1Segment((Guess4, 0), (Guess4, Guess3)) → h_1Segment((Guess5, 0), (Guess5, Guess4)) → i_1Segment((Guess6, 0), (Guess6, Guess5)) → j_1Segment((0, Guess2), (Guess1, Guess2)) → k_1Segment((0, Guess3), (Guess2, Guess3)) → l_1Segment((0, Guess4), (Guess3, Guess4)) → m_1Segment((0, Guess5), (Guess4, Guess5)) → n_1Segment((0, Guess6), (Guess5, Guess6)) → p_1