Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Counting Basics: Set Theory and Permutations

Description

This lecture covers the main rules of counting for combinatorial objects, including finite sets, union, intersection, set difference, Cartesian product, exponential objects, and permutations. It also introduces counting techniques such as combinatorial, induction, generating series, linear algebra, and probabilistic methods.

Official source

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Related concepts (32)

Set theory

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.

Intersection (set theory)

In set theory, the intersection of two sets and denoted by is the set containing all elements of that also belong to or equivalently, all elements of that also belong to Intersection is written using the symbol "" between the terms; that is, in infix notation. For example: The intersection of more than two sets (generalized intersection) can be written as: which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols.

Naive set theory

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics (for example Venn diagrams and symbolic reasoning about their Boolean algebra), and suffices for the everyday use of set theory concepts in contemporary mathematics.

Finite set

In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, is a finite set with five elements. The number of elements of a finite set is a natural number (possibly zero) and is called the cardinality (or the cardinal number) of the set. A set that is not a finite set is called an infinite set.

Zermelo set theory

Zermelo set theory (sometimes denoted by Z-), as set out in a seminal paper in 1908 by Ernst Zermelo, is the ancestor of modern Zermelo–Fraenkel set theory (ZF) and its extensions, such as von Neumann–Bernays–Gödel set theory (NBG). It bears certain differences from its descendants, which are not always understood, and are frequently misquoted. This article sets out the original axioms, with the original text (translated into English) and original numbering.

Related lectures (37)

Cartesian Product in Linear Algebra

Explores the Cartesian product in linear algebra and the method of induction for proving propositions.

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Cartesian Product MOOC: Analysis I (part 1): Prelude, basic concepts, real numbers MOOC: Analysis I

Covers the concept of the Cartesian product, emphasizing the order of elements in pairs.

Linear Algebra: Propositions and Sets

Covers propositions indexed by vectors, proof by induction, and Cartesian products of sets.

Commutation Groups: Euler's Totient Function