To the fourth dimension …
Posted by tpc at April 1st, 2010
and beyond? xkcd mentioned this game Miegakure about puzzle solving in four dimensions. I have my doubts about this but it’ll certainly be interesting.
Posted by tpc at April 1st, 2010
and beyond? xkcd mentioned this game Miegakure about puzzle solving in four dimensions. I have my doubts about this but it’ll certainly be interesting.
Posted by tpc at April 8th, 2009
I chanced upon this neat number puzzle devised by William Wallace, via wild about maths. It’s form is certainly recognizable, but still the effort deserves praise.
I remember a similar puzzle played with a deck of cards. You lay out the cards in rows and ask the participant to tell who which row his card is in. The trick is to collect the cards back horizontally, but deal out the next four rows vertically, this way after a few deals, you can tell which card is it.
This happen to tie in with a class I’m teaching tomorrow, maybe I’ll print out the cards and try it in class.
Posted by tpc at May 6th, 2008
I’ve been looking at logic puzzles as a break from all the frenzied examination related activities. An internet search will inevitably throw up the old nugget known as Einstein’s IQ quiz or puzzle. The wiki entry has a variant called the Zebra puzzle and at least a proper reference.
Posted by tpc at June 19th, 2007
a personal perspective by Terence Tao. This is a new edition of a book which was written by Tao more than 15 years ago, which means when he was only 15! It’s a thin little book that takes a leisurely look at solving some competition type problems. The coverage is not huge, but the author take pains to go through in great detail various strategies one can adopt in solving problems. Quite a nice book but very pricey for 102 pages.
I found exercise 2.1 quite fun.
In a parlour game, the ‘magician’ asks one of the participants to think of a three-digit number
. Then the magician asks the participant to add the five numbers
and
, and reveal their sum. Suppose the sum was 3194. What was
?
My solution is this. If we add all the six permutations, we know that the sum equals

.
So we just need to know the multiples,
. Take the smallest multiple larger than the given number, and check by subtracting the difference and summing the digits. You do not have to do it with more than 5 different multiples.
.
But
, so incorrect.
now
.
And
and we found our number.
Posted by tpc at April 30th, 2007
Here’s my solution to a nice little trigonometric problem posted by miss loi.
Show that





(QED)
Posted by tpc at March 22nd, 2007
I spotted this little book at the library and flipped through it. I saw the names Cauchy, Euler and d’Alembert and was immediately thinking “oh differential equations” until I flipped to this lovely nested square root

courtesy of Ramanujan.
This book turns out to be a guide to competition problem solving by Christopher Small. I’m not very big on competition problem solving, probably because I can’t do most of them, but I do like to work on some of them every once in a while. I’ve read most of the book, and quite like it.
Oh, the expression above evaluates to 3. Try it!
Posted by tpc at September 2nd, 2006
Came across a funny little problem last week. Explain the following:
For primes
, the decimal expansion of
is non-terminating. Is there a formula for the number of repeating digits?
6 digits
2 digits
6 digits
16 digits
and my favourite twin primes
5 digits
21 digits
Posted by tpc at December 27th, 2005
My latexrender (installed by my wife with much pain) has gone to disuse. So I’m putting up this problem posted by pAt84.
Version 1

Version 2

Posted by tpc at December 25th, 2005
A simple little puzzle. Suppose you are given two ordinary 6 sided dice. Is it possible to put the numbers 0-9 (with repetition) onto the faces of both dice, such that using both dice you can display all the days of the month i.e. 01 - 31 .
Posted by tpc at February 8th, 2005
No one shall expel us from the paradise that Calculus has created.
- tpc
The fact that an analytic solution to number theoretical problems exist is bewildering. And often, the analytic proof is much simpler than the elementary proof. The Prime Number Theorem is the most famous example. Another is the evaluation of
and
in terms of double integrals.
The following is strictly not a number theory problem:
A rectangle is divided into smaller rectangles. Each of the smaller rectangles has the property that at least one of the sides has integer length. Show that the large rectangle has the same property.
I first encountered the problem at kuro5hin via Chapterzero, but apparently it dates back to de Bruijin in the sixties. I couldn’t solve it but as luck would have it, saw a solution in Paul Zeitz’s The Art and Craft of Problem Solving, which provided a reference to an article in American Math Monthly (vol 94) by Stan Wagon which gave 14 proofs, including a one line calculus proof.
Posted by tpc at January 16th, 2005
AIME 1994
Find n for which
.
A fairly straightforward problem that can be worked out quickly once you see the pattern. 313 was my initial answer which was wrong. (The actual answer is 312.) The funny thing is that I first tried to check it with Maple and it returned an answer that was slightly wrong. My guess is bad code resulting in some round off error.
So I checked with Excel and found the answer and my initial error. Athough admitting that I like a microsoft product will destroy whatever “geek” status I that possess, I have to say that there are few things you cannot do with Excel. It is also an excellent (pun not intended) way to investigate patterns in number theory.
Posted by tpc at December 10th, 2004
A monk starts to climb a mountain at 8:00 am and reaches the summit at noon. He spends the rest of the day and that night on the summit. The next morning he leaves the summit at 8:00 am and descends by the same route he used the day before, reaching the bottom at noon. Prove that there is time between 8:00 am and noon at which the monk was at exactly the same spot on the mountain on both days. Note that the monk can walk at different speeds, rest, or even go backward whenever he wants.
A nice problem. Source unknown.
Posted by tpc at November 28th, 2004
It took me almost a week to prove
where
.
A time consuming but fruitful exercise. I had tried all the integration tricks I know, resorted to computer packages Maple and Mathematica - Integrator . In the end, I used contour integration and it took another two days to find the correct contour. I may not publish my solution here, in case I meet some smug kid who badly need to be tormented.
I found the problem here, the given solution is a heuristic argument.