![]() | ![]() |
![]() |
|---|
A solution and a new problem is posted every Monday evening during fall and spring semesters at www.cs.colostate.edu/~rmm/mathChallenge
One winner each week is eligible for a free ice cream and topping, courtesy of Cold Stone Creamery.
Email your solutions to solution@math.colostate.edu. Indicate your status (undergrad/grad/faculty/other) and school affiliation or city of residence if you are not affiliated with a school.
Email ideas for future challenges to Ross McConnell (rmm@cs.colostate.edu)
Let us revisit the problem about the inchworm from Challenge 3.
For this week's problem, there are now 1000 inchworms distributed randomly along the mile-long rubber band, some facing forward and some facing backward. They all walk an inch and the rubber band stretches by a mile; they walk another inch and the rubber band stretches by another mile, etc. If an inchworm reaches either end of the rubber band, he leaves. If an inchworm meets another, he turns around and starts inching in the opposite direction.
In Challenge 3, we showed that one inchworm starting at one end will get off the rubber band after a finite number k of iterations. How much longer does it take the 1000 inchworms? That is, how large must j be to guarantee that all 1000 inchworms are off the rubber band after jk iterations?
Hint: The problem is quite easy once you get the right insight.
People who solved this week's puzzle were Ben Joeris (student at Fort Collins High), Monica Chawathe and Saravana Sellappa (CSU Grad students), Andrew Johnson (Colorado School of Mines grad student), Nicolae Popescu (Fort Collins), Rocke Verser (Loveland), Byung-Soo Kim (South Korea). The ice cream goes to Monica.