This is a book of entertaining problems that can be solved through the use of algebra, problems with intriguing plots to excite the readers curiosity, amusing excursions into the history of mathematics, unexpected uses that algebra is put to in everyday affairs, and more. Algebra Can Be Fun has brought hundreds of thousands of youngsters into the fold of mathematics and its wonders. It is written in the form of lively sketches that discuss the multifarious (and exciting!) applications of algebra to the world about us. Here we encounter equations, logarithms, roots, progressions, the ancient and famous Diophantine analysis and much more. The examples are pictorial, vivid, often witty and bring out the essence of the matter at hand. There are numerous excursions into history and the history of algebra too. No one who has read this book will ever regard mathematics again in a dull light" Reviewers regard it as one of the finest examples of popular science writing.

This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. To ensure a quality reading experience, this work has been proofread and republished using a format that seamlessly blends the original graphical elements with text in an easy-to-read typeface. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

17 essays selected from the magazine "Fantasy and science fiction."

Scientific Computing and Differential Equations: An Introduction to Numerical Methods, is an excellent complement to Introduction to Numerical Methods by Ortega and Poole. The book emphasizes the importance of solving differential equations on a computer, which comprises a large part of what has come to be called scientific computing. It reviews modern scientific computing, outlines its applications, and places the subject in a larger context. This book is appropriate for upper undergraduate courses in mathematics, electrical engineering, and computer science; it is also well-suited to serve as a textbook for numerical differential equations courses at the graduate level. * An introductory chapter gives an overview of scientific computing, indicating its important role in solving differential equations, and placing the subject in the larger environment * Contains an introduction to numerical methods for both ordinary and partial differential equations * Concentrates on ordinary differential equations, especially boundary-value problems * Contains most of the main topics for a first course in numerical methods, and can serve as a text for this course * Uses material for junior/senior level undergraduate courses in math and computer science plus material for numerical differential equations courses for engineering/science students at the graduate level

This classic undergraduate treatment examines the deductive method in its first part and explores applications of logic and methodology in constructing mathematical theories in its second part. Exercises appear throughout. Alfred Tarski, one of the greatest logicians of all time, is widely thought of as 'the man who defined truth'. His work on the concepts of truth and logical consequence as defined by mathematical theory are cornerstones of modern logic, influencing developments in mathematics, philosophy, linguistics, and computer science. His teaching on logic and mathematics culminated in the 1941 classic INTRODUCTION TO LOGIC, which uses the method of deduction and explores logic and methodology as it pertains to creating mathematical theories.

Computers And Thought by Edward A. Feigenbaum is a comprehensive book that explores the relationship between computers and human thought. The book delves into the history of computer science and artificial intelligence, and how these fields have impacted our understanding of human cognition. It also examines the ways in which computers have been used to model human thought processes, and how these models have been applied to various fields such as psychology, linguistics, and philosophy.Feigenbaum discusses the different approaches to artificial intelligence, including rule-based systems, expert systems, and neural networks. He also explores the limitations of these approaches and the challenges of creating truly intelligent machines. The book includes case studies of successful applications of artificial intelligence, such as the development of chess-playing programs and natural language processing systems.The author also addresses ethical and philosophical questions related to artificial intelligence, such as the possibility of machines surpassing human intelligence and the implications of this for society. He argues that while computers can simulate human thought processes, they cannot replicate the full range of human experience and consciousness.Overall, Computers And Thought is a thought-provoking and informative book that provides a comprehensive overview of the relationship between computers and human thought. It is a valuable resource for anyone interested in the history and future of artificial intelligence and its impact on society.This scarce antiquarian book is a facsimile reprint of the old original and may contain some imperfections such as library marks and notations. Because we believe this work is culturally important, we have made it available as part of our commitment for protecting, preserving, and promoting the world's literature in affordable, high quality, modern editions, that are true to their original work.

This set features Linear Algebra and Its Applications, Second Edition (978-0-471-75156-4) Linear Algebra and Its Applications, Second Edition presents linear algebra as the theory and practice of linear spaces and linear maps with a unique focus on the analytical aspects as well as the numerous applications of the subject. In addition to thorough coverage of linear equations, matrices, vector spaces, game theory, and numerical analysis, the Second Edition features student-friendly additions that enhance the book's accessibility, including expanded topical coverage in the early chapters, additional exercises, and solutions to selected problems. Beginning chapters are devoted to the abstract structure of finite dimensional vector spaces, and subsequent chapters address convexity and the duality theorem as well as describe the basics of normed linear spaces and linear maps between normed spaces. Further updates and revisions have been included to reflect the most up-to-date coverage of the topic, including: The QR algorithm for finding the eigenvalues of a self-adjoint matrix The Householder algorithm for turning self-adjoint matrices into tridiagonal form The compactness of the unit ball as a criterion of finite dimensionality of a normed linear space Additionally, eight new appendices have been added and cover topics such as: the Fast Fourier Transform; the spectral radius theorem; the Lorentz group; the compactness criterion for finite dimensionality; the characterization of commentators; proof of Liapunov's stability criterion; the construction of the Jordan Canonical form of matrices; and Carl Pearcy's elegant proof of Halmos' conjecture about the numerical range of matrices. Clear, concise, and superbly organized, Linear Algebra and Its Applications, Second Edition serves as an excellent text for advanced undergraduate- and graduate-level courses in linear algebra. Its comprehensive treatment of the subject also makes it an ideal reference or self-study for industry professionals. and Functional Analysis (978-0-471-55604-6) both by Peter D. Lax.

