1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
#include <stdio.h> int main() { int i, n; printf("n = "); scanf("%d", &n); for (i = 2; i < n; i++) if (n % i == 0) break; if (i == n) printf("prime number\n"); else printf("not prime number\n"); return 0; } /* end */
1
n = not prime number