![]()
|
| Appendix | Bibliography | The Architects Plan | Cubit | Links | Zero
The Square Root Algorithm The basis of this technique lies in the observation that the area of a square is equal to the length of the square's side multiplied by itself. (For instance, a square that is 6 units long on a side will have an area of 6x6 = 36 square units.) Therefore, we can say that the length of a side is the "square root" of a square's area. Let us look at how this empirical understanding can be put to use. Suppose that we want to find the square root of the number 5. The nearest 'perfect square' that is less than 5 is obviously 4; that is, 2 x 2 equals 4. (A perfect square is a number that is a whole number squared.)
The question, then, is whether there is a way to add the area of the remaining one unit to the area of the square containing four units so that we can construct a square containing an area of five units? Surely, if each of these five squares could be subdivided into sufficiently smaller segments, then those of the 'one unit' left over square to the right could be used to add layers around the perimeter of the larger 'four unit' square to the left.
In the diagram above, each original square has been equally subdivided into 8ths along each side, such that each original unit square now comprises 64 smaller squares, thereby causing the larger square to the left to comprise 4 x 64 = 256 smaller squares. However, even greater precision is possible if a finer subdivision is used. Because of the halving and doubling nature of Egyptian computation, I believe it likely that in most cases the Egyptian scribe would have imagined that each original unit square was subdivided into 64 x 64 equivalent smaller units. As a result, the original unit square on the right would then have 4,096 smaller squares, and the original four unit square on the left would have 4 x 4,096 = 16,384. In addition, the perimeter of the original four unit square would now contain 128 + 128 + 126 +126 = 508 smaller squares, and not the perhaps expected 4 x 128 = 512. This is because as one counts the smaller squares on the perimeter, the corner squares do not get counted twice. The next step in the process is to take the smaller squares from the original unit square on the right and use them to layer around the larger square. As one proceeds to do this, it will be noticed that even though there are 508 smaller squares on the perimeter of the square on the left, the corner squares each have 2 sides facing out. Therefore, there are in fact 512 sides facing out to which new squares must be matched up. When a layer of this one-on-one matching is done, however, there will still be gaps at each of the corners remaining to be filled. (See blue layer in Diagram 3).
This means that the new layer to be added will need yet an additional four squares to fill these corner gaps. Notice, then, that the new layer contains the same number of squares as the number of sides facing out in the previous layer (with this number of sides facing out being four more than the actual number of squares in this previous perimeter) plus the four squares needed to fill in the corner gaps. In other words, each and every new layer will require 8 more of the same size squares than were in the previous layer. To facilitate this overall procedure, an "8 units per layer" table can be tabulated and kept handy. (Such a table follows this discussion). Note that each new layer that is added will add the width of 2 smaller square units to the length of each side. Returning to our example
of the A quick calculation
will now reveal that if each of the 316 remaining smaller squares
were imaginarily sliced into 9ths, there would be 9 x 316 = 2,844
of these slices (each being 1/9th of 1/64th of a unit thick, which
equals 1/576th of a unit), and these 2,844 slices would be enough
to layer almost exactly 5 times around the main square. (Since each
side at this point will have 142 smaller squares, there are are
142 x 4 = 568 sides facing out. 2,844 divided by 568 equals 5.00704.)
Therefore, in the Egyptian unit fraction system the This can be restated as: 2 + 1/6 + 1/16 + 1/144, and can be further simplified to : The codified principles of this method are: Principle 1) The perimeter of any square divided into S x S smaller units equals the number of these units per side multiplied by 4, take away 4. As a formula, this can be stated : (4 x S) - 4 = Perimeter. This principle holds true because the corner squares do not get counted twice. Principle 2) The number of units in each new layer that is added equals the number of similarly sized units in the previous layer plus 8. Principle 3) After N layers, the total number of same size squares that have accrued equals: N multiplied by the number of these size squares in the starting (base) perimeter plus the sum of the "8 units per layer" series for all the layers added. For example, if the base perimeter has 508 squares, then the first layer added will have 508 + 8 squares. The second layer will have (508 + 8) + 8 squares, etc. At the Nth layer, the number of squares that will have accrued is (508 x N) plus the sum of the "8 units per layer" series after N layers. Principle 4) Each layer that is added increases the length of a side of the larger square by 2 of the units in question. (Refer to Appendix Diagram 3). The 8 Units Per Layer Table
Clearly, this table can be extended to whatever length may be deemed necessary. The Egyptian scribes' reliance on, and use of, various tables as an aid to computation is well documented.2 The Square Root of 3 The nearest perfect square that is less than 3 is 1, and so 1 becomes the beginning square. The perimeter of this square is 64 x 4 - 4 = 252/64ths. The 2 left-over squares will then have 4,096 x 2 = 8,192 smaller squares. The "8 units per layer" table will show that these 8,192 squares are enough to emplace 23 layers, leaving 188 smaller squares still remaining. The beginning square will at this point have a side length of: 64/64ths + 46/64ths = 110/64ths. The number of sides facing out will be 110 x 4 = 440 sides. If the 188 remaining squares were each sliced into 40ths, then there would be enough of these slices to go around the new perimeter exactly 17 times (188 x 40 = 7520. And 7520 ÷ 440 = 17.) Since each of these
slices is 1/40th of 1/64 = 1/2560th of a unit thick, the side of
the beginning square will now contain Following this same
square root algorithm, and dividing by 64ths, will yield a square
root approximation for the This approximation leads
to an interesting coincidence of number. As was explained in an
earlier section, the Egyptians used an approximation for Pi that
was, in essence, the equivalent of 256/81 (from squaring 8/9 x 2).
Noting that Pi is the ratio of the circumference (perimeter) of
any circle to that circle's diameter, once it was discovered that
a square's diagonal was the Square Root of Numbers Less Than 1 Since the algorithm
method here described needs a beginning square, minor difficulties
arise in the face of the necessity to take the square root of a
number that is less than 1. Fractional quantities less than 1 will
first need to be reconfigured into a common denominator form, such
as 3/4 instead of the unit fraction form of 1/2 + 1/4. From here,
the algorithm can be used to take the square root of numerator and
denominator separately, followed by the consequent division to achieve
the result. Either this, or the fraction could be multiplied by
4,096 (i.e., 64 x 64, or by 80 x 80, etc.) to see what fractional
equivalent of a completed square it would be. For instance, in the
case of 64 x 64, 3/4 could be rewritten 3,072 ÷ 4096. The
square root of 3,072 could then be taken and the result divided
by The Inscribed Endecagon and Nonagon The diagram of the inscribed hexagon can be used to find a computable length for the side of an inscribed equal-sided endecagon, an 11 sided polygon.
Appendix Diagram 4 shows
this construction. The claim is that the line PG will do the job.
360 In this diagram, we
already know the lengths of BC (=1), GC (=1/2), OG (= The inscribed pentagon can be used to find a computable length for the side of an inscribed equal-sided nonagon, a 9 sided polygon.
In the above diagram, lines have been drawn connecting each corner of the pentagon with the two corners farthest opposite, creating a five pointed star known as a pentagram. If a compass is set equal to the line segment EN, a chord of this length will prove a bit too large to fit exactly nine times around the circle. In contrast, a chord set equal to line segment AD will prove just a bit too small. However, if the compass is set to a length precisely mid way between the lengths of EN and AD, the resulting chord will create an apparently perfect equal-sided inscribed nonagon. A study of the inscribed
pentagon in Diagram 12 in the Pentagon section will show that line
ON above is equivalent to line PR in that diagram, and hence to
the sine of 18 If one is looking for a way to create equal-sided inscribed polygons via the diagrammatic method, then through trial and error, ways such as have just been described will eventually be found. To achieve the desired results, however, it is necessary to work with patience and precision using marking tools that are kept well sharpened. Refining The Trigonometric
Table to 1/2 As stated in the text,
a trigonometric table could have been worked out to 1 1/2 From the pentagon analysis,
we saw that the ratios for the 4 1/2 Another possibility
is that with values for 4 1/2
In the above, angle
BOT is taken to be an angle less than 5 It is visually apparent
that difference between the lengths of BG and BT is small, and also
that when angle BOT is halved, the difference between the lengths
of BN and BX is smaller still (BX being the chord of angle BOX).
What we are seeing is that at very small angles, the sine of an
angle and the chord of that angle are becoming very nearly equal
in length. And so, at these small angles the sine of the angle is
then not only nearly equal in length to 1/2 the chord of the angle
which is twice as large, but it is also nearly equal to being 1/2
the length of the sine of the angle which is twice as large. It
is this latter occurrence which is what can be noticed in the computed
results for the angles of 4 1/2 Euclid's
Derivation of the 36 The following is a rewording into plain English of Euclid's presentation as it appears in his work, The Elements, written circa 300 B.C. As stated before, it is unlikely that Euclid was the originator of this derivation, but rather the codifier and disseminator. I include the following information because: 1) it is intrinsically interesting; and 2) it is interesting to compare this more studied approach with that shown in the Inscribed Pentagon section. It is as if at some point in antiquity it was felt that the empirical nature of the more ancient diagrammatic derivation of the inscribed pentagon (along the lines of that shown previously) was no longer deemed sufficiently rigorous. Lots of "little grey cells" were burned by whoever originally forged the following method.
In this first diagram, line JS has been drawn such that JM = MS. An arbitrary length, CS, is then added continuing JS to point C. A square is drawn on CS such that CT = CS = 'F'. Similarly, a square is drawn on MC. The theorem now states that: JC x CS + MS2 = MC2 Diagrammatically this means that the area of the rectangle bordered by the lines JC and CT (boxes 3, 4, and 1) plus the area of the square on MS (box 5) equals the area of the square on MC (boxes 3, 4, 5, and 1). Inspection of the diagram will show that the proposed theorem is indeed true. The next theorem in the chain is a special case of Theorem 6 above.
Theorem 11 shows how to find a point B on any line SK, such that: SK x BK = SB2, or written another way, so that: SK÷SB = SB÷BK.7 Line JS is drawn so that JM = MS. Square JSKD is drawn on JS. MK is swung upward to JS extended, creating MC = MK. Square CTBS is now drawn on CS, and as a result, CS = CT = SB = JP. Employing the previous theorem, we have that : JC x CS + MS2 = MC2. From the Pythagorean Theorem we know: MK2 = SK2 + MS2. Since MC = MK, then JC x CS + MS2 = SK2 + MS2. Subtracting MS2 from both sides of the equation leaves: JC x CS = SK2. Since CS = CT, the previous equation means that the area of the rectangle bordered by JC and CT is equal to the area of the square on SK. Since both of these figures contain the area of rectangle JSBP, then the area of the square on CS (i.e., CS2 ) must be equal to the area of the rectangle KD x BK. Therefore, CS2 = KD x BK Remembering that CS = SB and that KD = SK, we can restate this last equality to read: SB2 = SK x BK, which is what we set out to prove.
This theorem states that if from a point C outside of a circle, a line is drawn tangent to the circle at point A, and another arbitrary line CJ is also drawn from C to intersect the circle at S and J, then: JC x CS = CA2. There are two possibilities within this arrangement: 1) where CJ passes through the center of the circle, and 2) where it doesn't. The diagram above shows the first circumstance. In it, SM = MJ = MA, since all are radii of the circle. From Theorem 6 Book II we have: JC x CS + MS2 = MC2. And since MS = MA, then: JC x CS + MA2 = MC2. From the Pythagorean
Theorem we have: MC2 = CA2 + MA2
(from right Combining the last two equalities, and subtracting MA2 from both sides of the equation, we find what we set out to prove:
The next diagram will explore the second possibility.
In this next diagram we see the situation where JC does not pass through the circle's center. OM is drawn perpendicular to JC from the circle's center making MS = MJ. From Theorem 6, Book II we then have: JC x CS + MS2 = MC2 From the right triangles OMS and OMC we get the following: MS2 = OS2 - OM2 and MC2 = OC2 - OM2 These values for MS2 and MC2 can be substituted into the first formula: JC x CS + OS2 - OM2 = OC2 - OM2, and so JC x CS + OS2 = OC2. However, OS = OA (both are radii), and therefore JC x CS = OC2 - OA2. Applying the Pythagorean Theorem to right triangle CAO we have: CA2 = OC2 - OA2. Substituting back into the previous equation, we find that the theorem is proven for this case as well:
Theorem 37, Book III is the converse of Theorem 36. It states that if from a point C outside a circle, two lines are drawn, such that one line intersects the circle at two points (S and J) and the other meets the circle at its perimeter (at a point A), and further if JC x CS = CA2, then CA will be tangent to the circle at point A.
This theorem states that the angle between a line that is tangent to a circle and a chord that meets it, is equal to the angle that subtends that chord from its opposite side. In the above diagram, therefore, angle ZAC is to be proven equal to angle ABC. (Similarly, angle GAB will be equal to angle ACB). We start by noting that OA = OB = OC as they are all radii, and from their respective isosceles triangles we can state:
However, since ZG is tangent
at A, angle OAZ equals 90
This means that:
This theorem is the
final link in the chain, and it's a corker. It begins with Theorem
11, Book II (the second theorem in this progression) which states
that a point B can be found on a line SK such that SK x BK = SB2.
Using SK as a radius, a circle is next drawn with point S as its
center. Chord WK is drawn such that WK = SB and line segments SW
and WB are then also added. The theorem now states that with these
conditions met, angle WSK (i.e., To enact the proof, a point O must be found such that OW = OB = OS, thus allowing a circumscribed circle to be drawn around triangle SBW.8 Once this is done, the preceding theorems in this section are then brought in to play their hand. Line SBK was intentionally drawn to allow SK x BK = SB2. Since SB = WK, this equality can be rewritten: SK x BK = WK2. From theorem 37, Book
III, we see that WK is then tangent to triangle SBW's circumscribed
circle at W. This allows us to prove, using Theorem 32, Book III,
that angle KWB ( Since SK = SW, we know
that triangle KSW is isosceles, and so: From the diagram we
can see that both
This last statement
means that triangle KWB must be isosceles, and so WB = WK = SB.
Therefore, triangle SBW is also isosceles, and
Triangle SWK will therefore
contain 5 x (
BI666 New Genesis Links Below
|
|