查询词典 common 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的最大公约数的欧几里德运算法则。

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.

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

We divide both by their common divisor.

用它们的公因子去除两个数。

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.

我想那"公约数"可能还是大家对待生活和艺术的一种态度，也许我们都看重好玩吧。

Firstly, this thesis introduce the related concepts of the algorithm and some GCD algorithms that current existing, then list a few basic properties of Greatest Common Divisor.

本文首先介绍了算法的相关概念和当前现有的GCD算法，然后列出了最大公因子的几个基本性质。

This paper will introduce the polynomial greatest common divisor comprehensively and combine its basic characteristics with matrix decomposition and line transformation, and then use it to solve some related problems.

并把多项式最大公因式的性质与线性变换，矩阵分解相结合，解决一些相关的问题。

Therefore, it is imperative that you need to be prepared for the great change that is about to occur.

所以，你需要为快要出现的伟大改变准备好，这是必要的。

If u agree with our suggestion of dicker trade,we will exchange paper with u wood.

如果你方同意我们进行易货贸易的建议，我们将用纸与你们交换木材。