这是一个可以计算1000以内的素数算法 觉得还不错-This a 1000 can be calculated within the prime number algorithm also feel good

RSA 原理： 选取两个不同的大素数p、q，并计算N=p*q 选取小素数d，并计算e，使d*e (p-1)(q-1)=1 -RSA works: select two different large prime numbers p, q, and compute N = p* q Select the small prime d, and calculate the e, so d* e (p-1) (q-1) = 1

实现功能：输入一个100以内的数，计算输出该数内的素数-Functions: less than a 100 number, and calculate the output in the number of primes