Suppose n lines are drawn on a plane. Some of them can be concurrent (pass through same point). How many different regions created in this process? (find the least and the greatest number of regions that can be created).
Suppose there are 'n' circles no three of which pass through the same point and all of which intersect every other circle at two points. How many regions are created?
Suppose there are 100 points on a plane no three of which are on the same straight line. Can you draw a line on the plane such that 50 points are on one side of it?
A game is played between two players. There is a round table and unlimited supply of stones (dimension of the stone is unimportant). In each turn of the game a player can put one stone on the table. Whoever fails to find space one the table looses the game. Find a winning strategy for the first player.
On a 20 by 20 board a special knight is moving. In each turn the knight moves 1 step in a direction and 5 steps in a direction perpendicular to it. The knight is allowed to take as many turns as required. Can it come back to any of it's four adjacent squares of the square from which it started moving?
We often say that = etc. Is the statement true for x = 500 (or may be larger values?) If not, why?
Find a point on the plane of a triangle such that the sum of it's distances from three vertices is minimum.
Please post any interview problems that you remember. That will help other prospective applicants.