您要查找的是不是：
- analytic prime number theory 解析素数论
- Its divisibility and prime number theorems overlap parts of number theory. 其可除性和质数定理部分与数论（number theory）重叠。
- Number theory, once thought an esoteric discipline concerned with curious properties of prime numbers, turns out to form the underpinnings of modern cryptography. 过去大家认为，数论是一个诡秘的数学领域，专门研究质数的奇异性质，如今它却成为现代密码学的基础。
- His work on the twin prime conjecture and on Goldbach's conjecture led to progress in analytic number theory. 他对于孪生素数猜想和哥德巴赫猜想的研究大步推进了解析数论的发展。
- Cray number crunchers discovered the largest prime number. 克来公司的电脑发现了世界上最大的素数。
- Of, relating to, or being a prime number. 质数的，素数的属于或关于素数的
- Which number on the card is a prime number? 在卡片上哪一个数字是最初的数字?
- A classical introduction to modern number theory. 现代数论经典引论。
- Must be a prime number between 64 and 128 bytes long. 必须为长度在64字节和128字节之间的质数。
- In concluding this talk I wish to emphasize my advocacy for analytic number theory by saying again that the theory flourishes with or without the Riemann hypothesis. 在结束这次讲话时，我愿通过再次说明，数论将在无论有还是没有黎曼假设的情况下继续繁荣，来强调我对于解析数论的拥护。
- French mathematician who formulated modern number theory and probability theory. 费马，皮尔·德1601－1665法国数学家，他有系统地阐述了现代数理论和概率论
- Not all the odd numbers are prime numbers. 不是所有的奇数都是质数。
- The set of prime numbers is infinite. 素数集合是无限的。
- Recent perspectives in random matrix theory and number theory. 随即距阵理论和数论新观点。
- A Classical Introduction to Modern Number Theory 2nd ed. 现代数学论的经典引论第2版。
- The thesis tried to solve the problem of Hanoi Tower as that of number theory. 摘要梵塔问题本质上是一个数论问题。
- Do you remember your school number? Let's see whether it's a prime number or sum number. 判断一下,你们各自的学号是质数还是合数。
- NHashSize The size of the hash table for interface pointer maps. Should be a prime number. 用于指针映射接口的哈希表的大小,必须是一个素数。
- Any odd prime number P has (p-1)/2 quadratic residue. This is the quadratic residue theorem. 任何奇素数p有(p-1)/2个二次剩余,此就是二次剩余定理。
- This paper gives a fast arithmetic for the RSA which includes finding the big prime number and th e fast Euclid. 本文给出了实现 RSA的快速算法 ,包括寻找大素数和欧几里德的快速实现。
