Documente Academic
Documente Profesional
Documente Cultură
Delightful Puzzles
1. Chameleons On an island live 13 purple, 15 yellow and 39. Working Computer A room has n computers, less
17 maroon chameleons. When two chameleons of different than half of which are damaged, others are good. It is possible
colors meet, they both change into the third color. Is there a to query a computer about the status of any computer. A
sequence of pairwise meetings after which all chameleons damaged computer could give wrong answers. The goal is to
have the same color? discover a good computer in as few queries as possible.
2. Pebble Piles You are given three piles with 5, 49 and 40. Tiling With Calissons A large regular hexagon is cut
51 pebbles respectively. Two operations are allowed: (a) out of a triangular grid and
merge two piles together or (b) divide a pile with an even tiled with diamonds (pairs of
number of pebbles into two equal piles. Is there a sequence of triangles glued together
operations that would result in 105 piles with one pebble along an edge). Diamonds
each? come in three varieties,
depending on orientation;
prove that precisely the same number of each variety must
3. Rope Escape Rajeev is trapped atop a building 200m appear in the tiling.
high. He has with him a rope 150m long. There is a hook at
the top where he stands. Looking down, he notices that
midway between him and the ground, at a height of 100m, 41. Loop in a Linked List Given the head of a linked list,
there is a ledge with another hook. In his pocket lies a Swiss find if it contains a loop or not, in linear time. Can you
knife. Hmm... how might he be able to come down using the accomplish it with only O(1) extra space? Can you do it
rope, the two hooks and the Swiss knife? without modifying the list in any way?
4. Cake Cutting Mary baked a rectangular cake. Merlin 42. Perplexing Polynomial Alice is allowed to choose an
secretly carved out a small rectangular piece, ate it and arbitrary polynomial p(x) of any degree with nonnegative
vanished! The remaining cake has to be split evenly between integer coefficients. Bob can infer the coefficients of p(x) by
Mary's two kids. How could this be done with only one cut only two evaluations as follows. He chooses a real number a
through the cake? and Alice communicates p(a) to him. He then chooses a real
number b and Alice communicates p(b) to him. What values of
a and b helped Bob succeed and how?
5. Fox in a Hole Consider five holes in a line. One of them
is occupied by a fox. Each night, the fox moves to a
neighboring hole, either to the left or to the right. Each 43. Poisoned Wine Barrels An enemy spy has poisoned
morning, you get to inspect a hole of your choice. What one out of 1000 barrels of wine in a king's cellar. Even a sip of
strategy would ensure that the fox is eventually caught? the poisoned wine has potency to kill. However, the effects of
the poison show only in 30 days. The king asks the royal jailor
to identify the poisoned barrel within 30 days. What is the
6. Cube Cutting Imagine a 3x3x3 wooden cube. How least number of prisoners the jailor must employ to identify the
many cuts do we need to break it into twenty-seven 1x1x1 poisoned barrel?
cubes? A cut may go through multiple wooden pieces.
There is an unmarked grave and two tall oak trees. 49. What's the Number on My Hat? A goblin forewarns N
Walk from the grave to the left tree, counting the gnomes as follows: "Tomorrow morning, I shall place one hat
number of steps. Upon reaching the left tree, turn on each of you. Each hat shall be labeled with some number
left by 90 degrees and walk the same number of drawn from the range [0, N-1]. Duplicates are allowed, so two
steps. Mark the point with a flag. Return to the different hats might have the same label. Any gnome shall be
grave. Now, walk towards the right tree, counting able to see numbers on other hats but not his own! When a
the number of steps. Upon reaching the right tree, bell rings, all gnomes shall simultaneously announce one
turn right by 90 degrees and walk the same number number each. If any gnome succeeds in announcing the
of steps. Mark this point with another flag. The number on his own hat, all gnomes shall be set free." The
treasure lies at the midpoint of the two flags. gnomes have assembled in the evening to discuss their
predicament. Can you help them devise a strategy?
A party of sailors reached the island. They find a pair of tall
oak trees merrily swaying in the wind. However, the unmarked
grave is nowhere to be found. They are planning to dig up the 50. Tiling a Chessboard with Dominoes (A) An 8x8
entire island. It'll take a month. Can they do any better? chessboard has had two of its diagonally opposite squares
removed, leaving it with sixty-two squares. Can we tile it with
31 non-overlapping 2x1 rectangles (dominoes) such that all
12. Six Colored Balls We have two red, two green and
squares are covered? (B) Under what circumstances would
two yellow balls. For each color, one ball is heavy and the
other is light. All heavy balls weigh the same. All light balls removal of two squares from an 8x8
weigh the same. How many weighings on a beam balance are chessboard allow such a tiling? For
necessary to identify the three heavy balls? example, if we remove an arbitrary white
square and an arbitrary black square, can
the remaining board be tiled?
13. Josephus Problem There are n persons in a circle,
numbered 1 thru n. Going around the circle, every second
person is removed from the circle, starting with person number
2, 4, and so on. Show that the number of the last person 51. Tiling a Chessboard with Trominoes Show that a
remaining in the circle can be obtained by writing n in binary, chessboard of size 2^n by 2^n can be tiled with L-shaped
then moving the leftmost 1 to the right. So for example, with n figures of 3 squares, such that only one square remains
= 13 persons (1101 in binary), the last person is number 11 uncovered. In fact, the uncovered square may be any square
(1011 in binary). for every choice, there exists a tiling. In fact, the puzzle
may be extended to 3D: Eight unit cubes make a cube with
edge length two. We will call such a cube with one unit cube
14. Forty-Five Minutes How do we measure forty-five
removed a "piece". A cube with edge length 2^n consists of
minutes using two identical wires, each of which takes an
hour to burn. We have matchsticks with us. The wires burn (2^n)3 unit cubes. Prove that if one unit cube is removed from
non-uniformly. So, for example, the two halves of a wire might T, then the remaining solid can be decomposed into pieces.
burn in 10 minute and 50 minutes respectively.
52. Fuel Dumps on a Circular Racetrack A set of fuel
15. Thousand Prisoners A prison has 1000 cells. Initially, dumps on a circular racetrack have just enough gasoline for
all cells are marked with - signs. From days 1 thru 1000, the one car to make one round trip. Prove that there exists a fuel
jailor toggles marks on some of the cells: from + to - and from dump from which one car, starting with an empty gas tank,
- to +. On the i-th day, the signs on cells that are multiples of i can complete the round trip.
get toggled. On the 1001-th day, all cells marked with + signs
are opened. Which cells are these? 53. Red Card Alice repeatedly draws a card randomly,
without replacement, from a pack of fifty-two cards. Bob has a
16. Non-Transitive Dice You and your opponent shall play one-time privilege to raise his hand just before a card is about
a game with three dice: First, your opponent chooses one of to be drawn. Bob must execute his privilege before the last
the three dice. Next, you choose one of the remaining two card is drawn. If the card drawn is Red just after Bob raises
dice. The player who throws the higher number with their his hand, Bob wins; otherwise he loses. Is there any way for
chosen dice wins. Now, each dice has three distinct numbers Bob to be correct more than half the times he plays this game
between 1 and 9, with pairs of opposite faces being identical. with Alice?
Design the three dice such that you always win! In other
words, no matter which dice your opponent chooses, one of 54. My Cap Color At the Secret Convention of Logicians,
the two remaining dice throws a number larger than your the Master Logician placed a band on each attendee's head,
opponent, on average. such that everyone else could see it but the person
themselves could not. There were many, many different
colours of band. The Logicians all sat in a circle, and the
17. Blind Man and Cards A blind man is handed a deck Master instructed them that a bell was to be rung in the forest
of 52 cards and told that exactly 10 of these cards are facing at regular intervals: at the moment when a Logician knew the
up. How can he divide the cards into two piles, not necessarily colour on his own forehead, he was to leave at the next bell.
of equal size, with each pile having the same number of cards Anyone who left at the wrong bell was clearly not a true
facing up? Logician but an evil infiltrator and would be thrown out of the
Convention post haste; but the Master reassures the group by
18. Breaking a Chocolate How many steps are required stating that the puzzle would not be impossible for anybody
to break an m x n bar of chocolate into 1 x 1 pieces? We may present. How did they do it?
break an existing piece of chocolate horizontally or vertically.
Stacking of two or more pieces is not allowed. 55. Twelve Coins One of twelve coins is counterfeit: it is
either heavier or lighter than the rest. Is it possible to identify
19. Two Dice = Nine Cards Alice has two standard dice the counterfeit coin in three weighings on a beam balance?
with labels 1 thru 6. When she rolls them and adds their
labels, she gets a distribution over integers in [2, 12]. Bob has 56. Grid Infection In an n by n grid of squares, two
nine cards, each labeled with some real number. When Bob squares are neighbors if they share an edge. Initially, some
chooses two cards (without replacement) and adds their squares are "infected". At successive clock ticks, an
labels, he gets exactly the same distribution over integers in uninfected square gets infected if at least two of its neighbors
[2, 12] as Alice gets by rolling her dice. What are the labels are infected. How many squares must initially be infected so
on Bob's nine cards? that all squares eventually get infected?
20. Three Boxes and a Ruby Alice places three identical 57. Duplicate Integer An array of length n+1 is populated
boxes on a table. She has concealed a precious ruby in one with integers in the range [1, n]. Find a duplicate integer (just
of them. The other two boxes are empty. Bob is allowed to one, not all) in linear time with O(1) space. The array is read-
pick one of the boxes. Among the two boxes remaining on the only and may not be modified. Variation: what if the array may
table, at least one is empty. Alice must then remove one be written into but must be left unmodified by the algorithm?
empty box from the table. Finally, Bob is allowed to open
either the box he picked, or the box lying on the table. If he
opens the box with the ruby, he gets a kiss from Alice (which 58. Find the Angle Find the measure of angle "a" in the
he values more than the ruby, of course). What should Bob diagram.
do?
21. Absent-Minded Professor N women stand in a queue
to take seats in an auditorium. Seating is pre-assigned.
However, the first woman is an absent-minded professor who
chooses any of the N seats at random. Subsequent women in
the queue behave as follows: if the seat assigned to her is
available, she takes it. Otherwise, she chooses an
unoccupied seat at random. What are the chances that the
last woman in the queue shall get the seat assigned to her?
38. Measuring Weights (a) Customers at a grocer's shop 73. Geometry With Only a Compass Using only a
always want an integral number pounds of wheat, between 1 compass (and without a straight edge or a ruler), is it possible
pound and 40 pounds. The grocer prefers to measure wheat in to identify (a) the midpoint of two points? (b) the center of a
exactly one weighing with a beam balance. What is the least circle? (c) all four corners of a square, given two of them?
number of weights he needs? (b) Customers come to a pawn
shop with antiques. An antique always weighs an integral
number of pounds, somewhere between 1 pound and 80 74. Dijkstra's Self-Stabilization Protocol There are n+1
pounds. The owner of the pawn shop is free to do as many processors named 0, 1, ..., n. Processor i has a counter C(i)
weighings as necessary to ascertain the unknown integral that takes values in the range [0, n]. Its initial value is
weight by using a beam balance. What is the least number of arbitrarily chosen from [0, n]. Processor 0 is said to be
weights he needs? privileged if C(0) = C(n). Processor i, where i > 0, is said to be
privileged if C(i) C(i-1). At successive clock ticks, exactly
one out of possibly several privileged processors is arbitrarily
chosen and its counter is updated as follows: If processor 0 is
chosen, we set C(0) (C(0) + 1) mod (n+1). Otherwise, we
set C(i) C(i-1). Prove that after a bounded number of clock
ticks, exactly one processor will be privileged. And that this
will continue to hold forever.
The Puzzle Toad at CMU has challenging puzzles. William Wu's Puzzles Page at Berkeley has myriad puzzles with a discussion
board. Cut the Knot has dozens of high quality articles on mathematics, puzzles and games. Puzzles by Erich Friedman has
cute puzzles; he also maintains Math Magic, Erich's Packing Center and Ambigrams. Archives of Ed Pegg Jr's Math Games in
MAA make interesting reading. Age of Puzzles is a nicely done website with classic puzzles, diagrams and references. Sam
Lloyd website: A few of his puzzles have tastefully been compiled at this website. SOMA cube has dozens of SOMA cube
configurations. List of books by Martin Gardner. Select puzzles for high school students: SNAP Math Fair. Another small
collection. A nice collection of problems at mathproblems.info. Another collection of puzzles. Yet another collection by Tanya
Khovanova. Some problems by Mihai Patrascu. Several ingenious puzzles at MathOveflow.Net. Prisoner and Hat Puzzles.
Surprises! Surprises! Surprises!. MSRI Archives (puzzles in each newsletter). Nice C Puzzles by Gowri Kumar. Interesting articles
on various problems.
There are 1000 persons in a circle, numbered 1 thru 1000. Going around the circle, every second
person is removed from the circle, starting with person number 2, 4, and so on. this is done repeatedly
until one person is left. Which number person out of 1000 will that be?
8 Reply Share
All the puzzles are available in editable form at google doc at the following link.
https://docs.google.com/docume...
5 Reply Share
omg i had an extra credit one just like that riddle one and i got it right infact i was the only one that
got it right
2 Reply Share
17 green marbles and 14 white marbles what is the probability of choosing a white marble first chosen
without replacement was a green marble help please
2 Reply Share
Ranjith lal
2 Reply Share
i have a box.the two dimension of the box are 4 m and 3m. compute the third dimension of the box so
that the space diagonal of the box is an integer. solve this problem.
Reply Share
Alice and Bob are playing a game. The game is played as follows :
- There are N piles of coins on the table. Pile i has A[i] coins.
- In each turn, each player can pick up 1 or more coins from the leftmost non-empty pile.
- If a player picks up a coin from pile i , all coins from piles 0 to i-1 should have been taken.
- The person who picks up the last coin loses the game.
Alice and Bob play the game alternately. Alice plays first. Given the number of piles N and the
number of coins Ai in pile i, you have to determine which player will win the game, assuming
both play optimally.
both play optimally.
Reply Share
The study materials are now ready in virtual format. I just need to print them and thats why I
telephoned the school principle and asked him how many children signed the course. He said to me
that the participants are exactly 10 and their request is to be arranged in the classroom on 5 rows with
exactly 4 children on each row.
I already printed 10 copies of the study materials. This task was easy! But how to arrange the children
on five rows with exactly four children on each row?
In Polya's Urn process, surely the urns are the same size. Are you asking for the expected number of
balls in the urn containing the fewest balls?
Reply Share
hi gurmeet so beautiful
Reply Share
Pankaj Kukkar 2 years ago
you have two ropes, each of which takes one hour to burn completely. both of these ropes are
nonhomogeneous in thickness, meaning that some parts of the ropes are chunkier than other parts of
the rope. using these nonhomogeneous ropes and a lighter, time 45 minutes.
Note: Some clarification on what is meant by nonhomogeneous. For instance, maybe a particular
section of rope that is 1/8 of the total length is really chunky, and takes 50 minutes to burn off. then it
would take 10 minutes to burn off the remaning 7/8, since we know that the whole rope takes an hour
to burn off. that's just an example; we don't know any such ratios beforehand. The point is, if you look
at one of your ropes and cut it into pieces, you have no clue how long any individual piece will take to
burn off.
Reply Share
To friend #1 I give half the cards plus half a card. To friend #2 I give half of the cards remaining plus
half a card. To friend #3 i give half of the cards I have left plus half of a card. After this I have no
cards left ?
Reply Share
There are 12 L-shapes that need to be inserted into a grid. Each L has one hole in it. There are three
pieces of each of the four kinds shown here and any piece may be turned or flipped over before being
placed on the grid. No pieces of the same L can touch, even at a corner. The pieces fit together so well
that you cannot see any spaces between them; only the holes show. Can you tell where the L's are.
Reply Share
you r on the top of a bus, which means you are definitely not inside the bus. Give me a case which
both of the statements would be true.......
Reply Share
If at least one of m and n are even, India wins. Otherwise England does.
To win, whenever you have a bag which is even, split it into two odd bags. Y our opponent will
have no choice but to leave you with at least one nonempty even bag, allowing you to repeat
this process until no moves remain.
Reply Share
I recall a puzzle that isn't shown here but was once proposed by an IMO student. A 50 by 50 by 50
cube is levitating 100 ft into the air. There are two 50 ft ropes in the box, and a single window at the
cube's bottom side. I also vaguely recall the mention of a hook, perhaps on the box's side. How can a
person trapped inside escape, it asked. Like a fool, I had forgotten my hard-won solution. Could you
remind me, if you recognize this problem or if you have an idea of how to achieve escape.
Thanks.
Reply Share
M19 would be a better puzzle if you specify the number of floors rather than leave it arbitrary. As it is
written now, it should really be in the difficult category. Here's a moderate phrasing with a solution
that doesn't require a math degree:
With 100 floor building and 2 eggs, what is the optimal strategy for finding the lowest floor at which
an egg will break when dropped?
Solution:
At any point, if you are left with only 1 egg, the only strategy that will give you the answer is to start at
the lowest unknown floor and work your way up one-by-one until the egg breaks or until you reach
the top floor.
With 2 eggs, you can improve your strategy by starting somewhere between the lowest unknown floor
and the highest unknown floor. If the egg breaks, you can eliminate all upper floors, but then you
have to revert to the 1 egg strategy. If the egg doesn't break, you can eliminate that floor plus all floors
below it, and then choose another starting point among the remaining floors and repeat.
With 100 floors, you can find the correct floor in 14 drops or less by starting at floor 14. If the egg
breaks, you then go to floor 1, work your way up, and will find the correct floor with at most 14 drops.
If the egg doesn't break, then move up 13 floors to 27. Again, if it breaks, you work your way up from
15 and will find the correct floor in at most 14 drops. If it didn't, you move up 12 floors, then 11, etc.
Using this method, you can see that you will always find the correct floor in 14 or fewer drops.
Using this method, you can see that you will always find the correct floor in 14 or fewer drops.
If you attempt to find the floor with 13 or fewer drops, you can see that you must start at the 13th
floor or lower, and after the first drop you can move at most 12 floors, then 11, etc. Y ou will not reach
the top of the building within 13 drops, so you cannot guarantee you will find the correct floor.
superb
Reply Share
Hey,
Some problems don't have a solution.. like M17 and D11. Can u plz upload them
Reply Share
D11: http://pratikpoddarcse.blogspot.com/2010/01/red-vs-black-cards-expected-payoff.html
M17: http://pratikpoddarcse.blogspot.com/2009/11/weighing-problems.html
Cheers!
Reply Share
Hi Gurmeet,
Could you post the solution to the firing squad problem. The solution is now linked to the wikipedia
page. It would be nice if you could post the one you had posted before as well as explain why the
speeds are x and 3x. Thanks for your help!
Reply Share
The Puzzles are nice, trying to solve them , giving me a lot of fun
Reply Share
hey,
ur puzzles r cool n ur website totally is vry awesome :)
Reply Share
On D5, are the tumblers initially arranged upright, facing down, or randomly?
On D5, are the tumblers initially arranged upright, facing down, or randomly?
Reply Share
Great list!
'A cube with edge length 2n consists of (2n)^3 unit cubes. Prove that if one unit cube is removed from
T, then the remaining solid can be decomposed into pieces.'
Classic collection. Knew few puzzles before but a lot of these are new and very interesting!! Thanks for
sharing!
Reply Share
Good Collection.
http://2600hertz.wordpress.com...
Reply Share
4^4 = 64!
Reply Share