Replace the question mark with the correct number in the below-given picture?

A chess tournament is taking place on knock-out terms (the one who loses the match is out of the game).
(a) If 10 matches are played in total, how many players participated?
(b) If 20 players took part in the tournament, how many matches were played?

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?

Why did Buffon take the goal with him after every Juventus match?

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

John was visiting his friend Jacob. He found out that his friend's wife had just killed a burglar in self-defense.
John asks Jacob about what happened and he told that "His wife was watching television when suddenly the bell rang. She thought that it is her husband Jacob but she found the burglar who attacked her instantly and she got so frightened that she killed the burglar immediately with the knife.
John asked the police to arrest his friend's wife. Why?

Can you replace the question mark with the correct number?

Andrew’s doctor gives him three pills and tells him to take one every half hour. How much time will have passed by the time Andrew’s taken all three pills?

John buys rice at Rs.60/kg from Britain and then sells them at Rs.5/kg in India. As a result of this, he becomes a millionaire. How come?

A family is trapped in a jungle. There is a bridge which can lead them to safety. But at one time, the bridge can only allow two people to pass through. Also, all of them are afraid of the dark and thus, they can't go alone.

Father takes 1 minute to cross, the mother takes 2 minutes, the son takes 4 and the daughter takes 5 minutes. While crossing the time taken will be according to the slower one. How can they all reach the other side in the minimum possible time?