GAP Tutorial
 ----------------
 E. Eichinger


 GAP (Groups, Algorithms, Programming) is "a system for 
 computational discrete algebra, with particular emphasis 
 on Computational Group Theory" (see http://www-gap.mcs.st-and.ac.uk/).
 It provides a Pascal-like programming language, and contains
 many algorithms for groups of permutations. In this workshop 
 we will use GAP to find the size of certain permutation groups 
 that are given by their generators, we will enumerate all 
 molecules of a given structure modulo symmetry, and we will 
 construct block-designs used in statistics.