[The following is quoted at length from The Mathematical Experience, by Philip J. Davis & Reuben Hersh, pp. 285-287.]

Pólya's Craft of Discovery

George Pólya (1888-) has had a scientific career extending more than seven decades. A brilliant mathematician who has made fundamental contributions in many fields, Pólya has also been a brilliant teacher, a teacher's teacher, and an expositor. Pólya believes that there is a craft of discovery. He believes that the ability to discover and the ability to invent can be enhanced by skillful teaching which alerts the student to the principles of discovery and which gives him an opportunity to practice these principles.

In a series of remarkable books of great richness, the first of which was published in 1945, Pólya has crystallized these principles of discovery and inventioin out of his vast experience, and has shared them with us both in precept and in example. These books are a treasure-trove of strategy, know-how, rules of thumb, good advice, anecdote, mathematical history, together with problem after problem at all levels and all of unusual mathematical interest. Pólya places a global plan for "How to Solve It" in the endpapers of this book of that name:


you have to understand the problem.

find the connection between data and the unknown. You may be obliged to consider auxilliary problems if an immediate connection cannot be found. You should obtain eventually a plan of the solution.

Carry out your plan.

Examine the solution obtained.

These precepts are then broken down to "molecular" level on the opposite endpaper. There, individual strategies are suggested which might be called into play at appropriate moments, such as

Each of these heuristic principles is amplified by numerous appropriate examples.

Subsequent investigators have carried Pólya's ideas forward in a number of ways. A. H. Schoenfeld has made an interesting tabulation of the most frequently used heuristic principles in college-level mathematics. We have appended it here.



  1. Draw a diagram if at all possible.

  2. Examine special cases:
    1. Choose special values to exemplify the problem and get a "feel" for it.
    2. Examine limiting cases to explore the range of possibilities.
    3. Set any integer parameters equal to 1, 2, 3, ..., in sequence, and look for an inductive pattern.

  3. Try to simplify the problem by
    1. Exploiting symmetry, or
    2. "Without Loss of Generality" arguments (including scaling)


  1. Consider essentially equivalent problems:
    1. Replacing conditions by equivalent ones.
    2. Re-combining the elements of the problem in different ways.
    3. Introduce auxilliary elements.
    4. Re-formulate the problem by
      1. change of perspective or notation
      2. considering argument by contradiction or contrapositive
      3. assuming you have a solution, and determining its properties

  2. Consider slightly modified problems:
    1. Choose subgoals (obtain partial fulfillment of the conditions)
    2. Relax a condition and then try to re-impose it.
    3. Decompose the domain of the problem and work on it case-by-case.

  3. Consider broadly modified problems:
    1. Construct an analogous problem with fewer variables.
    2. Hold all but one variable fixed to determine that variable's impact.
    3. Try to exploit any related problems which have similar
      1. form
      2. "givens"
      3. conclusions.

Remember: when dealing with easier related problems, you should try to exploit both the result and the method of solution on the given problem.

Verifying Your Solution

  1. Does your solution pass these specific tests:
    1. Does it use all the pertinent data?
    2. Does it conform to reasonable estimates or predictions?
    3. Does it withstand tests of symmetry, dimension analysis, or scaling?

  2. Does it pass these general tests?
    1. Can it be obtained differently?
    2. Can it be substantiated by special cases?
    3. Can it be reduced to known results?
    4. Can it be used to generate something you know?

Transribed by Steve Hollasch, 1997, January 1