"In a bold and refreshingly informal style, this exciting text steers a middle course between elementary texts emphasizing connections with philosophy, logic, and electronic circuit design, and profound treatises aimed at advanced graduate students and professional mathematicians. It is written for readers who have studied at least two years of college-level mathematics. With carefully crafted prose, lucid explanations, and illuminating insights, it guides students to some of the deeper results of Boolean algebra-and in particular to the important interconnections with topology-without assuming a background in algebra, topology, and set theory. The parts of those subjects that are needed to understand the material are developed within the text itself." "Highlights of the book include the normal form theorem; the homomorphism extension theorem; the isomorphism theorem for countable atomless Boolean algebras; the maximal ideal theorem; the celebrated Stone representation theorem; the existence and uniqueness theorems for canonical extensions and completions; Tarski's isomorphism of factors theorem for (J'-algebras, and Hanf's related counterexamples; and an extensive treatment of the algebraictopological duality, including the duality between ideals and open sets, homomorphisms and continuous functions, subalgebras and quotient spaces, and direct products and Stone-Cech compactifications." A special feature of the book is the large number of exercises of varying levels of difficulty, from routine problems that help readers understand the basic definitions and theorems, to intermediate problems that extend or enrich material developed in the text, to harder problems that exploreimportant ideas either not treated in the text, or that go substantially beyond its treatment. Hints for the solutions to the harder problems are given in an appendix. A detailed solutions manual for all exercises is available for instructors who adopt the text for a course.

Elementary Methods in Number Theory begins with "a first course in number theory" for students with no previous knowledge of the subject. The main topics are divisibility, prime numbers, and congruences. There is also an introduction to Fourier analysis on finite abelian groups, and a discussion on the abc conjecture and its consequences in elementary number theory. In the second and third parts of the book, deep results in number theory are proved using only elementary methods. Part II is about multiplicative number theory, and includes two of the most famous results in mathematics: the Erdös-Selberg elementary proof of the prime number theorem, and Dirichlets theorem on primes in arithmetic progressions. Part III is an introduction to three classical topics in additive number theory: Warings problems for polynomials, Liouvilles method to determine the number of representations of an integer as the sum of an even number of squares, and the asymptotics of partition functions. Melvyn B. Nathanson is Professor of Mathematics at the City University of New York (Lehman College and the Graduate Center). He is the author of the two other graduate texts: Additive Number Theory: The Classical Bases and Additive Number Theory: Inverse Problems and the Geometry of Sumsets.

