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

    P-problem

    P problems

    composite number problem | linear programming problem over the integers | marriage problem

    Statements

    The composite number problem is the determination of if for a given positive integer N, there exist positive integers m and n such that N = mn.

    The linear programming problem over the integers asks if there is a rational vector x such that the linear system of inequalities Ax>=b holds.

    The marriage problem asks, given n unmarried men and n unmarried women, along with a list of all male-female partners who would be willing to marry one another, if it is possible to arrange n marriages so that polygamy is avoided and everyone receives an acceptable spouse.

    Alternate description

    Is a given positive integer prime?

    History

    | composite number problem | linear programming problem over the integers | marriage problem status | proved P | proved P | proved P proof date | 2002 (23 years ago) | 1979 (46 years ago) | 1973 (52 years ago) provers | Manindra Agrawal | Neeraj Kayal | Nitin Saxena | Leonid Khachiyan | John Hopcroft | Richard Karp

    Associated equations

    P element P

    Ax>=b

    Common classes

    P problems | mathematical problems | solved mathematics problems

    Back to List | POWERED BY THE WOLFRAM LANGUAGE