home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: rec.puzzles
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!news.cs.indiana.edu!noose.ecn.purdue.edu!mentor.cc.purdue.edu!seaman.cc.purdue.edu!ags
- From: ags@seaman.cc.purdue.edu (Dave Seaman)
- Subject: Re: Lost solution
- Message-ID: <Bzsx58.M8w@mentor.cc.purdue.edu>
- Sender: news@mentor.cc.purdue.edu (USENET News)
- Organization: Purdue University
- References: <1992Dec22.193053.24084@bernina.ethz.ch>
- Date: Fri, 25 Dec 1992 06:10:20 GMT
- Lines: 29
-
- In article <1992Dec22.193053.24084@bernina.ethz.ch> timh@igc.ethz.ch (Tim Harvey) writes:
- >Mr. S. and Mr. P. are both perfect logicians, being able to correctly deduce
- >any truth from any set of axioms. Two integers (not necessarily unique) are
- >somehow chosen such that each is greater than 1 and less than 100. Mr. S.
- >is given the sum of these two integers; Mr. P. is given the product of these
- >two integers. After receiving these numbers, the two logicians do not
- >have any communication at all except the following dialogue:
- > Mr. P.: I do not know the two numbers.
- > Mr. S.: I knew that you didn't know the two numbers; I do not know the
- > two numbers.
- > Mr. P.: Now I know the two numbers.
- > Mr. S.: Now I know the two numbers.
-
- Given that the original numbers are in the range [2,99], the numbers must be 4
- and 13. As a hint to get you started, the following are the possible sums that
- Mr. S might have which would allow him to make his first statement:
-
- 11, 17, 23, 27, 29, 35, 37, 41, 47, 53.
-
- For each of these possible sums except one, there is more than one possible
- product that Mr. P could have that would be consistent with his second
- statement and also with Mr. S's first statement.
-
- This puzzle is in the FAQ, by the way, but the FAQ answer uses incorrect
- reasoning. The solution really has very little to do with primes.
-
- --
- Dave Seaman
- ags@seaman.cc.purdue.edu
-