他是解析数论AnalyticNumberTheory-HKU.PPT

  1. 1、本文档共36页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
他是解析数论AnalyticNumberTheory-HKU

A Square (正方形) A Draw is Possible (和局是可能的)!! A Pentagon (五角形 ) A Draw is Possible (和局是可能的)! M. Gardner, Mathematical Games, Scientific American, February (1973), pp. 108-112 E. Mead, A Rose, C, Huang, The Game of SIM: A Winning Strategy for the Second Player, Mathematical Report No. 58, 1973, McMaster University. L.E.Shader, Another Strategy for SIM, Mathematics Magazine, Vol. 51. No. 1, pp. 60-62, 1978. G. J. Simmons, The Game of SIM, Journal of Recreational Mathematics, 1969. Some Mathematical Games are Available at http://hkumath.hku.hk/~wkc/MathModel/index.php References Pigeonhole ? Logic ? Game (鴿巢 ? 邏輯 ? 遊戲) Elegantia College 02 Feb 2013 Wai-Ki CHING Department of Mathematics The University of Hong Kong Pigeonhole Principle (鴿巢原理) If 7 pigeons are to live in 6 boxes (holes), then there is at least one box containing two or more pigeons (如果7隻鴿子住在6個籠裡,至少有一個籠包含兩隻或更多的鴿子). Dirichlet (狄里克利) The first statement of the Pigeonhole Principle is believed to have been made by the German Mathematician(德國數學家) Dirichlet (狄里克利) in 1834 under the name Schubfachprinzip (drawer principle). Dirichlet (狄里克利) Dirichlet(1805~1859)德國數學家,生於現德國 Duren(當時屬法國)。他是解析數論 (Analytic Number Theory)的奠基者,也是現代函數 (Functions) 觀念的定義者。 Dirichlet 人緣不錯,勤奮寡言,不修邊幅又健忘,卻是一個觀念清晰的好老師 。(He is a nice and hard working teacher) Continue Dirichlet 於1825年證明(prove)費瑪最後定理(Fermat’s Last Theorem) (when) n=5 情況而得盛名 , 後因心臟病發(heart attack)於瑞士,最後病逝於哥廷根。 費瑪最後定理: Xn + Yn =Zn , n=3,4,5,…, n=2: 32 + 42 =52 . Taken from: .tw/people/p_dirichlet/ Pigeonhole Principle (鴿巢原理) If we put n+1 balls into n boxes, then at least one box must contain two or more balls. 將 n+1 個球放入 n 個盒子內, 最小有一個盒子藏有2個或以上的球。 Proof by Contradiction (反證法) We want to prove that ‘at least one box must contain two or more balls’ by ‘Proof by Contradiction’. Assume that the statement is wrong (假設上面的事情是錯誤) then all the n boxes contains 1 or 0 ball. Therefore the total number of balls is less than or equal to n. This is a contradiction (矛盾). The cont

文档评论(0)

zhuwo + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档