Question

mes A. Hotz Programming Challenge: Prime qumber Array Values from Canvas: ICE12A Please name your source file: PC7101.CPP A prime number is a number that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided by 1 and 5 The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6. Write a function named isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Call your function in a loop that stores all the prime numbers from 2 to 1,000 in an array. Display the numbers, 10 to a line, with setw(8) in another loop. Using no test data, Your output should look like this: 2357 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 ....etc.... This experimental Web site is intended to help you produce better quality code It does NOT store your work Once you have witten the program, and verified that it runs properly (using the controls

this is c++ and please let the code works on vs2017. the output should be same as the question.

Answer 1

Hey here is answer to your question

#include <iostream>
#include <iomanip>
using namespace std;

//Function to check if number is prime
bool isPrime(int n)
{ //looping over number 2 to n (not starting with 1 as everything is can be divided by one)
    for (int i = 2; i < n; i++)
       //check if i can divide n
        if (n % i == 0)
           //if i can divide n then its not a prime number
           // as a prime number can only divide by 1 or itself
            return false;
    // if it si not divided by anything then its a prime number
    return true;
}

int main () {
   //counter which will be used to print new line
   int counter=0;

   // array to store prime numbers where each element in starting is 0
   int primeArray[1000]={0};

   //looping over 1 to 1000
   for (int i = 1; i <= 1000; i++)
       // checking if numebr is prime
       if (isPrime(i))
           // if number is prime add it to the array
           primeArray[i]=i;
  
   // looping 0 to 1000 to check array
   for (int i = 0; i < 1000; i++){
       //as we had all elemets in array "0" and 0 cant be a prime numeber
       //so we use that to print upto the last prime numebr upto 1000
       if (primeArray[i]!=0){
           // used setw()
           cout<< setw(8);
           // printing prime number
           cout<<primeArray[i];
           // increaseing the counter
           counter++;
      
       // now here the counter is used
       // we need to print 10 numbers in each row
       // and we incremented the counter so if it is 10 print a new line
       if(counter==10){
           printf("\n");
           counter=0;
           }
       }
   }
   //printing a new line at the end
   printf("\n");
  
return 0;
}

In case of any doubt please comment. Happy Learning :)

root@kali.-/HomeworkLib/april/isprime# g++ isprime.cpp root@kali.-/HomeworkLib/april/isprime# ./a.out 3 101 103 157 211 269 331 389 449 509 587 643 709 773 853 919 991 107 163 223 271 337 397 457 521 593 109 167 227 277 347 401 461 523 599 653 727 113 173 229 281 349 409 463 139 193 251 127 179 233 283 353 419 467 547 607 661 739 811 877 181 239 293 359 421 479 557 191 197 257 313 379 439 499 571 631 691 761 829 907 977 199 263 317 383 443 503 577 307 367 431 487 563 373 433 491 569 619 683 757 827 887 601 659 733 701 769 839 677 751 823 883 967 719 673 821 881 953 857 929 997 859 937 863 983