Question

10000以上素数表

请各位高人告诉我“大于10000的素数，至少20个连续素数”，最好告诉我答案的出处，以便查证！

Answer 1

#include<stdio.h>
void jsvalue(int m,int k,int xx[])
{int i,j,l=0;
for(i=m+1;k>0;i++)
{
for(j=2;j<i;j++)
if(i%j==0) break;
if(j==i) {xx[l]=i;l++;k--;}

}
}
main()
{int i,m,k,xx[100];
printf("please give the shu ,geshu(<100):\n");
scanf("%d %d",&m,&k);
jsvalue(m,k,xx);
for(i=0;i<k;i++)
printf("%d,",xx[i]);
}

算法：求得10000＋7,9,37,39,61,67,69,79,91,93,99,103,111,133,139,141,151,159,163,169

Answer 2

可以编程来求得嘛,这个挺简单的呀!
#include<stdio.h>
#include<math.h>
int fir(long m)
{
int i,k=0;
for(i=2;i<=(long)sqrt(m);i++)
if(m%i==0) {k=1;break;}
return k;
}
void main(void)
{
long m;
int n;
FILE *fp;
if((fp=fopen("123.txt","w"))==NULL)
{printf("not exist\n");exit(0);}
for(m=10001,n=0;;m++)
if(fir(m)==0)
{
n++;
printf(" %ld",m);
fprintf(fp,"%ld ",m);
if(n>=20) break;
}
printf("\n\n");
fclose(fp);
}
输出结果:10007 10009 10037 10039 10061 10067 10069 10079 10091 10093 10099 10103 10111 10133 10139 10141 10151 10159 10163 10169

Answer 3

我当回好人
public
class
Primes
{
public
static
void
main(String[]
args)
{
for
(long
i
=
1;
i
<=
10000;
i++)
{
long
a
=
1;
for
(long
n
=
2;
n
<=
Math.sqrt(i);
n++)
{
a
=
a
*
(
i
%
n);
if
(
i
%
n
>=
2)
{
a
=
a
/
2;
}
}
if
(a
!=
0)
{
System.out.println(i);
}
}
}
}

Answer 4

10007
10009
10037
10039
10061
10067
10069
10079
10091
10093
10099
10103
10111
10133
10139
10141
10151
10159
10163
10169
10177
10181
10193
10211
10223
10243
10247
10253
10259
10267
10271
10273
10289
10301
10303
10313
10321
10331
10333
10337
10343
10357
10369
10391
10399
10427
10429
10433
10453
10457
10459
10463
10477
10487
10499
10501
10513
10529
10531
10559
10567
10589
10597
10601
10607
10613
10627
10631
10639
10651
10657
10663
10667
10687
10691
10709
10711
10723
10729
10733
10739
10753
10771
10781
10789
10799
10831
10837
10847
10853
10859
10861
10867
10883
10889
10891
10903
10909
10937
10939
10949
10957
10973
10979

Answer 5

10007
10009
10037
10039
10061
10067
10069
10079
10091
10093
10099
10103
10111
10133
10139
10141
10151
10159
10163
10169