求素数

using System;
namespace Other_Features
{
public class Prime
{
public int number;
public Prime(int n)
{
if(isPrime(n))
this.number=n;
else
throw new Exception (n+" is not a prime.");
}
public static Prime operator ++ (Prime orig)
{
bool succeeded =false;
while(!succeeded)
succeeded=isPrime(++orig.number );
return orig;
}
public static bool isPrime(int number)
{
int max=(int)(number/2+1);
for(int i=2;i<max;++i)
if(number%i==0)
return false;
return true;
}
public static void Main()
{
Prime p=new Prime (1);
for(int i=0;i<100;++i)
{
Console.WriteLine (p.number);
++p;
}
}
}
}

最简单:

using System;
class Test
{
public static void Main()
{
int i;
Console.WriteLine (2);
Console.WriteLine (3);
Console.WriteLine (5);
Console.WriteLine (7);
for(i=2;i<=1000;i++)
{
if((i%2!=0)&&(i%3!=0)&&(i%5!=0)&&(i%7!=0))
{
Console.WriteLine (i+"\t");
}
}

}
}