Bio

Anjali Agarwal is currently pursuing her MS in Computer Science at the University of Washington, where she also has her undergrad in Computer Science and Mathematics. She have served as the instructor of record for one year and as a Teaching Assistant for three years, spanning courses in CS Theory, Data Structures, and Introductory Programming. Anjali passion lies in integrating discovery-based learning methods into CS courses, with the goal of cultivating curiosity and critical thinking among students. Beyond the classroom, she is actively engaged in K-12 outreach initiatives, conducting pedagogy research, and mentoring undergraduate students.

Description

Are there infinitely many prime numbers? Can we prove it?

Proofs are foundational to computer science, and proof by contradiction is one particularly powerful technique. In this teaching demonstration, we will introduce the mechanics of the proof by contradiction technique, discuss the advantages and disadvantages, and explore several key examples, including the proof that there are an infinite number of primes. This demonstration is designed to fit into a broader Discrete Mathematics course. All are encouraged to join, regardless of mathematical background.

https://northwestern.zoom.us/j/92035887921?pwd=N0F0TFB1NjJxR3l6Y2M1YXR3Sis4QT09