除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的

求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质

数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast

Find prime numbers are always programmers and mathematicians efforts topics here introduce a famous Eratosthenes seeking quality

Number of methods.