Last updated: Mar 28, 2013

Solving Mathematical Problems (Second edition)

Terence Tao

Oxford University Press, Oxford, England: 2006

Paper, 128 pages. ISBN13: 9780199205608

ISBN10: 0199205604

This book discusses various Olympiad level problems and how one can go about trying to solve them. It is the second edition of an earlier first-edition run. It has also been translated into Portugese as “Como resolver problemas matemáticos” by Paulo Ventura Araújo for the Sociedade Portuguesa de Matemática. It has also been translated into Chinese as “解题·成长· 快乐——陶哲轩教你学数学” (ISBN 9787301154472) by Qinglin Yu (于青林) for Peking University Press.

It has been reviewed for the Notices of the American Mathematical Society by Loren Larson.

- Sample chapters (Preface, strategy, problems in number theory)

— Errata —

- In page 2, “Problem 1.1 question” should just be “Problem 1.1”.
- In page 6, second to last paragraph, “once can avoid” should be “one can avoid”.
- In page 7, “ompute” should be “compute”, and “put clear denominators” should be “clear denominators”. On the fourth displayed equation, should be , and should be .
- In page 9, example (e), “876” should be “376”. “which are exactly” should be “which have exactly”. In example (d), should be .
- In page 16, bottom, “217” should be ““.
- In page 25, third paragraph: one of the “n”s should be in math mode.
- In page 33, Exercise 2.5: For an additional challenge, prove this exercise without using Bertrand’s postulate.
- In page 35: In the quote, “that was originally” should be “than was originally”.
- In page 37, second display: should be .
- In page 40, “smells heavily on” should be “smells heavily of”.
- In page 44, 5ab should be (13) (two occurrences)
- In page 45, Problem 3.4, there should be no commas between and . “are all integers” should be “are all distinct integers”. One should delete all references to , for instance deleting the factor in the problem box, and also and in the next page.
- In page 46, in the sentence “But polynomials only have as many degrees of freedom as their degree”, insert “with leading coefficient 1″ after “polynomials”.
- In page 47, Exercise 3.7, the should be a , one should look at rather than , and “are integers” should be “are distinct integers”.
- On page 50, the intersection of BC and AI should be labeled D.
- In the second to last line on page 52, “either or ” should be “either or “.
- In the diagram on page 53, the angle at D should be , and the angle at E should be .
- In page 58, one of the instances of should be in math mode (like all the other instances).
- In page 63, third line, “inner square” should be “inner rectangle”.
- In page 65-66, the informal geometric argument given is incomplete, the issue being that just because the sum of side lengths of is (say) bigger than 1, it is not immediately obvious that the same is true for, say, . But one can check using algebra that if , then , and similarly with the inequalities reversed; this allows the argument as stated to be made rigorous. (One can also argue by considering the rectangle with the narrowest side, and showing that it is adjacent to one which is even narrower if its sides do not add up to length 1.)
- In page 66, problem 44, there is a missing at the end of the string of equations, thus .
- Page 74, second paragraph: “this can be true is of” should be “this can be true is if”
- Page 76-77: The informal topological argument here does not quite work as stated, for if two rectangles with integer horizontal lengths (say) are connected by a common horizontal line segment rather than a common vertical one, then the lengths do not add together as suggested in the argument. To fix this, one needs a more complicated colouring scheme. Namely, one colours the
*interiors*of rectangles with integer horizontal lengths green, and those with integer vertical lengths red. As for the edges, one colours the (open) vertical edges green and the (open) horizontal edges red. There are a few remaining corners which are not on any open edge that remain to be coloured; these can be assigned either red or green arbitrarily. With this colouring, any green path between the two horizontal edges of the big rectangle can be used to deduce the integer horizontal length of that rectangle, and similarly for a red path between the two vertical edges. (There are also several other proofs, for instance one can induct on the number of rectangles.) - In page 77, second-to-last paragraph, “it seems that the assertion is plausible” should be “it seems plausible that the procedure always terminates”.
- In the diagrams on page 79 and page 82, the labels C and D should be switched.
- In page 82, “X is a quarter-length or less from M” should be “X is a quarter-length or more from M”.
- In page 87, second-to-last paragraph, “eliminated (c)” should be “eliminated is (c)”.
- In page 90, second paragraph: “ths game” should be “this game”.
- In page 92, third paragraph: “that it is a sure” should be “that is a sure”.
- In page 95: change all occurrences of “rouble” to “ruble” (for consistency). In the third paragraph, “in terms of equation” should be “in terms of equations”.
- In page 96, last line: “restricted to between” should be “restricted to lie between”.
- In page 97, second paragraph: “” should be “ or “, and so the example values of s should now read .
- In the references, “G.A. Hardy” should be “G.H. Hardy”.

— Errata to the Chinese version —

- In p. 40(d), “如果k是正奇數，則 1^k+2^k+…+n^k 可被 n+1 整除”, n+1 should be n(n+1)/2.
- In p. 76, “幸好第一個因數（p-1)i 和 p^2 是互質的（因為（p-1)i 和 p 是互質的）”, the i’s should be factorial symbols.
- In p. 146, “與一些三角形和圓有關的∠
*APF*，看起來似乎是比較「主流」的角”, APF should be ABF. - In p. 154, “若 n 為偶數，令 m=(n+2)/1″, (n+2)/1 should be n/2+1.
- In p. 202, ” 我們只能說 s = ±4 (mod 20)，因此羊的數量可能是 4、16、24、36、44、56 等”, ” should be “ or “, and so the example values of s should now read .

Thanks to Paulo Ventura Araújo, Thomas Drucker, Percival Li, Cecil Rousseau, Naoki Sato, dsilvestre, Arnstein Skåra, Tom Verhoeff, Weiyu Xu, Li Yan, and Au Cheuk Yin for corrections.

