Please help us improve the quality of example sentences! Edit on Github

8和20的公约数是4。Eight and twenty cancel by four.

本节介绍了最突出的公约数。This section introduces several of the most prominent conventions.

Other words in sentence

求最大公约数是一个较为经典的问题。How to calculate the greatest common divisors is a typical problem.

因为在你们之间找到一个“公约数”确实太难。不知你以为如何?Is that because it is too hard to find a "common divisor" among you three?

适用欧几里德算法来计算7735和4185的最大公约数。Use Euclid's algorithm to compute the greatest common divisor of 7735 and 4185.

适用欧几里德算法来计算7735和4185的最大公约数。Use Euclid’s algorithm to compute the greatest common divisor of 7735 and 4185.

最大公约数和最小公倍数请计算两个整数的最大公约数和最小公倍数。GCD and LCM. Determine the greatest common divisor and least common multiple of a pair of integers.

Other words in sentence

如果有几条航线和同一个机场相关联,那么这些航线编号的最大公约数必须等于1。If there are several flights that depart from one airport then the greatest common divisor of their flight numbers should be equal to 1.

我想那“公约数”可能还是大家对待生活和艺术的一种态度,也许我们都看重好玩吧。There must be some kind of "common divisor" working here. Maybe that is people's attitude towards life and art but we focus much more on fun.

该文所用的证明方法是基于二维槽号相位图、单元绕组和最大公约数法则。The proof method used in this paper is based on two-dimension slot-number phase diagram, unit winding, and the maximum common divided principles.

最大公约数,也称最大公因数、最大公因子,指两个或多个整数共有约数中最大的一个。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.

用消法变换求出最大公约数,所编制的操作程序与求最大公约数同步,并给出了最大公约数的倍数和表示的通式。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.

Other words in sentence

求同存异、包容互谅才是寻求各方利益最大公约数的根本途径。The surest way to finding the maximum common denominator between the interests of different parties is to seek consensus and be understanding and accommodative.

马修斯计算了天空中100颗最明亮的星星之间的角距离,然后将这些数值转化为100万对随机数,这其中约有61%的数字之间没有公约数。Matthews calculated the angular distance between the 100 brightest stars in the sky and turned them into 1 million pairs of random numbers, around 61 per cent of which had no common factors.

本文讨论一种基于最小二乘原理求取最大公约数的数值方法,它是处理密立根油滴实验数据较为理想的方法。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.