#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
int prime(int number, int * primes);
int main(void) {
int primes[998] = { 3, 0 };
int n = 5, i;
int count = 0, found;
clrscr();
printf("%8d%8d%8d", 1, 2, 3); /* Print first 3 primes */
/* Find the next 997 */
while ( count < 997 ) {
i = 0;
found = 1;
/* Test if number divides by any of the primes already found */
while ( primes[i] ) {
if ( (n % primes[i++]) == 0 ) { /* If it does... */
found = 0; /* ...then it isn't prime... */
break; /* ...so stop looking */
}
}
if ( found ) {
printf("%8d", n); /* If it's prime, print it... */
primes[i] = n; /* ...and add it to the list */
++count;
/* Start a new line every 8 primes found */
if ( ((count + 3) % 8) == 0 )
putchar('\n');
}
n += 2;
//getch(); /* There's no point testing even numbers, so skip them */
}
putchar('\n');
getch();
return EXIT_SUCCESS;
}
Sample Output :
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 63 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 859 863 877
881 883 887 907 911 919 929 937
941 947 953 967 971 977 983 991
997 1009 1013 1019 1021 1031 1033 1039
1049 1051 1061 1063 1069 1087 1091 1093
1097 1103 1109 1117 1123 1129 1151 1153
. . . . . . .
. . . . . . 7907
#include <stdlib.h>
#include <conio.h>
int prime(int number, int * primes);
int main(void) {
int primes[998] = { 3, 0 };
int n = 5, i;
int count = 0, found;
clrscr();
printf("%8d%8d%8d", 1, 2, 3); /* Print first 3 primes */
/* Find the next 997 */
while ( count < 997 ) {
i = 0;
found = 1;
/* Test if number divides by any of the primes already found */
while ( primes[i] ) {
if ( (n % primes[i++]) == 0 ) { /* If it does... */
found = 0; /* ...then it isn't prime... */
break; /* ...so stop looking */
}
}
if ( found ) {
printf("%8d", n); /* If it's prime, print it... */
primes[i] = n; /* ...and add it to the list */
++count;
/* Start a new line every 8 primes found */
if ( ((count + 3) % 8) == 0 )
putchar('\n');
}
n += 2;
//getch(); /* There's no point testing even numbers, so skip them */
}
putchar('\n');
getch();
return EXIT_SUCCESS;
}
Sample Output :
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 63 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 859 863 877
881 883 887 907 911 919 929 937
941 947 953 967 971 977 983 991
997 1009 1013 1019 1021 1031 1033 1039
1049 1051 1061 1063 1069 1087 1091 1093
1097 1103 1109 1117 1123 1129 1151 1153
. . . . . . .
. . . . . . 7907