All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic > Liars and Knights
Knavish Arithmetic (Posted on 2019-05-25) Difficulty: 5 of 5
The participants in our little logical mystery, are two pairs, each consisting of one knight and one knave.

The first pair, made up S1 and S2, are told sum of two integers (x + y). While the second pair, made up of P1 and P2, are told the product (xy).

At the outset, none of the participants know the identity of the knave in the other pair, although they are aware that each group is mixed.

Further, all participants have been told that 1 < x < y < 100.

Interaction between the four participants takes place as follows. In the initial phase, each participant writes a statement, initially hiding it from all other participants. The four statements are then revealed to all participants simultaneously

Initial phase:

•S1 wrote: “I deduce that 64 < xy < 196”

•S2 wrote: “It is impossible for P1 and P2 to deduce x and y from xy at this point”

•P1 wrote: “It is impossible for S1 and S2 to deduce x and y from x + y at this point”

•P2 wrote: “I deduce that x+y = 33”

Following these disclosures, a sequence of remarks are made by the participants in the following order:

Follow-up conversation:

•S1 says “It is impossible to determine which P is the knave from the above statements alone”

•P1 says “Now I know x and y”

•S2 says “Now I know x and y”

•P2 says “P1 and S2 are knaves”

Identify the two knaves and determine x and y, if you can!

See The Solution Submitted by FrankM    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Small hintFrankM2019-05-27 12:58:57
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information