The Golden Ratio: The Story of Phi, the World's Most Astonishing Number - Mario Livio (2003)
We want to show that for any whole numbers p and q, such that p is larger than q, the three numbers: p2 - q2; 2pq; p2+ q2 form a Pythagorean triple. In other words, we need to show that the sum of the squares of the first two is equal to the square of the third. For this we use the general identities that hold for any a and b.
Based on these identities, the square of the first number is:
and the sum of the first two squares is:
The square of the last number is:
We therefore see that the square of the third number is indeed equal to the sum of the squares of the first two, irrespective of the values of p and q.
We want to prove that the diagonal and the side of the pentagon are incommensurable—they do not have any common measure.
The proof is by the general method of reductio ad absurdum described at the end of Chapter 2.
Let us denote the side of the pentagon ABCDE by s1 and the diagonal by d1. From the properties of isosceles triangles you can easily prove that AB = AH and HC = HJ. Let us now denote the side of the smaller pentagon FGHIJ by s2 and its diagonal by d2. Clearly
If d1 and s1 have a common measure, it means that both d1 and s1 are some integer multiple of that common measure. Consequently, this is also a common measure of d1 - s1 and therefore of d2. Similarly, the equalities
Since based on our assumption the common measure of s1 and d1 is also a common measure of d2, the last equality shows that it is also a common measure of s2. We therefore find that the same unit that measures s1 and d1 also measures s2 and d2. This process can be continued ad infinitum, for smaller and smaller pentagons. We would obtain that the same unit that was a common measure for the side and diagonal of the first pentagon is also a common measure of all the other pentagons, irrespective of how tiny they become. Since this clearly cannot be true, it means that our initial assumption that the side and diagonal have a common measure was false—this completes the proof that s1 and d1 are incommensurable.
The area of a triangle is half the product of the base and the height to that base. In the triangle TBC the base, BC, is equal to 2a and the height, TA, is equal to s. Therefore, the area of the triangle is equal to s × a. We want to show that if the square of the pyramid's height, h2, is equal to the area of its triangular face, s × a, then s/a is equal to the Golden Ratio.
We have that
Using the Pythagorean theorem in the right angle triangle TOA, we have
We can now substitute for h2 from the first equation to obtain
Dividing both sides by a2, we get:
In other words, if we denote s/a by x, we have the quadratic equation:
In Chapter 4 I show that this is precisely the equation defining the Golden Ratio.
One of the theorems in The Elements demonstrates that when two triangles have the same angles, they are similar. Namely, the two triangles have precisely the same shape, with all their sides being proportional to each other. If one side of one triangle is twice as long as the respective side of the other triangle, then so are other sides. The two triangles ADB and DBC are similar (because they have the same angles). Therefore, the ratio AB/DB (ratio of the sides of the two triangles ADB and DBC) is equal to DB/BC (ratio of the bases of the same two triangles):
AB/DB = DB/BC.
But the two triangles are also isosceles, so that
DB = DC = AC.
We therefore find from the above two equalities that
AC/BC = AB/AC,
which means (according to Euclid's definition) that point C divides line AB in a Golden Ratio. Since AD = AB and DB = AC, we also have AD/DB = ö.
Quadratic equations are equations of the form
where a, b, c are arbitrary numbers. For example, in the equation 2x2+ 3x+1 = 0, a = 2, b = 3, c= 1.
The general formula for the two solutions of the equation is
In the above example
In the equation we obtained for the Golden Ratio,
we have a = 1, b = —1, c = — 1. The two solutions therefore are:
The problem of the inheritance can be solved as follows. Let us denote the entire estate by E and the share (in bezants) of each son by x. (They all shared the inheritance equally.)
The first son received:
The second son received:
Equating the two shares:
Therefore, each son received 6 bezants.
Substituting in the first equation we have:
The total estate was 36 bezants. The number of sons was therefore 36/6 = 6. Fibonacci's solution reads as follows:
The total inheritance has to be a number such that when 1 times 6 is added to it, it will be divisible by 1 plus 6, or 7; when 2 times 6 is added to it, it is divisible by 2 plus 6, or 8; when 3 times 6 is added, it is divisible by 3 plus 6, or 9, and so forth. The number is of 36 minus is plus 1 is or 6; and this is the amount each son received; the total inheritance divided by the share of each son equals the number of sons, or equals 6.
The relation between the number of subobjects, n, the length reduction factor, f, and the dimension, D, is
If a positive number A is written as A = 10L, then we call L the logarithm (base 10) of A, and we write it as log A. In other words, the two equations A = 10L and L = log A are entirely equivalent to each other. The rules of logarithms are:
(i) The logarithm of a product is the sum of the logarithms
(ii) The logarithm of a ratio is the difference of the logarithms
(iii) The logarithm of a power of a number is the power times the logarithm of the number
Since 100 = 1, we have from the definition of the logarithm that log 1 = 0. Since 101 = 10, 102 = 100, and so on, we have that log 10 = 1, log 100 = 2, and so on. Consequently, the logarithm of any number between 1 and 10 is a number between 0 and 1; the logarithm of any number between 10 and 100 is a number between 1 and 2; and so on.
If we take the logarithm (base 10) of both sides in the above equation (describing the relation between n, f and D), we obtain
Therefore, dividing both sides by log f
In the case of the Koch snowflake, for example, each curve contains four “subcurves” that are one-third in size; therefore n = 4,f =⅓ and we obtain
If we examine Figure 116(a), we see that the condition for the two branches to touch amounts to the simple requirement that the sum of all the horizontal lengths of the ever-decreasing branches with lengths starting with f3 would be equal to the horizontal component of the large branch of length f.All the horizontal components are given by the total length multiplied by the cosine of 30 degrees. We therefore obtain:
Dividing by cos 30° we obtain
The sum on the right-hand side is the sum of an infinite geometric series (each term is equal to the previous term multiplied by a constant factor) in which the first term is f, and the ratio of two consecutive terms is f. In general, the sum S of an infinite geometric sequence in which the first term is a, and the ratio of consecutive terms q, is equal to
For example, the sum of the sequence
in which a = 1 and q = ½is equal to
In our case we find from the equation above:
Dividing both sides by f, we get
Multiplying by (1-f) and arranging, we obtain the quadratic equation:
with the positive solution
which is 1/ö.
Benford's law states that the probability P that digit D appears in the first place is given by (logarithm base 10):
Therefore, for D = 1
For D = 2
And so on. For D = 9,
The more general law says, for example, that the probability that the first three digits are 1, 5, and 8 is:
Euclid's proof that infinitely many primes exist is based on the method of reductio ad absurdum. He began by assuming the contradictory—that only a finite number of primes exist. If that is true, however, then one of them must be the largest prime. Let us denote that prime by P. Euclid then constructed a new number by the following process: He multiplied together all the primes from 2 up to (and including) P, and then he added 1 to the product. The new number is therefore
By the original assumption, this number must be composite (not a prime), because it is obviously larger than P, which was assumed to be the largest prime. Consequently, this number must be divisible by at least one of the existing primes. However, from its construction, we see that if we divide this number by any of the primes up to P, this will leave a remainder 1. The implication is, that if the number is indeed composite, some prime larger than P must divide it. However, this conclusion contradicts the assumption that P is the largest prime, thus completing the proof that there are infinitely many primes.