home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!mcsun!Germany.EU.net!ecrc!acrab5!joachim
- From: joachim@ecrc.de (Joachim Schimpf)
- Subject: Re: PROLOG puzzle frameworks
- Message-ID: <1992Nov19.095904.29834@ecrc.de>
- Sender: news@ecrc.de
- Reply-To: joachim@ecrc.de
- Organization: European Computer industry Research Centre GmbH.
- References: <7932@skye.ed.ac.uk>
- Date: Thu, 19 Nov 1992 09:59:04 GMT
- Lines: 28
-
- In article 7932@skye.ed.ac.uk, ken@aiai.ed.ac.uk (Ken Johnson) writes:
- >
- >*** The Mr S and Mr P Problem, by David Warren
- >
- >There are two numbers M and N such that 1 < M & N < 100. Mr S is told
- >their sum S and Mr P is told their product P. The following dialogue
- >takes place:
- >
- > Mr P: I don't know the numbers.
- >
- > Mr S: I knew you didn't know them; I don't know them either.
- >
- > Mr P: Now I know the numbers!
- >
- > Mr S: Now I know them too!
- >
- >Question: What are the numbers?
-
- When a friend gave me this problem a few years ago, the bounds given were
- 1 < M,N < 50, which gives you a unique solution.
-
- If my program is correct, there are four solutions in 1 < M,N < 100.
-
- ---------------------------------------------------------------------------
- Joachim Schimpf Email joachim@ecrc.de
- European Computer-Industry Research Centre Phone +49 89 92699 111
- Arabellastrasse 17, D-8000 Munich 81, Germany Fax +49 89 92699 170
-
-