哥德巴赫猜想证明的计算机选择建模

ACM-SE 14 Pub Date : 1976-04-22 DOI:10.1145/503561.503579
G. Pitts
{"title":"哥德巴赫猜想证明的计算机选择建模","authors":"G. Pitts","doi":"10.1145/503561.503579","DOIUrl":null,"url":null,"abstract":"The branch of Number Theory in the field of mathematics deals primarily with integer or whole number relationships. One such relationship classifies the integers on the basis of their divisibility into two classes of numbers, the even numbers and the odd numbers. Divisibility criteria can also be used to classify integers as being either prime or composite. This paper addresses a problem concerning these attributes of the integers.","PeriodicalId":151957,"journal":{"name":"ACM-SE 14","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Computerized selective modeling for the Goldbach conjecture proof\",\"authors\":\"G. Pitts\",\"doi\":\"10.1145/503561.503579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The branch of Number Theory in the field of mathematics deals primarily with integer or whole number relationships. One such relationship classifies the integers on the basis of their divisibility into two classes of numbers, the even numbers and the odd numbers. Divisibility criteria can also be used to classify integers as being either prime or composite. This paper addresses a problem concerning these attributes of the integers.\",\"PeriodicalId\":151957,\"journal\":{\"name\":\"ACM-SE 14\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1976-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 14\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/503561.503579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 14","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503561.503579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数论在数学领域中的分支主要研究整数或整数关系。其中一种关系根据整数的可整除性将其分为两类,即偶数和奇数。可整除性准则也可用于将整数分类为素数或合数。本文讨论了一个关于整数的这些属性的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computerized selective modeling for the Goldbach conjecture proof
The branch of Number Theory in the field of mathematics deals primarily with integer or whole number relationships. One such relationship classifies the integers on the basis of their divisibility into two classes of numbers, the even numbers and the odd numbers. Divisibility criteria can also be used to classify integers as being either prime or composite. This paper addresses a problem concerning these attributes of the integers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信