## 18 comments

Comments feed for this article

31 July, 2007 at 8:37 am

Anonymous404 on the link to the first edition.

23 February, 2008 at 6:32 pm

dsilvestreI think on page 52 on the last two lines where it says “because we want to prove that either B=60º or A=Y”, it should instead say “because we want to prove that either A=60º or B=Y”.

(I wrote A for alfa, B for beta, etc)

25 February, 2008 at 9:38 am

Terence TaoThanks for the correction!

8 April, 2008 at 2:32 am

Radu GrigoreNitpick: In Chapter 2 Wilson’s theorem is stated as “(n-1)!+1 is a multiple of n if and only if n is a prime number” and the next page says that “we do not consider 1 to be a prime number.”

8 December, 2008 at 7:41 pm

percyliI think that there is an “D” missing on page 50’s graph.

9 December, 2008 at 6:56 am

Terence TaoThanks!

15 December, 2008 at 3:12 pm

MathOManConcerning page 76-77.

Your corrected solution is beautiful. I have discussed it in my blog alongside two other solutions, one using integration of , the other using the tensor calculus. You can find it here.

Above you also mention the possibility of “induction on the number of rectangles” — how does that work?

19 March, 2009 at 9:00 am

AntonioGreetings,

In Portuguese Mathematics is Matemática, without the h.

The title of your book in Portuguese is “Como resolver problemas matemáticos”, by “Sociedade Portuguesa de Matemática”.

[Corrected, thanks - T.]16 March, 2010 at 10:58 am

Livro de Terence Tao Como Resolver Problemas Matemáticos « problemas | teoremas[...] Solving mathematical problems: a personal perspective, Deakin University Press, 1992. No post Solving Mathematical Problems, de 1997, no seu blogue What’s New, sobre a 2.ª edição do original Solving Mathematical [...]

17 May, 2010 at 3:07 pm

marcoes posible descargar sus textos en formato pfd?

gracias

19 May, 2010 at 1:43 am

palibacsiI would appreciate it, if occasionally higher-level mathematical problems were discussed in a similar style and by various authors, where even the eventually dismissed ideas and avenues of attack are documented. I hope there is room for it at least on the internet.

I think it would be interesting to see how different mathematicians make use of the existing literature while working on a problem and how they find the sources that eventually turn out to be helpful.

If something like this already exists, I will be glad to know where.

My impression is that far too many students get the false impression that they will never be able to produce the kind of polished solutions and proofs they always read and I hope that this can be overcome in this way. The next step would be to draw the students’ attention to these discussions.

Perhaps the polymath projects are quite close to it, but on a level too high to reach a large enough part of the students.

19 May, 2010 at 1:50 am

palibacsiOn top it says that the second edition of Solving Mathematical Problems has 150 pages, but the one on my desk has only 103 pages. If there are another 47 pages of this wonderful book, I must get them!

19 May, 2010 at 7:26 am

Terence TaoHmm, strange, I don’t remember where that number came from. The official OUP page lists 128 pages (presumably counting blank pages, etc.), so I’ll go with that number.

19 May, 2010 at 12:05 pm

palibacsiCounting blank pages, etc., there are actually 128 pages.

12 April, 2012 at 3:56 pm

jhHello, professor, i got a question for (d) of p.9 of this book, “If k is a positive odd number, then 1k +2k +. . .+nk is divisible by n+1.”

when

n=5 k=3,

1^3+2^3+3^3+4^3+5^3=225 (not divisible by 6)

in case,

i think you intended when n=(even) whole expression is divisible by n(n+1)/2

(you showed it at problem 2.6)

[Correction added, thanks - T.]13 September, 2012 at 5:00 pm

João JorgeHi there, on problem 2.6, page 25, there is something that I can´t see. I suppose it’s obvious. “If the two factors are coprime, then our objective is equivalent to proving both of” “(factor 1)|(expression) and (factor 2)|(expression)”. Why it´s necessary the two factors being coprimes ? It’s maybe a dumb question but please someone enlighten me !

Thanx,

Regards.

14 September, 2012 at 8:08 am

Terence TaoThe claim “a|n and b|n” is not logically equivalent to “ab|n” in general, but instead to “lcm(a,b)|n”, where lcm(a,b) is the least common multiple of a and b. For example, to show that an integer n is divisible by 24=6*4, it is insufficient to demonstrate that n is divisible by 6 and 4 separately (n=12 is a counterexample). Of course, if a and b are coprime, then lcm(a,b)=ab, and so logical equivalence is restored in this case.

On the other hand, the converse implication is always true: “ab|n” implies both “a|n” and “b|n”, regardless of how many common factors a and b have.

14 September, 2012 at 12:12 pm

João JorgeHi again,

First thanx for the reply, and second for the elucidation.

It was kind of obvious, but I wasn´t seeing it.

By the way I am studying your book “analysis”. I’m a portuguese student on 2ºyear of 3 on economics, on a further 2 years masters degree.

My course don’t have much mathematics, so I’m teaching myself.

I do it because I like maths, and I need a strong basis to be more analitical, quantitative, beeing more capable of study advanced technical books, and improve mind thinking.

I have good grades on mathematics now, but not really good ones. I think I’m very clever, “small genius”, but always frooze on tests. Some teachers said that I have an excellent mathematical reasoning.

On 12º my math teacher gave me 1 more value on 0-20 scale because of a probablistic problem that I solved with sequencies.

Do you have any suggestion how I should aproach tests?

With a final comment I would like to express my admiration for your work, community interaction, and the reasons why you work on mathematics.

Thanx, and good luck for everything in your life,

Regards.