Get Math Help

GET TUTORING NEAR ME!

(800) 434-2582

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Home / Get Math Help

    Redfield-Pólya Theorem

    Statement

    The Pólya enumeration theorem is a very general theorem that allows the number of discrete combinatorial objects of a given type to be enumerated (counted) as a function of their order.

    Alternate names

    theorem that is not Burnside's | PET | Redfield-Pólya theorem

    History

    status | proved proof date | 1927 (97 years ago) provers | John Howard Redfield | George Pólya

    Classes

    solved mathematics problems | mathematics theorems

    Back to List | POWERED BY THE WOLFRAM LANGUAGE