The document describes classes for integer manipulation and prime factorization. It defines member functions to perform operations on integers such as counting digits, reversing digits, splitting integers into blocks, determining primality, and finding prime factorization. It also provides code for driver programs that test the classes and allow the user to select operations via a menu. The full solution includes implementing the remaining member functions, adding constructors/destructors, overloading operators, and separating class specifications from implementation code.

1. C++ code only
(Retrieve of Malik D., 2015, p. 742) Programming Exercises 24., Chapter 10.
Consider the integer 6203851479017652638. Some of the operations that can be performed on
this integer are:
(5) Determine whether the number is prime.
(6) Find the prime factorization of the number.
Write the definitions of the member functions of the class integerManipulation .
class integerManipulation {
public:
void setNum(long long n);
//Function to set num.
//Postcondition: num = n;
long long getNum();
//Function to return num.
//Postcondition: The value of num is returned.
void reverseNum();
//Function to reverse the digits of num.
//Postcondition: revNum is set to num with digits in
//in the reverse order.
void classifyDigits();
//Function to count the even, odd, and zero digits of
num.
//Postcondition: evenCount = the number of even digits
// in num.
// oddCount = the number of odd digits in num.
int getEvensCount();
//Function to return the number of even digits in num.
//Postcondition: The value of evensCount is returned.
int getOddsCount();
//Function to return the number of odd digits in num.

2. //Postcondition: The value of oddscount is returned.
int getZerosCount();
//Function to return the number of zeros in num.
//Postcondition: The value of zerosCount is returned.
int sumDigits();
//Function to return the sum of the digits of num.
//Postcondition: The sum of the digits is returned.
integerManipulation(long long n = 0);
//Constructor with a default parameter.
//The instance variable num is set accordingto the
//parameter, and other instance variables are
//set to zero.
//The default value of num is 0;
//Postcondition: num = n; revNum = 0; evenscount = 0;
//oddsCount = 0; zerosCount = 0;
private:
long long num;
long long revNum;
int evenCcount;
int oddsCount;
int zerosCount;
};
void integerManipulation::setNum(long long n) {
num = n;
}
long long integerManipulation::getNum() {
return num;
}
void integerManipulation::reverseNum() {
cout << "Programming Exercise" << endl;
}

3. void integerManipulation::classifyDigits() {
long long temp;
temp = abs(num);
int digit;
while (temp != 0) {
digit = temp - (temp / 10) * 10; temp = temp / 10;
if (digit % 2 == 0) {
evensCount++;
if (digit == 0)
zerosCount++;
}
else
oddsCount++;
}
}
integerManipulation::getEvensCount() {
return evensCount;
}
int integerManipulation::getOddsCount() {
return oddsCount;
}
int integerManipulation::getZerosCount() {
return zerosCount;
}
int integerManipulation::sumDigits() {
cout << "Programming Exercise " << endl;
return 0;
}
integerManipulation::integerManipulation(long long n) {

4. num = n;
revNum = 0;
evensCount = 0;
oddsCount = 0;
zerosCount = 0;
}
#include
#include "integerManipulation.h"
using namespace std;
int main(){
integerManipulation number;
long long num;
cout << "Enter an integer: ";
cin >> num;
cout << endl;
number.setNum(num);
number.classifyDigits();
cout << "The number of even digits: "
<< number.getEvensCount() << endl
<< "The number of zeros: "
<< number.getZerosCount() << endl
<< "The number of odd digits: "
<< number.getOddsCount() << endl;
return 0;
}//end main
Sample Run :
Enter an integer : 6203851479017652638
The number of even digits : 10
The number of zeros : 2
The number of odd digits : 9
Retrieve of Malik D., 2015, p. 816) Programming Exercises 14., Chapter 11.
Write the definitions of the functions of the class primeFactorization and write a program that
uses this class to output the prime factorization of an integer.

