greatest common divisor是什么意思，greatest common divisor的意思翻译、用法、同义词、例句

最大公约数；[数] 最大公因子（等于 greatest common factor）

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

最大公约数和最小公倍数请计算两个整数的最大公约数和最小公倍数。

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

如果有几条航线和同一个机场相关联，那么这些航线编号的最大公约数必须等于1。

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

最大公因子计算是计算数论的基础课题之一，它在密码算法和密码分析中有着非常广泛的应用。

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.

用消法变换求出最大公约数，所编制的操作程序与求最大公约数同步，并给出了最大公约数的倍数和表示的通式。

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.

本文在一个较弱的条件下证明了关于最大公因子矩陈与因子封闭集的关系的一个猜想。

Use Euclid’s algorithm to compute the greatest common divisor of 7735 and 4185.

适用欧几里德算法来计算7735和4185的最大公约数。

Based on C/C++ language the author devises programs of positive integer greatest common divisor algorithms.

设计出了基于C/C++语言最大公约数算法程序，通过分析算法，提出了程序设计语言教学的几点建议。

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.

本文介绍直接求解密立根油滴半径的方法和在考虑误差的情况下，用计算机求各油滴所带电量测定值Q（K）的最大公约数的一种新方法及程序。

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

利用多项式矩阵的行初等变换给出了求几个多项式的最大公因式的新方法，并给出了这种方法的具体应用。

Offers the concept of right greatest common divisor of two matrices over an Euclidean ring and expression, and considrs its some properties.

讨论了多项式矩阵最大公因子与最小公倍的有关性质，同时给出了多项式矩阵的分解定理。

The greatest common divisor, also known as the greatest common factor, the most common factor, refers to two or more integers have one of the biggest in a few.

最大公约数，也称最大公因数、最大公因子，指两个或多个整数共有约数中最大的一个。

For two integers a, b, one can calculate the greatest common divisor(a, b) ofaandb by using Euclidean algorithm, then the least common multiple[a, b] =(ab/a, b).

给出了用其整系数线性组合表示两个正整数的最大公约数的计算机程序。

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.

本文讨论一种基于最小二乘原理求取最大公约数的数值方法，它是处理密立根油滴实验数据较为理想的方法。

In this paper, the matrix method of calculating the greatest common divisor of several polynomials is given by using the row elementary operation, and so is the concrete application of this method.

把多项式组转为系数矩阵表示后，通过矩阵的第一斜消变换、第二斜消变换化简矩阵，得到利用斜消变换求解最大公因式的算法实现。