Find a 9-digit number, which you will gradually round off starting with units, then tenth, hundred etc., until you get to the last numeral, which you do not round off. The rounding alternates (up, down, up ...). After rounding off 8 times, the final number is 500000000. The original number is commensurable by 6 and 7, all the numbers from 1 to 9 are used, and after rounding four times the sum of the not-rounded numerals equals 24.

Twenty frogs are sitting on a log floating on the surface of a river. Two of them decide to jump off into the water.

How many frogs are there on the log at this moment?

Can you find out a way through which you can make five squares out of the given figure by moving just six match sticks?

what does this below rebus represent identXQQQQQME

There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?

I have two sand hourglasses:
1. A 7 minute one and
2. An 11-minute one.

Using just these 2 sand hourglasses, how can I measure time as 15 minutes?

Find out which of the given views in the picture is accurately the top view of the given pyramid.

Astrology starts with the alphabet A, Biology starts with B, Psychology with P and Limnology with L.

Can you find an "ology" that begins with a P?

You stand in front of two doors. A guard stands next to each door. You know the following things: one path leads to paradise, the other leads to death. You cannot distinguish between the two doors. You also know that one of the two guards always tells the truth and the other always lies. You have permission to ask one guard one question to discover which door leads to paradise. What one question would you ask to guarantee you enter the door to paradise?

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?