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?

Find the last number in the series below:

voN luJ yaM raM ---

Below, you can see some coding:
January = 1017
February = 628
March = 1335
April = 145
May = 1353
June = 1064
July = 1074
August = 186

Now deciphering the way it has been coded, can you find out how September will be coded?

A brand new Mobile Phone was on sale at 20% as a promotional offer. By what per cent must the Mobile price be increased to sell it at the original price again?

In a basket of apples,
when counted in twos, there was one extra
when counted in threes, there were two extra when counted in fours, there were three extra
when counted in fives, there were four extra
when counted in sixes, there was five extra.

However, if the apples were counted in sevens, no extra apple was left. Can you calculate the minimum number of apples that were present in the basket?

Until it is measured, not known. Yet how you miss it when it has gone. What is it?

You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

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?

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?

What will be the best approach to finding all the prime numbers less than 75 that leave an odd reminder when we divide them with 5?