One Infinite Series and Infinite Sequences.- 1 Operations with Power Series.- Additive Number Theory, Combinatorial Problems, and Applications.- Binomial Coefficients and Related Problems.- Differentiation of Power Series.- Functional Equations and Power Series.- Gaussian Binomial Coefficients.- Majorant Series.- 2 Linear Transformations of Series. A Theorem of Cesàro.- Triangular Transformations of Sequences into Sequences.- More General Transformations of Sequences into Sequences.- Transformations of Sequences into Functions. Theorem of Cesàro.- 3 The Structure of Real Sequences and Series.- The Structure of Infinite Sequences.- Convergence Exponent.- The Maximum Term of a Power Series.- Subseries.- Rearrangement of the Terms.- Distribution of the Signs of the Terms.- 4 Miscellaneous Problems.- Enveloping Series.- Various Propositions on Real Series and Sequences.- Partitions of Sets, Cycles in Permutations.- Two Integration.- 1 The Integral as the Limit of a Sum of Rectangles.- The Lower and the Upper Sum.- The Degree of Approximation.- Improper Integrals Between Finite Limits.- Improper Integrals Between Infinite Limits.- Applications to Number Theory.- Mean Values and Limits of Products.- Multiple Integrals.- 2 Inequalities.- Inequalities.- Some Applications of Inequalities.- 3 Some Properties of Real Functions.- Proper Integrals.- Improper Integrals.- Continuous, Differentiate, Convex Functions.- Singular Integrals. Weierstrass' Approximation Theorem.- 4 Various Types of Equidistribution.- Counting Function. Regular Sequences.- Criteria of Equidistribution.- Multiples of an Irrational Number.- Distribution of the Digits in a Table of Logarithms and Related Questions.- Other Types of Equidistribution.- 5 Functions of Large Numbers.- Laplace's Method.- Modifications of the Method.- Asymptotic Evaluation of Some Maxima.- Minimax and Maximin.- Three Functions of One Complex Variable. General Part.- 1 Complex Numbers and Number Sequences.- Regions and Curves. Working with Complex Variables.- Location of the Roots of Algebraic Equations.- Zeros of Polynomials, Continued. A Theorem of Gauss.- Sequences of Complex Numbers.- Sequences of Complex Numbers, Continued: Transformation of Sequences.- Rearrangement of Infinite Series.- 2 Mappings and Vector Fields.- The Cauchy-Riemann Differential Equations.- Some Particular Elementary Mappings.- Vector Fields.- 3 Some Geometrical Aspects of Complex Variables.- Mappings of the Circle. Curvature and Support Function.- Mean Values Along a Circle.- Mappings of the Disk. Area.- The Modular Graph. The Maximum Principle.- 4 Cauchy's Theorem • The Argument Principle.- Cauchy's Formula.- Poisson's and Jensen's Formulas.- The Argument Principle.- Rouche's Theorem.- 5 Sequences of Analytic Functions.- Lagrange's Series. Applications.- The Real Part of a Power Series.- Poles on the Circle of Convergence.- Identically Vanishing Power Series.- Propagation of Convergence.- Convergence in Separated Regions.- The Order of Growth of Certain Sequences of Polynomials.- 6 The Maximum Principle.- The Maximum Principle of Analytic Functions.- Schwarz's Lemma.- Hadamard's Three Circle Theorem.- Harmonic Functions.- The Phragmén-Lindelöf Method.- Author Index.

Numerical linear algebra, digital signal processing, and parallel algorithms are three disciplines with a great deal of activity in the last few years. The interaction between them has been growing to a level that merits an Advanced Study Institute dedicated to the three areas together. This volume gives an account of the main results in this interdisciplinary field. The following topics emerged as major themes of the - Singular value and eigenvalue decompositions, including applications, - Toeplitz matrices, including special algorithms and architectures, - Recursive least squares in linear algebra, digital signal processing and control, - Updating and downdating techniques in linear algebra and signal processing, - Stability and sensitivity analysis of special recursive least squares problems, - Special architectures for linear algebra and signal processing. This book contains tutorials on these topics given by leading scientists in each of the three areas. A consider- able number of new research results are presented in contributed papers. The tutorials and papers will be of value to anyone interested in the three disciplines.

The author explores the ways in which games can be used to instruct and inform as well as provide pleasure. He uses innovative approaches to problem solving through individualized game techniques. Topics improving education with games; educational games for the physical and social sciences; games for the learning disadvantaged; games for occupational choice and training; games for planning and problem solving in government and industry; and the future of serious games. This book was originally published in 1970 by Viking Press.

Abstract In this chapter we provide an overview of probabilistic logic networks (PLN), including our motivations for developing PLN and the guiding principles underlying PLN. We discuss foundational choices we made, introduce PLN knowledge representation, and briefly introduce inference rules and truth-values. We also place PLN in context with other approaches to uncertain inference. 1.1 Motivations This book presents Probabilistic Logic Networks (PLN), a systematic and pragmatic framework for computationally carrying out uncertain reasoning – r- soning about uncertain data, and/or reasoning involving uncertain conclusions. We begin with a few comments about why we believe this is such an interesting and important domain of investigation. First of all, we hold to a philosophical perspective in which “reasoning” – properly understood – plays a central role in cognitive activity. We realize that other perspectives exist; in particular, logical reasoning is sometimes construed as a special kind of cognition that humans carry out only occasionally, as a deviation from their usual (intuitive, emotional, pragmatic, sensorimotor, etc.) modes of thought. However, we consider this alternative view to be valid only according to a very limited definition of “logic.” Construed properly, we suggest, logical reasoning may be understood as the basic framework underlying all forms of cognition, including those conventionally thought of as illogical and irrational.

1 Real Functions 2 Sequences and Series 3 Continuous Functions on Intervals 4 Differentiation 5 The Riemann Integral 6 Topology 7 Function Spaces 8 Differentiable Maps 9 Measures 10 Integration 11 Manifolds 12 Multilinear Algebra 13 Differential Forms 14 Integration on Manifolds

