Nelsen

1/20/08

7:00 PM

Page 7

+

=

Visual Gems of Number Theory Roger B. Nelsen Lewis & Clark College

W

hile looking through some elementary number theory texts recently, I was struck by how few illustrations most of them have. A number can represent the cardinality of a set, the length of a line segment, or the area of a plane region, and such representations naturally lead to a variety of visual arguments for topics in elementary number theory. Since a course in number theory usually begins with properties of the integers, specifically the positive integers, the texts should have more pictures. In the next few pages I’ll present some “visual gems” illustrating one-to-one correspondence, congruence, Pythagorean triples, perfect numbers, and the irrationality of the square root of two. We begin with figurate numbers, positive integers that can be represented by geometric patterns. The simplest examples are the triangular numbers tn (= 1 + 2 + 3 + ! + n) and square numbers n2. In Figure 1(a) are the familiar patterns for t4 and 42. The computational formula for tn is n(n + 1)/2, which is easily derived from Figure 1(b) by seeing that 2tn = n(n + 1).

(a)

(b)

Figure 1. Triangular and square numbers. You may have noticed that each triangular number is also a binomial coefficient:  n + 1 1+ 2 +!+ n =  .  2  One explanation for this is that each is equal to n(n + 1)/2, but this answer sheds no light on why the relationship holds. A better explanation is the following: there exists a one to one correspondence between a set of tn = 1+2+3+ ! +n objects

and the set of two-element subsets of a set with n+1 objects. In Figure 2, we have a visual proof of this correspondence.

 n + 1 . Figure 2. A visual proof that 1 + 2 + ! + n equals   2  There are many lovely relationships between triangular and square numbers. One is hidden in the following theorem, which appears in nearly every elementary number theory text as an example or exercise: if n is odd, then n2 ≡1(mod 8). In Figure 3, we have a visual proof that every odd square is one more than eight times a triangular number, which proves the result. But it does more—it is an essential part of an induction proof that there are infinitely many numbers that are simultaneously square and triangular! First note that t1 = 1 = 12. Then observe that t8t = k

8tk (8tk + 1) = 4tk ( 2 k + 1)2 , 2

so that if tk is a square, so is t . For example, t8 = 62, t288 = 8t k 2042, etc. But not all square triangular numbers are generated 2 this way: t49 = 35 , t1681 = 11892, etc. Challenge: Can you find a visual argument to use in the proof for odd triangular numbers? WWW.MAA.ORG/MATHHORIZONS 7

1/20/08

7:00 PM

Page 8

MATH HORIZONS

Figure 3. A visual proof that n odd implies n2 ≡ 1(mod 8). Congruence results involving triangular numbers can be illustrated in a similar manner. In Figure 4, we “see” that t3n–1≡ 0 (mod 3).

Exercise: Find visual arguments to show that t3n ≡ 0 (mod 3) and t3n+1 ≡ 1 (mod 3).

Figure 5. There are infinitely many PPTs. A classical result characterizing PPTs is the following theorem: (a, b, c) is a PPT if and only if there are relatively prime integers m > n > 0, one even and the other odd, such that (a, b, c) [or (b, a, c)] = (2mn, m2 – n2, m2 + n2). Figure 6 uses the double angle formulas from trigonometry to illustrate this result. n θ

m

n  sin θ =  m2 + n2  m cosθ =  m2 + n2 

m,n ∈N, m > n

2mn   m2 + n2   2 2 m −n  cos2θ = m2 + n2  sin2θ =

m2 +n 2

Nelsen

2mn

2θ m2 –n2

Figure 4. A visual proof that t3n–1 ≡ 0 (mod 3). Discussing triangles and squares in geometry always brings to mind the Pythagorean theorem. In number theory it brings to mind Pythagorean triples. A primitive Pythagorean triple (PPT) is a triple (a, b, c) of positive integers with no common factors satisfying a2 + b2 = c2. Familiar examples are (3, 4, 5), (5, 12, 13) and (8, 15, 17). Indeed, there are infinitely many PPTs, and in Figure 5 we have a visual proof that n2 odd (i.e. n2 = 2k+1) implies that n2 + k2 = (k + 1)2, or equivalently, that (n, k, k+1) is a PPT. In Figure 5, the n2 = 2k +1 blue dots are first arranged into an “L” then k2 white dots are drawn, for a total of (k + 1)2 dots.

Figure 6. A characterization of PPTs. Another less well-known characterization is the following: there exists a one-to-one correspondence between PPTs and factorizations of even squares of the form n2 = 2pq with p and q relatively prime. Figure 7 illustrates this result.

