This is an exciting book, but beware!
Hellegouarch claims to major in giving examples rather than proving "the basic structure theorems" in this book, and, this he does very well. The examples are beautiful. The proofs that he does offer are unusually elegant and instructive. This book is perfect for the serious student of mathematics who has had the usual undergraduate course covering things like the theory of rings and ideals, Galois theory, complex analysis, that sort of thing.
What really makes this book so perfect are the holes in the proofs. They are just exactly the right size to fill in with enough difficulty to strengthen your muscles but not to break your back. This book would be absolutely fantastic for a first or second year graduate course that used the Texas method to introduce the students to arithmetic geometry or albegraic number theory or modular forms, or any of a number of other sub-fields of mathematics.
A very strange thing, though, is that some of the holes in the proofs that are labelled "exercises" are trivial to fill in when compared with the real holes. I must qualify this statement by mentioning that I have only worked through the first 17 pages in detail. Although, I have read the whole book several times without paying too much attention to detail.
For example, on page 13, there is the statement, "since x and y are odd, p**2 + 3*q*2 must be odd." (x,y,p,q, are all integers, x=p+q, y=p-q, and GCD(x,y) = (x,y) = 1.) Now, using elementary number-theory odd-even type arguments, this is not obvious. However, computing modulo 2 makes it easy: p**2 + 3*q*2 == p+q = x == 1 modulo 2. Note also that the result does not depend on "y" being odd, as Hellegouarch's statement would have you believe. Figuring out mis-leading statements like this are a great way to prepare a young graduate student to become a research mathematician. In real research problems, you are not usually told which theorems to invoke to prove your results.
Two sentences later, he mentions that (p,q) = 1, which again requires a little thought. In the next sentence he applies a result (Corollary 1.6.1) proved for the Gaussian integers on the previous page, but, he claims that it is a Z[squareroot(-3)] form of this result that is really being used. Not so. It is the Gaussian integer [Z(i)] form that is being used. Furthermore, in applying Corollary 1.6.1, he uses not only the Corollary but side results that appear in the proof of the Corollary. Furthermore, he applies the Corollary in the highly special case when b=0 but doesn't tell you this.
For a professional PhD mathematician (like myself) figuring all this out was great fun, but, then, to further confuse the issue, when Hellegouarch gets to the bottom of the proof, he claims that the filling in of the final details are left to the reader as an "exercise." But, the final deatils are not an "exercise," they are immediately obvious, especially for the reader who has jumped the hurdles required to get to the end.
Another example of a hole which is a great exercise is the statement on the bottom of page 15 that if p is prime over the integers and reducible over the Gaussian integers, then the reduction is essentially unique. In other words, p can be written as x*y over the Gaussian integers where neither x nor y are units in essentially one and only one way. BTW, x is the conjugate of y in such a reduction. The proof follows easily by applying the norm function N(a+bi) = a**2 + b**2, but he doesn't tell you this. He doesn't even tell you that this is a hole that needs to be filled in. Noticing holes like this one are a great way for a young mathematician to be prepared for a career in research mathematics. Sometimes, such holes are not just little annoyances, but, real holes, and part of the work of a research mathematician is being able to find them. This was the case for Wiles first proof (1993) of Fermat's Last Theorem. It had a "real" whole and it tood a "real mathematician" to find it.
All this makes for great fun, but beware!
In working through most of the first 17 pages with a fine-toothed comb, I was struck by the lack of typos. I don't remember seeing any. Certainly not any that forced me to run a computation to decide whether or not it was a typo. But then, on page 18, I found the following statement,
"Euler introduced the ring Z[j] where j = exp(2pi*i/3) is a primitive root of unity, in order to study the Fermat equationn of degree 3; he accepted the fact that the fundamental theorem of arithmetic extends to Z[j] (fortunately for him this is actually the case, although it is not for the ring Z[squareroot(-3)])."
This statement sure looks false as it stands. There are various possibile explanation for it, but, the most likely is that "-3" is a typo and it should be "-5" or any other negative integer except for the nine integers that constitute H. M. Stark's 1967 solution to the "Gaussian number problem."
(The 9 values of "D" for which Q[sqr(D)] and hence Z[sqr(D)] are UFDs are -1, -2, -3, -7, -11, -19, -43, -67, and -163. Being a UFD is the usual interpertation of the phrase "the fundamental theorem of arithmetic extends to Z[sqr(D)]." Reference: Stewart and Tall (S&T) "ANT," 3rd edition, 2002, page 86. Although S&T do not call it "the Gaussian number problem, many other books do.)
Naturally, it would be nice if there were an errata sheet for a book like this that neither gives definitions of many of its terms nor gives proofs of its basic structure theorems (from which the definitions could be deduced). However, I could not find such a list on the web. John G. Aiken, PhD in 1972 in C* and W* algebras.