Loading AI tools
Hungarian mathematician (1887–1985) From Wikipedia, the free encyclopedia
George Pólya (/ˈpoʊljə/; Hungarian: Pólya György, pronounced [ˈpoːjɒ ˈɟørɟ]; December 13, 1887 – September 7, 1985) was a Hungarian-American mathematician. He was a professor of mathematics from 1914 to 1940 at ETH Zürich and from 1940 to 1953 at Stanford University. He made fundamental contributions to combinatorics, number theory, numerical analysis and probability theory. He is also noted for his work in heuristics and mathematics education.[2] He has been described as one of The Martians,[3] an informal category which included one of his most famous students at ETH Zurich, John von Neumann.
George Pólya | |
---|---|
![]() George Pólya, before 1935 | |
Born | György Pólya December 13, 1887 |
Died | September 7, 1985 97) Palo Alto, California, U.S. | (aged
Nationality | Hungarian |
Citizenship | Hungarian Swiss (1918–1947) American (1947–)[1] |
Alma mater | Eötvös Loránd University |
Known for | Pólya–Szegő inequality How to Solve It Multivariate Pólya distribution Pólya conjecture Pólya enumeration theorem Landau–Kolmogorov inequality Pólya–Vinogradov inequality Pólya inequality Pólya–Aeppli distribution Pólya urn model Fueter–Pólya theorem Hilbert–Pólya conjecture Jordan–Pólya numbers |
Scientific career | |
Fields | Mathematics |
Institutions | ETH Zürich Stanford University |
Doctoral advisor | Lipót Fejér |
Doctoral students | Albert Edrei Hans Einstein Fritz Gassmann Albert Pfluger Walter Saxer James J. Stoker Alice Roth |
Pólya was born in Budapest, Austria-Hungary, to Anna Deutsch and Jakab Pólya, Hungarian Jews who had converted to Christianity in 1886.[4] Although his parents were religious and he was baptized into the Catholic Church upon birth, George eventually grew up to be an agnostic.[5] He received a PhD under Lipót Fejér in 1912, at Eötvös Loránd University.[6] He was a professor of mathematics from 1914 to 1940 at ETH Zürich in Switzerland and from 1940 to 1953 at Stanford University. He remained a Professor Emeritus at Stanford for the rest of his career, working on a range of mathematical topics, including series, number theory, mathematical analysis, geometry, algebra, combinatorics, and probability.[7] He was invited to speak at the ICM at Bologna in 1928,[8] at Oslo in 1936 and at Cambridge, Massachusetts, in 1950.
On September 7, 1985, Pólya died in Palo Alto, California, United States[9] due to complications of a stroke he suffered during that summer.
Early in his career, Pólya wrote with Gábor Szegő two influential problem books, Problems and Theorems in Analysis (I: Series, Integral Calculus, Theory of Functions and II: Theory of Functions. Zeros. Polynomials. Determinants. Number Theory. Geometry). Later in his career, he spent considerable effort to identify systematic methods of problem-solving to further discovery and invention in mathematics for students, teachers, and researchers.[10] He wrote five books on the subject: How to Solve It, Mathematics and Plausible Reasoning (Volume I: Induction and Analogy in Mathematics, and Volume II: Patterns of Plausible Inference), and Mathematical Discovery: On Understanding, Learning, and Teaching Problem Solving (volumes 1 and 2).
In How to Solve It, Pólya provides general heuristics for solving a gamut of problems, including both mathematical and non-mathematical problems. The book includes advice for teaching students of mathematics and a mini-encyclopedia of heuristic terms. It was translated into several languages and has sold over a million copies. The book is still used in mathematical education. Douglas Lenat's Automated Mathematician and Eurisko artificial intelligence programs were inspired by Pólya's work.
In addition to his works directly addressing problem solving, Pólya wrote another short book called Mathematical Methods in Science, based on a 1963 work supported by the National Science Foundation edited by Leon Bowden and published by the Mathematical Association of America (MAA) in 1977. As Pólya notes in the preface, Bowden carefully followed a tape recording of a course Pólya gave several times at Stanford in order to put the book together. Pólya notes in the preface "that the following pages will be useful, yet they should not be regarded as a finished expression."
There are three prizes named after Pólya, causing occasional confusion of one for another. In 1969 the Society for Industrial and Applied Mathematics (SIAM) established the George Pólya Prize, given alternately in two categories for "a notable application of combinatorial theory" and for "a notable contribution in another area of interest to George Pólya."[11]
In 1976 the Mathematical Association of America (MAA) established the George Pólya Award "for articles of expository excellence" published in the College Mathematics Journal.[12] In 1987 the London Mathematical Society (LMS) established the Pólya Prize for "outstanding creativity in, imaginative exposition of, or distinguished contribution to, mathematics within the United Kingdom."[13] In 1991, the MAA established the George Pólya Lectureship series.[14]
Stanford University has a Polya Hall named in his honor.[15]
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.