1) A numerical method, that extracts the greatest common divisor by the least square, is discussed in this paper. It would be the proper method to manage the data of Milliken oil drop experiment.

2) The greatest common divisor of 24 and 30 is 6 24.

3) Use Euclid's algorithm to compute the greatest common divisor of 7735 and 4185.

4) GCD and LCM. Determine the greatest common divisor and least common multiple of a pair of integers.

5) In this paper the greatest common divisor is found by the cancellation transformation, and the general form of multiply-sum representation of G. C. D. is given.

6) Greatest Common Divisor is one of the basic subjects in computational number theory, it has a wide application in encryption and analysis of cryptography.

7) A computer program for expressing the greatest common divisor of two positive integers using their linear combination is given here.

8) If there are several flights that depart from one airport then the greatest common divisor of their flight numbers should be equal to 1.

9) By using the row elementary opration the matrix method of calculating the greatest common divisor of several polynomials is given with concrete applications.

10) The method of finding radius of oil-drop anda new method and programme of finding the greatest common divisor of Q (K) under the condition of errors are given in this paper.

11) In this paper, the matrix method of calculating the greatest common divisor of several polynomials is given by using the row elementary operation,[http:///greatest common divisor.html] and so is the concrete application of this method.

12) This paper gives a proof of a conjecture on the relation between the greatest common divisor matrix and the factor closed set under a certain condition.