Thread: Prime Numbers and Array...

Code:

#include"stdafx.h"
#include<stdlib.h>
#include<math.h>


int main() {

int int_array[10];
int i, product = 1, sum = 0;

for (i = 0; i < 10; i++) {
	int_array[i] = (rand() * 251)/RAND_MAX;
	printf("int_array[%d] has a value of %d.\n", i, int_array[i]);
}

for (i = 0; i < 10; i++) {
	sum = sum + int_array[i];
}
printf("The sum of the 10 integers is %d\n");


for (i = 0; i < 10; i++) {
	product = product * int_array[i];
}
printf("The product of the 10 integers is %d\n");

printf("The numbers that are divisible by two are\n");
for (i = 0; i < 11; i++) {
	if ((int_array[i]%2)==0)
printf ("%d\n", int_array[i]);
}

printf("The numbers that are divisible by three are\n");
for (i = 0; i < 11; i++) {
	if ((int_array[i]%3)==0)
printf ("%d\n", int_array[i]);
}

printf("The numbers that are prime are\n");
for (i = 0; i < 11; i++) {
	int x = sqrt (int_array[i]);
	for 
		//divide it by 2 - x, if the remainder is ever 0, its not prime.
	
}

How would I do the prime number section? I'm totally lost. :S