Skip Navigation

UNL Math Club

Event Archive

Math Club Events, Spring 2011

Thursday January 20 at 5:00pm in 106 Avery
Come learn about summer research opportunities. Pizza and pop provided! Chief Undergraduate Advisor Gordon Woodward will discuss summer research programs.
Quick summary of research programs and useful links (for a more comprehensive list see our Research Page)

January 28-30, 2011
13th Annual Nebraska Conference for Undergraduate Women in Math.

February 10-14, 2011
Mathematical Contest in Modeling

Thursday, February 17 at 5:00pm in Avery 348
Explore the strategies and math behind common games and play some fun games as well. Learn to play Set, Philosopher's Football, and many other games; or bring your own game and teach others! As always, pizza and pop will be provided! This event will also double as an organizational meeting to hear what events you, the member of math club, would like to have for the remainder of the semester!

Thursday, March 10 at 5:00pm in Avery 12
Interested in learning about (La)TeX, the standard tool for typesetting mathematics? Come to a workshop for beginners and TeXperts alike. Here is a page devoted to the event.

Thursday March 17 at 5:00pm in 108 Avery
Want to know what course to take in the fall? Come to the preview of upper-level math courses offered in Fall 2011. Faculty teaching these courses will briefly describe the course contents, format, and prerequisites, and answer questions. Pizza served!

Thursday, April 7 at 5:00pm in 106 Avery
UNL Math Professor Daniel Toundykov will speak on "Efficient multiplication with the Fast Fourier Transform":

Abstract: Fast arithmetic for large numbers, hundreds or thousands of digits in length, has become increasingly important in number theory research, combinatorics problems, cryptography, and arbitrary-precision computing. However, even specialized computer processors are limited to about 19 significant digits per operation, and must be supplemented by software algorithms to handle higher-precision arithmetic. The standard long division and multiplication procedures are too inefficient for this purpose. I will describe the ideas behind the fastest known multiplication algorithms based on the discrete Fourier transform, and discuss connections of integer multiplication with algebra and complex analysis.