离散数学英文课件:DM_lecture1_6_7_第1页
离散数学英文课件:DM_lecture1_6_7_第2页
离散数学英文课件:DM_lecture1_6_7_第3页
离散数学英文课件:DM_lecture1_6_7_第4页
离散数学英文课件:DM_lecture1_6_7_第5页
已阅读5页,还剩11页未读, 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

1、Overview,In section 1.5, we already saw: Several types of proofs of implications pq: Vacuous, Trivial, Direct, Indirect Some methods of proving general statements p: proof by contradiction (reduction to absurdity). In this module, we will see examples of: Forward vs. backward reasoning. Proof by cas

2、es. Turning conjectures into proofs.,Forward Reasoning,Have premises p, and want to prove q. Find a s1 such that ps1 Then, modus ponens gives you s1. Then, find an s2 (such that) s1s2. Then, modus ponens gives you s2. And hope to eventually get to an sn snq. The problem with this method is It can be

3、 tough to see the path looking from p.,Backward Reasoning,It can often be easier to see the very same path if you just start looking from the conclusion q instead That is, first find an s1 such that s1q. Then, find an s2 s2s1, and so on Working back to an sn psn. Note we still are using modus ponens

4、 to propagate truth forwards down the chain from p to sn to to s1 to q! Though we are finding the chain backwards,Backward Reasoning Example,Theorem: a0,b0,ab: (a+b)/2 (ab)1/2. Proof: Notice it is not obvious how to go from the premises a0, b0, ab directly forward to the conclusion (a+b)/2 (ab)1/2.

5、So, lets work backwards from the conclusion, (a+b)/2 (ab)1/2 !,Steps of Example,(a+b)/2 (ab)1/2 (squaring both sides) This preserves the “” since both sides are positive. (a+b)2/4 ab (multiplying through by 4) (a+b)2 4ab (squaring a+b) a2+2ab+b2 4ab (subtracting out 4ab) a22ab+b2 0 (factoring left s

6、ide) (ab)2 0 Now, since ab, (ab)0, thus (ab)20, and we can work our way back along the chain of steps,“Forwardized” version of Example,Theorem: a0,b0,ab: (a+b)/2 (ab)1/2. Proof. If Since ab, (ab)0. Thus, (ab)20, i.e., a22ab+b2 0. Adding 4ab to both sides, a2+2ab+b2 4ab. Factoring the left side, we h

7、ave (a+b)2 4ab, so (a+b)2/4 ab. Since ab is positive, we can take the square root of both sides and get (a+b)/2 (ab)1/2. ,Stone Game Example,Game rules: There are 15 stones in a pile. Two players take turns removing either 1, 2, or 3 stones. Whoever takes the last stone wins. Theorem: There is a str

8、ategy for the first player that guarantees him a win. How do we prove this? Looks complicated How do we pick out the winning strategy from among all possible strategies? Work backwards from the endgame!,Working Backwards in the Game,Player 1 wins if it is player 2s turn and there are no stones P1 ca

9、n arrange this ifit is his turn, and thereare 1, 2, or 3 stones This will be true aslong as player 2 had4 stones on his turn And so on,“Forwardized” version,Theorem. Whoever moves first can always force a win. Proof. Player 1 can remove 3 stones, leaving 12. After player 2 moves, there will then be

10、either 11, 10, or 9 stones left. In any of these cases, player 1 can then reduce the number of stones to 8. Then, player 2 will reduce the number to 7, 6, or 5. Then, player 1 can reduce the number to 4. Then, player 2 must reduce them to 3, 2, or 1. Player 1 then removes the remaining stones and wi

11、ns.,Proof by Examples (Cases),A universal statement can never be proven by using examples, unless the universe can be validly reduced to only finitely many examples, and your proof covers all of them! We want to show p1 p2 pn q (p1 q) (p2 q) (pn q) Proof: p1 p2 pn q (p1 p2 pn) q (p1 p2 pn) q (p1 q)

12、(p2 q) (pn q) (p1 q) (p2 q) (pn q),Proof by Examples (Cases),Theorem: x,yZ: x2+3y2 = 8. Proof: If |x|3 or |y|2 then x2+3y2 8. This leaves x20,1,4 and 3y20,3. The largest pair sum to 4+3 = 7 8.,Constructive Proof,Theorem: For every three natural numbers x, y, z larger than 1 (x, y, z 1), there is som

13、e natural number larger than all x, y, z such that it is not divisible by x or y or z. Proof: Construct xyz+1. we first assume xyz+1 can be evenly divided by x, i.e. (xyz+1)/x = yz + 1/x, where 1/x must be an integer. The only possible value for x must be 1. But this is in contradiction with the fac

14、t that x, y, z 1. Therefore, xyz+1 cannot be divided by x, and similarly, by y or z.,Conjecture & Counterexamples,Conjecture: integers n0, n2n+41 is prime. Hm, lets see if we can find any counter-examples: 121+41 = 41 (prime) 222+41 = 42+41 = 43 (prime) 323+41 = 93+41 = 47 (prime) Looking good so fa

15、r! Can we conclude after showing that it checks out in, say, 20 or 30 cases, that the conjecture must be true? NEVER! Of course, 41241+41 is divisible by 41!,Even Great Mathematicians Can Propose False Conjectures!,Euler conjectured that for n2, the sum of n1 nth powers of positive integers is not a

16、n nth power. Remained true for all cases checked for 200 years, but no proof was found. Finally, in 1966, someone noticed that275 + 845 + 1105 + 1335 = 1445. Larger counter-examples have also been found for n=4, but none for n5 yet.,Fermats “Last Theorem”,Theorem: xn+yn=zn has no solutions in intege

17、rs xyz 0 with integer n2. In the 1600s, Fermat famously claimed in a marginal note that he had a “wondrous proof” of the theorem. But unfortunately, if he had one, he never published it! The theorem remained a publicly unproven conjecture for the next 400 years! Finally, a proof that requires hundre

18、ds of pages of advanced mathematics was found by Wiles at Princeton in 1990. It took him 10 years of work to find it! Challenge: Find a short, simple proof of Fermats last theorem, and you will become instantly famous!,Some Open Conjectures,Conjecture: There are infinitely many primes of the form n2+1, where nZ. Conjecture: (Twin Prime Conjecture) There are infinitely pairs of primes of the form (p,

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论