您要查找的是不是：
- Cray number crunchers discovered the largest prime number. 克来公司的电脑发现了世界上最大的素数。
- The public and private keys are based on a pair of very large prime numbers that are not known by anyone intercepting the message. 公开密钥和秘密密钥是基于一对想截获报文的人不知道的非常大的素数。
- large prime numbers 大素数
- Not all the odd numbers are prime numbers. 不是所有的奇数都是质数。
- The set of prime numbers is infinite. 素数集合是无限的。
- Of, relating to, or being a prime number. 质数的，素数的属于或关于素数的
- Which number on the card is a prime number? 在卡片上哪一个数字是最初的数字?
- Goldbach Conjecture to prove that an arbitrary large even number can be expressed into two prime numbers, and! 哥德巴赫猜想，证明任意大的一个偶数都可以表示成为两个素数的和！
- Must be a prime number between 64 and 128 bytes long. 必须为长度在64字节和128字节之间的质数。
- Its divisibility and prime number theorems overlap parts of number theory. 其可除性和质数定理部分与数论（number theory）重叠。
- Here the process of breaking down a large integer formed of two prime numbers into those primes. 这里指将由两个质数组成的大整数分解成那两个质数的过程。
- Any integer greater than 1 that is divisible only by 1 and itself; 2, 3, and 5 are prime numbers, 4 is not. 只能被1及其本身整除的大于1的任何整数;2、3和5是质数,4不是。
- T: The numbers, which have only 1 and themselves as their divisors, are called prime numbers. 像这样,只有1和它本身两个约数的数叫质数。
- For example, suppose that you wanted to find the prime numbers between 1 and 1,000,000. 例如,假设您想找出1到1,000,000之间的所有素数。
- Eratosthenes sieve method is a method to search for all prime numbers less than natural number N(N>1). 埃拉托斯特尼筛法是求不超过自然数N(N>1)的所有质数的一种方法。
- Because 19 and 2 have only two divisors: 1 and themselves, they are prime numbers. 因为19和2都各只有两个约数：1和它们本身，所以它们是质数。;;”
- Whatis the difference between the biggest and the smallset prime numbers within 100 ? 在100内,最大和最小的质数相差多少?
- A Quantum Algorithm for Large Prime Factorization 大数质因子分解的量子算法
- He bit off a large piece of the apple. 他咬下一大块苹果。
- IV. Introduce Goethbach's Guess: Any even number greater than 4 can be the sum of two prime numbers. 介绍歌德巴赫猜想:任何一个大于4的偶数,都可写成两个质数的和。
