Binary star is within its Roche lobe, i.e. the area where the gravitational pull of the star itself is larger than that of the other component. The stars have no major effect on each other, and essentially evolve separately. Most binaries belong to this class. "Semidetached binary stars" are binary stars where one of the components fills the binary star's Roche lobe and the other does not. Gas from the surface of the Roche-lobe-filling component (donor) is transferred to the other, accreting star. The mass transfer dominates the evolution of the system. In many cases, the inflowing gas forms an accretion disc
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