An Introduction to the Theory of Numbers
@article{T1946AnIT,
title={An Introduction to the Theory of Numbers},
author={E. C. T.},
journal={Nature},
year={1946},
volume={157},
pages={390-390}
}THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers. One reason for this is clear. Any mathematician, not necessarily an expert in theory of numbers, can start almost anywhere id the book and turn over a few pages, and find a discussion of some problem which he can understand, and which is solved by elementary arguments in a comparatively short space… Expand
3,901 Citations
Farey series and ford circles
- Mathematics
- 2002
• The mathematician does not study pure mathematics because it is useful; he studies it because he delights in it and he delights in it because it is beautiful. – J.H. Poincare In 1938 L.R. Ford… Expand
PERFECT NUMBERS: AN ELEMENTARY INTRODUCTION
- 2000
This serves as an elementary introduction to the history and theory surrounding even perfect numbers. One would be hard put to find a set of whole numbers with a more fascinating history and more… Expand
A Brief Introduction to Algebraic Geometry
- 2007
Algebraic geometry is fairly easy to describe from the classical viewpoint: it is the study of algebraic sets (defined in §2) and regular mappings (also defined in §2) between such sets.… Expand
A Singular Introduction to Commutative Algebra
- Mathematics
- 2002
From the reviews of the first edition: "It is certainly no exaggeration to say that A Singular Introduction to Commutative Algebra aims to lead a further stage in the computational revolution in… Expand
Some Fundamental Theorems in Mathematics
- Mathematics
- 2018
An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 135 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful… Expand
On the Number of Prime Numbers less than a Given Quantity
- 2007
Prime numbers are probably one of the most beautiful objects in all of mathematics. It is remarkable, that they have such a simple definition: “p is prime iff p has no other divisors, besides 1 and… Expand
96.52 Some different approaches to summing a particular series
- Computer Science
- The Mathematical Gazette
- 2012
This work demonstrates what might be considered to be the most 'obvious' method (referred to here as a 'direct attack'), and gives both a number-theoretic and a probabilistic proof. Expand
Groups of Arithmetical Functions
- Mathematics
- 2005
Here the sum is taken over all positive integer divisors d of n. This somewhat surprising choice of a product is quite fruitful, allowing one to obtain interesting numbertheoretic formulas from… Expand
A Dynamical Systems Proof of Fermat's Little Theorem
- Mathematics
- 2003
This theorem, not to be confused with its more famous brother, Fermat's Last Theorem, is useful not only when you want to compute what 69397 is modulo 13 (though it is useful for that kind of… Expand
Probabilistic Number Theory
Dedicated to Prof. Jonas Kubilius and the members of his working group at Vilnius University, for their outstanding work in probabilistic number theory and their kind hospitality! This is a first… Expand