Computer scientists, mathematicians, and philosophers discuss the conceptual foundations of the notion of computability as well as recent theoretical developments. In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations into the foundations of mathematics. In the decades since, the theory of computability has moved to the center of discussions in philosophy, computer science, and cognitive science. In this volume, distinguished computer scientists, mathematicians, logicians, and philosophers consider the conceptual foundations of computability in light of our modern understanding.Some chapters focus on the pioneering work by Turing, Gödel, and Church, including the Church-Turing thesis and Gödel's response to Church's and Turing's proposals. Other chapters cover more recent technical developments, including computability over the reals, Gödel's influence on mathematical logic and on recursion theory and the impact of work by Turing and Emil Post on our theoretical understanding of online and interactive computing; and others relate computability and complexity to issues in the philosophy of mind, the philosophy of science, and the philosophy of mathematics.ContributorsScott Aaronson, Dorit Aharonov, B. Jack Copeland, Martin Davis, Solomon Feferman, Saul Kripke, Carl J. Posy, Hilary Putnam, Oron Shagrir, Stewart Shapiro, Wilfried Sieg, Robert I. Soare, Umesh V. Vazirani

Moritz Pasch (1843-1930) is justly celebrated as a key figure in the history of axiomatic geometry. Less well known are his contributions to other areas of foundational research. This volume features English translations of 14 papers Pasch published in the decade 1917-1926. In them, Pasch argues that geometry and, more surprisingly, number theory are branches of empirical science; he provides axioms for the combinatorial reasoning essential to Hilbert’s program of consistency proofs; he explores "implicit definition" (a generalization of definition by abstraction) and indicates how this technique yields an "empiricist" reconstruction of set theory; he argues that we cannot fully understand the logical structure of mathematics without clearly distinguishing between decidable and undecidable properties; he offers a rare glimpse into the mind of a master of axiomatics, surveying in detail the thought experiments he employed as he struggled to identify fundamental mathematical principles; and much more. This volume will: Give English speakers access to an important body of work from a turbulent and pivotal period in the history of mathematics, help us look beyond the familiar triad of formalism, intuitionism, and logicism, show how deeply we can see with the help of a guide determined to present fundamental mathematical ideas in ways that match our human capacities, will be of interest to graduate students and researchers in logic and the foundations of mathematics.

This book discusses some ways of doing mathematical work and the subject matter that is being worked upon and created. It argues that the conventions we adopt, the subject areas we delimit, what we can prove and calculate about the physical world, and the analogies that work for mathematicians--all depend on mathematics, what will work out and what won't. And the mathematics, as it is done, is shaped and supported, or not, by convention, subject matter, calculation, and analogy. The causes studied include the central limit theorem of statistics, the sound of the shape of a drum, the connection between algebra and topology, the stability of matter, the Ising model, and the Langlands Program in number theory and representation theory. Contents: Convention: How Means and Variances are Entrenched as Statistics; Subject: The Fields of Topology; Appendix: The Two-Dimensional Ising Model of a Ferromagner; Calculation: Strategy, Structure, and Tactics in Applying Classical Analysis; Analogy; A Syzygy Between a research Program in Mathematics and a Research Program in Physics, Each of Which is Itself an Analogy; Mathematics in Concreto. Readership: Mathematicians, Physicists, philosophers and historians of science.

A description of the historical development of mathematics with a brief survey of high points and trenchant influences, originally published in 1986 by Praeger. A remarkable bargain. Fascinating study considers the origins and nature of mathematics, its development and role in the history of scientific thinking, impact of high-speed computers, 20th-century changes in the foundations of mathematics and mathematical logic, mathematization of science and technology, much more. Compelling reading for mathematicians, physicists, students₇anyone interested in the evolution of mathematical thought. 34 illustrations. 1968 edition.

This book will be useful to anyone who wants to understand the use of quantum theory for the description of physical processes. It is a graduate level text, ideal for independent study, and includes numerous figures, exercises, bibliographical references, and even some computer programs. The first chapters introduce formal tools: the mathematics are precise, but not excessively abstract. The physical interpretation too is rigorous. It makes no use of the uncertainty principle of other ill-defined notions. The central part of the book is devoted to Bell's theorem and to the Kochen-Specker theorem. It is here that quantum phenomena depart most radically from classical physics. There has recently been considerable progress on these issues, and the latest developments have been included. The final chapters discuss further topics of current research: spacetime symmetries, quantum thermodynamics and information theory, semiclassical methods, irreversibility, quantum chaos, and especially the measuring process. In particular, it is shown how modern techniques allow the extraction of more information from a physical system than traditional measurement methods. For physicists, mathematicians and philosophers of science with an interest in the applications and foundations of quantum theory. The volume is suitable as a supplementary graduate textbook.

This book gives a remarkably fine account of the influences mathematics has exerted on the development of philosophy, the physical sciences, religion, and the arts in Western life.