{"title":"在连接机器上找到95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/","authors":"R. Frye","doi":"10.1109/SUPERC.1988.74138","DOIUrl":null,"url":null,"abstract":"The smallest counterexample to Euler's generalization of Fermat's Last theorem is 95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/. The author explains how this solution was found by an exhaustive data-parallel search on several Connection Machine systems. An outline of the history of the problem and the architecture of the data-parallel Connection Machine system are presented along with the parallel algorithm.<<ETX>>","PeriodicalId":103561,"journal":{"name":"Proceedings Supercomputing Vol.II: Science and Applications","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Finding 95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/ on the Connection Machine\",\"authors\":\"R. Frye\",\"doi\":\"10.1109/SUPERC.1988.74138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The smallest counterexample to Euler's generalization of Fermat's Last theorem is 95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/. The author explains how this solution was found by an exhaustive data-parallel search on several Connection Machine systems. An outline of the history of the problem and the architecture of the data-parallel Connection Machine system are presented along with the parallel algorithm.<<ETX>>\",\"PeriodicalId\":103561,\"journal\":{\"name\":\"Proceedings Supercomputing Vol.II: Science and Applications\",\"volume\":\"175 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Supercomputing Vol.II: Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SUPERC.1988.74138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Supercomputing Vol.II: Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SUPERC.1988.74138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding 95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/ on the Connection Machine
The smallest counterexample to Euler's generalization of Fermat's Last theorem is 95800/sup 4/+217519/sup 4/+414560/sup 4/=422481/sup 4/. The author explains how this solution was found by an exhaustive data-parallel search on several Connection Machine systems. An outline of the history of the problem and the architecture of the data-parallel Connection Machine system are presented along with the parallel algorithm.<>