PrimeNum程序描述： 本程序包括：找100～200间的素数 主要是记住找素数的算法-PrimeNum procedures Descr iption : The procedures include : find 100 ~ 200 of the Primes is mainly remembered for a number of algorithm -

一个自然数是素数,且它的数字位置经过任意对换后仍为素数,刚称为绝对素数,例如:13。试找出所有二位绝对素数。-a natural number is a prime number, and its position after arbitrary figures for the number of after-still, just as absolute prime, For example : 13. Tried to find out all the two absolute prime.

使用循环找出100以内的素数，代码很好用，运行无误-Using a loop to find prime numbers less than 100, the code is very easy to use, run correctly