February 15 2013
Geoff Exoo, a professor of mathematics and computer science at ISU, will talk at the Math and CS department seminar from noon-1 p.m. today (Friday, Feb. 15). The talk will take place in Root Hall, room A-186 - one of the conference rooms in the math/computer science wing of the building. Details on the talk are below.
Title:Computational Number Theory
Blurb:This talk will introduce some topics in Computational Number Theory. Jeff Kinne and I both hope this will become an ongoing seminar topic, and we encourage participation by students and faculty, and are especially interested in volunteers for future talks.
Number Theory is an area that has several attractions. It is a topic of significant current interest, while at the same time it contains some (perhaps most) of the oldest unsolved problems in Mathematics and Computer Science. Many of these problems can be easily understood by those without an extensive Mathematical background. In addition, there are numerous opportunities for both faculty and undergraduate research projects.
Originally, I was going to use this talk as an introduction to sieves. However, last week, the discovery of the 48th Mersenne prime (the largest known prime, with more than 17 million digits) was announced, so I will also review the methods used to make this discovery.
For questions on the seminar, contact Jeff Kinne at Jeffrey.Kinne@indstate.edu.
Associated programming competition:See http://mathcs.indstate.edu/dept/files/presidential_competition.pdf. Basically, can you find the first billion primes in less than one minute on a single modern CPU?