The Project Gutenberg EBook of The First 100,000 Prime Numbers, by Unknown
This eBook is for the use of anyone anywhere at no cost and with
almost no restrictions whatsoever. You may copy it, give it away or
re-use it under the terms of the Project Gutenberg License included
with this eBook or online at www.gutenberg.net
Title: The First 100,000 Prime Numbers
Author: Unknown
Release Date: June 20, 2008 [EBook #65]
Language: English
Character set encoding: ASCII
*** START OF THIS PROJECT GUTENBERG EBOOK THE FIRST 100,000 PRIME NUMBERS ***
The First 100,000 Prime Numbers
This file contains the first 100,000 primes as well as the C program
(frightfully primitive as it may be) which is used to calculate them.
They were calculated at using a Cray X-MP.
***Program Begins***
#include "stdio.h"
#include "math.h"
int number;
main()
{
printf("Which number do you wish to start the test with? ");
scanf("%d",&number);
printf("\n");
printf("I'm starting with number %d\n",number);
if (number<1) number=1;
if (number==1) printf("1\n");
if (number<=2) printf("2\n");
if (!(number % 2)) number++;
if (number==1) number=3;
do
{
if (isprime(number)) printf("%d\n",number);
number+=2;
}while (1) ;
}
isprime(int thenumber)
{
int isitprime=1,loop;
for(loop=3 ; (isitprime) && (loop<(sqrt(thenumber)+1)) ; loop+=2)
isitprime = (thenumber % loop);
return(isitprime);
}
***Program Ends***
The Project Gutenberg Etext of The First 100,000 Prime Numbers
[1 is not a prime by many definitions of prime]
1
2
3
5
7
11
13
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
101
103
107
109
113
127
131
137
139
149
151
157
163
167
173
179
181
191
193
197
199
211
223
227
229
233
239
241
251
257
263
269
271
277
281
283
293
307
311
313
317
331
337
347
349
353
359
367
373
379
383
389
397
401
409
419
421
431
433
439
443
449
457
461
463
467
479
487
491
499
503
509
521
523
541
547
557
563
569
571
577
587
593
599
601
607
613
617
619
631
641
643
647
653
659
661
673
677
683
691
701
709
719
727
733
739
743
751
757
761
769
773
787
797
809
811
821
823
827
829
839
853
857
8
|