  Encyclopedia > Discrete mathematics

Article Content

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 due to 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.

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

Discrete mathematics usually cover

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

Reference and Further reading

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia
 Search over one million articles, find something about almost anything!

Featured Article
 Fractals ... of fractal is that there are objects that one would like to call fractals but which do not satisfy all the properties above. For example, naturally occurring ...  