查询词典 null divisor

The second part is the controllability of parabolic equation .We study on the controllability of parabolic systems with a nonlinear term involving the state and the gradient ,the null-controllability property of a 1-d parabolic equation involving a fractional power of the Laplace operator ,null controllability of some systems of two parabolic equations with one control force ,and exact controllability of the parabolic system with bilinear control .

第二部分写的是，抛物方程的能控性，我们研究了含有状态和梯度的非线性的项抛物系统的能控性，含有拉普拉斯算子的分数阶的1-d抛物方程的零能控性，带有一个强控制的两个抛物方程的一些系统的零能控性和具有双线性控制抛物系统的精确能控性。

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函数与最小素因子的均值，并得到一个渐近公式。

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.

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

The small blue capacitor has very high chances to go fully shorted compare to electrolytic capacitor which is very rare.

小蓝电容器具有很高的机会去充分地缩短了比较电解电容器，这是非常罕见的。

In the Italian campaigns of 1513 and 1515, when the Swiss won the victories of Novara and Marignan, he acted as army chaplain.

在意大利的运动， 1513年和1515年，当瑞士赢得了胜利，诺瓦拉和marignan ，他担任军队的牧师。