Chairux Algorithm for Divisibility Test
Charles Irungu Mwangi *
Department of Mathematics, Former student at The University of Nairobi, Nairobi, Kenya.
Moses Otieno Ouma
Department of Agricultural and Biosystems Engineering, Former student at Jomo Kenyatta University of Agriculture and Technology, Juja, Kenya.
*Author to whom correspondence should be addressed.
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.
Keywords: Chairux algorithm, bezout identity, euclidean algorithm, period length