5. #ifndef primeFactorization_H
#define primeFactorization_H
#include "integerManipulation.h"
class primeFactorization : public integerManipulation {
public:
void factorization();
//Function to output the prime factorization of num.
//Postcondition: Prime factorization of num is
//printed.
primeFactorization(long long n = 0);
//Constructor with a default parameter.
//The instance variables of the base class are set
//according to the parameters and the array
//first125000Primes is created.
//Postcondition: num = n; revNum = 0; evenscount = 0;
// oddsCount = 0; zerosCount = 0;
//first125000Primes = first 125000 prime numbers.
private:
long first125000Primes[125000];
void first125000PrimeNum(long long list[], int length);
//Function to determine and store the first 125000
//prime integers.
//Postcondition: The first 125000 prime numbers are
//determined and stored in the array first125000Primes.
//Add additional functions as needed.
};
#endif
primeFactorization::primeFactorization(long long n)
: integerManipulation(n) {
first125000PrimeNum(first125000Primes, 125000);
}

6. void primeFactorization::factorization() {
cout << "Programming Exercise " << endl;
}
#include
#include "primeFactorization.h"
using namespace std;
int main()
{
primeFactorization number;
long long num;
cout << "Enter an integer between 2 and "
<< "270,000,000,000,000: ";
cin >> num;
cout << endl;
number.setNum(num);
number.factorization();
return 0;
} //end main
Sample Run 1 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 3614457253
3614457253 is not a prime number.
Its factorization is : 3614457253 = 11 * 29 * 151 * 75037
Sample Run 2 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 2457829012772
2457829012772 is not a prime number.
Its factorization is : 2457829012772 = 2 * 2 * 7 * 37 * 41 * 67 * 863641
Sample Run 3 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 151383311
151383311 is a prime number.
Its factorization is : 151383311 = 151383311

7. Consider the integer 6203851479017652638. Some of the operations that can be performed on
this integer are: Count the number of even digits, odd digits, and zeros. Find the sum of the
digits. Reverse the digits; split the number into blocks of three-digit numbers; and find the sum
of these numbers. Split the number into blocks of n-digit numbers starting from right to left and
find the sum of these n-digit numbers. (Note that the last block may not have n digits. If needed
add additional instance variables.)
(5) Determine whether the number is prime.
(6) Find the prime factorization of the number.
Write the definitions of the member functions of the class integerManipulation .
class integerManipulation {
public:
void setNum(long long n);
//Function to set num.
//Postcondition: num = n;
long long getNum();
//Function to return num.
//Postcondition: The value of num is returned.
void reverseNum();
//Function to reverse the digits of num.
//Postcondition: revNum is set to num with digits in
//in the reverse order.
void classifyDigits();
//Function to count the even, odd, and zero digits of
num.
//Postcondition: evenCount = the number of even digits
// in num.
// oddCount = the number of odd digits in num.
int getEvensCount();
//Function to return the number of even digits in num.
//Postcondition: The value of evensCount is returned.

8. int getOddsCount();
//Function to return the number of odd digits in num.
//Postcondition: The value of oddscount is returned.
int getZerosCount();
//Function to return the number of zeros in num.
//Postcondition: The value of zerosCount is returned.
int sumDigits();
//Function to return the sum of the digits of num.
//Postcondition: The sum of the digits is returned.
integerManipulation(long long n = 0);
//Constructor with a default parameter.
//The instance variable num is set accordingto the
//parameter, and other instance variables are
//set to zero.
//The default value of num is 0;
//Postcondition: num = n; revNum = 0; evenscount = 0;
//oddsCount = 0; zerosCount = 0;
private:
long long num;
long long revNum;
int evenCcount;
int oddsCount;
int zerosCount;
};
void integerManipulation::setNum(long long n) {
num = n;
}
long long integerManipulation::getNum() {
return num;
}
void integerManipulation::reverseNum() {

9. cout << "Programming Exercise" << endl;
}
void integerManipulation::classifyDigits() {
long long temp;
temp = abs(num);
int digit;
while (temp != 0) {
digit = temp - (temp / 10) * 10; temp = temp / 10;
if (digit % 2 == 0) {
evensCount++;
if (digit == 0)
zerosCount++;
}
else
oddsCount++;
}
}
integerManipulation::getEvensCount() {
return evensCount;
}
int integerManipulation::getOddsCount() {
return oddsCount;
}
int integerManipulation::getZerosCount() {
return zerosCount;
}
int integerManipulation::sumDigits() {
cout << "Programming Exercise " << endl;
return 0;
}

