Skip to content
Research Article Open access CC BY 4.0

Chairux Algorithm for Divisibility Test

Charles Irungu Mwangi, Moses Otieno Ouma

Asian Journal of Advanced Research and Reports · pp. 111–141 · Published 10 Aug 2023

10.9734/ajarr/2023/v17i10538

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.

Chairux algorithm bezout identity euclidean algorithm period length

Cited by 1

New Rules for Calculating Decimal Number Residue on Primes

Alaa Ghazi Abdulbaqi, Yasir Hashim · 2024 21st International Multi-Conference on Systems, Signals & Devices (SSD) · 2024

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

1

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.