{"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}
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.