Discrete mathematics

From Example Problems
Jump to: navigation, search

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 includes :

Some applications: game theoryqueuing theorygraph theorycombinatorial geometry and combinatorial topologylinear programmingcryptography (including cryptology and cryptanalysis) — theory of computationanalysis of atonal music

See also

Reference and further reading =

Wikibooks has more about this subject:

bg:Дискретна математика de:Diskrete Mathematik es:Matemática discreta eo:Diskreta matematiko fa:ریاضی گسسته fr:Mathématiques discrètes he:מתמטיקה בדידה lt:Diskrečioji matematika nl:Discrete wiskunde ja:離散数学 pl:Matematyka dyskretna pt:Matemática discreta ru:Дискретная математика sk:Diskrétna matematika fi:Diskreetti matematiikka sv:Diskret matematik vi:Toán học rời rạc zh:离散数学