Binary Relation
A binary relation on a set A is a relation from A to itself.
Definition · Example · CSE Use →Definitions, examples and Computer Science applications for this mathematics subject.
A binary relation on a set A is a relation from A to itself.
Definition · Example · CSE Use →A binomial coefficient counts the ways to choose k objects from n without order.
Definition · Example · CSE Use →A combination selects objects without regard to order.
Definition · Example · CSE Use →An equivalence relation is reflexive, symmetric and transitive.
Definition · Example · CSE Use →The factorial of n is the product of all positive integers from 1 to n.
Definition · Example · CSE Use →The inclusion-exclusion principle counts a union by adding set sizes and subtracting overlaps.
Definition · Example · CSE Use →Mathematical induction proves a statement for all integers by establishing a base case and an inductive step.
Definition · Example · CSE Use →A partial order is a reflexive, antisymmetric and transitive relation.
Definition · Example · CSE Use →A permutation is an arrangement of objects in which order matters.
Definition · Example · CSE Use →The pigeonhole principle says that placing more objects than containers forces at least one container to hold multiple objects.
Definition · Example · CSE Use →A poset is a set together with a partial order relation.
Definition · Example · CSE Use →A recurrence relation defines terms of a sequence using earlier terms.
Definition · Example · CSE Use →A relation from A to B is any subset of the Cartesian product A × B.
Definition · Example · CSE Use →A sequence is an ordered list of values, often indexed by integers.
Definition · Example · CSE Use →Strong induction assumes all earlier cases up to n are true to prove the next case.
Definition · Example · CSE Use →