Chairux Algorithm for Divisibility Test

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.