Author Archives: admin
I came across a game where your knowledge of Geometry will help you solve puzzles. It's called Euclid: the game and can be accessed here. It consists of 20 levels of Geometry puzzles. Enjoy.
A camel is loaded with straws until it's back breaks. Each straw has a weight uniformly distributed between 0 and 1, independent of other straws. The camel's back breaks as soon as the total weight of all the straws exceeds 1. Find the expected weight of the last straw that breaks the camel's back. (knowledge [Read the full story ...]
Estimate the value of pi using a 6 sided die. - via Goldman Sachs interview, reposted in CSE blog
A car has 4 tires and 1 spare tire. Each tire can travel a maximum distance of 20000 miles before wearing off. What is the maximum distance the car can travel before you are forced to buy a new tire? You are allowed to change tires (using the spare tire) unlimited number of times. - [Read the full story ...]
What is the largest square table that you can cover completely using 3 square napkins of side 1 unit? You cannot tear the napkins, but you can fold them or overlap them, and the napkins are allowed to drape over the side of the table. - via Mind your decisions.
You certainly can make a triangle from 3 unit toothpicks called a, b and c (each being a side opposite angles A, B, and C respectively. But what if you were to: Cut a piece from b and burn it. Cut a piece from c and burn it. Leave a alone. What are the probabilities [Read the full story ...]
There are 3 people each wearing either a white or a black hat. They can see everyone's hat except their own. They must design a strategy so that they can maximize the chances of success of at least one person guessing the hat color correctly and no one guessing wrong. They cannot talk to each [Read the full story ...]
You want to pair 2n students into n pairs of 2 students each. You like to do it on consecutive days so that no two students are paired together twice. What is the maximum number of consecutive days for which you can achieve such a pairing?
There are n coins placed in a row. The goal is to form n/2 pairs of them by a sequence of moves. On the first move a single coin has to jump over one coin adjacent to it, on the second move a single coin has to jump over two adjacent coins, on the third [Read the full story ...]