Implement your own integer class, where all operations are mod 41.
Given that the modulus is prime, make sure you overload all basic
mathematical operators (+,-,*,/,=) as well as the equality relational
operator (==).  Also, include an exponentiation function. 

Keep in mind that division is defined as multiplication by the
inverse.  The inverse of a number n mod 41 is a number m such that mn
= 1 mod 41.  And since 41 is prime, there is an inverse for all
values. 

Given that we are dealing with such small numbers, there is no reason
to use the extended Euclidean algorithm to find the inverse.  Rather,
just check all values until such an inverse is found (brute force it).
In this case, it will take roughly the same number of steps on
average. 

Make sure you write a tester file which fully exercises your new
integer class. 

Also, you will need to use a makefile to compile this exercise.

The class itself is worth 50 points, the tester file another 20.  The
makefile is worth 20 as well. 

For 25 points extra credit, look up and use the extended Euclidean
algorithm to find the inverse to do division, and make the constructor
take a value (which should be prime) as the modulus.