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

Home > Logic
Logical Choice (Posted on 2013-12-05) Difficulty: 3 of 5
Ms. Cooper was teaching a logic class which is very always popular with students and this semester was no exception. There was only one space left in the class and three students had applied. Each of the applicants was interviewed. The last space must be taken by a student who makes either three true or three false statements. One of the other two applicants makes two true and one false statement. The other applicant makes one true and two false statements.

Here's what the three applicants said during their interview:
Keith:
1. Cade is the oldest.
2. Kenny will not bring the teacher an apple.
3. I am the one with three true statements.

Kenny:
1. I would bring the teacher an apple.
2. Cade will be chosen.
3. Keith's first statement is false.

Cade:
1. I am the oldest, so I should be selected.
2. Kenny will be selected.
3. Kenny's third statement is true. 
Which student was selected as the last person chosen for the logic class?

See The Solution Submitted by K Sengupta    
Rating: 2.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution a possible solution | Comment 1 of 4
A possible solution:

Keith, with his 3 truthful statements, is the chosen one
Kenny- a sequence of 2 lies and one true statement.
Cade - 1 lie and 2 true statement.

Assuming existence of a unique solution, - I was not looking  for others.
 The text does not preclude a priori that an absolute liar was selected,,,

Edited on December 5, 2013, 10:29 am
  Posted by Ady TZIDON on 2013-12-05 10:08:48

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 (2)
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