Skip to content →

neverendingbooks Posts

problema bovinum

Published December 3, 2007 by lievenlb

Suppose for a moment that some librarian at the Bodleian Library announces that (s)he discovered an old encrypted book attributed to Isaac Newton. After a few months of failed attempts, the code is finally cracked and turns out to use a Public Key system based on the product of two gigantic prime numbers, $2^{32582657}-1 $ and $2^{30402457}-1 $, which were only discovered to be prime recently. Would one deduce from this that Newton invented public key cryptography and that he used alchemy to factor integers? (( Come to think of it, some probably would ))

The cynic in me would argue that it is a hell of a coincidence for this text to surface exactly at the moment in history when we are able to show these numbers to be prime and understand their cryptographic use, and conclude that the book is likely to be a fabrication. Still, stranger things have happened in the history of mathematics…

In 1773, Gotthold Ephraim Lessing at that time librarian at the Herzog-August-Bibliothek discovered and published a Greek epigram in 22 elegiac couplets. The manuscript describes a problem sent by Archimedes to the mathematicians in Alexandria.

In his beautiful book “Number Theory, an approach through history. From Hammurapi to Legendre” Andre Weil asserts (( Chapter I,IX )):

Many mathematical epigrams are known. Most of them state problems of little depth; not so Lessing’s find; there is indeed every reason to accept the attribution to Archimedes, and none for putting it into doubt.

This Problema Bovidum (the cattle problem) is a surprisingly difficult diophantine problem and the simplest complete solution consists of eigth numbers, each having about 206545 digits. As we will see later the final ingredient in the solution is the solution of Pell’s equation using continued fractions discovered by Lagrange in 1768 and published in 1769 in a long memoir. Lagrange’s solution to the Pell equation was inserted in Euler’s “Algebra” which was composed in 1771 but published only in 1773… the very same year as Lessing’s discovery! (( all dates learned from Weil’s book Chp. III,XII ))

Weil’s book doesn’t include the details of the original epigram. The (lost) archeologist in me wanted to see the original Greek 22 couplets as well as a translation. So here they are : (( thanks to the Cattle problem site ))

A PROBLEM

which Archimedes solved in epigrams, and which he communicated to students of such matters at Alexandria in a letter to Eratosthenes of Cyrene.

If thou art diligent and wise, O stranger, compute the number of cattle of the Sun, who once upon a time grazed on the fields of the Thrinacian isle of Sicily, divided into four herds of different colours, one milk white, another a glossy black, a third yellow and the last dappled. In each herd were bulls, mighty in number according to these proportions: Understand, stranger, that the white bulls were equal to a half and a third of the black together with the whole of the yellow, while the black were equal to the fourth part of the dappled and a fifth, together with, once more, the whole of the yellow. Observe further that the remaining bulls, the dappled, were equal to a sixth part of the white and a seventh, together with all of the yellow. These were the proportions of the cows: The white were precisely equal to the third part and a fourth of the whole herd of the black; while the black were equal to the fourth part once more of the dappled and with it a fifth part, when all, including the bulls, went to pasture together. Now the dappled in four parts were equal in number to a fifth part and a sixth of the yellow herd. Finally the yellow were in number equal to a sixth part and a seventh of the white herd. If thou canst accurately tell, O stranger, the number of cattle of the Sun, giving separately the number of well-fed bulls and again the number of females according to each colour, thou wouldst not be called unskilled or ignorant of numbers, but not yet shalt thou be numbered among the wise.

But come, understand also all these conditions regarding the cattle of the Sun. When the white bulls mingled their number with the black, they stood firm, equal in depth and breadth, and the plains of Thrinacia, stretching far in all ways, were filled with their multitude. Again, when the yellow and the dappled bulls were gathered into one herd they stood in such a manner that their number, beginning from one, grew slowly greater till it completed a triangular figure, there being no bulls of other colours in their midst nor none of them lacking. If thou art able, O stranger, to find out all these things and gather them together in your mind, giving all the relations, thou shalt depart crowned with glory and knowing that thou hast been adjudged perfect in this species of wisdom.

The Lessing epigram may very well be an extremely laborious hoax but it is still worth spending a couple of posts on it. It gives us the opportunity to retell the amazing history of Pell’s problem rangingfrom the ancient Greeks and Indians, over Fermat and his correspondents, to Euler and Lagrange (with a couple of recent heroes entering the story). And, on top of this, the modular group is all the time just around the corner…

4 Comments

the iguanodon dissected

Published November 9, 2007 by lievenlb

Here the details of the iguanodon series. Start with the Farey sequence $F(n) $of order n which is the sequence of completely reduced fractions between 0 and 1 which, when in lowest terms, have denominators less than or equal to n, arranged in order of increasing size. Here are the first eight Fareys

F(1) = {0⁄1, 1⁄1}
F(2) = {0⁄1, 1⁄2, 1⁄1}
F(3) = {0⁄1, 1⁄3, 1⁄2, 2⁄3, 1⁄1}
F(4) = {0⁄1, 1⁄4, 1⁄3, 1⁄2, 2⁄3, 3⁄4, 1⁄1}
F(5) = {0⁄1, 1⁄5, 1⁄4, 1⁄3, 2⁄5, 1⁄2, 3⁄5, 2⁄3, 3⁄4, 4⁄5, 1⁄1}
F(6) = {0⁄1, 1⁄6, 1⁄5, 1⁄4, 1⁄3, 2⁄5, 1⁄2, 3⁄5, 2⁄3, 3⁄4, 4⁄5, 5⁄6, 1⁄1}
F(7) = {0⁄1, 1⁄7, 1⁄6, 1⁄5, 1⁄4, 2⁄7, 1⁄3, 2⁄5, 3⁄7, 1⁄2, 4⁄7, 3⁄5, 2⁄3, 5⁄7, 3⁄4, 4⁄5, 5⁄6, 6⁄7, 1⁄1}
F(8) = {0⁄1, 1⁄8, 1⁄7, 1⁄6, 1⁄5, 1⁄4, 2⁄7, 1⁄3, 3⁄8, 2⁄5, 3⁄7, 1⁄2, 4⁄7, 3⁄5, 5⁄8, 2⁄3, 5⁄7, 3⁄4, 4⁄5, 5⁄6, 6⁄7, 7⁄8, 1⁄1}