10. integerManipulation::integerManipulation(long long n) {
num = n;
revNum = 0;
evensCount = 0;
oddsCount = 0;
zerosCount = 0;
}
#include
#include "integerManipulation.h"
using namespace std;
int main(){
integerManipulation number;
long long num;
cout << "Enter an integer: ";
cin >> num;
cout << endl;
number.setNum(num);
number.classifyDigits();
cout << "The number of even digits: "
<< number.getEvensCount() << endl
<< "The number of zeros: "
<< number.getZerosCount() << endl
<< "The number of odd digits: "
<< number.getOddsCount() << endl;
return 0;
}//end main
Sample Run :
Enter an integer : 6203851479017652638
The number of even digits : 10
The number of zeros : 2
The number of odd digits : 9
Retrieve of Malik D., 2015, p. 816) Programming Exercises 14., Chapter 11.

11. Write the definitions of the functions of the class primeFactorization and write a program that
uses this class to output the prime factorization of an integer.
#ifndef primeFactorization_H
#define primeFactorization_H
#include "integerManipulation.h"
class primeFactorization : public integerManipulation {
public:
void factorization();
//Function to output the prime factorization of num.
//Postcondition: Prime factorization of num is
//printed.
primeFactorization(long long n = 0);
//Constructor with a default parameter.
//The instance variables of the base class are set
//according to the parameters and the array
//first125000Primes is created.
//Postcondition: num = n; revNum = 0; evenscount = 0;
// oddsCount = 0; zerosCount = 0;
//first125000Primes = first 125000 prime numbers.
private:
long first125000Primes[125000];
void first125000PrimeNum(long long list[], int length);
//Function to determine and store the first 125000
//prime integers.
//Postcondition: The first 125000 prime numbers are
//determined and stored in the array first125000Primes.
//Add additional functions as needed.
};
#endif
primeFactorization::primeFactorization(long long n)
: integerManipulation(n) {
first125000PrimeNum(first125000Primes, 125000);

12. }
void primeFactorization::factorization() {
cout << "Programming Exercise " << endl;
}
#include
#include "primeFactorization.h"
using namespace std;
int main()
{
primeFactorization number;
long long num;
cout << "Enter an integer between 2 and "
<< "270,000,000,000,000: ";
cin >> num;
cout << endl;
number.setNum(num);
number.factorization();
return 0;
} //end main
Sample Run 1 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 3614457253
3614457253 is not a prime number.
Its factorization is : 3614457253 = 11 * 29 * 151 * 75037
Sample Run 2 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 2457829012772
2457829012772 is not a prime number.
Its factorization is : 2457829012772 = 2 * 2 * 7 * 37 * 41 * 67 * 863641
Sample Run 3 :
Enter an integer between 2 and 270, 000, 000, 000, 000 : 151383311
151383311 is a prime number.
Its factorization is : 151383311 = 151383311

13. Add the member functions to integerManipulation Class.Implement the code of the member
function of primeFactorization Class.Implement an Options Menu in the driver program with the
following operations:Count the number of even digits, odd digits, and zeros.Find the sum of the
digits.Reverse the digits.Split the number into blocks of three-digit numbers and find the sum of
these numbers.Split the number into blocks of n-digit numbers from right to left and find the sum
of these n-digit numbers. (Note that the last block may not have n digits. If needed, add
additional instance variables.)Determine whether the number is prime.Find the prime
factorization of the number.Quit of program.
Implement your code's Constructors, Destructor, Copy Constructor, Mutators, and Accessor
functions.Overload operators in the classes.The solution must contain the following:Source
code.Separate class specifications from implementation.Program output.