The realization of RSA, contains a large prime number class, very practical.
说明：RSA的实现，内含有一个大素数类，很实用。
Finding two prime factors of a very large number is a difficult task for most computers.
对于大多数计算机来说找到一个非常大的数字的两个素因子是一件是难的事。
First, the computer must determine the factors of the large number. Then, the computer must determine if the factors are prime Numbers.
首先，计算机要找到这个数字的因子，然后该计算机还要判定这个是因子是否是素因子。
This is the largest prime number that has been discovered (with the aid of a large computer) to date.
这是迄今为止发现的最大素数(借助于一台大型计算机)。
Whenpopulating an extremely large number of Text components, it may be advantageousto collect all unique characters in the Text components' content and prime thefont atlas.
当填充一个非常大的文本组件，它可能收集所有文本组件中不同的字符，加入文字图集。
If, on the other hand, you want the value of the totient for some large number for which you have the factorization, pass the argument as sequence of (prime, exponent) pairs.
另一方面，如果你想要一个大的您要进行因式分解的数字，将参数作为(素数，指数)对的序列传递。
If, on the other hand, you want the value of the totient for some large number for which you have the factorization, pass the argument as sequence of (prime, exponent) pairs.
另一方面，如果你想要一个大的您要进行因式分解的数字，将参数作为(素数，指数)对的序列传递。
应用推荐