Exercise: In the proof, we’ve actually shown that there are infinitely many PPTs in which one leg and the hypotenuse are consecutive integers. Find a visual proof that there are infinitely many PPTs in which the hypotenuse and one leg differ by two. Figure 7. Another characterization of PPTS. 8 NOVEMBER 2007

Nelsen

1/20/08

7:00 PM

Page 9

MATH HORIZONS

The PPT (3, 4, 5) is the only such triple where the sum of two consecutive squares is the next square. But what about sums of three consecutive squares? Four consecutive squares? Observe: 32 + 4 2 = 5 2

10 2 + 112 + 12 2 = 132 + 14 2

212 + 22 2 + 232 + 24 2 = 25 2 + 26 2 + 27 2 " What’s the pattern? A little reflection yields the observation that each square immediately to the left of the equals sign is the square of four times a triangular number, i.e., 4 = 4(1), 12 = 4(1+2), 24 = 4(1+2+3), etc., which leads to the identity ( 4 t n − n )2 + ! + ( 4 t n )2 = ( 4 t n + 1)2 + ! + ( 4 t n + n )2 . While it is not difficult to verify this by induction, the illustration (for the n = 3 case, using 4t3 = 4(1+2+3)) of these “Pythagorean runs” in Figure 8 may better explain why the relationship holds.

Figure 9. Euclid’s formula for even perfect numbers. nal of a square are incommensurable. Here is a modern version of that classical Greek proof. From the Pythagorean theorem, an isosceles triangle of edge-length 1 has hypotenuse 2. If 2 is rational, then some multiple of this triangle must have three sides with integer lengths, and hence there must be a smallest isosceles right triangle with this property. But the difference of two segments of integer length is a segment of integer length and so, as illustrated in Figure 10, inside any isosceles right triangle whose three sides have integer lengths we can always construct a smaller one with the same property! Hence 2 must be irrational. Exercise: Prove that 3 and 5 are irrational in a similar manner.

Figure 8. Pythagorean runs. The ancient Greeks called positive integers like 6 and 28 perfect, because in each case the number is equal to the sum of its proper divisors (e.g., 28 = 1 + 2 + 4 + 7 + 14). In Book IX of the Elements, Euclid gives a formula for generating even perfect numbers: If p = 2n+1–1 is a prime number, then N = 2np is perfect. We can illustrate this result very nicely in Figure 9 by letting N be the area of a rectangle of dimensions 2n ! p, and noting that the rectangle can be partitioned into a union of smaller rectangles (and one square) whose areas are precisely the proper divisors of N. We conclude with one more example from the Greeks. The Pythagoreans were probably the first to demonstrate that 2 is irrational, that is, to show that lengths of a side and the diago-

Figure 10. The irrationality of 2 .

Further Reading For more visual proofs with triangular numbers, see James Tanton’s “Triangular Numbers” in the November 2005 issue of Math Horizons. For visual proofs in combinatorics, see Jennifer Quinn and Arthur Benjamin’s Proofs That Really Count: The Art of Combinatorial Proof (MAA, 2003). For an Continued on page 29

WWW.MAA.ORG/MATHHORIZONS 9

Book Reviews

1/21/08

1:48 AM

Page 31

MATH HORIZONS

Math Made Visual: Creating Images for Understanding Mathematics, by Claudi Alsina and Roger Nelsen. Published by Mathematical Association of America. ISBN 978-0-88385-746-5. List: $51.95. square identities and integrals. Thus, Continued from page 9 introduction to creating visual proofs, see Claudi Alsina and Roger Nelsen’s Math Made Visual: Creating Images for Understanding Mathematics (MAA, 2006). Some of the proofs in the article originally came from: T. Apostol, “The irrationality of the square root of two—a geometric proof,”

when approaching problems of this nature, it is often best to represent numbers as areas of a region of a plane. For instance, a simple figure (such as the one on top of page 7) represents that 1+3+5 + ! +(2n–1) = n2, even though the algebraic proof is a better-known method. There are many ways to solve a math problem, and visual approaches are often a great start. Because of the nature of visual proofs, it is possible to make different illustrations to arrive at the same conclusion. For example, the authors continually revisit the Pythagorean Theorem, showing several visual proofs throughout the book to demonstrate that there are various ways to arrive at the same conclusion. From the ancient Greeks’ to Leonardo da Vinci’s method, each proof is different as well as provocative for such a fundamental theorem. Other topics covered include iterative procedures, some number theory, visual sets, and a mind-bendingly fun chapter on three-dimensional

