enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Hilbert's problems - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_problems

    Problems 1, 2, 5, 6, [g] 9, 11, 12, 15, 21, and 22 have solutions that have partial acceptance, but there exists some controversy as to whether they resolve the problems. That leaves 8 (the Riemann hypothesis ), 13 and 16 [ h ] unresolved, and 4 and 23 as too vague to ever be described as solved.

  3. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    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.

  4. Lists of unsolved problems - Wikipedia

    en.wikipedia.org/wiki/Lists_of_unsolved_problems

    List of unsolved problems may refer to several notable conjectures or open problems in various academic fields: Natural sciences, engineering and medicine [ edit ]

  5. Hilbert's sixteenth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_sixteenth_problem

    Hilbert's 16th problem was posed by David Hilbert at the Paris conference of the International Congress of Mathematicians in 1900, as part of his list of 23 problems in mathematics. [1] The original problem was posed as the Problem of the topology of algebraic curves and surfaces (Problem der Topologie algebraischer Kurven und Flächen).

  6. Millennium Prize Problems - Wikipedia

    en.wikipedia.org/wiki/Millennium_Prize_Problems

    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 can also find that solution quickly. Since the former describes the class of problems termed NP, while the latter describes P, the question is equivalent to asking whether all problems in NP are ...

  7. Kuratowski's closure-complement problem - Wikipedia

    en.wikipedia.org/wiki/Kuratowski's_closure...

    In point-set topology, Kuratowski's closure-complement problem asks for the largest number of distinct sets obtainable by repeatedly applying the set operations of closure and complement to a given starting subset of a topological space. The answer is 14. This result was first published by Kazimierz Kuratowski in 1922. [1]

  8. List of undecidable problems - Wikipedia

    en.wikipedia.org/wiki/List_of_undecidable_problems

    Hilbert's tenth problem: the problem of deciding whether a Diophantine equation (multivariable polynomial equation) has a solution in integers. Determining whether a given initial point with rational coordinates is periodic, or whether it lies in the basin of attraction of a given open set, in a piecewise-linear iterated map in two dimensions ...

  9. Open Problems in Mathematics - Wikipedia

    en.wikipedia.org/wiki/Open_Problems_in...

    First edition. Open Problems in Mathematics is a book, edited by John Forbes Nash Jr. and Michael Th. Rassias, published in 2016 by Springer (ISBN 978-3-319-32160-8).The book consists of seventeen expository articles, written by outstanding researchers, on some of the central open problems in the field of mathematics.