算术乘法定义方式的推广.pdfVIP

  1. 1、本文档共6页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
算术乘法定义方式的推广 参赛队员:赵易非 指导老师: 肖恩利 学校:复旦大学附属中学 Generalization of the Definition Method of the Arithmetic Multiplication Preface According to Van der Waerden, the sum of two natural numbers is defined as x ⋅1 x + x y x y x ⋅ =⋅ +   (for every x and every y) The product of two natural numbers is recursively defined as x ⋅1 x + x ⋅y x =⋅y +x   (for every x and every y) + + x (y ) x (y ) here means the successor(consequent) of in the set of natural numbers. (Algebra)  Apparently, the product here uniquely depends on how the sum works. The generalization of this product is thus based on the substitution of addition, the sum here. Then the question arose. What result will emerge if we change the addition of natural numbers into a normal arithmetic binary operation? Inspired by the substitution of original addition, we are going to define an order of arithmetic binary operation in the following text (Sometimes we call the original addition of natural numbers of 1-order, and therefore the multiplication of 2-order and so on. Actually it is an instinctive perception rather than a well-defined mathematical theory. However, to change the addition into a binary operation and generalize the multiplication provides a tool to clarify this so-called order. If we call one binary operation of i-order, we may treat it as an addition and hence define a multiplication according to the mentioned recursive definition and then call it (i+1)-order. By using the same method, we can define an operation of

文档评论(0)

docindoc + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档