Title: Recurrence Relations
Lecture Notes: Recurrence_relations
Speaker: Andy Loo
Abstract: In counting problems, sometimes it is hard to count the total number of configurations directly, but if we look at the problem from a different angle, we may be able to find connections with the number of configurations in smaller cases. The question then is how to get the total number from these recurrence relations. Let’s find out this weekend!
Chili peppers: 2 out of 4
Title: The Math of Celtic Knots
Leaders: Justin Lanier & Harini Subrahmanyam Fredrickson
Time & Date: 3:14pm-4pm, Saturday March 22
Location: Princeton Public Library, teen room (3rd floor)
Abstract: It’s St. Patrick’s Day this week! We’ll look at some ornate Celtic knots, observe and explain some patterns, and make some knot drawings of our own. We’ll also discuss the difference between knots and links, ways to identify each, and some other basic topological ideas. Come shamrock some great math with us!
Abstract: Imagine you needed to set up a security system at an art gallery, based on its 2D floor plan. You’d want to make sure that the cameras you installed would be able to see every part of the gallery, but you wouldn’t want to buy more cameras than you had to. Depending on the shape of the gallery, how many cameras would you need? We’ll explore this problem and variations on it.