The abstract:

Competition problems sometimes have surprisingly simple and nice solutions which can be understood by anyone with some knowledge of Precalculus or elementary Number Theory. In this talk, we will discuss a few such problems and their solutions. One problem, from the 1958 Putnam Competition, is to prove the product of four consecutive positive integers cannot be a perfect square or a perfect cube. We will embark on a problem solving strategy, working our way from the hopeful beginning stages to a full proof, and by the end we will see that Putnam problems are not always as difficult as one might think. This talk will be accessible to any undergraduate with an interest in math.

More details for the Putnam Competition, see http://math.unt.edu/news/other-recurring-events/william-lowell-putnam-competition

All are welcome, and participants are free to bring lunch and eat while attending!