Counting and arithmetic are a child’s first introduction to mathematics and would be regarded by those who go on to study algebra, geometry, trigonometry and perhaps calculus at high school as the most elementary branch of mathematics. Paradoxically, however, advanced arithmetic or number theory as it is usually called, is one of the most complex and difficult areas of mathematical research. It includes still unsolved problems that can be stated in simple-to-understand language and which appear to be true by trial and error, but which are fiendishly difficult to prove.

One famous example, of course, was Fermat’s Last Theorem, first postulated in 1637, but not proved until over 3 centuries later by Andrew Wiles. The theorem states that there are no positive integers *x, y* and *z* satisfying *x*^{n} + *y*^{n} = *z*^{n} for integers *n* > 2 (that the equation has solutions for *n* = 1 is obvious and there is also an infinity of solutions for *n* = 2, for example 3^{2} + 4^{2} = 5^{2}, 5^{2} + 12^{2} = 13^{2}, etc.). Although no one could find a solution for *n* > 2 it took until 1995 to show that none existed.

Other examples abound. It is easy to show that there are infinitely many prime numbers, but what about primes of the form 2^{p} – 1, the first few of which are 3, 7, 31, 127, corresponding to *p* = 2, 3, 5, 7 respectively? Whether or not there is an infinity of them is still an open question even though the continual discovery of ever larger prime numbers of this type suggests they must be infinite in number (presently the largest one discovered corresponds to *p* = 74,207,281). Likewise, it is not known if there are infinitely many perfect numbers (a perfect number such as 6 or 28 equals the sum of its divisors excluding the number itself) nor indeed if there are any odd perfect numbers. Seemingly simple problems, but no solutions yet.

In the accompanying note *Foundations of Arithmetic* I mainly discuss the Fundamental Theorem of Arithmetic. Although it is the basis of elementary arithmetic, it is related in its analytical form to the Riemann zeta function thereby showing how arithmetical problems can lead one straight into advanced analysis. That to me, as a total non-expert, is one reason why number theory seems such a fascinating subject requiring very special mathematical insights. I can understand why it is an area of research that has always attracted some of the world’s most gifted mathematicians. Also included in the linked document are a couple of simple and familiar results, the first of which is an exercise in mathematical induction when two variables are involved, while the second provides a gentle introduction to modular arithmetic. It is all thoroughly well-known material, of course, expressed here in my own style and notation. The books *The Higher Arithmetic *(Hutchinson, 1952) by H. Davenport and *An* *Introduction to the* *Theory of Numbers* (Oxford, 1960) by G. H. Hardy and E. M. Wright were my principal sources of information.