Prime Checker C++

[ace2606]

Hi
I am a beginner in C++ and would like someone to give me an idea or push me in the right direction of how to solve this question , It is related to classes

Design and implement a class called PrimeChecker to check if a number is
prime. The class stores an array of consecutive primes. It uses this array
to check if a given number is prime. To simplyfy the excercise the array
will store at most 1000 prime numbers. The class has the following public
methods:
(a) Constructor
The array to store up to 1000 primes is created and the prime number
’2’ and ’3’ are stored in side the array.
(b) Destructor
(c) IsPrime() which returns a boolean and takes a parameter which is
an integer.
Note: Whether a number n is prime can be checked by testing divis-
ibility of all primes from 2 to the √n.
Check if the array stores all needed prime numbers and extend place
more consecutive prime numbers into array if needed.
(d) printAllKnownPr imes() which prints all the primes stored in the ar-
ray using cout.

Thank you in advance =)

[Ganon11]

What work have you done so far? How far have you gotten in this class?

Could you make a prime checker without a class (a.k.a. make a function that checks if a number is prime?)

[ace2606]

What work have you done so far? How far have you gotten in this class?

Could you make a prime checker without a class (a.k.a. make a function that checks if a number is prime?)

I got

#include <iostream>
using namespace std;
class PrimeChecker {
 
private:
int primes[1000];                         // defining the array
//const int MAX_PRIMES=1000;
 
int i;                                     // defining i , the position of the prime in the array
                                    // defining x, the number input into the program
 
 
 
public:
//int primes();
PrimeChecker (); 
~PrimeChecker();
void printAllKnownPrimes() ;
bool IsPrime(int x);
//bool IsPrimes (int i);
};
 
 
PrimeChecker::PrimeChecker(){
primes[0] =2;
primes[1] =3;
i=1;
}
 
PrimeChecker::~PrimeChecker(){};
int x;
bool PrimeChecker::IsPrime(x){
int SQ = sqrt(x)
 
for ( n=primes[i] + 1; n<SQ; a++){
if (n%primes[i]==0)
primes[i+1] = n;
i++;
}
}
return IsPrime(x);
}
 
bool PrimeChecker::IsPrimes(x) {
  for (x=2;x<input;x++) {
   if (input%x=0){
         return false;
  }
 }
return true;
}
 
 
 
}
 
 
//void printAllKnownPrimes() {
//cout << "All primes are " ;
//for (int i=0;i<n;i++){
//cout << primes[i]; }
 
 
 
 
 
 
int main(){
    PrimeChecker p;
    int x;
    while(1){
        while(x<2||x>62710561,i++) {
            cout<<"Please input x between 2 and 1000 "<<endl;
            cin>>x;
            if(x==0) break;
        }
        if(x==0) break;
 
        if(p.IsPrime(x)) cout<<x<<" is a prime"<<endl;
        else cout<<x<<" is not a prime"<<endl;
        p.AllKnownPrimes();
 
        cout<<"Please input x in [2,62710561] or 0 for quit:"<<endl;
        cin>>x;
        if(x==0) break;
    }
    getchar();
           return 1;
    }
}

DOesnt compile though

[donbock]

I got
<code snipped for brevity>
Doesn't compile though

Please provide any compiler errors/warnings, being careful to translate line numbers as needed so they refer to the source code as you posted it.

You're asking for people to volunteer their time to assist you. Make it easy for them to help you.

Please don't take my snippiness personally -- you just had the misfortune to be here when I boiled over.