Mathematics Undergraduate Seminar Series presentations today at 3 p.m.
Mathematics Undergraduate Seminar Series presents two student presentations by Samuel Erickson and Erin Giosta today.
Talk 1: Samuel Erickson
Pattern avoidance, permutations, and the Wilf-equivalence
We will begin with a brief history of pattern avoidance, along with its roots in computer science. We will move on to discuss pattern avoidance in permutations along with Wilf-equivalence. We will then look at double-lists and pattern avoidance in double-lists. Finally, we will see results for specific cases that were obtained by my research group in the REU program at Valpo University.
Talk 2: Erin Giosta
Proofs that there are Infinitely Many Prime Numbers
Since every whole number greater than 1 can be uniquely written as the product of primes, primes can be regarded as the basic building blocks of whole numbers. How many of these building blocks are there? The fact that there are infinitely many prime numbers has been known for quite some time, but many different approaches can be used to prove this fact. During this talk we will go through the proof Euclid first used to establish this result and the ideas that he needed to develop his proof. We will then dive into different proofs found by Goldbach and Erdos that produce the same result.
Wednesday, Mar. 25 | 3-3:50 p.m. | Bridges 268
By Samuel Erickson and Erin Giosta, MSUM