How much will a 38° angle measure when looked at under a microscope that magnifies ten times?

He digs out tiny caves and stores gold and silver in them. He also built bridges of silver and made crowns of gold. They are the smallest you could imagine. Sooner or later everybody needs his help, yet many people are afraid to let him help them. Who is he?

Five thieves looted a bank and they ran away in a car. The bank staff informed the police and they began the search of their car in their jeep. They found them on a road and chased them eventually catching them. The light that is used to fill the number plate was broken on the thieves' car. Also, the headlights of the jeep police were not working. How were the police able to catch the thieves then?

John speaks the truth only once a day in a week. Below are a few hints for you:

First: Days are Sunday, Monday and so on.
Second: One day he says, "I lie on Monday and Tuesday".
Third: On the next day, he says, "Today is either Thursday, Saturday or Sunday".
Fourth: On the next day, he says, "I lie on Wednesday and Friday".

Can you identify the day on which he speaks the truth?

what does this below rebus represent identXQQQQQME

Three cars are driving on a track that forms a perfect circle and is wide enough that multiple cars can pass anytime. The car that is leading in the race right now is driving at 55 MPH and the car that is trailing at the last is going at 45 MPH. The car that is in the middle is somewhere between these two speeds.
Right now, you can assume that there is a distance of x miles between the leading car and the middle car and x miles between the middle car and the last car and also, x is not equal to 0 or 1.
The cars maintain their speed till the leading car catches up with the last car and then every car stops. In this scenario, do you think of any point when the distance between any two pairs will again be x miles i.e. the pairs will be x distance apart at the same time ?

Three people enter a room and have a green or blue hat placed on their heads. They cannot see their own hat but can see the other hats.
The colour of each hat is purely random. They could all be green, blue, or any combination of green and blue.
They need to guess their own hat colour by writing it on a piece of paper, or they can write 'pass'.
They cannot communicate with each other in any way once the game starts. But they can have a strategy meeting before the game.
If at least one of them guesses correctly they win $10,000 each, but if anyone guesses incorrectly they all get nothing.
What is the best strategy?

In the attached figure, you can see a chessboard and two rooks placed on the chess board. What you have to find is the number of squares that do not contain the rooks. How many are there?

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

PS: You may start the number from 0.

Can you tell a 3D object that has just two surfaces?