Day 2 - Tuesday
Breakfast 7:00-8:30 (Dining Hall)
8:30-9:20
Lisa Naples
Abstract: Suppose that we want to run some errands at various locations throughout town. What is the most efficient way for us to travel from location to location and then return home?
In this course, we will begin by exploring how ideas from graph theory can help us to answer this question.
We will then extend the task by assuming that we need to visit infinitely many locations. We will see that tools from statistics and calculus can sometimes be used to determine efficient routes through sets. We will also explore situations in which these tools can fail to help us find a reasonable route.
Relevant background from graph theory, statistics, and calculus will be introduced in the course.
9:30-10:20
Alex Barrios
Finding Patterns with Remainders
Abstract: Ordinary arithmetic often hides patterns that become visible only after we record remainders instead of exact values. In 1801, Gauss revealed that arithmetic possesses a hidden world of patterns, one that reshaped number theory as we know it. In this lecture, we introduce modular arithmetic and discover that many questions about integers become dramatically simplified when viewed in this new realm.
Break 10:30-11:00
11:00-11:50
Lunch 12:00-1:30pm (Dining Hall)
1:30-2:20
Pamela E. Harris
2:30-3:30
Work time
Free time
Dinner (Dining Hall)