![]() In fact, I have adhered to it rather closely c10sely at at some some critical critical points. It had to be expanded, in accordance with my own plans, but its outline could be preserved without much change. The first part of this volume is based on a course taught at Princeton University in 1961-62 at that time, an excellent set of ofnotes notes was was prepared prepared by by David David Cantor, Cantor, and and it it was was originally originally my intention to make these notes available to the mathematical public with only quite minor changes. It contained a abrief brief but but essentially essentially comĀ comĀ plete plete account account of of the the main main features features of of c1assfield class field theory, both local and global and it soon became obvious that the usefulness of the intended volume would be greatly enhanced if I inc1uded included inc1uded such a treatment of this topic. Then, among some old papers of mine, I accidentally came across a long-forgotten manuscript by Chevalley, ChevaIley, of pre-war vintage (forgotten, that is to say, both by me and by its author) which, to my taste at least, seemed to have aged very weIl. First, we need a simple definition: Two integers are relatively prime if their only common positive integer factor is 1. ![]() The first part of this volume is based on a course taught at Princeton University in 1961-62 at that time, an excellent set of ofnotes notes was was prepared prepared by by David David Cantor, Cantor, and and it it was was originally originally my intention to make these notes available to the mathematical public with only quite minor changes. One of the basic techniques of number theory is the Euclidean algorithm, which is a simple procedure for determining the greatest common divisor of two positive integers. }tPZ()jlOV, g~oxov UO((JUijlrXr:WV A10"x.
0 Comments
Leave a Reply. |