{"title":"可整除性检验的Chairux算法","authors":"Charles Irungu Mwangi, Moses Otieno Ouma","doi":"10.9734/ajarr/2023/v17i10538","DOIUrl":null,"url":null,"abstract":"This paper presents a novel Chairux Algorithm for the divisibility test. The test is based on an arbitrary integer via the concepts of Bezout’s identity and the Euclidean algorithm. Examples demonstrating the effectiveness of the proposed algorithm indicate its simplicity, efficiency, and flexibility compared to the existing state-of-the-art algorithms.","PeriodicalId":190996,"journal":{"name":"Asian Journal of Advanced Research and Reports","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Chairux Algorithm for Divisibility Test\",\"authors\":\"Charles Irungu Mwangi, Moses Otieno Ouma\",\"doi\":\"10.9734/ajarr/2023/v17i10538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel Chairux Algorithm for the divisibility test. The test is based on an arbitrary integer via the concepts of Bezout’s identity and the Euclidean algorithm. Examples demonstrating the effectiveness of the proposed algorithm indicate its simplicity, efficiency, and flexibility compared to the existing state-of-the-art algorithms.\",\"PeriodicalId\":190996,\"journal\":{\"name\":\"Asian Journal of Advanced Research and Reports\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Journal of Advanced Research and Reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/ajarr/2023/v17i10538\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Journal of Advanced Research and Reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/ajarr/2023/v17i10538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a novel Chairux Algorithm for the divisibility test. The test is based on an arbitrary integer via the concepts of Bezout’s identity and the Euclidean algorithm. Examples demonstrating the effectiveness of the proposed algorithm indicate its simplicity, efficiency, and flexibility compared to the existing state-of-the-art algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
