‎Compactness in General Spaces (+)Generalized ""Sandwich"" Theorems (+) Named and Faceless Values: An Initial Exploration in Memory of Prasanta C. Mahalanobis (+) Some Sèlected Quick and Easy Methods of Statistical Analysis (+) Correlation of Ranges of c... - [LARGE COLLECTION OF OFFPRINTS]‎

‎[Various places and printer] ,1945 - 1974. Collection of 24 offprint from various academic journals. All with wrappers (or as issued) and in fine condition. Contained in a black kassett.‎

‎A large collection of offprint by American physicist John Tukey known for development of the FFT algorithm and box plot. Tukey's range test, the Tukey lambda distribution, Tukey's test of additivity and Tukey's lemma all bear his name.""John Tukey's whole life was one of public service, and as the preceding quotes make clear, he had profound influence. He was a member of the President's Scientific Advisory Committee for each of Presidents Eisenhower, Kennedy, and Johnson. He was special in many ways. He merged the scientific, governmental, technological, and industrial worlds more seamlessly than, perhaps, anyone else in the 1900s. His scientific knowledge, creativity, experience, calculating skills, and energy were prodigious. He was renowned for creating statistical concepts and words. JWT's graduate work was in mathematics, but driven by World War II, he left that field to go on to revolutionize the world of the analysis of data. At the end of the war he began a joint industrial-academic career at Bell Telephone Laboratories and at Princeton University. Science and the analysis of data were ubiquitous. This split career continued until he retired in 1985. Even after retirement his technical and scientific work continued at a very high level.He is said to have introduced the terms: ""bit"", ""linear programming"", ""ANOVA"", ""Colonel Blotto"", and was first into print with ""software"". Of these efforts L. Hogben and M. Cartwright wrote, ""The introduction by Tukey of bits for binary digits has nothing but irresponsible vulgarity to commend it."" Tukey's word ""polykay"" was described as ""linguistic miscegenation"" by Kendall and Stuart because of its combining a Greek prefix with a Latin suffix. JWT did it again later with ""polyspectrum"". (Brillinger, John Wilder Tukey).‎

‎Some Notes on the Separation of Convex Sets.‎

‎Lisboa, R. Almirante Pessinha, 1942. 8vo. In the original grey printed wrappers. Offprint from: ""Portugaliae Mathematica"", Vol 3, 1942. Very fine and clean. Pp. 95-102‎

‎Offprint of Tukey's paper on the pathology of convex sets.‎

‎Théorie électromagnétique de la lumière‎

