George Pólya

George Pólya (December 13, 1887 - September 7, 1985, in Hungarian Pólya György) was a mathematician, who was born in Budapest, Hungary and died in Palo Alto, USA.

Related Topics:
December 13 - 1887 - September 7 - 1985 - Hungarian - Mathematician - Budapest - Hungary - Palo Alto - USA

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

He worked on a great variety of mathematical topics, including series, number theory, combinatorics, and probability.

Related Topics:
Series - Number theory - Combinatorics - Probability

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

In his later days, he spent considerable effort on trying to characterize the general methods that we use to solve problems, and to describe how problem-solving should be taught and learned. He wrote three books on the subject: How to Solve It, Mathematics of Plausible Reasoning Volume I: Induction and Analogy in Mathematics, and Mathematics of Plausible Reasoning Volume II: Patterns of Plausible Reasoning.

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

In How to Solve It, Pólya provides general heuristics for solving problems of all kinds, not simply mathematical ones. The book includes advice for teaching students mathematics and a mini-encyclopedia of heuristic terms. It was translated into several languages and has sold over a million copies. Russian physicist Zhores I. Alfyorov, (Nobel laureate in 2000) praised it, saying he was very pleased with Pólya's famous book.

Related Topics:
Heuristics - Physicist - Zhores I. Alfyorov - Nobel laureate - 2000

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

In 1976 The Mathematical Association of America established the George Pólya award for "for articles of expository excellence published in the College Mathematics Journal."

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

In Mathematics of Plausible Reasoning Volume I, Pólya discusses inductive reasoning in mathematics, by which he means reasoning from particular cases to the general rule. (He also includes a chapter on the technique called mathematical induction, but that technique is not his main theme.) In Mathematics of Plausible Reasoning Volume II, he discusses more general forms of inductive logic that can be used to roughly determine to what degree a conjecture (in particular, a mathematical conjecture) is plausible.

Related Topics:
Inductive reasoning - Mathematical induction - Inductive logic

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

Some quotes:

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

• How I need a drink, alcoholic of course, after the heavy chapters involving quantum mechanics. (This is a mnemonic for the first fourteen digits of ?, the lengths of the words are the digits)
• If you can't solve a problem, then there is an easier problem you can solve: find it.
 
George Pólya: Bibliography ►