Sandeep 's World >> Puzzle Mania

Last updated April 20, 2015 with the geometry puzzle. All answers are available @ Puzzles Unravelled.


Geometry Puzzle
 A
  |\
  | \
  |  \
  |   \
  |    \
  |     \
  |      \
  |       \
  |        \
  |         \
  |          \
  |           \
  |            \
  |             \
  |              \
D |_______________\ C
  |               |\
  |               | \
  |               |  \
  |               |   \
  |               |    \
  |               |     \
  |_______________|______\
 O               E         B
    
In the figure,
  • AOB and DCE are right angles
  • AB = 221
  • DC = CE = 60
  • OA is longer than OB

Find OA.

Let me add that trial and error is the easiest way out here, but the real challenge is to solve it using equations as there is no guarantee that the solution is an integer!

Note: after posting this, I realized that the puzzle came from usvishakh.net and is explained in a very hiralious way.


Factor of Sums
Take four distinct non-zero positive integers a, b, c and d (a ≠ b ≠ c ≠ d). Say, s = a + b + c + d, and s1 = a + b, s2 = a + c, s3 = a + d, s4 = b + c, s5 = b + d, s6 = c + d. If you are allowed to pick up a, b, c, d, how many of {s1, s2, s3, s4, s5, s6} can be made divisible by s?

For example, a = 2, b = 3, c = 4, d = 11, s = 20. Only s1 (2 + 3 = 5) is divisible by s. In comparison, a = 1, b = 2, c = 4, d = 8, s = 15, with s1 (1 + 2 = 3) and s2 (1 + 4 = 5) divisible by s.


Car Thief and Lie Detector
A rather silly car thief stole, without knowing it, the car of the chief of police. The police immediately started an investigation and on the basis of witness depositions, four suspects were arrested that were seen near the car at the time of the crime. Because the chief of police took the case very seriously, he decided to examine the suspects personally and use the new lie-detector of the police station. Each suspect gave three statements during the examinations, that are listed below:

Suspect A:
  1. In high-school I was in the same class as suspect C.
  2. Suspect B has no driving license.
  3. The thief didn't know that it was the car of the chief of police.

Suspect B:
  1. Suspect C is the guilty one.
  2. Suspect A is not guilty.
  3. I never sat behind the wheel of a car.

Suspect C:
  1. I never met suspect A until today.
  2. Suspect B is innocent.
  3. Suspect D is the guilty one.

Suspect D:
  1. Suspect C is innocent.
  2. I didn't do it.
  3. Suspect A is the guilty one.

With so many contradicting statements, the chief of police lost track. To make things worse, it appeared that the lie-detector didn't quite work yet as it should, because the machine only reported that exactly four of the twelve statements were true, but not which ones.

The Question: Who is the car thief?

This is a fairly simple one for us but not so easy for the police chief!


Match the Following
There are 5 houses in 5 different colors. In each house lives a person with a different nationality. The 5 owners drink a certain type of beverage, smoke a certain brand of cigar, and keep a certain pet. No owners have the same pet, smoke the same brand of cigar, or drink the same beverage.

The question is: Who owns the fish?

Hints:
  1. The Brit lives in the red house.
  2. The Swede keeps dogs as pets.
  3. The Dane drinks tea.
  4. The green house is on the left of the white house.
  5. The green homeowner drinks coffee.
  6. The person who smokes Pall Mall rears birds.
  7. The owner of the yellow house smokes Dunhill.
  8. The man living in the center house drinks milk.
  9. The Norwegian lives in the first house.
  10. The man who smokes Blend lives next to the one who keeps cats.
  11. The man who keeps the horse lives next to the man who smokes Dunhill.
  12. The owner who smokes Bluemaster drinks beer.
  13. The German smokes prince.
  14. The Norwegian lives next to the blue house.
  15. The man who smokes Blend has a neighbor who drinks water.


Searching Two-Dimensional Array
There is a two dimensional array, of size 'n' rows and 'm' columns, with all rows and columns sorted individually. Whats the best way to search for a value (say, 'v') in the array? Best way is obviously the one with the lowest order of search.


Choosing Weights
This is a representative of a huge variety of weights and common balance problems. U r given a common balance and is expected to chose weights, so that u can measure all integer weights from 1kg - 40kg.

The question is what are the weights u'll choose, if u have to do it with minimum number of weights.


Faulty Ball
There are 13 balls, out of which one of them one is faulty (in terms of weight, either overweight or underweight, which we dont know). If u r given a common balance, how many weighs will u need to find out the faulty. Ofcourse, it shud work for all cases!

A simpler variation of the problem is a group of 9 balls, with one of them underweight (here, we know the faulty is actually underweight).


Speed of the River
A man was roving up the river and saw a log flowing down about 1mile from his starting point. He continued roving for another hr (after he saw the log) and then turned around and started going back. When he reached the starting point, he again saw the log. Assuming that the man is roving at a constant speed and the river flowing at a constant speed, what is the speed of the log/river?

(For this question, its always possible to frame two equations in two variables and solve them, but the charm is in solving it without any maths equations! Precisely the reason why I've added it here)


Candy Packets
Candies are available in packets of 6, 9 and 20. Obviously most of the counts can be made using these packet sizes, lets say 50 candies = one 20 packet, two 9 packets and two 6 packets. What is the highest count of candies which cannot be made of these packet sizes?

(An easier version of the same puzzle is packet sizes of 3 and 20)


Birthday Puzzle
On a tuesday morning, two men are travelling in a train. One of them says: "If you take the year when I was born and sum up the four digits of it, then you get my age!"

The other one says: "Surprisingly, although my age is different, if I do the same with the four digits of the year when I was born, I get my age, too!"

A mathematician overhears the conversation and wishes both of them a happy birthday. The mathematician was right (of course!), and wouldn't have said it if he wasn't 100% sure.

Questions:

When did that happen? How old were the two men? When were they born?

(Give day, month and year. And dont worry, there is a unique solution.)


Product 'n Sum
X, Y are two numbers so that 2 <= X, Y <= 99 and X ! = Y

There are two smart guys P and S. P knows the product of X and Y and S knows the sum. Now they have this conversation:

S : I dont know the numbers
P : Neither Do I
S : I know that u dont know the numbers
P : Now I know the numbers
S : Now, I too do

So tell me what is X and Y ?

(Needless to say this also has a unique and logical solution)


Ant 'n Rod
There is an iron rod 1km long, an ant starts moving from one end of the rod at a rate of 1 cm/s. but, after each second the rod stretches by an extra 1km (yeah ... its 1km and not 1cm) on both sides.

The question is how long will the ant take to reach the other end, if at all it will ?

Dont worry about things like the length of the ant and the width of the rod. They are all zero. for a practical case, replace iron rod with a line segment and ant with a point object.


Power
This one is simple. Write down an 'efficient' program to find 'a' to the power of 'b' where 'a' and 'b' are integers. Well ... the catch is in the word 'efficient'. Yeah ... I mean efficiency in terms of number of operations and memory usage.



© 2017 Sandeep Unnimadhavan