约数

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

Everybody can see, our add approximate number and column number are rising all the time in last few years.

大家可以看到，我们的续约数与栏目数在近几年一直上升。

"Zhang Jian Qiu count as" Communication is the question 92, the achievements of the more prominent and there is the common denominator least common multiple of the calculation, the arithmetic progression of the problem to solve, some uncertainties, such as problem solving equation.

张丘建算经》现传本有92问，比较突出的成就有最大公约数与最小公倍数的计算，各种等差数列问题的解决、某些不定方程问题求解等。

I want to also share a few additional tips about balancing your work and your family at home.

我也想分享更多的小费约数平衡你的工作和你的家人在家。

Our result has shown that within several seconds of 600 W, Ar, O2 or N2 plasma pretreatment, PP fabric and PE film are activated at surface, so as surface tension of film and capillary attraction of fabric are both augmented.

实验结果显示：对於 PP 不织布与 PE 膜，以600 W 激发 Ar 、 O2、 N2三种气体电浆处理，皆可於极短时间约数秒至数十秒，即可使基材表面活化，形成亲水性或增进表面的毛细作用。

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

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

Because some numbers have two divisors, but some have more than two, we may classify them into two types.

&分两类。有的只有两个约数，有的不止两个约数。&

Look at these numbers. Do they have any divisors besides 1 and itself?

下列各数，除了1与它本身这两个约数，还有没有别的约数？

We iterate through all possible numbers that could possibly be factors of num, using the count variable and decrementing for every value that does not divide num.

我们迭代所有可能的约数， count 变量依次递减，第一个能整除 num 的就是我们要找的最大约数，找到后就不再再继续找了，使用 break 语句退出循环。

They weren't aggressive, but I yelled and threw a rock in their direction to get them off the trail and away from me, just in case.

他们没有侵略性，但我大喊，并在他们的方向扔石头让他们过的线索，远离我，以防万一。

In slot 2 in your bag put wrapping paper, quantity does not matter in this case.

在你的书包里槽2把包装纸、数量无关紧要。