Discrete mathematics
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Discrete_mathematics"
.

Discrete mathematics, also called finite mathematics, is the study of mathematical structures that are fundamentally discrete in the sense of not supporting or requiring the notion of continuity. Objects studied in discrete mathematics are largely countable sets such as integers, finite graphs, and formal languages.

Discrete mathematics has become popular in recent decades because of its applications to computer science. Concepts and notations from discrete mathematics are useful to study or describe objects or problems in computer algorithms and programming languages.

In some mathematics curricula, finite mathematics courses cover discrete mathematical concepts for business, whereas discrete mathematics courses emphasize concepts for computer science majors, and combinatorics and other specialized courses emphasize the mathematical theory.

For contrast, see continuum, topology, and mathematical analysis.

Discrete mathematics includes the following topics:

See also

conjunction and disjunction

content
Discrete mathematics portal

Applications

References and further reading

Wikibooks
Wikibooks has more on the topic of

Companion Web site: http://highered.mcgraw-hill.com/sites/0072880082/information_center_view0/

© jGames.co.uk 2007 (some content from Wikipedia under GDL ) !-- ValueClick Media 468x60 and 728x90 Banner CODE for jgames.co.uk -->
Your Ad Here