The camp activities are intended to provide engagement in many different ways — both through serious study and serious play. Most days, campers attend three courses. Time is set aside for self-directed learning and fun, including puzzles, Math games, and hands-on activities.
The curriculum varies from year to year (Click here to see Epsilon 2022 curriculum) . Some of the classes that have been offered in past Epsilon Camps are:
We introduce the Division algorithm in order to study a variety of applications including different positional number systems, the divides relation, greatest common divisors and solutions to Linear Diophantine equations using the extended Euclidean algorithm, modular arithmetic and divisibility rules. We will then delve deeper into modular arithmetic by investigating Fermat's little theorem, Wilson's theorem, and Euler's theorem as well as finding roots modulo n. We finish by discussing the Chinese remainder theorem. Along the way we will introduce various related puzzles and tricks.
Methods of Proof
Starting with the three classical laws of thought (identity, non-contradiction, and excluded middle), the course progresses through propositional calculus and the deduction theorem to the method of direct proof and the method of indirect proof, the well-ordering principle, Peano's fifth axiom, the Fundamental Theorem of Mathematical Induction (FTMI), the equivalence of well-ordering and FTMI, and examples of proofs using the various methods.
Sets and Functions
Using naïve set theory, we will develop the concepts and properties of ordered pair, relation, and function. We will discuss Russell's paradox and the need for axioms. We will also learn about cardinals, ordinals, and the axiom of choice. We will likely conclude the course with the Cantor-Schroder-Bernstein Theorem.
We will study the geometry of zeroes of the polynomials in two variables over the reals. After studying linear polynomials we will learn how the quadratic polynomials can be classified. Useful methods like factorization or substitution of variables will be discussed and used to study higher degree curves. We will prove the Nullstellensatz for some simple cases. As an application we decide if Watt's curve includes a straight line segment or not, and how the situation can be improved by using 6-bar or 8-bar planar linkages.
Enumerative has the same Latin root as the word number, and combinatorics is derived from the German and English words meaning combinations. This class will focus on the counting of combinations. Enumerative combinatorics questions are often in the form, 'How many different ways can you select a subset of objects from a larger group?'Characteristics of the desired subset and properties of the group of objects can vastly change the difficulty and complexity of the questions. We will explore counting in the contexts of probability and graph theory. We will to use the context of the board game Pandemic to motivate counting in a discrete mathematical modeling context.
Visual Group Theory
We will focus on symmetry groups from the view of group actions by studying the symmetries of objects such as games (for instance Spinpossible and the Rubik's cube), rearrangements of cards, regular polygons, and light switches. After playing with Cayley diagrams and letting our intuition guide us, we will see the need for a more rigorous algebraic definition of symmetry groups, which will lead us to the study of groups more formally. We will then focus on properties of groups generalizing familiar arithmetic/algebraic laws and investigate Cayley tables. We will study cyclic groups, dihedral groups and symmetric groups (as well as the hyperoctahedral groups), and finish with Cayley's theorem. Along the way, we will discuss one-to-one and onto functions, groups created by generators and relations, directed graphs, and the notion of subgroups and group isomorphism (these last two informally).
We introduce homogeneous coordinates of points and lines of the Euclidean plane; then we add the ideal line to construct the real projective plane. We study a little linear algebra to use it as a tool. We prove the theorem of Desargues, and if time permits, the theorem of Pappus in the real projective plane. Then we change gears: we start the axiomatic study of projective planes. We discover the existence of finite geometries, and we prove many properties, including relations to Graeco-Latin squares.
Advanced Set Theory
In this course we will study the Zermelo-Frankel axiom system (together with the axiom of choice). We will carefully develop and explore theories for (a) unstructured sets and (b) well-ordered sets. In each setting, we will compare sizes and develop a version of arithmetic that includes addition and multiplication. If time allows, we'll recursively define the Aleph function and show that it has a fixed point.
We consider several geometric objects that are self-similar, including Koch's curve and snowflake, the Cantor set, the Sierpinski triangle and carpet, and the dragon curve. The notion of a Lindenmayer system will be defined. We will learn about computing the limit of a sequence and the sum of a series, in order to find the dimension of a fractal. We will introduce the set of complex numbers to study the Mandelbrot set and the Newton fractal as well.
Symmetry and Orbifolds
We study and classify symmetries of the plane and sphere using topology. Along the way we will prove the classification of surfaces, study Euler characteristic, and enumerate orbifolds. As time permits we will consider the symmetries of the hyperbolic plane, geometrizing arbitrary surfaces, Cayley graphs of planar symmetry groups using 'Van Kampen tilings', color symmetries, covering spaces, and the fundamental group and 1st homology of surfaces.