Selection of objects from a set in which the order does not matter
a sequence where repetitions are allowed:
a sequence in which all entries are distinct:
in both sequences there is a unique entry that is prime
To enumerate is to make a complete list of objects one by one
finite set:
infinite set:
countable set: a set whose elements can be enumerated
e.g.,
uncountable set: a set whose elements can not be exhausted by enumeration, e.g.,
a partition of a set is a way of writing it into
non-overlapping unions of its subsets
a relation betwen
an equivalence relation is a relation that is
reflexive:
symmetric:
transitive:
an equivalence relation induces a partition on a set
if we put
recursively defined terms with given initial values
A fuction is periodic if there exists some
holds for all
A formal power series with coefficients produced by some sequence
Example: Fix
(Partial) Order: A reflexive, antisymmetric, transitive relation
e.g.,
Lexicographic order: the order as per the dictionary
The growth of
suppose that
assume that
show that
write a proof for the statement that the set of all infinite binary sequence is uncountable
formulate it in academic style with definitions, lemmata, and theorems.
you may refer to this source for the Cantor's Diagonal Argument