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

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.

Is a given positive integer prime?

| 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

P element P

Ax>=b

P problems | mathematical problems | solved mathematics problems