‎Paris, A.Hermann 1892 xvi + 157pp., 25cm., br.orig., qqs.rousseurs (surtout aux tranches et à la couverture), bon état, [Ouvrage traduit de l'allemand, la traduction française est enrichie d'additions faites par l'auteur], W82138‎

‎Number theory and analysis. A collection of papers in honor of Edmund Landau, 1877 - 1938.‎

‎ New York - Berlin, Plenum Press - Veb Deutscher Verlag der Wissenschaften 1969, 250x170mm, 355pages, editor's binding. Book in good condition.‎

‎Introduction élémentaire a la Géometrie Lobatschewskienne. Ouvrage posthume, publié d'apres les notes de l'auteur.‎

‎Genéve et Paris, 1914. Orig. printed wrappers. 170 pp. Clean and fine.‎

‎The original printing.‎

‎La machine de Turing - Collection Points Sciences n°131.‎

‎Seuil. 1999. In-12. Broché. Bon état, Couv. convenable, Dos satisfaisant, Intérieur frais. 174 pages.. . . . Classification Dewey : 510-Mathématiques‎

‎Collection Points Sciences n°131 - traduit de l'anglais par Julien Basch et Patrice Blanchard. Classification Dewey : 510-Mathématiques‎

‎A Method for the Calculation of the Zeta-Function. [Received 7 March, 1939. - Read 16 March, 1939]. [In: Proceedings of the London Mathematical Society. Second Series. Volume 48]. - [TURING'S FIRST WORK ON THE ZETA-FUNCTION]‎

‎London, Hodgson & Son, 1945. Royal8vo. In a recent nice green full cloth binding with gilt lettering to spine. Entire volumes 48 of ""Proceedings of the London Mathematical Society. Second Series"". A very nice and clean copy without any institutional stamps. Pp. 180-197. [Entire volume: (4),477 pp.]‎

‎First printing of Turing's first published paper devoted to the Riemann-zeta function, the basis for his famous ""Zeta-function Machine"", a foundation for the digital computer.While working on his Ph.D.-thesis, Turing was concerned with a few other subjects as well, one of them seemingly having nothing to do with logic, namely that of analytic number theory. The problem that Turing here took up was that of the famous Riemann Hypothesis, more precisely the aspect of it that concerns the distribution of prime numbers. This is the problem that Hilbert in 1900 listed as one of the most important unsolved problems of mathematics. Turing began investigating the zeros of the Rieman zeta-function and certain of its consequences. The initial work on this was never published, though, but nevertheless he continued his work. ""Turing had ideas for the design of an ""analogue"" machine for calculating the zeros of the Riemann zeta-function, similar to the one used in Liverpool for calculating the tides."" (Herken, The Universal Turing Machine: A Half-Century Survey, p. 110). Having worked on the zeta-function since his Ph.D.-thesis but never having published anything directly on the topic, Turing began working as chief cryptanalyst during the Second World War and thus postponed this important work till after the war. Thus, it was not until 1945 that he was actually able to publish his first work on this most important subject, namely the work that he had presented already in 1939, the groundbreaking ""A Method for the Calculation of the Zeta-Function"", which constitutes his first printed contribution to the subject.""After the publication of his paper ""On computable Numbers,"" Turing had begun investigating the Riemann zeta-function calculation, an aspect of the Riemann hypothesis concerning the distribution of prime numbers... Turing's work on this problem was interrupted by World War II, but in 1950 he resumed his investigations with the aid of the Manchester University Mark I [one of the earliest general purpose digital computers]..."" (Origins of Cyberspace p. 468).Not in Origins of Cyberspace (on this subject only having his 1953-paper - No. 938).‎

‎Computability and Lambda-Definability. (Extracted from The Journal of Sybolic Logic, Volume 2, 1937, pp.153-64.).‎

‎1937. 8vo. Bound in recent marbled boards. Title-page for volume 2 of Journal of Symbolic Logic withbound.‎

‎First edition of Turing's important paper, in which he links Kleene's recursive functions, Church's lambda-definable functions and his own computable functions and proves them to be identical. In the appendix of his milestone-paper ""On Computable Numbers"" from 1936, Turing gave a short outline of a method for proving that his notion of computability is equivalent with Alonzo Church's notion of lambda-definabilty. It was not until the present article, however, that it was proved that Steven Kleene's general recursive functions, Church's lambda-definable functions and Turing's computable functions were all identical. Kleene had already proved that every general recursive function is lambda-definable, so by showing that computability follows from lambda-definability and that general recursiveness follows from computability, Turing had ended the circle, which was a primary reason for its acceptance as a notion of ""effective calculable"" demanded by Hilbert's Entscheidungsproblem.""The purpose of the present paper is to show that the computable functions introduced by the author (in ""On computable numbers"") are identical with the lambda-definable functions of Church and the general recursive functions due to Herbrand and Gödel and developed by Kleene."" Turing wrote this paper while at Princeton studying with Church.""(Hook and Norman No. 395)‎

‎Rounding-off Errors in Matrix Processes. - [TURING'S LU FACTORIZATION]‎

‎Oxford, Clarendon Press, 1948. 8vo. Bound in contemporary full calf with gilt lettering to spine. In ""The Quarterly Journal of Mechanics and Applied Mathematics"", Vol. 1, 1948. Previous owner's name written to front free-endpaper. Ver fine and clean. Pp. 287-380. [Entire volume: (4), 474 pp.].‎

‎First printing of this important paper in which Turing for the very first time introduced the concept of LU factorization or LU decomposition. ""Turing's paper was one of the earliest attempts to examine the error analysis of the various methods of solving linear equations and inverting matrices. His analysis was basically sound. The main importance of the paper was that it was published at the dawn of the modern computing era, and it gave indications of which methods were 'safe' when solving such problems on a computer"". (Burgoyne, Collected Works of A M Turing).""In 1945, [Turing] declined an offer of a Fellowship at King's [College, Cambridge] in favour of joining the newly formed Mathematical Division at the National Physical Laboratory (NPL). His early work on computability, combined with his wartime experience in electronics, had fired him with an enthusiasm for working on the design of an electronic computer. ethe machine he designed, which was called the Automatic Computing Engine (ACE) in recognition of Babbage's pioneering work, was characteristically original…""While in the Mathematics Division of NPL, Turing became keenly interested in numerical analysis. His paper, ""Rounding-off Errors in Matrix Processes"", showed that the acute anxiety about the effect of rounding errors in Gaussian elimination was largely unjustified. This paper has been overshadowed to some extent by the von Neumann and Goldstine paper on matrix inversion, but it is a brilliant piece of work and would have repaid closer study at the time"". (""Turing, Alan M."" by James H. Wilkinson, p. 1803, in Encyclopedia of Computer Science, A. Ralston et al (eds.), 4th edition, Nature Publishing Group, 2000).In linear algebra, LU decomposition factorizes a matrix as the product of a lower triangular matrix and an upper triangular matrix. LU decomposition is a key step in several fundamental numerical algorithms in linear algebra such as solving a system of linear equations, inverting a matrix, or computing the determinant of a matrix. Not in Origins of Cyberspace nor The Erwin Tomash Library. ‎

‎Systems of Logic based on Ordinals. [Received 31 May, 1938. - Read 16 June, 1938.]. [In: Proceedings of the London Mathematical Society. Second Series. Volume 45]. - [TURING'S PH.D.-THESIS]‎

‎London, Hodgson & Son, 1939. Royal8vo. In a recent nice red full cloth binding with gilt lettering to spine. Entire volume 45 of ""Proceedings of the London Mathematical Society. Second Series"". Small white square paper label pasted on to lower part of spine, covering year of publication stating: ""A Gift / From /Anna Wheeler"". A very nice and clean copy without any institutional stamps. Pp. 161-240. [Entire volume: (4), 475 pp.].‎

‎The rare first printing of Turing's Ph.D.-thesis, which ""opened new fields of investigation in mathematical logic"". This seminal work constitutes the first systematic attempt to deal with the Gödelian incompleteness theorem as well as the introduction to the notion of relative computing. After having studied at King's College at Cambridge from 1931 to 1934 and having been elected a fellow here in 1935, Turing, in 1936 wrote a work that was to change the future of mathematics, namely his seminal ""On Computable Numbers"", in which he answered the famous ""Entscheidungsproblem"", came up with his ""Universal Machine"" and inaugurated mechanical and electronic methods in computing. This most famous theoretical paper in the history of computing caught the attention of Church, who was teaching at Princeton, and in fact he gave to the famous ""Turing Machine"" its name. It was during Church's work with Turing's paper that the ""Church-Turing Thesis"" was born. After this breakthrough work, Newman, under whom Turing had studied at Cambridge, urged him to spend a year studying with Church, and in September 1936 he went to Princeton. It is here at Princeton, under the guidance of Church, that Turing in 1938 finishes his thesis [the present paper] and later the same year is granted the Ph.D. on the basis of it. The thesis was published in ""Proceedings of the London Mathematical Society"" in 1939, and after the publication of it, Turing did no more on the topic, leaving the actual breakthroughs to other generations. In his extraordinary Ph.D.-thesis Turing provides an ingenious method of proof, in which a union of systems prove their own consistency, disproving, albeit shifting the problem to even more complicated matters, Gödel's incompleteness theorem. It would be many years before the ingenious arguments and striking partial completeness result that Turing obtained in the present paper would be thoroughly investigated and his line of research continued. The present thesis also presents other highly important proofs and hypotheses that came to influence several branches of mathematics. Most noteworthy of these is the idea that was later to change the face of the general theory of computation, namely the attempt to produce an arithmetical problem that is not number-theoretical (in his sense). Turing's result is his seminal ""o-machines"""" he here introduces the notion of relative computing and augments the ""Turing Machines"" with so-called oracles (""o""), which allowed for the study of problems that could not be solved by the Turing machine. Turing, however, made no further use of his seminal o-machine, but it is that which Emil Post used as the basis for his theory of ""Degrees of Unsolvability"", crediting Turing with the result that for any set of natural numbers there is another of higher degree of unsolvability. This transformed the notion of computability from an absolute notion into a relative one, which led to entirely new developments and in turn to vastly generalized forms of recursion theory. ""In 1939 Turing published ""Systems of Logic Based on Ordinals,""... This paper had a far-reaching influence"" in 1942 E.L. Post drew upon it for one of his theories for classifying unsolvable problems, while in 1958 G. Kreisel suggested the use of ordinal logics in characterizing informal methods of proof. In the latter year S. Feferman also adapted Turing's ideas to use ordinal logics in predicative mathematics."" (D.S.B. XIII:498). A part from these groundbreaking points, which Turing never returned to himself, he here also considers intuition versus technical ingenuity in mathematical reasoning, does so in an interesting and provocative manner and comes to present himself as one of the most important thinkers of modern mathematical as well as philosophical logic.""Turing turned to the exploration of the uncomputable for his Princeton Ph.D. thesis (1938), which then appeared as ""Systems of Logic based on Ordinals"" (Turing 1939). It is generally the view, as expressed by Feferman (1988), that this work was a diversion from the main thrust of his work. But from another angle, as expressed in (Hodges 1997), one can see Turing's development as turning naturally from considering the mind when following a rule, to the action of the mind when not following a rule. In particular this 1938 work considered the mind when seeing the truth of one of Gödel's true but formally unprovable propositions, and hence going beyond rules based on the axioms of the system. As Turing expressed it (Turing 1939, p. 198), there are 'formulae, seen intuitively to be correct, but which the Gödel theorem shows are unprovable in the original system.' Turing's theory of 'ordinal logics' was an attempt to 'avoid as far as possible the effects of Gödel's theorem' by studying the effect of adding Gödel sentences as new axioms to create stronger and stronger logics. It did not reach a definitive conclusion.In his investigation, Turing introduced the idea of an 'oracle' capable of performing, as if by magic, an uncomputable operation. Turing's oracle cannot be considered as some 'black box' component of a new class of machines, to be put on a par with the primitive operations of reading single symbols, as has been suggested by (Copeland 1998). An oracle is infinitely more powerful than anything a modern computer can do, and nothing like an elementary component of a computer. Turing defined 'oracle-machines' as Turing machines with an additional configuration in which they 'call the oracle' so as to take an uncomputable step. But these oracle-machines are not purely mechanical. They are only partially mechanical, like Turing's choice-machines. Indeed the whole point of the oracle-machine is to explore the realm of what cannot be done by purely mechanical processes...Turing's oracle can be seen simply as a mathematical tool, useful for exploring the mathematics of the uncomputable. The idea of an oracle allows the formulation of questions of relative rather than absolute computability. Thus Turing opened new fields of investigation in mathematical logic. However, there is also a possible interpretation in terms of human cognitive capacity."" (SEP).Following an oral examination in May, in which his performance was noted as ""Excellent,"" Turing was granted his PhD in June 1938.‎

‎A formal theorem in Church s theory of types (+) The use of dots as brackets in Church's system. (In: ""The Journal Of Symbolic Logic""). - [TURING ON CHURCH'S TYPE THEORY]‎

‎(No place), The Association for Symbolic Logic, 1942. Large 8vo. Bound in blue half cloth with silver lettering to spine. In ""Journal of Symbolic Logic"", Volume 7. Small paper label to lower part of spine and upper inner margin of front board. Stamp to title-page and last leaf, otherwise internally fine. Pp. 28-33"" 146-156 (Entire copy: (4), 180 pp.).‎

‎First appearance of these two paper's by Turing.Turing's paper ""A Formal Theorem in Church's Theory of Types"" is a significant contribution to the fields of computer science and mathematical logic. By providing a formal proof within Church's theory, Turing expanded our understanding of computation and its relationship to logic. His work on computability and the theory of types laid the foundation for the development of theoretical computer science, proof theory, and automated reasoning. Turing's paper continues to be a landmark in the study of computation, inspiring further research and practical applications in diverse areas of science and technology. In ""The Use of Dots as Brackets in Church's System"", introducing the dot parentheses notation, Turing simplified the representation and manipulation of lambda calculus expressions, making them more intuitive and manageable. His work highlighted the relationship between syntax and semantics, laying the foundation for further research in formal semantics and the development of programming languages. Turing's paper continues to be influential, shaping the way complex expressions are represented and reasoned about in the fields of computation, formal systems, and logic.‎

‎A Formal Theorem in Church's Theory of Types (+) Practical forms of type theory‎

‎(No place), The Association for Symbolic Logic, 1942, 1943 &1948. Lev8vo. Bound in two uniform red half cloth with gilt lettering to spine. In ""Journal of Symbolic Logic"", Volume 7, 8 [Bound together] & 13.. Barcode label pasted on to back board. Small library stamp to lower part of 6 pages. Minor scratches to extremities of volume 13. A fine set. Pp. 28-33" Pp. 80-94. [Entire volumes: IV, 164 pp." IV, 236 pp.).‎

‎First printing of the two important - but often overlooked - papers by Turing which provide ""information about Turing's thoughts on the logical foundations of mathematics which is not to be found elsewhere in his writings"". (Copeland, The Essential Turing, P. 206). ‎

‎James Gregory Tercentenary memorial Volume. Containing his Correspondance with John Collins and his hitherto unpublished mathematical Manuscripts, together with Addresses and Essays communicated to the Royal Society of Edinburgh, July 4, 1938.‎

‎London, G. Bell & Sons, 1939. Royal8vo. Orig. full cloth. Portrait. XII,524 pp., 4 plates, textdiagrams.‎

‎First edition.‎

‎The Theory of Determinants, Matrices, and Invariants. Third Edition.‎

‎ New York, Dover Publications, Inc. 1960, 205x135mm, XVIII - 374pages, paperback. Book in good condition.‎

‎An Introduction to the Theory of Canonical Matrices.‎

‎London a. Glasgow, 1932. Orig. full cloth. XIII,192 pp.‎

‎Introduction to Partial Differential Equations - A Computational Approach , Texts in Applied Mathematics, volume 29‎

‎Springer-Verlag - Springer , Texts in Applied Mathematics Malicorne sur Sarthe, 72, Pays de la Loire, France 2005 Book condition, Etat : Très Bon hardcover, editor's yellow printed binding, title in blue grand In-8 1 vol. - 407 pages‎

‎69 illustrations 1st edition, 2005 Contents, Chapitres : Series Preface, Preface, Contents, xv, Text, 392 pages - Setting the scene - Two-point boundary value problems - The heat equation - Finite difference schemes for the heat equation - The wave equation - Maximum principles - Poisson's equation in two space dimensions - Orthogonality and general Fourier series - Convergence of Fourier series - The heat equation revisited - Reaction-diffusion equations - Applications of the Fourier transform - References and index fine copy, no markings‎

‎Introduction to the Mathematics of Inversion in Remote Sensing and Indirect Measurements.‎

‎New York, Dover Publ., 1996. Paperback. X, 242 pp.‎

‎ARITHMETIQUE ET SYSTEME METRIQUE - 1000 EXERCICES ET PROBLEMES DE CALCUL MENTAL ET DE CALCUL ECRIT CLASSES D'APRES UNE DIVISION MENSUELLE DES MATIERES DU PROGRAMME DU 18 JANVIER 1887 ET PRECEDES DU COURS ELEMENTAIRE D'ARITHMETIQUE DE SYSTEME METRIQUE ETC.‎

‎GEDALGE. 1923. In-12. Cartonné. Etat passable, Plats abîmés, Dos abîmé, Mouillures. 132 pages - quelques figures en noir et blanc dans le texte - traces de moisissures à l'intérieur de l'ouvrage sans réelle conséquence sur la lecture - manque coiffe en tête.. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎ARITHMETIQUE ET SYSTEME METRIQUE - 1000 EXERCICES ET PROBLEMES DE CALCUL MENTAL ET DE CALCUL ECRIT CLASSES D'APRES UNE DIVISION MENSUELLE DES MATIERES DU PROGRAMME DU 18 JANVIER 1887 ET PRECEDES DU COURS ELEMENTAIRE D'ARITHMETIQUE DE SYSTEME METRIQUE ET DE NOTIONS SUR LES PRINCIPALES FIGURES GEOMETRIQUES - 30 EDITION - OUVRAGE INSCRIT SUR LA LISTE DES LIVRES DONNES GRATUITEMENT DANS LES ECOLES MUNICIPALES DE LA VILLE DE PARIS - COURS ELEMENTAIRE. Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎ARITHMETIQUE ET SYSTEME METRIQUE 2400 EXERCICES ET PROBLEMES.‎

‎GEDALGE JEUNE 15 eme EDITION. 1892. In-4. Broché. Etat passable, Plats abîmés, Dos abîmé, Intérieur frais. 442 pages. Dos manquant. Couverture très abimée. Nombreuses illustrations en noir et blanc dans le texte. Ouvrage déboité.. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎D'après une division mensuelle des matières du programme du 27 juillet 1882 précédés du cours d'arithmétique et de système métrique et de notions usuelles de géométrie, de comptabilité, d'algèbre et de calcul mental. Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Arithmétique et système métrique - 2400 exerices et problèmes - Cours supérieur - 21e édition.‎

‎Gedalge Jeune. 1900. In-12. Cartonné. Etat d'usage, Couv. défraîchie, Dos satisfaisant, Papier jauni. 444 pages - annotation sur le 1er contre plat - coins frottés - quelques figures en noir et blanc dans le texte - quelques annotations à l'intérieur de l'ouvrage sans conséquence sur la lecture - étiquettte de librairie collée sur le 1er plat.. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎2400 exercices et problèmes classés d'après une division mensuelle des matières du programme du 27 juillet 1882 précédés du cours d'arithmétique et de système métrique et de notions usuelles de géométrie, de comptabilité, d'algèbre et de calcul mental. Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Arithmétique système métrique 1000 exercices problèmes de calcul mental & de calcul écrit - Cours élémentaire - Nouvelle édition.‎

‎Gedalge Jeune. non daté. In-12. Cartonné. Etat passable, Plats abîmés, Dos frotté, Intérieur acceptable. 132 pages - annotations au crayon à papier sur les contre plats et à l'intérieur de l'ouvrage - coins, tranches frottés - déchirures, manque, tâches sur les plats - page de titre absente.. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Vendu en l'état. Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Nouveau cours d'arithmétique appliquée et de dessin géométrique - Cours supérieur et classe de fin d'études cours professionels prépration au certificat d'études 2e partie.‎

‎Charles Lavauzelle et cie. 1946. In-8. Cartonné. Etat d'usage, Couv. partiel. décollorée, Dos satisfaisant, Papier jauni. 403 pages - nombreuses planches de figures en noir et blanc - nombreuses figures en noir et blanc dans le texte.. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎ Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Fixed Point Theory of Parametrized Equivariant Maps. Lectures Notes in Mathematics, 1343.‎

‎ Berlin, Heidelberg, New York, Tokyo, Springer-Verlag 1988, 240x165mm, 147pages, paperback. Book in good condition.‎

‎COURS D'ALGEBRE ELEMENTAIRE A L'USAGE DES CANDIDATS AUX DIVERS BREVETS DE L'ENSEIGNEMENT PRIMAIRE.‎

‎EMMANUEL VITTE. 1925. In-8. Cartonné. Etat d'usage, Couv. légèrement passée, Dos satisfaisant, Papier jauni. 359 pages - coins frottés - annotations sur la tranche en pied - quelques rousseurs sans conséquence sur la lecture .. . . . Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎Collection l'école libre. Classification Dewey : 372.7-Livre scolaire : mathématiques‎

‎ARITHMETIQUE ELEMENTAIRE.‎

‎Paul Privat.. 1877. In-12. Cartonnage d'éditeurs. Bon état, Couv. légèrement passée, Dos satisfaisant, Quelques rousseurs. 188 pages. Nombreuses illustrations en noir et blanc, dans le texte. Ecritures sur la 2nde de couverture et sur la page de garde. Tâches dans le texte.. . . . Classification Dewey : 510-Mathématiques‎

‎A l'usage des élèves de la congrégation du sauveur et de la sainte Vierge. Classification Dewey : 510-Mathématiques‎