gcd (4) --- determine greatest common divisor of two integers  07/20/84


          | _C_a_l_l_i_n_g _I_n_f_o_r_m_a_t_i_o_n

                 long_int function gcd (x0, x1)
                 long_int x0, x1

          |      Library: vswtmath (Subsystem mathematical library)


            _F_u_n_c_t_i_o_n

                 'Gcd' determines the greatest common divisor of the two long
                 integers specified as arguments.  The function return is the
                 GCD (always positive).


            _I_m_p_l_e_m_e_n_t_a_t_i_o_n

                 'Gcd'   is  a  straightforward  implementation  of  Euclid's
                 algorithm.


            _B_u_g_s

                 Behavior  with  nonpositive  arguments  may  be   considered
                 irrational by some.


            _S_e_e _A_l_s_o

                 invmod (4)




























            gcd (4)                       - 1 -                       gcd (4)