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?
I am eight letters long - "12345678"
My 1234 is an atmospheric condition.
My 34567 supports a plant.
My 4567 is too appropriate.
My 45 is a friendly thank-you.
My 678 is a man's name.
There are three light switches outside a room. One of the switches is connected to a light bulb inside the room.
Each of the three switches can be either 'ON' or 'OFF'.
You are allowed to set each switch the way you want it and then enter the room(note: you can enter the room only once)
Your task is to then determine which switch controls the bulb?
A devotee visits 9 temples when he visits India. All these nine temples have one thing in common - there are 100 steps in every temple. The devotee puts the Re.1 coin after climbing up every step. He does the same while climbing down every step. At each temple, the devotee offers half of his money from his pocket to god. In this way, his pocket becomes empty after he visits the 9th temple.
Can you calculate the total amount he had initially?