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

Home > Logic
Accurate Association (Posted on 2013-01-03) Difficulty: 2 of 5
Associate each letter with the correct number, given that:
  • If A is 1, then B is not 3.
  • If B is not 1, then D is 4.
  • If B is 1, then C is 4.
  • If C is 3, then D is not 2.
  • If C is not 2, then D is 2.
  • If D is 3, then A is not 4.

No Solution Yet Submitted by K Sengupta    
Rating: 1.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution easy Comment 3 of 3 |

[BDAC] = [1234]

"Associate each letter with the correct  Distinct number " 
makes more sense and challenge' than without"Distinct "

 If such is the text (my assumption ), then  statement 3 & statement 5 force   the BDAC as the only possible soution.

 We verify that  this solution causes no contradiction vs other statements.

IT DOES NOT.

-done

 


  Posted by Ady TZIDON on 2013-01-04 06:23:00
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 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information