Three ants are sitting at the three corners of an equilateral triangle. Each ant starts randomly picks a direction and starts to move along the edge of the triangle. What is the probability that none of the ants collide?

By moving exactly three matchsticks can you make the below equation true.It can be solved by 3 ways.

Which Burger Is Different in below image?

The below mentioned letters have been placed in a order using a logic.

DEAD, BALL, FEAR, SHOP

Can you find the logic?

Which of the below owl is odd one out?

Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?

John is a strange liar.

He lies on six days of the week, but on the seventh day, he always tells the truth.

He made the following statements on three successive days:

Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it"s Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."

On which day does John tell the truth?

What has six faces, but does not wear makeup, has twenty-one eyes, but cannot see? What is it?

A professor thinks of two consecutive numbers between 1 and 10.
'A' knows the 1st number and 'B' knows the second number

A: I do not know your number.
B: Nor do I know your number.
A: Now I know.

What are the four solutions for this?

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?