Follow on twitter: @thatsmaths
Randomness is a slippery concept, defying precise definition. A simple example of a random series is provided by repeatedly tossing a coin. Assigning “1” for heads and “0” for tails, we generate a random sequence of binary digits or bits. Ten tosses might produce a sequence such as 1001110100. Continuing thus, we can generate a sequence of any length having no discernible pattern [TM152 or search for “thatsmaths” at irishtimes.com].
Continue reading ‘Random Numbers Plucked from the Atmosphere’
The rational numbers are countable: they can be put into one-to-one correspondence with the natural numbers. In previous articles we showed how the rationals can be presented as a list that includes each rational precisely once. One approach leads to the Farey Sequences. A second, related, approach gives us the Stern-Brocot Tree. Here, we introduce another tree structure, The Calkin-Wilf Tree.
Continue reading ‘Listing the Rational Numbers III: The Calkin-Wilf Tree’
The rational numbers are countable: they can be put into one-to-one correspondence with the natural numbers. But it is not obvious how to construct a list that is sure to contain every rational number precisely once. In a previous post we described the Farey Sequences. Here we examine another, related, approach.
Continue reading ‘Listing the Rational Numbers II: The Stern-Brocot Tree’
We know, thanks to Georg Cantor, that the rational numbers — ratios of integers — are countable: they can be put into one-to-one correspondence with the natural numbers.
Continue reading ‘Listing the Rational Numbers: I. Farey Sequences’
Godfrey Harold Hardy’s memoir, A Mathematician’s Apology, was published when he was 63 years old. It is a slight volume at just 90 pages, but is replete with interesting observations and not a few controversial opinions. After 78 years, it is still in print and is available in virtually every mathematics library. Though many of Hardy’s opinions are difficult to support and some of his predictions have turned out to be utterly wrong, the book is still well worth reading.
The Indian mathematician D. R. Kaprekar spent many happy hours during his youth solving mathematical puzzles. He graduated from Fergusson College in Pune in 1929 and became a mathematical teacher at a school in Devlali, north-east of Mumbai.
Kaprekar process for three digit numbers converging to 495 [Wikimedia Commons].
We wrote last week on modular arithmetic, the arithmetic of remainders. Here we will examine a few other aspects of this huge subject. Modular arithmetic was advanced by Gauss in his Disquisitiones Arithmeticae. In this system, number wrap around when they reach a point known as the modulus. Numbers that differ by a multiple of the modulus are called congruent. Thus 4, 11 and 18 are all congruent modulo 7.
Addition table for numbers modulo 12.
