George Polya – författare

The definitive guide to mathematical problem solving, from one of the great teachers of the twentieth centuryGeorge Pólya's perennial bestseller has inspired generations around the world to think more clearly. Brilliantly showing how 'there is a grain of discovery in the solution of any problem', his strategies for mathematical problem-solving - from finding weak points to squeezing the data - will help get to the bottom of any puzzle.'A superb book on how to think fresh thoughts ... A walk inside Pólya's mind as he builds up maxims on how to comprehend a problem, how to build up a strategy, and then how to test it' David Bodanis, Guardian'Everyone should know the work of George Polya on how to solve problems' Marvin Minsky'A classic ... It is the outcome of careful and informed deliberation by one of the great teachers among the ranks of research mathematicians' Ian Stewart, author of Does God Play Dice?'Every prospective teacher should read it' E. T. Bell

A unique, heuristic approach to mathematical discovery and problem solvingThis combined edition of Mathematical Discovery: On Understanding, Learning and Teaching Problem Solving is unique among mathematics texts. Espousing a heuristic approach to mathematical problem solving, the text may be followed sequentially or according to instructors' individualized curricula. Beginning with a discussion of patterns and practical approaches to problem solving, the book then presents examples from various branches of math and science to help students discover how to solve problems on their own – an invaluable skill for the classroom and beyond.

This volume features a complete set of problems, hints, and solutions based on Stanford University's well-known competitive examination in mathematics. It offers students at both high school and college levels an excellent mathematics workbook. Filled with rigorous problems, it assists students in developing and cultivating their logic and probability skills. 1974 edition.

A guide to the practical art of plausible reasoning, this book has relevance in every field of intellectual activity. Professor Polya, a world-famous mathematician from Stanford University, uses mathematics to show how hunches and guesses play an important part in even the most rigorously deductive science. He explains how solutions to problems can be guessed at; good guessing is often more important than rigorous deduction in finding correct solutions. Vol. I, on Induction and Analogy in Mathematics, covers a wide variety of mathematical problems, revealing the trains of thought that lead to solutions, pointing out false bypaths, discussing techniques of searching for proofs. Problems and examples challenge curiosity, judgment, and power of invention.

A guide to the practical art of plausible reasoning, this book has relevance in every field of intellectual activity. Professor Polya, a world-famous mathematician from Stanford University, uses mathematics to show how hunches and guesses play an important part in even the most rigorously deductive science. He explains how solutions to problems can be guessed at; good guessing is often more important than rigorous deduction in finding correct solutions. Vol. II, on Patterns of Plausible Inference, attempts to develop a logic of plausibility. What makes some evidence stronger and some weaker? How does one seek evidence that will make a suspected truth more probable? These questions involve philosophy and psychology as well as mathematics.

The description for this book, Isoperimetric Inequalities in Mathematical Physics. (AM-27), will be forthcoming.

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.

"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text.One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." Mathematical Reviews (Review of the original hardcover edition)"The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya." Zentralblatt MATH (Review of the original hardcover edition)

Dieser Buchtitel ist Teil des Digitalisierungsprojekts Springer Book Archives mit Publikationen, die seit den Anfängen des Verlags von 1842 erschienen sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.

From the reviews: "The work is one of the real classics of this century; it has had much influence on teaching, on research in several branches of hard analysis, particularly complex function theory, and it has been an essential indispensable source book for those seriously interested in mathematical problems. These volumes contain many extraordinary problems and sequences of problems, mostly from some time past, well worth attention today and tomorrow. Written in the early twenties by two young mathematicians of outstanding talent, taste, breadth, perception, perseverence, and pedagogical skill, this work broke new ground in the teaching of mathematics and how to do mathematical research. (Bulletin of the American Mathematical Society)

From the reviews: "...In the past, more of the leading mathematicians proposed and solved problems than today, and there were problem departments in many journals. Polya and Szego must have combed all of the large problem literature from about 1850 to 1925 for their material, and their collection of the best in analysis is a heritage of lasting value. The work is unashamedly dated. With few exceptions, all of its material comes from before 1925. We can judge its vintage by a brief look at the author indices (combined). Let's start on the C's: Cantor, Caratheodory, Carleman, Carlson, Catalan, Cauchy, Cayley, Cesaro,...Or the L's: Lacour, Lagrange, Laguerre, Laisant, Lambert, Landau, Laplace, Lasker, Laurent, Lebesgue, Legendre,...Omission is also information: Carlitz, Erdos, Moser, etc."Bull.Americ.Math.Soc.

Dieser Buchtitel ist Teil des Digitalisierungsprojekts Springer Book Archives mit Publikationen, die seit den Anfängen des Verlags von 1842 erschienen sind. Der Verlag stellt mit diesem Archiv Quellen für die historische wie auch die disziplingeschichtliche Forschung zur Verfügung, die jeweils im historischen Kontext betrachtet werden müssen. Dieser Titel erschien in der Zeit vor 1945 und wird daher in seiner zeittypischen politisch-ideologischen Ausrichtung vom Verlag nicht beworben.