Question

Write the code in C with all the right output please.

Problem: In this assignment you will analyze a data set of 10,000 randomly generated integers. From this data set you will display a count of the prime numbers that are greater than the average (double) of the entire data set. The user will input only a single integer value to serve as the seed for the random number generator. The use of a common seed will result in output that replicates that displayed in the example executions. The data set is to be created as follows: 1. Seed the random number generator (srand) with the value given as input (seedValue). 2. Generate the first random number calculate the remainder of it (modulus) with the seed value given as input (rand() & seedValue). The resulting value will represent the maximum number for the data set. The minimum value will be one. 3. Proceed to generate 10,000 numbers in the range identified in the previous step. Example Execution #1 (first number generated modulus seed 2000 is 1347): Enter seed value -> 2000 Range for problem: 1 - 1347 Number of primes larger than data set average [674.8] : 708 Example Execution #2: Enter seed value -> 6000 Range for problem: 1 - 3480 Number of primes larger than data set average [1747.4]: 644 Example Execution #3: Enter seed value -> 18000 Range for problem: 1 - 1348 9 Number of primes larger than data set average [6797.3]: 556

Answer 1

Hey here is answer to your question.

In case of any doubt comment below. Please UPVOTE if you Liked the answer.

#include <stdio.h>

int isPrime(int n)
{
if (n <= 1)
return 0;
for (int i = 2; i < n; i++)
if (n % i == 0)
return 0;
  
return 1;
}

int main(int argc, char const *argv[])
{  
   int seed;
   printf("Enter seed value -> ");
   scanf("%d",&seed);
   srand(seed);
  
   int range = rand()%seed;

   int array[10000];
   double sum = 0;
  
   for (int i = 0; i < 10000; ++i)
   {
       array[i] = (rand() % (range)) + 1;
       sum = sum + array[i];
   }

   double avarage = (sum/10000);

   int counter =0;

   for (int i = 0; i < 10000; ++i)
   {
       if (array[i] >= avarage)
           if (isPrime(array[i]))
               counter++;
   }

   printf("Range for the problem is [1 - %d]\n",range);
   printf("Number of primes larger than dataset avarage [%.1f] : %d \n",avarage,counter);

   return 0;
}