由于此商品库存有限,请在下单后15分钟之内支付完成,手慢无哦!
100%刮中券,最高50元无敌券,券有效期7天
活动自2017年6月2日上线,敬请关注云钻刮券活动规则更新。
如活动受政府机关指令需要停止举办的,或活动遭受严重网络攻击需暂停举办的,或者系统故障导致的其它意外问题,苏宁无需为此承担赔偿或者进行补偿。
醉染图书数论与密码学导论(第二版)(英文)9787560398150
¥ ×1
新春将至,本公司假期时间为:2025年1月23日至2025年2月7日。2月8日订单陆续发货,期间带来不便,敬请谅解!
Preface
1 Introduction
1.1 Diophantine Equations
1.2 Modular Arithmetic
1.3 Primes and the Distribution of Primes
1.4 Cryptography
2 Divisibility
2.1 Divisibility
2.2 Euclids Theorem
. Euclids Original Proof
2.4 The Sieve of Eratosthenes
2.5 The Division Algorithm
2.5.1 A Cryptographic Application
2.6 The Greatest Common Divisor
2.7 The Euclidean Algorithm
2.7.1 The Extende Ecdean Algorithm
2.8 Other Bases
2.9 Fermat and Mersenne Numbers
2.10 Chapter Highlights
2.11 Problems
2.11.1 Exercises
2.11.2 Projects
2.11.3 Computer Explorations
2.11.4 Answers to "Check Your Understanding"
3 Linear Diophantine Equations
3.1 ax + by=c
3.2 The Postage Stamp Problem
3.3 Chapter Highlights
3.4 Problems
3.4.1 Exercises
3.4.2 Answers to "Check Your Understanding"
4 Unique Factorization
4.1 The Starting Point
4.2 The Fundamental Theorem of Arithmetic
4.3 Euclid and the Fundamental Theorem of Arithmetic
4.4 Chapter Highlights
4.5 Problems
4.5.1 Exercises
4.5.2 Projects
4.5.3 Answers to "Check Your Understanding"
5 Applications of Unique Factorization
5.1 A Puzzle
5.2 Irrationaliyrof
5.2.1 Four More Proofs That √2 Is Irrational
5.3 The Rational Root Theorem
5.4 Pythagorean Triples
5.5 Differences of Squares
5.6 Prime Factorization of Factorials
5.7 The Riemann Zeta Function
5.7.1 ∑1/p Diverges
亲,大宗购物请点击企业用户渠道>小苏的服务会更贴心!
亲,很抱歉,您购买的宝贝销售异常火爆让小苏措手不及,请稍后再试~
非常抱歉,您前期未参加预订活动,
无法支付尾款哦!
抱歉,您暂无任性付资格