Get Math Help

GET TUTORING NEAR ME!

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

    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.

    History

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

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.