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?
It's pretty hard to give up.
If you remove a part of it, you will be left with a bit.
Even if you remove another part, the bit still remains.
Remove one more and it still remains.
In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.
A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.
There is a box in which distinct numbered balls have been kept. You have to pick two balls randomly from the lot.
If someone is offering you a 2 to 1 odds that the numbers will be relatively prime, for example
If the balls you picked had the numbers 6 and 13, you lose $1.
If the balls you picked had the numbers 5 and 25, you win $2.
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?
Only one colour, but not one size,
Stuck at the bottom, yet easily flies.
Present in sun, but not in rain,
Doing no harm, and feeling no pain.
What is it?