In the Mexico City area, there are two Houses H1 and H2. Both H1 and H2 have two children each.
In House H1, The boy plays for Mexico Youth academy and the other child plays baseball.
In House H2, The boy Plays soccer for his school in Mexico and they recently have a newborn.
Can you prove that the probability of House-H1 having a girl child is more than that of House-H2?
As shown in the picture below, we can see a boy hanging on the tree branch to save his life. There are various ways in which he can die like1. A snake hanging toward the right waiting to bite the boy.2. A roaring Lion near the tree.3. Two crocodiles are ready to attack if the boy reaches near water. The tree is chopped to some extent, so can fall as if he moves a lot. Can you give this boy an escape plan?
I am first found in caves, now prolific online; I am a depiction, a drawing, a symbol, or sign. I will convey whichever mood you could wish; or for that matter, a fist, flask, or fish. What am I?
A Japanese ship is sailing in the Indian Ocean. The captain of the ship feels tired and decides to take shower to be rejuvenated. He goes to take the shower after keeping his diamond-studded Rolex watch and gold chain on the table.
When he comes back after 15 minutes, he finds them missing. There are 4 crew members on the ship and he calls them one by one to ask them what they were doing in that duration.
Following are the answers:
1. Crew 'A' who is the cook replies that he was cooking mutton for the crew members.
2. Crew 'B' who is a housekeeper tells that he was sleeping in his room.
3. Crew 'C' who is the engineer says that he was checking on the generator.
4. Crew 'D' who is another housekeeper says that he was correcting the hoisted flag that was put upside down.
It took only a couple of seconds for the captain to find the thief. Can you find the thief too?
Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
A bank customer had $100 in his account. He then made 6 withdrawals. He kept a record of these withdrawals, and the balance remaining in the account, as follows:
A man started to town with a fox, a goose, and a sack of corn. He came to a stream which he had to cross in a tiny boat. He could only take one across at a time. He could not leave the fox alone with the goose or the goose alone with the corn. How did he get them all safely over the stream?