Anyone with even a small fancy for geometrical matters would have at some point in their lives played with the golden ratio (). Indeed, we too have had our share of fun and games with the golden ratio. In course of this we stumbled upon what seemed to us an interesting geometrical problem although it is likely to be seen as a trivial issue by mathematicians. was apparently rather important to the yavana-s. Among the Hindus as we have noted before, it was used in the construction of the śrīcakra, the primary yantra of the śrīkula tradition.

**Problem and the rules of the game**

Starting material: A unit square. For convenience we place one vertex at origin and one side on the x-axis.

Objective: To construct a recursive golden rectangle and a golden spiral of any given resolution using this unit square. At the risk of sounding slow-witted I must emphasize this is not the same as drawing a golden rectangle and sectioning it.

It is well-known that the recursive golden rectangle is constructed by starting with a unit square and repeatedly drawing squares which are scaled by a factor of and arranging them in an inwardly spiralling fashion. The golden spiral is obtained by drawing a quadrant arc using one vertex of each of these squares as the center and the side of the square as the radius such that we get a smooth curve. Figure 1 shows a few iterations of this being done manually.

Figure 1

Now doing the above is a tedious manual procedure with its limitations. So the question was can we do it relatively automatically taking advantage of a modern construction software like GeoGebra. One could technically compute the coordinates of each new square and draw them out with such a program but this is tedious too and needs some rather unappetizing programming sleights. Instead, we wish to achieve this construction using only the following three allowed operations, which can be easily automatically repeated in construction software (e.g. GeoGebra) to obtain a recursive golden rectangle of spiral of any desired resolution:

1) A single vector which can translate (rectilinear displacement) the starting unit square by a given distance in a given direction. Figure 2 shows the displacement of our unit square ( by the vector to get .

Figure 2

2) Dilation (scaling) with the origin as the center of dilation. This operation allows one to scale an object (in our case the unit square) by any factor such that ratio of the distance of any point on scaled square from origin to distance of its equivalent point on the the unit square from origin is equal to the scaling factor. Figure 3 shows such a dilation operation performed on by to get .

Figure 3

3) Rotation of an object about origin by a constant angle in one direction. Figure 4 shows the rotation of by to get .

Figure 4

To get a flavor of how this works when done recursively we start with our unit square , which is what we need to construct the golden rectangle, and inscribe a circular quadrant inside it. We then apply following series of operations recursively on these two object: Translate by vector , then dilate by a certain scaling factor and then rotate by a given angle. For obtaining the golden rectangle, one can find the rotation angle easily. As one can see from the manual construction in Figure 1, for a recursive rectangle each successive square must be rotated by . The scale-factor is also obvious because we are aiming for a golden rectangle; the square must be successively scaled by the factor of , where for each iteration. But these two are not enough as can be seen in Figure 5. There we apply the above rotation and dilation transformations on with an arbitrary translation vector thus:

where the vector is:

Figure 5

We get a spiral arrangement of the squares and the quadrant arcs but clearly this is not the golden rectangle or spiral. Hence, the big question is how do we find the right translation vector and how many such vectors exist which can produce a recursive golden rectangle with the unit square.

**Determination of translation vector and construction of the desired golden entities**

The determination of the translation vectors to produce the golden rectangles and spirals involves an interesting construction. We are not going to repeat the well-known constructions of the yavana-s by which they obtained and . We start with segments of these values already pre-constructed:

1) Let the unit square be ABCD with point A at origin.

2) From point A in the direction opposite to side along the same straight line mark the point G at distance and point H at distance .

3) From point A in the direction opposite to side along the same straight line mark the point F at distance and point E at distance .

4) Draw . Drop perpendiculars to from points H and E to meet it at points I and J.

5) One will notice that i.e. it is congruent to the sides of the unit square.

6) Now use to complete the construction of square IJKL which is congruent to our unit square ABCD.

7) Draw vectors that connect point A to points I, J, K and L. Any of these 4 vectors can serve as translation vectors with the above dilation and rotation factors to give us 4 golden rectangles from the unit square ABCD and 4 golden spirals from the 4 quadrant arcs inscribed in square ABCD (Figure 6 and 7).

Figure 6: single example of golden rectangle/spiral

Figure 7: All four golden rectangles and spirals

This construction reveals some interesting features:

1) The angle between the vectors and is and each vector is separated from the adjacent one by . Thus the 4 vectors together form a trisection of the angle .

2)As noted above the square IJKL which determines the end points of the four translation vectors is congruent to the starting unit square but from the construction we can see that it is rotated with respect to it by an angle of , where . This angle is the supplementary angle of the dihedral angle of a dodecahedron.

3) From the construction we can show the shortest of the vectors is:

3) The six ratios of the magnitudes of the 4 translation vectors can be expressed as relationships featuring thus: