Lamé’s Theorem is a little known result that describes a beautiful connection between the Fibonacci sequence and the Euclidean Algorithm on the integers. We will describe what this connection is, beginning with what how the Euclidean Algorithm works on the integers. We will end with a preliminary report on current research into an analog of Lamé’s Theorem on the Gaussian Integers. No previous knowledge of any of the topics is required.

Wednesday, Feb. 25 | 3-3:50 p.m. | Bridges 268
By Trevor McGuire, NDSU