Chairux Algorithm for Divisibility Test

This paper presents a novel Chairux Algorithm for the divisibility test. The test is established an arbitrary number via the ideas of Bezout’s identity and the Euclidean algorithm. Examples professed the effectiveness of the projected algorithm signify its restraint, efficiency, and elasticity compared to the existing new algorithms.

Please read full article - https://journalajarr.com/index.php/AJARR/article/view/538