查询词典 divisor

Software Description: XICalc is an integer calculator program with the following features: multiple precision integers with millions of digits; uses Hartley Transform to speed-up long multiplies; separate input and outputnotation, base 2 to base 36; greatest common divisor function; Modulo arithmetic options; Bernoullinumbers, Euler Numbers; Boolean functions; random number generator; prime factor algorithm using theElliptic Curve Method; number theoretic functions phi, sigma and tau; prime testing and searching using the Adleman function; algebraic notation; if-then-else statement; go-to statement; can run XICalc code from files; hot help from F1 key; and it抯 written in Microsoft Visual C#.

XICalc 是一款带有如下功能的综合性计算器软件：带有百万数位的多精度整数；使用 Hartley Transform 加速长整型多样化计算；以2到36为基数分隔输入和输出符号；最大公约数函数；模数算法选项；Bernoulli 数字；Euler 数字；布尔函数；随机数字生成器；使用圆周曲线算法的主要因素运算法则；π，τ，Σ的数字理论函数；使用 Adleman 函数的最初测试和搜索功能；代数符号；if-then-else 语法结构声明；go-to 语法结构声明；来自于文件的XICalc 代码；F1键的热点帮助；并且该软件是采用适用于 Windows 操作系统的微软 Visual C#。

A well-known example of an algorithm is Euclid's algorithm, which is a process for calculating the greatest common divisor of two integers m and n.

在运算法则中一个著名的例子就是计算两个整数m和n的最大公约数的欧几里德运算法则。

Using the elementary methods, we studied the hybrid mean value involving Smarandache function and the least prime divisor function, and gave an asymptotic formula.

用初等的方法研究了一个Smarandache函数与最小素因子的均值，并得到一个渐近公式。

This paper introduced the odd sieve sequence, the methods of character, estimate and triangle sum are used to study the mean value of the divisor function. An asymptotic formula of the divisor function is gave in the odd sieve sequence set to through the analytical method.

引入了奇筛数序列，主要利用特征和估计及三角和方法，研究了除数函数的均值性质，并通过解析方法给出了除数函数在奇筛数序列集合中的一个的渐近公式。

Is that because it is too hard to find a "common divisor" among you three?

因为在你们之间找到一个"公约数"确实太难。不知你以为如何？

As an example, we could write the following function to find the greatest common divisor of two ints

考虑下面的例子，这个函数用来求出两个 int 型数的最大公约数

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

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

A new method of calculating the greatest common divisor of several integers by using the row elementary operation is given.

利用整数矩阵的行初等变换给出一种求几个整数的最大公因数的新方法，并给出这种方法的一个应用。

The reason that zero can not be divisor, is right?Feng XinkongIn the eighth book of six-year primary school's teaching in nine-year compulsory educationmaterials, it states that "zero can not be divisor". But we can find that the formula, a=cq, checking the dividing exactly , is same as the form of direction proportion function, y=kx; the formula of checking the dividing not exactly, a=cq+r, is same as the form of simple function.

在九年义务教育六年制小学教科书《数学》第八册中规定"零不能作除数"，但是当我们学习了正比例函数和一次函数之后就会发现，验算能整除的除法的关系式a=cq和正比例函数y=kx的表示形式相同；验算有余数除法的关系式a=cq+r与一次函数的关系式y=kx+b的表示形式相同。

In this dissertation , the main works of the author is follows:(1)The method FPI (Fast Plaintext Imbedded to the divisor) is improved, which makes the probability of the plaintext not be imbedded into the divisor nearly to zero and its velocity is fast.

在本论文中，作者主要做了以下几个方面的工作：(1)改进了明文嵌入超椭圆曲线除子的FPI(Fast Plaintext Imbedded to the divisor)方法，该方法使明文不能嵌入到超椭圆曲线的除子的概率几乎为零，且其速度较快，可用于椭圆曲线密码体制。

I am accused of being overreligious," she said in her quiet, frank manner,"but that does not prevent me thinking the children very cruel who obstinately commit such suicide.""

客人们在卡罗利娜·埃凯家里，举止就文雅一些，因为卡罗利娜的母亲治家很严厉。

Designed by French fashion house Herm è s, this elegant uniform was manufactured in our home, Hong Kong, and was the first without a hat.

由著名品牌 Herm è s 设计，这件高贵的制服是香港本土制造，是我们第一套不配帽子的制服。