/********************* Program To Check Whether The User Entered Prime Number Is Mersenne Prime Or Not A Mersenne Prime is a prime number that is one less than a power of two. It is a prime number of the form 2^n -1 for some integer n. Example Input : 31 Example Ouput : true (31 is a prime number and 31=2^5 -1) NOTE : The Highest Number Upto Which Can Be Entered Is 1500 Input : Enter any prime number that is one less than a power of two. An example is given above. *********************/ #include #include using namespace std; class Mersenne_Prime { int num1, i, result, ans, flag, found; public: Mersenne_Prime() { found=0; flag=1; } void details(); void getdata(); int prime(); void calculate(); void display(); }; void Mersenne_Prime :: details() { cout << "Mersenne Prime : A Mersenne Prime is a prime number that is one less than a power of two. It is a prime number of the form 2^n -1 for some integer n." << endl; } void Mersenne_Prime :: getdata() { cout << "\nTo Check Whether The Entered Prime Number Is Mersenne Prime Or Not" << endl; cout << "\nEnter The Prime Number To Be Checked : "; cin >> num1; cout << num1 << endl; } void Mersenne_Prime :: calculate() { for(i=1;i<1000;i++) { ans=pow(2,i); result=ans-1; if(result>=1500) { break; } else if(num1==1) { cout << num1 << " is neither prime nor composite !!" << endl; cout << "Try Again Later !!" << endl; break; } else if(result==num1) { found=1; break; } else found=0; } } void Mersenne_Prime :: display() { if(found) cout << num1 << " is a Mersenne Prime Number !!" << endl; else cout << num1 << " is a not a Mersenne Prime Number !!" << endl; } int Mersenne_Prime :: prime() { int i; for(i=2;i<=num1/2;i++) { if(num1%i==0) { flag=0; break; } } if (flag) return 1; else return 0; } int main() { Mersenne_Prime M1; M1.details(); M1.getdata(); int x=M1.prime(); if(x) { M1.calculate(); M1.display(); } else { cout << "The Entered Number Is Not A Prime Number !!" << endl; cout << "Try Again Later !!!" << endl; } }