1 Combinatorics

 1.1 Counting I: Subset enumerator
  1.1.1 Idea
  1.1.2 Implementation
  1.1.3 Remark
 1.2 Counting II: Permutation enumerator
  1.2.1 Idea
  1.2.2 Implementation
  1.2.3 Remark
 1.3 Steganography
  1.3.1 Idea
  1.3.2 Implementation
 1.4 Working with GMP integers
  1.4.1 Idea
  1.4.2 Implementation
 1.5 Enumerating graphs with Pólya’s theorem and GMP
  1.5.1 Introduction
  1.5.2 Permutations
  1.5.3 The Cycle Index
  1.5.4 Pólya’s theorem
  1.5.5 Cycle index of the pair group
  1.5.6 Concerning memory allocation
  1.5.7 Implementation I: auxiliary functions
  1.5.8 Implementation II: Polynomials
  1.5.9 Implementation III: Pólya’s theorem
  1.5.10 Results
 1.6 Backtracking I: The n-queens problem
  1.6.1 Idea
  1.6.2 Implementation