Farey sequences have plenty of mysterious properties. For example, in 1924 J. Franel and Edmund Landau proved that an asymptotic density result about Farey sequences is equivalent to the Riemann hypothesis.
More precisely, let a(n) be the number of terms in the Farey sequence F(n) (that is, a(1)=2,a(2)=3,…,a(8)=23 etc. This is sequence A005728 in the online integer sequences catalog).
Let $F(n)_j $ denote the j-th term in F(n), then the following conjecture is equivalent to the Riemann hypothesis

For every $\epsilon > 0 $ there is a constant C depending on $\epsilon $ such that

$\sum_{j=1}^{a(n)} | F(n)_j – \frac{j}{a(n)} | < C n^{\frac{1}{2}+\epsilon} $

when n goes to infinity. Anyway, let us continue our construction. Farey sequences are clearly symmetric around 1/2 so let us just take half of them, so we jump to 1 when we have reached 1/2. Let us extend this halved Farey on both sides with $\infty $ and call it the modified Farey sequence f(n). For example,

$f(3) = {~\infty,0,\frac{1}{3},\frac{1}{2},1,\infty } $

Now consider the Farey code in which we identify the two sides connected to $\infty $ and mark two consecutive Farey numbers as

[tex]\xymatrix{f(n)_i \ar@{-}[r]_{\bullet} & f(n)_{i+1}}[/tex]

That is, the Farey code associated to the modified sequence f(3) is

[tex]\xymatrix{\infty \ar@{-}[r]_{1} & 0 \ar@{-}[r]_{\bullet} & \frac{1}{3} \ar@{-}[r]_{\bullet} & \frac{1}{2} \ar@{-}[r]_{\bullet} & 1 \ar@{-}[r]_{1} & \infty}[/tex]

Recall from earlier that to a Farey-code we can associate a special polygon by first taking the hyperbolic convex hull of all the terms in the sequence (the region bounded by the vertical lines and the bottom red circles in the picture on the left) and adding to it for each odd interval [tex]\xymatrix{f(n)_i \ar@{-}[r]_{\bullet} & f(n)_{i+1}}[/tex] the triangle just outside the convex hull consisting of two odd edges in the Dedekind tessellation (then we obtain the region bounded by the black geodesics for the sequence f(3)).

Next, we can associate to this special polygon a cuboid tree diagram by considering all even and odd vertices on the boundary (which are tinted red, respectively blue) together with all odd vertices in the interior of the special polygon. These are indicated in the left picture below. If we connect these vertices with the geodesics in the polygon we get a cuboid tree diagram. The obtained cuboid tree diagram is depicted on the right below.

Finally, identifying the red points (as they lie on geodesics connected to $\infty $ which are identified in the Farey code), adding even points on the remaining geodesics and numbering the obtained half-lines we obtain the dessin d’enfant given on the left hand side. To such a dessin we can associate its monodromy group which is a permutation group on the half-lines generated by an order two element indicating which half-lines make up a line and an order three element indicating which half-lines one encounters by walking counter-clockwise around a three-valent vertex. For the dessin on the left the group is therefore the subgroup of $S_{12} $ generated by the elements

$\alpha = (1,2)(3,4)(5,6)(7,8)(9,10)(11,12) $

$\beta = (1,2,3)(4,5,7)(8,9,11) $

and a verification with GAP tells us that this group is the sporadic Mathieu group $M_{12} $. This concludes the description of the second member of the Iguanodon series. If you like to check that the first 8 iguanodons are indeed the simple groups

$L_2(7), M_{12}, A_{16}, M_{24}, A_{28}, A_{40}, A_{48}, A_{60}, \ldots $

the following dissection of the Iguanodon may prove useful

9 Comments

Iguanodon series of simple groups

Published November 7, 2007 by lievenlb

Bruce Westbury has a page on recent work on series of Lie groups including exceptional groups. Moreover, he did put his slides of a recent talk (probably at MPI) online.

Probably, someone considered a similar problem for simple groups. Are there natural constructions leading to a series of finite simple groups including some sporadic groups as special members ? In particular, does the following sequence appear somewhere ?

$L_2(7), M_{12}, A_{16}, M_{24}, A_{28}, A_{40}, A_{48}, A_{60}, \ldots $

Here, $L_2(7) $ is the simple group of order 168 (the automorphism group of the Klein quartic), $M_{12} $ and $M_{24} $ are the sporadic Mathieu groups and the $A_n $ are the alternating simple groups.

I’ve stumbled upon this series playing around with Farey sequences and their associated ‘dessins d’enfants’ (I’ll come back to the details of the construction another time) and have dubbed this sequence the Iguanodon series because the shape of the doodle leading to its first few terms

reminded me of the Iguanodons of Bernissart (btw. this sketch outlines the construction to the experts). Conjecturally, all groups appearing in this sequence are simple and probably all of them (except for the first few) will be alternating.

I did verify that none of the known low-dimensional permutation representations of other sporadic groups appear in the series. However, there are plenty of similar sequences one can construct from the Farey sequences, and it would be nice if one of them would contain the Conway group $Co_1 $. (to be continued)

4 Comments