Archive for the ‘Puzzles’ Category.
7th November 2008, 08:45 am
31st October 2008, 05:35 am
I’ve got this puzzle from Nick Petry.
Captain Flint is dying. All his treasures are buried far away. He only has 99 pieces of gold with him. Filled with remorse at the last moments of his life, he decides that he only wants to take one piece of gold with him to his grave. The rest of the gold he will give to the families of two men that he had killed the day before.
Though Captain Flint is heavily drunk he notices that no matter which piece he takes for himself, he can divide the leftover 98 pieces into two piles of 49 pieces each of the same weight. Prove that all the gold pieces are of the same weight.
For an additional challenge, Sasha Shapovalov suggested the following generalization of the previous puzzle.
Captain Flint has N gold pieces and yesterday he killed not two but K men. He wants to take one piece with him to his grave and to divide the rest into equi-weighted piles, not necessarily of the same number of pieces. If he can choose any piece to take with him and is able to divide the rest, prove that N – 1 is divisible by K.
Both of these puzzles can be easily solved if the weight of every gold piece is an integer or even a rational number. If you don’t assume that the weights are rational numbers, then I do not know an elementary solution, but I do know a simple and beautiful solution using linear algebra for both puzzles.
Even pirates need linear algebra to divide their treasure. Hooray for linear algebra!
Share:




20th October 2008, 05:54 pm
Here is a logic puzzle for kids:
— John has more than a thousand books, said Pete.
— No, he has less than one thousand books, said Ann.
— Surely, he has at least one book, said Mary.
If only one statement is true, are you sure you know how many books John has?
Share:




19th October 2008, 05:17 am
Here is a math problem from the 1977 USSR Math Olympiad:
Let A be a 2n-digit number. We call this number special if it is a square and a concatenation of two n-digits squares. Also, the first n-digit square can’t start with zero; the second n-digit square can start with zero, but can’t be equal to zero.
- Find all two- and four-digit special numbers.
- Prove that there exists a 20-digit special number.
- Prove that not more than ten 100-digit special numbers exist.
- Prove that there exists a 30-digit special number.
Obviously, these questions are divided into two groups: show the existence and estimate the bound. Furthermore, this problem can be naturally divided into two other groups. Do you see them? The puzzle about special numbers makes a special day today — you get a four-in-one puzzle.
Share:




18th October 2008, 07:43 am
David Bernstein gave me this puzzle. He says that the puzzle was given at a Moscow math Olympiad a long time ago. At that time there were no computer science olympiads yet. I do not know why this puzzle feels to me like computer science. Maybe because the trivial solution is of order N, the easy solution is of order square root of N and the requested solution is of order logarithm of N:
Can you cut a square into N convex pieces minimizing the number of possible intersections of any straight line with your pieces?
It is easy to maximize the number of intersections. If you cut your square with N-1 parallel cuts into N equal thin rectangles, then there exists a line with N intersections.
It is easy to cut a square to guarantee no more than 2√N intersections. Can you cut your square so that any line makes no more than 2log2N intersections?
Share:




12th October 2008, 12:39 pm
A puzzle from the 1977 USSR math Olympiad can be solved naturally with linear algebra:
Seven dwarfs are sitting at a round table. Each dwarf has a cup partially filled with milk. Each dwarf in turn divides all his milk evenly between the six other cups. After the seventh dwarf has done this, every cup happens to contain the initial amount of milk. What was the initial distribution of milk?
Can you use linear algebra to intelligently solve this puzzle?
Share:




9th October 2008, 04:08 pm
This puzzle is a generalization of a problem from the 1977 USSR math Olympiad:
At the beginning of the game you are given a polynomial, which has 1 as its leading coefficient and 1 as its constant term. Two people play. On your turn you assign a real value to one of the unknown coefficients. The person that goes last wins if the polynomial has no real roots at the end. Who wins?
It is clear that if the last person’s goal is for the polynomial to have a root, then the game is trivial: in this case, he can always make 1 a root with the last move. Also, an odd degree polynomial always has a real root. Therefore, to make the game interesting we should assume that the degree of the polynomial is even.
Though I can’t imaging myself ever being interested in playing this game, figuring out the strategy is a lot of fun.
Share:




8th October 2008, 05:52 pm
Here is a math puzzle for kids from a nice collection of ThinkFun Visual Brainstorms:
Wendy has cats. All but two of them are Siamese, all but two of them are Persian, and all but two of them are Maine Coon. How many cats does Wendy have altogether?
This puzzle has two answers: the expected answer and an unexpected answer. Can you find both?
Share:




25th September 2008, 12:37 pm
Here is a puzzle that my ex-brother-in-law, Dodik, gave to me today:
Prove that every group with more than two elements has a non-trivial automorphism.
I usually love puzzles that are solved with a counter-intuitive brilliant idea. This puzzle is different — I didn’t solve it in one elegant swoop. But I still love the puzzle: it feels so natural, and it’s solution feels so natural, that I even decided to call this puzzle “organic.” Or, maybe, I am just in an organic mood today waiting for my organic bananas to be delivered from Boston Organics.
Share:




23rd September 2008, 11:51 am
Here is a funny puzzle from Kvant (1996, vol 4), the best Russian journal of recreational math.
When Alice goes through the looking-glass, she might meet many multi-headed, multi-armed, multi-legged beings. A being with H heads, A arms and L legs is considered:
- smart, if H > A+L,
- strong, if A > H+L,
- fast, if L > H+A.
Can there exist a well-rounded personality behind the looking-glass: someone who is smart, strong and fast at the same time?
Share:



