Girl Child over Boy Child

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?




Similar Riddles

Use the numbers 2, 3, 4 and 5 and the symbols + and = to make a true equation. Conditions: Each must be used exactly once and no other numbers or symbols can be used.

Asked by Neha on 30 Sep 2021


There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?

Asked by Neha on 24 Dec 2025

The great emperor Akbar once ruled India. He was well known for his intelligence. But along with that, he was known for the Nine Gems in his court. One of the nine gems was Birbal, a quick witted and extremely intelligent man. The stories of his wit were widely popular.

Once a king ruling in a distant land heard of Birbal. To check his wit, he sent an invitation and called him to visit his land. Akbar allowed Birbal to go and he took off on the journey.

Upon reaching that kings kingdom, he was welcomed with flowers. He was then escorted to the palace of the king. Upon entering the palace, Birbal found that there were six people sitting in front of him adorning the same robe. They were also lookalike and it was hard to judge who the real king was.

After a couple of minutes, Birbal approached one of them and bowed in front of him greeting him.

That was the real king. How did Birbal know who was the real king ?

Asked by Neha on 10 May 2021


I know a 5-digit number having a property that With a 1 after it, it is three times as large as it would be with a one before it.

Guess the number?

Asked by Neha on 06 Apr 2025

By what process could you make a 'Tea-Table' into food?

Asked by Neha on 16 Aug 2023

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

Asked by Neha on 20 Apr 2022


Complete the series by replacing "?" with the correct number.

ST ND RD TH '?'

Asked by Neha on 14 Jan 2026

There were two grandmothers and their two granddaughters.
There were two husbands and their two wives.
There were two fathers and their two daughters.
There were two mothers and their two sons.
There were two maidens and their two mothers.
There were two sisters and their two brothers.
Yet there are only six, who are buried here,
All are born legitimate and relationships clear.
How can this happen?

Asked by Neha on 15 Jun 2024

This is a picture puzzle. You have to guess the name of the movie that can be related to the picture.

Doctor

Asked by Neha on 20 Jun 2024


Out of three Friends John, Jacob and Jonny one of them is a king, one is a bureaucrat, and one is a Spy.

The king always tells the truth, the bureaucrat always lies, and the Spy can either lie or tell the truth.

John says: Jonny is a bureaucrat
Jacob says: John is a king
Jonny says: I am a Spy

Tell me, Who is the king, who is the bureaucrat, and who is the Spy?

Asked by Neha on 03 Feb 2024

Hot Articles

Amazing Facts

Artificial Intelligence

Artificial Intelligence has crushed all human records in the puzzle game “2048,” achieving a high score of 839,732 and beating the game in only 973 moves without using any undo.