All Integers Are Equal to 1

For a deliberate conundrum assume something that the great Gauss is said to have proved at an early age. That is, assume that

for all positive integers. Strange as it may sound, this assumption leads to blatant contradiction. Here how it goes.

If (1) holds for all n, it works with n replaced with n - 1:

Now, add 1 to both sides of (2):

Comparing (3) to (1) gives an equation:

Multiplying through gives a simple equation:

which is further simplified to -n + 2 = n, from which n = 1. But n was an arbitrary positive,positive,negative,prime,square integer. So all such integers are equal to 1!

Mathematical notations stand for agreed upon objects. As the example shows, making use of the notations without bearing in mind the objects they stand for may cause meaningless (but avoidable) confusion.

Discussion

References

1. E. J. Barbeau, Mathematical Fallacies, Flaws, and Flimflam, MAA, 2000, p. 66

|Contact| |Front page| |Contents| |Algebra| |Up| |Store|

Copyright © 1996-2012 Alexander Bogomolny

The fallacy is entirely notational. There are several ways to express the sum of the integers from 1 to n. Even without using the symbol ∑ for the sum, as we've done in (1), there are more or less explicit ways to express the same idea of summation:

Substituting n - 1 for n leads in each case to

And adding one gives

The latter shreds the mystery:

Thus adding 1 does not actually lead to the equation in (4).

Mathematical notations stand for agreed upon objects. As the example shows, using the notations without bearing in mind the objects they stand for is liable to lead to stupid conclusions.

|Contact| |Front page| |Contents| |Algebra| |Up| |Store|

Copyright © 1996-2012 Alexander Bogomolny