
You can search for articles in back issues of Contingencies from July/August 2000 to March/April 2009 using the search box to the right. Simply type in subject words, author's name, or article title and click search. To search for articles from May/June 2009 to the present, go to the current digital issue of the magazine and use the search function on the left of the top navigation bar. 

More LogiciansBy Yan Fridman This Issue’s PuzzleYou may recall that late in 2004 and in the beginning of 2005 we published a few logician puzzles. Here’s another one of the kind, suggested by Bob Gabriel and revised to shorten the computation time. Two brilliant, perfect logicians, Green and Blue, are given the following information regarding the two positive integers A and B: They are both greater than 1, A < B, and their sum is less than 40. Green is told the product of A and B, and Blue is given the sum of A and B. The logicians are then engaged in the following conversation: Green: “I know the product.”
Please answer the following questions:
Previous Issue PuzzlesFight With the Dragon A scary and always hungry dragon has appeared in a peaceful village and has a habit of eating at least five villagers every day. Many citizens have tried to fight the dragon off, but to no avail; They’ve inevitably become meals for the voracious monster. Finally, a brave soldier, Cornelius, gets his lucky sword, goes to the center square, which the dragon had occupied, and challenges the threeheaded monster to a duel. With every swing of his sword, Cornelius can miss or chop one or two of the dragon’s heads. If Cornelius chops off one head, a new head immediately pops up in its place (even if the dragon has only a single head). If he removes two heads with one stroke, the monster loses them, and they don’t grow back. If the soldier misses, the dragon grows a new head. The probability of Cornelius missing with the swing of the sword is the same regardless of the number of heads. If the monster has two or more heads, the soldier is as likely to take two heads off as to miss altogether. The dragon gets more strength every time Cornelius misses. In fact, the moment it gets five heads, it will eat the soldier alive. On the other hand, once the dragon loses all of its heads for good, it’s killed. The fight must continue until the deadly end. Please answer the following questions:
Chess Puzzle White to move and mate in three. Initial position:
Solutions for the MayJune puzzlesFight With the Dragon Answers:
Solution:I hope that readers will not chastise me for not being mathematically strict in stating the following fact: If the dragon has n heads, then the probability of the soldier’s victory is the same regardless of how long the battle has been going on. I am not going to prove this statement here, but eager readers can consider this as an exercise. If you believe me, then the solution becomes straightforward. If not, there are many other ways to solve it, including building a matrix of possible states and finding the limit of the mth power of the matrix with m approaching infinity to find the answer. Let x_{n} be the probability that the dragon wins if the monster has n heads. Then the following system of equations will produce the answer. Each equation is based on possible state changes from time t to time t + 1, where states represent the number of the dragon’s heads. For example, if the dragon has four heads, then after the next sword swing, it can have five heads following a failure to chop head(s) off (with probability q), four heads (with probability 1 – p – q), or two heads (with probability p), hence the fifth equation. x_{0} = 0
This system effectively represents four equations with four unknowns. By solving the system and denoting a = p/q and y(a) = a^{3} + 2a^{2} + a + 1, we get: x_{0} = 0
To answer question 1, we set a = 1, n = 3 and get x_{3} = 2/5, so the probability of the soldier’s victory is 3/5, or 60%. To answer question 2, we need x_{3} = .5, so from this we get a = .802 (requires computer). Chess Puzzle 1. Bh1 f4
Solver listsDue to an administrative deadline, names of only those people who submitted correct solutions by May 31, 2006, are shown on the lists. Dragon Puzzle: John Adduci, Steve Altschuld, Bob Bartholomew, Richard Bottelli, Scott Boulay, Geoff Bridges, Bob Byrne, William Carroll, John Cook, Mike Crooks, Tom Dahl, Mark DanburgWyld, Andrew Dean, Robert Ellerbruch, Mark Evans, Mike Failor, Steve Gallancy, Nick Gifford, William Glasgow, Mark Glickman, Brian Goldberg, Yehuda Haber, John Hubenschmidt, Stuart Klugman, Chi Kwok, Kevin Larsen, Tim Luker, Howard Mahler, Raja Malkani, Ken McKusick, Lee Michelson, Carl Nauman, Don Onnen, Stephen Peeples, Luke Porter, David Promislow, Justin Radick, Francis de Regnaucourt, Philip Silverman, Todd Simkin, Greg Scruton, Al Spooner, Ron Stokes, Elnatan Sulimanoff, Doug Szper, Donn Takebayashi, Tony Torelli, Kevin Trapp, David Uhland, Jenny Young, Darin Zimmerman Chess Puzzle: Casey Abell, Steve Altschuld, Ian Arvin, Steven Azar, Richard Bottelli, Scott Boulay, Geoff Bridges, Brian Brugger, Robert Burrell, Bob Byrne, William Carroll, Alan Clark, Mike Crooks, Rob Drozd, Jeffrey Dvinoff, Andy Dvorine, Brian Eastman, Robert Ellerbruch, Mark Evans, Mike Failor, Chuck Fuhrer, Bob Gardner, Colby Gardner, William Glasgow, Mark Glickman, Andrew Gordon, Leigh Halliwell, Len Helfgott, Norm Henricks, Dave Heyman, Bob Howard, Will Joseph, Greg Keklak, Todd Kennedy, Robert Koch, Ignace Kuchazik, Kevin Larsen, Brian Liebeskind, Dave Llewellyn, Tim Luker, Don Mac Donald, Raja Malkani, John Marshall, Ken McKusick, June Meimban, Mark Mercier, Randy Meyer, Lee Michelson, Jim Murray, William Nibbelin, Don Onnen, Wade Oshiro, David Parsons, Mark Peterson, Matthew Petro, Igor Pogrebinsky, Dylan Porter, David Promislow, Justin Radick, Hugh Ramler, Boris Raskin, Francis de Regnaucourt, Robert Rietz, Dave Scherr, Greg Scruton, Noam Segal, Don Sondergeld, Al Spooner, Ron Stokes, Thomas Struppeck, Thomas Tholany, Kevin Trapp, Howard Wachspress, Zorast Wadia, Gerald Ward, Andrew Yerre, Hank Youngerman, Darin Zimmerman, Lee Zinzow Solutions may be emailed to cont_puzzles @yahoo.com or mailed to Puzzles, 25 Sparrow Walk, Newtown, Pa. 18940. In order to make the solver lists (separately maintained for the regular and chess puzzles), please submit your answers and solutions by July 31, 2006. Depending on the response volume, solver lists may contain only the names of people who solved puzzles on the first attempt.
Contingencies (ISSN 10489851) is published by the American Academy of Actuaries, 1100 17th St. NW, 7th floor, Washington, DC 20036. The basic annual subscription rate is included in Academy dues. The nonmember rate is $24. Periodicals postage paid at Washington, DC, and at additional mailing offices. BPA circulation audited. This article may not be reproduced in whole or in part without written permission of the publisher. Opinions expressed in signed articles are those of the author and do not necessarily reflect official policy of the American Academy of Actuaries. 
July/August 2006The Actuary's New Clothes  A Canadian Perspective on the Financial Economics Debate A Safer Strategy  Investing in Biotech Inside Track: Commentary: Up To Code: Policy Briefing: Workshop: Tradecraft: Humor: Puzzles: Endpaper:


