List of basic discrete mathematics topics
From Wikipedia, the free encyclopedia
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. Most, if not all, of the objects studied in finite mathematics are 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, while discrete mathematics courses emphasize concepts for computer science majors. For contrast, see continuum, topology, and mathematical analysis.
Included below are many of the standard terms used routinely in university-level courses and in research papers. This is not, however, intended as a complete list of mathematical terms; just a selection of typical terms of art that may be encountered.
Contents |
[edit] Essence of discrete mathematics
[edit] The discrete mathematics subjects
|
|
[edit] Discrete mathematical disciplines
For further reading in discrete mathematics, beyond a basic level, see these pages. Many of these disciplines are closely related to computer science.
- Automata theory - Combinatorics - Combinatorial geometry - Computational geometry - Digital geometry - Discrete geometry - Graph theory - Mathematical logic - Combinatorial optimization - Set theory - Combinatorial topology - Number theory - Information theory - Game theory
[edit] Concepts in discrete mathematics
[edit] Sets
[edit] Functions
- Function - How to specify a function - Domain of a function - Codomain - Range of a function - Image (mathematics) - Injective function - Surjection - Bijection - Function composition - Partial function - Multivalued function - Binary function - Floor function - Sign function - Inclusion map - Pigeonhole principle - Relation composition - Permutations - Symmetry
[edit] Operations
[edit] Arithmetic
- Decimal - Binary numeral system - Divisor - Division by zero - Indeterminate form - Empty product - Euclidean algorithm - Fundamental theorem of arithmetic - Modular arithmetic - Successor function
[edit] Elementary algebra
- Left-hand side and right-hand side of an equation - Linear equation - Quadratic equation - Solution point - Arithmetic progression - Recurrence relation - Finite difference - Difference operator - Groups - Group isomorphism - Subgroups - Fermat's little theorem - Cryptography - Faulhaber's formula
[edit] Mathematical relations
|
[edit] Mathematical phraseology
- If and only if - Necessary and sufficient (Sufficient condition) - Distinct - Difference - Absolute value - Up to - Modulo - Characterization (mathematics) - Normal form - Canonical form - Without loss of generality - Vacuous truth - Contradiction, Reductio ad absurdum - Counterexample - Sufficiently large - Pons asinorum - Table of mathematical symbols - Contrapositive - Mathematical induction
[edit] Combinatorics
[edit] Probability
- Average - Expected value - Discrete random variable - Sample space - Events - Conditional Probability - Independence - Random variables
