**Grand Challenges, Past and Present**

The history of discrete mathematics has involved a number of challenging problems which have focused attention within areas of the field. In graph theory, much research was motivated by attempts to prove the four color theorem, first stated in 1852, but not proved until 1976 (by Kenneth Appel and Wolfgang Haken, using substantial computer assistance).

In logic, the second problem on David Hilbert's list of open problems presented in 1900 was to prove that the axioms of arithmetic are consistent. Gödel's second incompleteness theorem, proved in 1931, showed that this was not possible – at least not within arithmetic itself. Hilbert's tenth problem was to determine whether a given polynomial Diophantine equation with integer coefficients has an integer solution. In 1970, Yuri Matiyasevich proved that this could not be done.

The need to break German codes in World War II led to advances in cryptography and theoretical computer science, with the first programmable digital electronic computer being developed at England's Bletchley Park. At the same time, military requirements motivated advances in operations research. The Cold War meant that cryptography remained important, with fundamental advances such as public-key cryptography being developed in the following decades. Operations research remained important as a tool in business and project management, with the critical path method being developed in the 1950s. The telecommunication industry has also motivated advances in discrete mathematics, particularly in graph theory and information theory. Formal verification of statements in logic has been necessary for software development of safety-critical systems, and advances in automated theorem proving have been driven by this need.

Computational geometry has been an important part of the computer graphics incorporated into modern video games and computer-aided design tools.

Several fields of discrete mathematics, particularly theoretical computer science, graph theory, and combinatorics, are important in addressing the challenging bioinformatics problems associated with understanding the tree of life.

Currently, one of the most famous open problems in theoretical computer science is the P = NP problem, which involves the relationship between the complexity classes P and NP. The Clay Mathematics Institute has offered a $1 million USD prize for the first correct proof, along with prizes for six other mathematical problems.

Read more about this topic: Discrete Mathematics

### Other related articles:

... Mosley credits Lewis with helping him end approximately five years of homelessness in the 1990s ... Mosley describes the circumstances as follows "In 1996, Peter Lewis picked me up along the side of a San Diego freeway where I was living, to tell me a ruling by San Francisco Judge Garcia gave Moby Grape their name back ...

... it has been suggested for behavior management in youth with a variety of behavioral

**challenges,**including youth with bipolar disorder, attention deficit hyperactivity disorder (ADHD), Asperger's disorder, and conduct ...

... The final three designers - Sunny, Jessica and Jason - are given six months to construct a 12-piece collection for a runway show at Toronto's Fashion Week ... With eight weeks until the show, the designers are discouraged when mentor Brian criticizes their garments ...

### Famous quotes containing the words present and/or grand:

“We do not rest satisfied with the *present*.... So imprudent we are that we wander in the times which are not ours and do not think of the only one which belongs to us; and so idle are we that we dream of those times which are no more and thoughtlessly overlook that which alone exists. For the *present* is generally painful to us.”

—Blaise Pascal (1623–1662)

“We now come to the *grand* law of the system in which we are placed, as it has been developed by the experience of our race, and that, in one word, is SACRIFICE!”

—Catherine E. Beecher (1800–1878)