Section 32 Direct proofs and Counterexamples II Rational …32节直接证明与反例II理性….pptVIP

Section 32 Direct proofs and Counterexamples II Rational …32节直接证明与反例II理性….ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Section 32 Direct proofs and Counterexamples II Rational …32节直接证明与反例II理性…

Section 4.2 Direct proof and Counterexample II: Rational numbers Definition: A real number r is rational if, and only if, it can be expressed as a quotient of two integers with a non-zero denominator. A real number that is not rational is irrational. More formally, if r is a real number, then r is rational ? ?? integers a and b such that and b? 0 More on generalizing the Generic Particular. Example: The sum of two rationals is rational. Example: The product of two rationals is rational. Section 4.3 Direct Proof and Counterexample III: Divisibility Definition: If n and d (≠ 0) are integers, then n is divisible by d if and only if n = d×k for some integer k. Alternatively, we say that n is a multiple of d, or d is a factor of n, or d is a divisor of n, or d divides n. The notation d | n reads “d divides n”. Properties of Divisibility Theorem Every non-zero integer d divides 0. 1 divides any integer. no integer is divisible by 0. Theorem If d divides a and d divides b, then d divides (a + b) Transitive property of divisibility If a divides b, and b divides c, then a divides c. Several simple Divisibility Tests Theorem An integer n is divisible by 3 if and only if the sum of its digits is divisible by 3. Theorem An integer n is divisible by 4 if and only if the number represented by the last 2 digits of n is divisible by 4. Theorem An integer n is divisible by 11 if and only if the alternate sum of its digits is divisible by 11. ex. 37162 is not div. by 11 b/c (3–7+1–6+2) is not. The Unique Factorization Theorem (Fundamental theorem of Arithmetic) Given any integer n 1, there exist a positive integer k, distinct prime numbers p1, p2, ···, pk (in increasing order) and positive integers e1, e2, ···, ek such that n = p1e1p2e2 ··· pkek and thi

您可能关注的文档

文档评论(0)

189****7685 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档