There are five sheets of paper each of which has a whole number on one side and and an alphabet on the other side written on it as shown below.
What is the minimum number of sheets that is necessary and sufficient that you will turn over to verify whether the proposition given below about them is true or false? What are the sheets that you will turn over?
Proposition: “If there is a prime number on one side of a sheet then the other side of the sheet has a vowel.”
Two: Sheets 1 and 2.
Sheet 1 has to be turned over to verify the truth of the proposition. If it doesn’t contain a vowel on the other side, then the proposition can be declared as false. This will verify the statement to be true.
Sheet 2 has also to be turned over. If it has got a prime number on the other side then it will disprove the proposition. This will verify the statement to generally true for all cases by the help of contradiction.
One does not need to turn over sheet 4 because the proposition doesn’t imply that only those sheets with a prime number on one side have got a vowel on the other.
Sheets 3 and 5 are of no help to disprove or prove the proposition obviously.
- Number of elements that can be seen from right side
- Sum of every K’th prime number in an array
- Kth prime number greater than N
- Puzzle 69 |The Number Game
- Puzzle 78 | The lost bus Number
- Product of every K’th prime number in an array
- Puzzle | Find Number of matches
- Puzzle | (Something for the marmalade , Number Game)
- Puzzle | Guess the total number of coins
- Puzzle | Can 2 persons be with same number of hairs on their heads?
- Puzzle 71 | Correct Number to save life
- Minimum absolute difference of a number and its closest prime
- Find Largest Special Prime which is less than or equal to a given number
- Puzzle | Maximum number of Kings on Chessboard without under check
- Puzzle | Minimum number steps to weigh 1 kg rice with 1gm weight
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.