Frank Morgan's Math Chat
March 4, 1999
OLD CHALLENGE. Critique the following short proof of Fermat's Last Theorem sent in by reader Rob Connelly. (In perhaps the biggest mathematics news of the century, Andrew Wiles recently came up with a very long and complicated proof to this 350-year old problem.)
Fermat's Last Theorem. The equation
(1) xn + yn = zn
has no positive integer solutions for n > 2.
Proposed proof. Suppose there were such a solution. Since x y, we may suppose x = y + a, z = y + b, with b > a positive integers. Consider the integer N defined by
(2) zn -1 = xn-1 + yn-1 + N.
xn + yn = zn = z(xn-1 + yn-1 + N).
Solving for N yields:
N = [(y+a)n-1 (a-b) + yn-1 (-b)]/(y+b) = [F(y)]/(y+b) ,
so y+b divides F(y) and
(*) 0 = F(-b) = (a-b)n + (-b)n 0 = (b-a)n + bn > 0,
the desired contradiction.
ANSWER. Luke Gustafson and John Snygg give the best account of the mistake in line (*). It is true that if as expressions in a variable y, y+b divides F(y), then y+b must be a factor of F(y) and F(-b) must be 0. But here, y is a constant, and just because the constant y+b divides the constant F(y), it does not follow that F(-b) = 0.
Elliot Kearsley also points out that the proof, if correct, would apply as well to the false case n = 2. John Robertson also reports that "I have found an error in Wiles's official published proof of Fermat's Last Theorem," but then admits that it is just an insignificant typo.
NEW CHALLENGE. Which countries in the world have a point such that the shortest line from every other point in the country stays inside the country? (Pretend that the world is round and smooth: ignore mountains and valleys.) Mathematicians call such countries starlike. Are there any countries such that the shortest line between any two points stays in the country? Mathematicians call such countries convex.
JOKE. This week's winning math joke comes from Eric Brahinsky. Curious scholars at a world mathematics conference are aghast when a man strolls to the lectern leading--a horse!
"Ladies and gentlemen!" he announces, "Meet Dobbin, the world's only equine mathematical genius! I invite you to submit problems to him, which he will solve with amazing speed!"
The room is in an uproar, but an intrepid voice calls out, "9 times 3!"
Over the din hoofbeats are heard. Twenty-seven of them. The room grows quiet. Then another voice. "Five cubed." .... And 125 hoofbeats! "6 factorial!"--720 hoofbeats. Applause starts and gradually grows....
"Ladies and gentlemen: these are child's play. Challenge him! I know you can do better than that!"
"How many ways can 7 distinct objects be partitioned?" snickers one professor. His sneer fades as the horse stamps 877 times. "OK," snaps another. "How many distinct factors does the square root of Skewes' number [one of the largest numbers ever to appear in mathematics] have?" With hooves tramping like trillions of troupes of flamenco dancers, Dobbin serenades the astonished gathering with exactly 2.5x10(2x1034-1)+101034 +1 clicks. "e to the i p!" Through some mysterious sleight-of-hoof, Dobbin responds with -1 click. Professors assail the heroic horse with the most complex problems in partial differential equations, chaos theory, even...geometric measure theory [Prof. Morgan's field]. The horse never misses a beat. Dobbin remains unflappable and, evidently, infallible. Applause turns to wild cheering, (human) foot-stomping, cries of "Bravissimo!"
Finally, the beaming presenter holds up one hand. "Ladies and gentlemen: I think we all agree we've witnessed a memorable display here. Now we have time for only one more problem, so make it a good one!"
A handful of the world's top mathematicians huddle together. Pencils are flying, calculators calculating, slide rules sliding, sadistic grins growing.
Amidst all this, a young voice from the back yells, "I got one! I got one!" The gathered scholars turn to see a schoolgirl, maybe 15, with a tattered school text in one hand and the other hand raised and waving madly. Raucous laughter. One slightly annoyed professor says, "Young lady! The world's top mathematical brains are laboring here. And I suppose you can do better???"
"But I have one he can't do. I know it. Please? Please?"
The amused presenter says, "In all fairness, she did have hers ready first. Let's hear it."
"OK. You've got a plane with perpendicular axes and each point identified by its Cartesian coordinates [named after Descartes]. What's the distance from the origin to (1,0)?"
Gales of laughter. "Come ON! That's infantile! Go away and let us work!"
"No! Make him answer! He can't do it!" She strides straight to the front, looks Dobbin straight in the eye and shouts, "Answer it!"
Dobbin twitches his tail a bit but otherwise just stands there. One prof says, "Hey, she's a sweet kid. He really ought to answer. What's the deal?" Others join in: "Yeah! What's the matter, horse?"
Dobbin's tail twitches more, and his mane begins to toss. Nostrils flare. A slight lather can be seen on his flanks. But the assemblage listens in vain for that single click.
"Well, obviously," says the presenter, "such a silly trifle isn't worth his time." But by now a chant of "ANSWER IT! ANSWER IT!" has risen. The horse's eyes are wild with fear. Finally, Dobbin rears up, neighs in terror, and bolts from the room--his humiliated owner running after him to calls of "Fraud! Charlatan!"--and worse.
Back in the room, the hubbub eventually settles. One mathematician approaches the girl who had asked the question that brought Dobbin down. "It was such an easy question. How did you know?"
"Oh, that's simple. Everyone knows you can't put Descartes before the horse."
Send answers, comments, and new questions by email to:
Frank.Morgan@williams.edu, to be eligible for Flatland and other book awards. Winning answers will appear in the next Math Chat. Math Chat appears on the first and third Thursdays of each month. Prof. Morgan's homepage is at www.williams.edu/Mathematics/fmorgan.
Copyright 1999, Frank Morgan.