Mark your calendars for the Math & CS Majors/Faculty BBQ scheduled for Wednesday, May 9th at Noon on the KW Lawn area.  Rain location will be Tome Hall 2nd floor lobby area.  Take a break from studying and join us as the Math/CS professors BBQ hamburgers, hot dogs & veggie burgers to perfection.  They will also provide side dishes & desserts.

Haosong (Tony) Wang will present "Dynamics of the Complex Hyperbolic Cosine-Root Family" on Tuesday, May 1st at Noon in Tome 115.

Katherine Veil will present "Improving the jmle Tool's Constraint Solving on Sets" on Thursday, May 3rd at Noon in Tome 117.

Free pizza and everyone is welcome to attend.

Math & CS Majors:  Sign up for the majors dinner in Tonya's office (Tome 201) or email millert@dickinson.edu.  The dinner will be held on Tuesday, April 17th at 6 pm in the Social Hall West.  You must sign up by April 13th. Proper dress attire is required.

Professor Jeff Forrester will present "Mutations and Cancer - Using Mathematics to Peer Inside the Cell".  We will induct new members into Upsilon Pi Epsilon & Pi Mu Epsilon.  We will also award departmental prizes and awards.

Assistant Professor of Computer Science John MacCormick will present "9 Algorithms That Changed the Future: The Ingenious Ideas that Drive Today's Computers" on Wednesday, April 4th from 4:30-5:30 p.m. in the Waidner-Spahr Library.  Light refreshments will be served.  Everyone welcome to attend!

Dr. James Hamblin, Shippensburg University, will present "A Variation on the Money-Changing Problem" on Tuesday, April 10th at Noon in Tome 115.  Free pizza and everyone welcome to attend!

Abstract: Suppose you move to a country that has 5-cent, 12-cent, and 26-cent coins.  Which denominations can you make change for?  Which denominations can you *not* make change for?  For those denominations that you can make change for, how many ways are there to do it?  This number is called the denumerant, and has been studied extensively.  In this talk we will investigate the maximal denumerant, which counts the number of ways to make change for an amount using the largest possible number of coins.

Here's a challenge to get you started thinking about this problem.  Using 5, 12, and 26, find a number whose maximal denumerant is greater than 1.  In other words, find an amount that you can make change for using the same number of coins in at least two different ways, and for which there is no other way to make change for it using more coins.