Extension of Reduce Digits Algorithm for Divisibility of Even Numbers
H. Khosravi, P. Jafari, Elias Faryad
Abstract
H. Khosravi, P. Jafari, Elias Faryad
Abstract
Abstract: Let z = anan-1…a1 is dividend and w = bmbm-1…b1 is even divisor. In this paper, we study divisibility of even numbers with extension of reduce digits algorithm. In the other words, we study divisibility of even numbers with a new algorithm entitled reduce digits algorithm such that this algorithm reduced the numbers of digits for z.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract: Let z = anan-1…a1 is dividend and w = bmbm-1…b1 is even divisor. In this paper, we study divisibility of even numbers with extension of reduce digits algorithm. In the other words, we study divisibility of even numbers with a new algorithm entitled reduce digits algorithm such that this algorithm reduced the numbers of digits for z.
Key concepts: Divisibility rule, Divisor (algebraic geometry), Mathematics, Extension (predicate logic), Greatest common divisor, Combinatorics, Prime (order theory), Discrete mathematics