What is greater than gold but cannot be bought. it can never be sold and can earn if its sought. though it can be broken, it can still be fixed. for by birth it can't start nor by death it is ended.what am i?
One night, Louis and Adam were sitting together. Adam was watching a movie while his wife Louis was reading a mystery book. Suddenly the power went out and Adam decided to go to bed, but strangely Louis kept on reading. There was no artificial light around, so Louis kept on reading. How come?
The Brit lives in the red house.
2. The Swede keeps dogs as pets.
3. The Dane drinks tea.
4. The greenhouse is on the immediate left of the white house.
5. The greenhouse’s owner drinks coffee.
6. The owner who smokes Pall Mall rears birds.
7. The owner of the yellow house smokes Dunhill.
8. The owner living in the centre house drinks milk.
9. The Norwegian lives in the first house.
10. The owner who smokes Blends lives next to the one who keeps cats.
11. The owner who keeps the horse lives next to the one who smokes Dunhill.
12. The owner who smokes blue masters drinks beer.
13. The German smokes Prince.
14. The Norwegian lives next to the blue house.
15. The owner who smokes Blends lives next to the one who drinks water.
Now, the question is…Who owns the fish?
A four-digit number (not beginning with 0) can be represented by ABCD. There is one number such that ABCD=A^B*C^D, where A^B means A raised to the B power. Can you find it?
Like you see, some letters have gone missing from these words that contain the IE pair at some or the other place. The letters that will be used to fill the blanks are given below. Use them and form meaningful words. Can you do that?
A, C, D, F, H, K, L, M, N, N, O, R, R, S, S, S, T, T, Y and Y.
Two guards were guarding the camp.Guard-1 was looking towards the south to make sure no threat is coming from the road.Guard-2 was looking at the north to make sure no threat is coming from the top. Suddenly Guard-1 ask the Guard-2 why he is smiling?How Guard-1 knows that Guard-2 is smiling?
In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?