illustration proofs. As a narrative, Math Made Visual is truly a work of art. However, the best feature in Math Made Visual is the problem sets at the end of each chapter. Each puzzle is challenging and fun, and, just like the rest of the book, invites creativity. Although there are solutions for each problem in the back of the book, it is quite easy to arrive at the same conclusion in other ways. Regardless, each solution is elegant as well as interesting. Having double majored in art and math, I could not help delighting in Math Made Visual for its true spirit and meaning. Although useful and fun, the aesthetics of each visual proof was appealing as well as entertaining. Ultimately, each treasure found in unraveling a wordless proof exposes a deeper and insightful glimpse of the beautiful processes of mathematics.

Am. Math. Monthly, 107 (2000), 841842.

even squares,” Math. Mag., 78 (2005), 14.

M. Boardman, “Proof without words: Pythagorean runs,” Math. Mag., 73 (2000), 59.

L. Larson, “A discrete look at 1+ 2 + ! +n,” College Math. J., 16 (1985), 369382.

D. Goldberg, personal communication.

C. Vanden Eynden, Elementary Number Theory, Random House, 1987.

J. Gomez, “Proof without words: Pythagorean triples and factorizations of

Jacob McMillen and Natalya St. Clair serve on the Student Advisory Group for Math Horizons.

Contest Results In the April 2007 issue of Math Horizons, Ken Suman challenged our readers to find examples of mathematical equivoques. Many of you responded. Our favorites come from Benjamin Dickman, Amherst College ’08 and Donald Vestal, South Dakota State University with these new definitions: concave: where the bad guys hang out convex: what police try to do dimension: “Did I tell you…” fuzzy set: A set that has been left in the refrigerator too long mock theta functions: what Ken Ono does when his theta functions misbehave

Q Test: most adorable relativity: genealogy Schur numbers: numbers whose values are known Schur triple: Catching the right-fielder asleep with a hit along the base line

WWW.MAA.ORG/MATHHORIZONS 31

Visual Gems of Number Theory

illustrations most of them have. A number can represent the cardinality of a .... Benjamin's Proofs That Really. Count: The Art of Combinatorial Proof (MAA, 2003).

672KB Sizes 10 Downloads 216 Views

Recommend Documents

Elementary Number Theory
and data security.] ...... Click or double-click on the Maple icon—or ask the lab assistant where it is ...... 2. f : Un → Ua × Ub is also a one-to-one, onto mapping. 3.

Elementary Number Theory
gorithm” is sometimes used more loosely (and sometimes more precisely) than defined here ...... The author recently watched a TV show (not movie!) called La ...

A Framework for Visual Characterization of Number ...
input data range. Lastly ... These are very powerful commercial visualization tools however they .... this framework is the open source object oriented code.

A Framework for Visual Characterization of Number ...
by developers to create applications based on number theoretic problems. .... control which has been developed as a component in the windows control library.

Algebraic Number Theory, a Computational Approach - GitHub
Jan 16, 2013 - 2.2.1 The Ring Z is noetherian . .... This material is based upon work supported by the National Science ... A number field K is a finite degree algebraic extension of the ... How to use a computer to compute with many of the above obj

104 Number Theory Problems.pdf
on Algebraic Number Theory and Elliptic Curves. He teaches at Phillips Exeter. Academy. Zuming also ... Page 3 of 213. 104 Number Theory Problems.pdf.

Elementary Methods in Number Theory
in integers x1,...,xs. The shape of the function Rs(n) depends on the parity of s. In this book we derive formulae for Rs(n) for certain even values of s, in particular, ...... rnqn−1. Since rn < rn+1, it follows that qn−1 ≥ 2. This procedure i

Future Number of Children
www.gapminder.org/teach ... Free teaching material for a fact-based worldview .... Attribution - You must make clear to others the license terms of this work and ...

Online PDF Number Theory (Dover Books on ...
Online PDF Number Theory (Dover Books on Mathematics) - Full .... Although mathematics majors are usually conversant with number theory by the time they ...

Solved and unsolved problems in Number Theory - Daniel Shanks.pdf
Solved and unsolved problems in Number Theory - Daniel Shanks.pdf. Solved and unsolved problems in Number Theory - Daniel Shanks.pdf. Open. Extract.

number theory books pdf free download
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. number theory ...

104-Number-Theory-Problems-Andreescu-Andrica-Feng.pdf ...
Retrying... 104-Number-Theory-Problems-Andreescu-Andrica-Feng.pdf. 104-Number-Theory-Problems-Andreescu-Andrica-Feng.pdf. Open. Extract. Open with.