本書是一本講述數(shù)論的本科生教程。書中包括了一些有關(guān)的代數(shù),并著重強(qiáng)調(diào)解決方程的整數(shù)解。尋找整數(shù)解引入數(shù)論的兩個(gè)最原始基本的問題—?dú)W拉代數(shù)和素因子分解,及當(dāng)代代數(shù)的基本靈魂—環(huán)和理想。這些思想的形成和從古代到現(xiàn)代的過度構(gòu)成該書主要框架,歷史概念的講述引進(jìn)新思想,現(xiàn)代證明的應(yīng)用使得內(nèi)容更加簡單、自然、有趣。書中包括一些從沒有以教材的形式出現(xiàn)的內(nèi)容,如運(yùn)用二次形式康威理論處理Pell方程。而且,這也是僅有的一本包括理想理論的數(shù)論書。敘述清楚,引用恰當(dāng),聯(lián)系典型使得本書成為一本很難得教科書和自學(xué)課本。目次:自然數(shù)與整數(shù);歐拉算法;同余算術(shù);密碼系統(tǒng);Pell方程;Gaussian整數(shù);二次整數(shù);四次方理論;二次互反性;環(huán);理想;素理想。
讀者對(duì)象:數(shù)學(xué)專業(yè)的本科生、研究生和有關(guān)專業(yè)的自學(xué)人員。
作者簡介:作者John Stillwell是San Francisco大學(xué)的教授。其作品有《數(shù)學(xué)及其歷史》,第2版,(2002),《數(shù)論和幾何》(1998),《代數(shù)基礎(chǔ)》(1994),這些著作品均已被Springer-Verlag出版。
reface
1 Natural numbers and integers
1.1 Natural numbers
1.2 Induction
1.3 Integers
1.4 Division with remainder
1.5 Binary notation
1.6 Diophantine equations
1.7 The Diophantus chord method
1.8 Gaussianintegers
1.9 Doscission
2 The Euclidean algorithm
2.1 The by subtraction
2.2 The by division with remainder
2.3 Linearrepresentation ofthe god
2.4 Primes and factorization
2.5 Consequences of unique prime factorization
2.6 Linear Diophantine equations
2.7 The vector Eudidean algorithm
2.8 The map ofre latively prime pairs
2.9 Doscission
3 Congruencearithmetic
3.1 Congruencemodn
3.2 Congruence classes and their arithmetic
3.3 Inverses mod p
3.4 Fermat's little theorem
3.5 Congruence theorems of Wilson and Lagrange
3.6 Inverses mod k
3.7 Quadratic Diophantine equations
3.8 Primitive roots
3.9 Existence ofprimitive roots
3.10 Discussion
4 The RSA cryptosystem
4.1 Trapdoorfunctions
4.2 Ingredients of RSA
4.3 Exponentiation mod n
4.4 RSA encryption and decryption
4.5 Digitalsignatures
4.6 0thercomputationalissues
4.7 Discussion
5 The Pell equation
6 The Gaussian integers
7 Quadratic integers _
8 The four square theorem
9 Quadratic reciprocity
10 Rings
11 Ideals
12 Prime ideals
Bibliography
Index