欢迎来到麦多课文档分享! | 帮助中心 海量文档,免费浏览,给你所需,享你所想!
麦多课文档分享
全部分类
  • 标准规范>
  • 教学课件>
  • 考试资料>
  • 办公文档>
  • 学术论文>
  • 行业资料>
  • 易语言源码>
  • ImageVerifierCode 换一换
    首页 麦多课文档分享 > 资源分类 > PPT文档下载
    分享到微信 分享到微博 分享到QQ空间

    Chapter 11The Number Theory Revival.ppt

    • 资源ID:379549       资源大小:209.50KB        全文页数:14页
    • 资源格式: PPT        下载积分:2000积分
    快捷下载 游客一键下载
    账号登录下载
    微信登录下载
    二维码
    微信扫一扫登录
    下载资源需要2000积分(如需开发票,请勿充值!)
    邮箱/手机:
    温馨提示:
    如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
    如需开发票,请勿充值!如填写123,账号就是123,密码也是123。
    支付方式: 支付宝扫码支付    微信扫码支付   
    验证码:   换一换

    加入VIP,交流精品资源
     
    账号:
    密码:
    验证码:   换一换
      忘记密码?
        
    友情提示
    2、PDF文件下载后,可能会被浏览器默认打开,此种情况可以点击浏览器菜单,保存网页到桌面,就可以正常下载了。
    3、本站不支持迅雷下载,请使用电脑自带的IE浏览器,或者360浏览器、谷歌浏览器下载即可。
    4、本站资源下载后的文档和图纸-无水印,预览文档经过压缩,下载后原文更清晰。
    5、试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。

    Chapter 11The Number Theory Revival.ppt

    1、Chapter 11 The Number Theory Revival,Between Diophantus and Fermat Fermats Little Theorem Fermats Last Theorem,11.1 Between Diophantus and Fermat,China, Middle Ages (11th -13th centuries) Chinese Remainder Theorem Pascals triangle Levi ben Gershon (1321) “combinatorics and mathematical induction” (f

    2、ormulas for permutations and combinations) Blaise Pascal (1654) unified the algebraic and combinatorial approaches to “Pascals triangle”,Pascals triangle in Chinese mathematics,The Chinese used Pascals triangle to find the coefficients of (a+b)n,Pascals Triangle,As we know now, the kth element of nt

    3、h row is since Thus Pascals triangle expresses the following property of binomial coefficients:,Indeed, suppose that for all n we have Then,Letting k = j + 1in the secondsum we get,Knowing that C0n-1=1, Cn-1n-1 =1 and replacing j by k in thefirst sum we obtain,Combinations, permutations, and mathema

    4、tical induction,Levi ben Gershon (1321) gave the formula for the number of combinations of n things taken k at a time: He also pointed out that the number of permutations of n elements is n! The method he used to show these formulas is very close to mathematical induction,Why “Pascals Triangle” ?,Pa

    5、scal demonstrated (1654) that the elements of this triangle can be interpreted in two ways: algebraically as binomial coefficients combinatorially as the number of combinations of n things taken k at a time As application he solved problem of division of stakes and founded the mathematical theory of

    6、 probabilities,Pierre de FermatBorn: 1601 in Beaumont (near Toulouse, France) Died: 1665 in Castres (France),11.2 Fermats Little Theorem,Theorem (Fermat, 1640) If p is prime and n is relatively prime to p (i.e. gcd (n,p)=1) then np 1 1 mod p Equivalently, np-1 1 is divisible by p if gcd (n,p)=1 or n

    7、p n is divisible by p (always) Note: Fermats Little Theorem turned out to be very important for practical applications it is an important part in the design of RSA code! Fermat was interested in the expressions of the form 2m 1 (in connection with perfect numbers) and, at the same time, he was inves

    8、tigating binomial coefficients Fermats original proof of the theorem is unknown,Proof,Proof can be conducted in two alternative ways: iterated use of binomial theorem application of the following multinomial theorem:,11.3 Fermats Last Theorem,“On the other hand, it is impossible for a cube to be wri

    9、tten as a sum of two cubes or a fourth power to be written as a sum of two fourth powers or, in general, for any number which is a power higher than second to be written as a sum of two like powers. I have a truly marvellous demonstration of this proposition which this margin is too small to contain

    10、.”written by Fermat in the margin of his copy of Bachets translation of Diophantus “Arithmetica”,Theorem There are no triples (a,b,c) of positive integers such that an + bn = cn where n 2 is an integer Proofs for special cases: Fermat for n = 4 Euler for n = 3 Legendre and Dirichlet for n = 5, Lame

    11、for n = 7 Kummer for all prime n 100 except 37, 59, 67 Note: it is sufficient to prove theorem for all prime exponents (except 2) and for n = 4, since if n = mp where p is prime and an + bn = cn then (am)p + (bm)p = (cm)p,First significant step (after Kummer): Proof of Mordells conjecture (1922) abo

    12、ut algebraic curves given by Falting (1983) Applied to the “Fermat curve” xn + yn = 1 for n 3, this conjecture provides the following statement Fermat curve contains at most finitely many of rational points for each n 3 Therefore, Faltings result imply that equation an + bn = cn can have at most finitely many solutions for each n 3 The complete proof of Fermats Last Theorem is due to Andrew Wiles and follows from much more general statement (first announcement in 1993, gap found, filled in 1994, complete proof published in 1995),


    注意事项

    本文(Chapter 11The Number Theory Revival.ppt)为本站会员(花仙子)主动上传,麦多课文档分享仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文档分享(点击联系客服),我们立即给予删除!




    关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

    copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
    备案/许可证编号:苏ICP备17064731号-1 

    收起
    展开