|
The Bailey Challenge
Challenge receives record number of solutions
Is Mr. Mathematics going soft? You submitted a record number of solutions to the problems, almost four times the normal yield. There were many interesting comments on the moat problem. Some of the older solvers thought that the knight should save the princess, rather than the other way around. The recent grads knew better. Professor Al Schmidt, calling on his World War II travels, thought the moat size was a bit small. Some thought the knight, even in full armor, could jump across the moat, particularly with Princess Di awaiting.
Your main tools for the problems of this issue are your imagination and the beam balance shown in the figure. You are to isolate a look-alike counterfeit coin among true coins by a series of weighings (balancings). The three problems are outlined in the following table. In problems 2 and 3 you also need to determine whether the bad coin is heavy or light.
Problem Total Information Number of
number number about the weighing
of coins counterfeit permitted
______________________________________________
1 3 heavy 1
2 9 heavy or light 3
3 12 heavy or light 3
Problem 1 is the appetizer. Problem 2 is the main course. Problem 3 is a classic and was suggested by Joe Valentine, class of ‘41. It should be tried only if you have plenty of time and imagination or have seen the solution.
Joe is funding The Valentine Memorial Prize of a $25 gift certificate for the solution of Problem 3 that is the most understandable (to me). The certificate is redeemable at the Rose-Hulman bookstore, and I will do the shopping and mailing to the winner (if desired).
To reduce youth boredom during the holidays, I am including two youth problems.
Youth Problem 1:
See Problem 1 above
Youth Problem 2:
The numbers 1,2,3,4,5,6,7 are all to be used in that order so that your expression equals 100. You may use +, -, times and grouping with ( ). For example the expression 1+2+(3*4)=5*(6-7) equals ten. The symbol * means times. Mom or dad will explain these problems but won’t give any hints.
Solutions of the problems in the previous issue were submitted by the following alumni and students:
Steve Robertson, 1990; Chris Abdnour, 1989; Ron Andrews, 1974; Buddy Atherton, 1979; Scott Bagwell, 1980; Mark Bailey, 1976; Bob Bannister, 1946; Bill Bates, 1991; John W. Briggs, 1957; Bob Burger, 1991; Paul Cella, 1958; Cecil Cook, 1949; Charles E. Cooper, 1956; Brooke Chenoweth, 2000; John S. Chinn, 1956; Jim Chinni, 1988; Randall S. Conn, 1997;Earl E. Creekmore, 1965; Rick Ditteon, 1974; Chuck Divine, 1967; James E. Dunn, 1965; Paul Fathauer, 1993; Benjamin Ford, 1999; Tom Freeman, 1985; Jim Griffith, 1957; Greg Hall, 1992; George Houghton, 1972; Joe Jachim, 1989; Allan Junker, 1950; Paul R. Kimmerle, 1991; Bill Krehely, 1980; Greg Kremer, 1989; Ralph Llewellyn, 1955; Larry Logue,1959; Roger Long, 1965; Robert R. Lowe, 1969; Allan K. Mahler, 1971; C. Elaine Mahler, 2000; Roy A. Marchant, 1983; Brian Mark, 1982; Jeff Markwardt, 1995; Bryon Mish, 1993; Kent Moraga, 1981; Richard Mott, 1943; Tom Olinger, 1980; Dan Pate, 1973; Mark Ress, 1976; Aaron Reynolds, 1994; John F. Richardson, 1931; Bill Rinker, 1951; Louis Roehm, 1960; Rick Roll, 1981; Al Schairbaum, 1949; Alfred R. Schmidt, 1949; Dave Schrader, 1973; Brian L. Seidl, 1987; Chris Sloffer, 1989; W. C. Soudriette, 1943; Benjamin Studerent-Hickman, 1991; Art Sutton, 1956; Michael Taylor, 1982; John Tindall, 1961; Don Todd, 1962; Scott Walshon, 2000; Ken Walter, 1983; Doug Wheaton, 1974; Nathan Wiley, 1994; Mark Young, 1994; David Yates, 1984; Tony Zamora 1991; Joe Zumar, 1973;
Other solvers included:
Jim Durlacher, Neil Flatter;
Rebecca Graves, R.J. Lopez, Harold A. Rosene, Jr., Steve Richardson, and Scott Mancroni.
Send solutions for the Bailey Challenge to:
Bailey Challenge
c/o Herb Bailey, Box 185
Rose-Hulman Institute of Technology
5500 Wabash Avenue
Terre Haute, IN 47803
or e-mail them to Echoes editor Bryan Taylor at bryan.taylor@rose-hulman.edu.
-by Herb Bailey
Professor Emeritus of Mathematics
|