Bibi-binary express any number, it suffices to enumerate the (hexadecimal) digits that make it up. For example: the number written as "2000" in base ten, which translates to "7D0" in conventionally-written hexadecimal, would in Bibi-binary be spoken aloud as "BIDAHO". Contrary to the numeric conventions used in modern computers, the bibi-binary system represents negative numbers using one's complement, rather than two's complement. Thus: and their sum is written as "1 1111" (one of two representations of zero in this system; zero can also be written as "0 0000"). On modern machines, in classic binary notation, −7 would be written 1 1001,
Binary GCD algorithm Binary GCD algorithm The binary GCD algorithm, also known as Stein's algorithm, is an algorithm that computes the greatest common divisor of two nonnegative integers. Stein's algorithm uses simpler arithmetic operations than the conventional Euclidean algorithm; it replaces division with arithmetic shifts, comparisons, and subtraction. Although the algorithm was first published by the Israeli physicist and programmer Josef Stein in 1967, it may have been known in 1st-century China. The algorithm reduces the problem of finding the GCD by repeatedly applying these identities: The algorithm requires O(n) worst-case time, where n is the number of bits in the larger of