Follow on twitter: @thatsmaths
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.
Numbers can be expressed in several different ways. We are familiar with whole numbers, fractions and decimals. But there is a wide range of other forms, and we examine one of them in this article. Every rational number 
where all 
Every circle has the property that the distance around it is just over three times the distance across. This has been known since the earliest times [see TM120 or search for “thatsmaths” at irishtimes.com].
The constant ratio of the circumference to the diameter, denoted by the Greek letter pi, is familiar to every school-child. You might expect to find a proof in Euclid’s Elements of Geometry, he could not prove it, and he made no mention of the ratio (see last week’s post).
![\displaystyle x = a_0 + \cfrac{1}{ a_1 + \cfrac{1}{ a_2 + \cfrac{1}{ a_3 + \dotsb + \cfrac{1}{a_n} } }} = [ a_0 ; a_1 , a_2 , a_3 , \dots , a_n ]](https://s0.wp.com/latex.php?latex=%5Cdisplaystyle+x+%3D+a_0+%2B+%5Ccfrac%7B1%7D%7B+a_1+%2B+%5Ccfrac%7B1%7D%7B+a_2+%2B+%5Ccfrac%7B1%7D%7B+a_3+%2B+%5Cdotsb+%2B+%5Ccfrac%7B1%7D%7Ba_n%7D+%7D+%7D%7D+%3D+%5B+a_0+%3B+a_1+%2C+a_2+%2C+a_3+%2C+%5Cdots+%2C+a_n+%5D+&bg=ffffff&fg=000000&s=0 "\displaystyle x = a_0 + \cfrac{1}{ a_1 + \cfrac{1}{ a_2 + \cfrac{1}{ a_3 + \dotsb + \cfrac{1}{a_n} } }} = [ a_0 ; a_1 , a_2 , a_3 , \dots , a_n ]")
