From Zero to Infinity: What Makes Numbers Interesting is a book in popular mathematics and number theory by Constance Reid. It was originally published in 1955 by the Thomas Y. Crowell Company. [1] The fourth edition was published in 1992 by the Mathematical Association of America in their MAA Spectrum series. [2] [3] [4] A K Peters published a fifth "Fiftieth anniversary edition" in 2006. [5] [6] [7] [8] [9] [10]
Reid was not herself a professional mathematician, but came from a mathematical family that included her sister Julia Robinson and brother-in-law Raphael M. Robinson. [11] She had worked as a schoolteacher, but by the time of the publication of From Zero to Infinity she was a "housewife and free-lance writer". [1] She became known for her many books about mathematics and mathematicians, aimed at a popular audience, of which this was the first. [11]
Reid's interest in number theory was sparked by her sister's use of computers to discover Mersenne primes. She published an article on a closely related topic, perfect numbers, in Scientific American in 1953, and wrote this book soon afterward. [4] Her intended title was What Makes Numbers Interesting; the title From Zero to Infinity was a change made by the publisher. [8]
The twelve chapters of From Zero to Infinity are numbered by the ten decimal digits, (Euler's number, approximately 2.71828), and , the smallest infinite cardinal number. Each chapter's topic is in some way related to its chapter number, with a generally increasing level of sophistication as the book progresses: [4] [5] [10]
The first edition included only chapters 0 through 9. [1] The chapter on infinite sets was added in the second edition, replacing a section on the interesting number paradox. [12] Later editions of the book were "thoroughly updated" by Reid; [4] in particular, the fifth edition includes updates on the search for Mersenne primes and the proof of Fermat's Last Theorem, and restores an index that had been dropped from earlier editions. [9]
From Zero to Infinity has been written to be accessible both to students and non-mathematical adults, [4] requiring only high-school level mathematics as background. [7] Short sets of "quiz questions" at the end chapter could be helpful in sparking classroom discussions, making this useful as supplementary material for secondary-school mathematics courses. [6] [10]
In reviewing the fourth edition, mathematician David Singmaster describes it as "one of the classic works of mathematical popularisation since its initial appearance", and "a delightful introduction to what mathematics is about". [4] Reviewer Lynn Godshall calls it "a highly-readable history of numbers", "easily understood by both educators and their students alike". [6] Murray Siegel describes it as a must have for "the library of every mathematics teacher, and university faculty who prepare students to teach mathematics". [10]
Singmaster complains only about two pieces of mathematics in the book: the assertion in chapter 4 that the Egyptians were familiar with the 3-4-5 right triangle (still the subject of considerable scholarly debate) and the omission from chapter 7 of any discussion of why classifying constructible polygons can be reduced to the case of prime numbers of sides. [4] Siegel points out another small error, on algebraic factorization, but suggests that finding it could make another useful exercise for students. [10]
In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is countable if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements.
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers, or defined as generalizations of the integers.
A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.
In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem.
In mathematics, a Fermat number, named after Pierre de Fermat (1607–1665), the first known to have studied them, is a positive integer of the form: where n is a non-negative integer. The first few Fermat numbers are: 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ....
Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.
In mathematics, transfinite numbers or infinite numbers are numbers that are "infinite" in the sense that they are larger than all finite numbers. These include the transfinite cardinals, which are cardinal numbers used to quantify the size of infinite sets, and the transfinite ordinals, which are ordinal numbers used to provide an ordering of infinite sets. The term transfinite was coined in 1895 by Georg Cantor, who wished to avoid some of the implications of the word infinite in connection with these objects, which were, nevertheless, not finite. Few contemporary writers share these qualms; it is now accepted usage to refer to transfinite cardinals and ordinals as infinite numbers. Nevertheless, the term transfinite also remains in use.
In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dirichlet L-functions to give the first proof of Dirichlet's theorem on arithmetic progressions. It is well known for its results on prime numbers and additive number theory.
In number theory, a Wieferich prime is a prime number p such that p2 divides 2p − 1 − 1, therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides 2p − 1 − 1. Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.
In number theory, a regular prime is a special kind of prime number, defined by Ernst Kummer in 1850 to prove certain cases of Fermat's Last Theorem. Regular primes may be defined via the divisibility of either class numbers or of Bernoulli numbers.
In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction. It is a method which relies on the well-ordering principle, and is often used to show that a given equation, such as a Diophantine equation, has no solutions.
The interesting number paradox is a humorous paradox which arises from the attempt to classify every natural number as either "interesting" or "uninteresting". The paradox states that every natural number is interesting. The "proof" is by contradiction: if there exists a non-empty set of uninteresting natural numbers, there would be a smallest uninteresting number – but the smallest uninteresting number is itself interesting because it is the smallest uninteresting number, thus producing a contradiction.
In number theory, a Pierpont prime is a prime number of the form for some nonnegative integers u and v. That is, they are the prime numbers p for which p − 1 is 3-smooth. They are named after the mathematician James Pierpont, who used them to characterize the regular polygons that can be constructed using conic sections. The same characterization applies to polygons that can be constructed using ruler, compass, and angle trisector, or using paper folding.
In number theory, Fermat's Last Theorem states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions.
Infinity is something which is boundless, endless, or larger than any natural number. It is often denoted by the infinity symbol .
In the history of mathematics, the principle of permanence, or law of the permanence of equivalent forms, was the idea that algebraic operations like addition and multiplication should behave consistently in every number system, especially when developing extensions to established number systems.
In number theory, a pernicious number is a positive integer such that the Hamming weight of its binary representation is prime, that is, there is a prime number of 1s when it is written as a binary number.
Closing the Gap: The Quest to Understand Prime Numbers is a book on prime numbers and prime gaps by Vicky Neale, published in 2017 by the Oxford University Press (ISBN 9780198788287). The Basic Library List Committee of the Mathematical Association of America has suggested that it be included in undergraduate mathematics libraries.