Search results
Results from the WOW.Com Content Network
Here’s another problem that’s very easy to write, but hard to solve. All you need to recall is the definition of rational numbers. Rational numbers can be written in the form p/q, where p and ...
Euler diagram for P, NP, NP-complete, and NP-hard set of problems (excluding the empty language and its complement, which belong to P but are not NP-complete) Main article: P versus NP problem The question is whether or not, for all problems for which an algorithm can verify a given solution quickly (that is, in polynomial time ), an algorithm ...
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
Solve 7th-degree equation using algebraic (variant: continuous) functions of two parameters. Unresolved. The continuous variant of this problem was solved by Vladimir Arnold in 1957 based on work by Andrei Kolmogorov (see Kolmogorov–Arnold representation theorem), but the algebraic variant is unresolved. [j] — 14th
Math is not everyone’s favorite, understandably. Hours of math homework and difficult equations can make anyone sour on the subject. But when math problems are outside of a school setting, there ...
For functions in certain classes, the problem of determining: whether two functions are equal, known as the zero-equivalence problem (see Richardson's theorem); [5] the zeroes of a function; whether the indefinite integral of a function is also in the class. [6] Of course, some subclasses of these problems are decidable.
The problem for graphs is NP-complete if the edge lengths are assumed integers. The problem for points on the plane is NP-complete with the discretized Euclidean metric and rectilinear metric. The problem is known to be NP-hard with the (non-discretized) Euclidean metric. [3]: ND22, ND23
Smale's problems is a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 [1] and republished in 1999. [2] Smale composed this list in reply to a request from Vladimir Arnold, then vice-president of the International Mathematical Union, who asked several mathematicians to propose a list of problems for the 21st century.