Let Fn be a free group of rank n with free basis x1, ⋯, xn. Let {y1, ⋯, yk} be a set of k ≤ n elements of Fn, where each yi is represented by a word Yi(x1, ⋯, xn) in the generators xj. Let ∂ yi/∂ xj ...

1. Relations and Functions Types of relations: Reflexive, symmetric, transitive and equivalence relations. One to one and onto functions, composite functions, inverse of a function. Binary operations.

Types of relations: reflexive, symmetric, transitive and equivalence relations. One to one and onto functions, composite functions, inverse of a function. Binary operations. Concept, notation, order, ...