15 caves are arranged in a circle at the temple of doom. One of these caves has the treasure of gems and wealth. Each day the treasure keepers can move the treasure to an adjacent cave or can keep it in the same cave. Every day two treasure seekers visit the place and have enough time to enter any two caves of their choice.

How do the treasure seekers ensure that they find the treasure in the minimum number of possible days?

Find three whole, positive numbers that have the same answer when multiplied together as when added together.

You need to arrange three 7 and mathematical symbols to form number 1?

There are five vowels (a, e, i, o, u) in the English language.
Can you tell us a word that contains all these vowels?

You are trapped into a death trap by the famous jigsaw killer. As usual, a screen flashes in front of you and explains you the trap game. There are 100 pearls kept in a bowl in front of you and an empty bowl. Among the 100 pearls, 50 are white and 50 are black. You can divide them as you like into the two bowls. Once you are done, you will pull a lever, which will turn the room pitch black. The bowls will move and shuffle around. In the dark, you have to pick up one pearl from any bowl. Once you do that, the room will flood with lights again. If the peral you have in your hand is white, you will be allowed to live, but if the pearl you picked is black, the room will be filled with poisonous gas and you will die. How will divide the pearls to increase your chances of survival?

I never was there, I am always to be.
You have never ever seen me, not ever you will.
Yet I am the confidence of everyone.

Who Am I?

Give it food and it will live; give it water and it will die.

The teacher told the student that if he told a lie then he will be expelled from school and if he told the truth then he still is expelled from school.

What can a student say to prevent his being expelled from school?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

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?