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

Home > Logic
Formal Reasoning (Posted on 2004-12-15) Difficulty: 2 of 5
I present to you a deck of 4 cards. Each card has on one side a letter of the alphabet, and on the other side a single digit from 0-9.

I propose a hypothesis that may apply to this deck:
If the letter is 'E', then the number on the other side is '4'.

I then drop the 4 cards on the table, and you see: 'B', '7', 'E', '4' (on the respective cards).

Which of the 4 cards must you turn over to verify or disprove my hypothesis?

See The Solution Submitted by SilverKnight    
Rating: 3.0000 (22 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
ANSWER | Comment 30 of 60 |
THERE IS NO WAY TO PROVE OR DISPROVE IT.  IN THE PROBLEM IT SAYS THE HYPOTHESIS MAY APPLY TO THIS DECK, SO REGARDLESS OF WHAT CARD YOU TURN OVER YOU STILL CAN'T PROVE ANYTHING BECAUSE THERE IS NO DEFINITE HYPOTESIS.
  Posted by SIMONE FOLK on 2004-12-24 19:44:14
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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