Encyclopedia  |   World Factbook  |   World Flags  |   Reference Tables  |   List of Lists     
   Academic Disciplines  |   Historical Timeline  |   Themed Timelines  |   Biographies  |   How-Tos     
Sponsor by The Tattoo Collection
Discrete mathematics
Main Page | See live article | Alphabetical index

Discrete mathematics

Discrete mathematics, sometimes 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. Most, if not all, of the objects studied in finite mathematics are countable sets, such as the integers.

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 express objects or problems in computer algorithms and programming languages. In some mathematics curricula, Finite Mathematics courses cover discrete mathematical concepts for business, while Discrete Mathematics courses emphasize concepts for computer science majors.

See also the list of basic discrete mathematics topics.

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

Discrete mathematics usually covers

Some applications: Game theory -- Queuing theory -- Graph theory -- combinatorial geometry and combinatorial topology -- Linear programming -- cryptography (including cryptology and cryptanalysis) -- theory of computation

Reference and further reading