Lion and its Tamer

A lion and its tamer are standing inside a cage that measures 1 unit in radius. Both of them can effortlessly run at the speed of 1 unit maximum.

1) Suppose the lion is hungry, will he be able to eat up the tamer?
2) If yes, how long can the tamer survive?




Similar Riddles

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?

Nodes Connectivity Riddle

Asked by Neha on 20 Dec 2020


I have a mouth but I don't eat.
I have a bank but have no money.
I have a bed but i dont sleep.
I wave but have no hands.

Who Am I ?

Asked by Neha on 01 Mar 2023

Four children having five rocks each were playing a game in which they had to throw the rock at a particular solid area in the water. Child 1- Succeeded in throwing three rocks at a solid area but one of the rocks sunk. Child 3 - His aim was so bad that all rocks got sunk. Child 4- He was awesome and none of the rocks got sunk. Child 2 - Was the winner but was struck by a rock in the head and died. Who killed Child 2?

Asked by Neha on 21 Oct 2024


On rolling two dices (six-sided normal dice) together, what is the probability that the first one comes up with a 2 and the second one comes up with a 5?

Asked by Neha on 08 Oct 2023

What kind of band never plays music?

Asked by Neha on 14 Jul 2025

Joseph organises an exotic office New year party at the beach to his important fellow employees.

Following are the important people that will come to the party

1. Joseph

2. Joseph 2 girlfriends- Carol Vanstone and Tracey Hughes

3. The sales head Clay Vanstone.

4. Clay Vanstone 2 associates.

5. Mr. Jeremy and his Secret Tab.

They all need to cross a small river to reach the beach, however, Joseph has got just one boat.

There are few rules for crossing the river.

1. The capacity of the boat is limited to just two people.

2. Clay Vanstone associates will not stay with Joseph without Clay Vanstone.

3. Carol Vanstone and Tracey Hughes will not stay with the Clay Vanstone without Joseph.

4. Mr. Jeremy would never leave the Secret Tab alone.

5. Secret Tab counts as a person.

6. Only Joseph, Clay Vanstone or Mr. Jeremy can drive the boat.

7. The two girlfriends Carol Vanstone and Tracey Hughes will not stay with the Clay Vanstone without Joseph.

8. No Associates would stay with Joseph without their Clay Vanstone.

9. Mr.Jeremy will not leave the Secret Tab alone.

Asked by Neha on 15 Dec 2020


A tourist visits a small town for his research. While in the town, he decides to get a haircut. Since the town is quite small, there are only two barbers in the town � one on the North Street and one on the South Street. The barbershop on the North Street is a mess and the barber has a weird and pathetic haircut. While the barbershop at the South Street is pretty tidy and the barber as well has an impressive haircut.

Which barbershop will the tourist visit for his haircut and why?

Famous Barber Haircut Riddle

Asked by Neha on 23 Jul 2024

People are waiting in line to board a 100-seat aeroplane. Steve is the first person in the line. He gets on the plane but suddenly can't remember what his seat number is, so he picks a seat at random. After that, each person who gets on the plane sits in their assigned seat if it's available, otherwise, they will choose an open seat at random to sit in. The flight is full and you are last in line. What is the probability that you get to sit in your assigned seat?

Asked by Neha on 13 Mar 2024

How many pluses should we put between the digits of 987654321 to get a total of 99, and where?

Asked by Neha on 25 Sep 2021


Can you find the next number in the below sequence
3 , 7 , 10 , 11 , 12 , 17 ?

Asked by Neha on 04 Mar 2025

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.