Created
December 22, 2012 11:53
-
-
Save anonymous/4358598 to your computer and use it in GitHub Desktop.
Freudenthal's logic puzzle
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
X and Y are two different integers, greater than 1, with sum less than 100. S and P are two mathematicians; S knows the sum X+Y, P knows the product X*Y, and both know the information in these two sentences. The following conversation occurs. | |
P says "I cannot find these numbers." | |
S says "I was sure that you could not find them. I cannot find them either." | |
P says "Then, I found these numbers." | |
S says "If you could find them, then I also found them." | |
What are these numbers? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment