Discrete Mathematics Concept
(Redirected from Discrete Math Concept)
A Discrete Mathematics Concept is a mathematical concept for discrete math domain.
- Context:
- It can (typically) be the referent of a Discrete Math Term.
- It can (typically) be expressed in a Mathematical Language.
- …
- Counter-Example(s):
- See: Linear Programming Concept, Linear Algebra Textbook.
References
2015
- http://wikipedia.org/wiki/Outline_of_discrete_mathematics
- Absolute value; Algorithmics; Antisymmetric relation; Arithmetic progression; Associativity; Automata theory; Bijection; Bijective proof; Binary function; Binary numeral system; Binary operator; Binary relation; Canonical form; Cartesian product; Characterization (mathematics); Codomain; Combination; Combinatorial geometry; Combinatorial optimization; Combinatorial proof; Combinatorial topology; Combinatorics; Commutativity; Complement (set theory); Computability; Computational geometry; Conditional Probability; Congruence (geometry); Contradiction; Contrapositive; Counterexample; Counting; Cryptography; De Morgan's laws; Decimal; Difference operator; Digital geometry; Discrete geometry; Discrete random variable; Disjoint sets; Disjoint union; Distinct; Distributivity; Division by zero; Divisor; Domain of a function; Double counting (proof technique); Element (mathematics); Empty product; Empty set; Equality (mathematics); Equation; Equivalence class; Equivalence relation; Euclidean algorithm; Expected value; Extensionality; Factorial; Faulhaber's formula; Fermat's little theorem; Finite difference; Floor function; Function (mathematics); Function composition; Fundamental theorem of arithmetic; Game theory; Graph theory; Graphing equivalence; Group (mathematics); Group isomorphism; Identity (mathematics); Identity element; Identity function; If and only if; Image (mathematics); Inclusion map; Indeterminate form; Inequality (mathematics); Inequation; Information theory; Injective function; Intersection (set theory); Linear algebra; Linear equation; Logical operator; Markov chain; Mathematical induction; Mathematical logic; Mathematical proof; Mathematical relation; Modular arithmetic; Multiset; Multivalued function; Naive set theory; Necessary and sufficient; Normal form (mathematics); Number theory; Open sentence; Ordered pair; Partial function; Partially ordered set; Pascal's triangle; Permutation; Permutations and combinations; Permutations; Pigeonhole principle; Pons asinorum; Power set; Probability; Quadratic equation; Random variables; Range of a function; Recurrence relation; Reductio ad absurdum; Reflexive property of equality; Reflexive relation; Relation composition; Right-hand side of an equation; Sample space; Set (mathematics); Set theory; Sign function; Similarity (geometry); Simple theorems in the algebra of sets; Solution point; Subgroups; Subset; Substitution property of equality; Subtraction; Successor function; Sufficient condition; Sufficiently large; Surjection; Symmetric difference; Symmetric property of equality; Symmetric relation; Symmetry; Transitive closure; Transitive property of equality; Transitive relation; Truth table; Union (set theory); Uniqueness quantification; Up to; Vacuous truth; Venn diagram; Without loss of generality; complexity; computer science; digital topology;