By Carl B. Boyer, Uta C. Merzbach, Isaac Asimov
Boyer and Merzbach distill hundreds of thousands of years of arithmetic into this interesting chronicle. From the Greeks to Godel, the math is marvelous; the forged of characters is amazing; the ebb and movement of rules is all over the place obvious. And, whereas tracing the improvement of ecu arithmetic, the authors don't fail to remember the contributions of chinese language, Indian, and Arabic civilizations. surely, this is—and will lengthy remain—a vintage one-volume heritage of arithmetic and mathematicians who create it.
Read or Download A history of mathematics PDF
Similar science & mathematics books
There's no paintings in English that compares with this significant survey of arithmetic. Twenty leading topic parts in arithmetic are handled by way of their easy origins, and their subtle advancements, in twenty chapters via eighteen amazing Soviet mathematicians. every one quantity of the second one variation has been amended to incorporate the full index to the set.
This paintings reports abelian branched coverings of gentle complicated projective surfaces from the topological point of view. Geometric information regarding the coverings (such because the first Betti numbers of a gentle version or intersections of embedded curves) is expounded to topological and combinatorial information regarding the bottom house and department locus.
- Theta functions on Riemann surfaces
- Topics in harmonic analysis, related to the Littlewood-Paley theory
- SGA 1: Revetements etales et groupe fondamental
- Semigroups (Translations of Mathematical Monographs 3)
Extra resources for A history of mathematics
Algebra 5 (1967), 342-357. [La] H. Laue, A graph theoretic proof of the fundamental trace identity, Discrete Math. 69 (1988), 197-198. [Le] J. S. Lew, The generalized Cayley—Hamilton theorem in n dimensions, Z. Angew. Math. Phys. 17 (1966), 650-653. [LeVi] M. Lewin and Y. Vitek, A system of gaps in the exponent set of primitive matrices, Dlinois J. Math. 25 (1981), 87-98. [Lol] L. Lov£sz, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory IT-25 (1979), 1-7. [Lo2] L. Lov£sz, An algorithmic theory of numbers, graphs and convexity, Soc.
Combinatorics 2 (1981), 17-20. [Br4] R. A. Brualdi, Matrices, eigenvalues, and directed graphs, Lin. Multilin. Alg. 11 (1982), 143-165. [Br5] R. A. Brualdi, Combinatorial verification of the elementary divisors of tensor products, Lin. Alg. Applies. 71 (1985), 31^47. [Br6] R. A. Brualdi, The Jordan canonical form: an old proof, Amer. Math. Monthly 94 (1987), 257-267. [BrGil] R. A. Brualdi and P. M. Gibson, The convex polyhedron of doubly stochastic matrices: I. Applications of the permanent function, J.
Assoc, of America (Washington), 1963. [Ry3] H. J. Ryser, An extension of a theorem of de Bruijn and Erdos on combinatorial designs, J. Algebra 10 (1968), 246-261. [SaSc] B. D. Saunders and H. Schneider, Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices, Discrete Math. 24 (1978), 205-220. [Se] A. Seress, On ^-designs with X = 2p, preprint. [Sh] J. Shao, On a conjecture about the exponent set of primitive matrices, Lin. Alg. Applies. 65 (1985), 91-123. [ShSi] S.