Search results
Results from the WOW.Com Content Network
The following articles contain lists of problems: List of philosophical problems; List of undecidable problems; Lists of unsolved problems; List of NP-complete problems;
In number theory, the Heegner theorem [1] establishes the complete list of the quadratic imaginary number fields whose rings of integers are principal ideal domains. It solves a special case of Gauss's class number problem of determining the number of imaginary quadratic fields that have a given fixed class number.
The problems in Arnold's Problems are each numbered with a year and a sequence number within the year. They include: 1956–1, the napkin folding problem, on whether a paper rectangle can be folded to a shape with larger perimeter than the rectangle; 1972–33, the Arnold conjecture, on the number of fixed points of a Hamiltonian diffeomorphism
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.
The choosability (or list colorability or list chromatic number) ch(G) of a graph G is the least number k such that G is k-choosable. More generally, for a function f assigning a positive integer f ( v ) to each vertex v , a graph G is f -choosable (or f -list-colorable ) if it has a list coloring no matter how one assigns a list of f ( v ...
Get answers to your AOL Mail, login, Desktop Gold, AOL app, password and subscription questions. Find the support options to contact customer care by email, chat, or phone number.
Get answers to your AOL Mail, login, Desktop Gold, AOL app, password and subscription questions. Find the support options to contact customer care by email, chat, or phone number.
The naming procedure for large numbers is based on taking the number n occurring in 10 3n+3 (short scale) or 10 6n (long scale) and concatenating Latin roots for its units, tens, and hundreds place, together with the suffix -illion. In this way, numbers up to 10 3·999+3 = 10 3000 (short scale) or 10 6·999 = 10 5994 (long scale