Improving the efficiency of the 'mod_inv' method within the 'mathsHelper' class. Currently, it uses a brute-force approach to find the modular inverse, which may not be optimal for large values of 'm'. Instead, we can utilize the Extended Euclidean Algorithm to compute the modular inverse more efficiently.

Improving the efficiency of the 'mod_inv' method within the 'mathsHelper' class. Currently, it uses a brute-force approach to find the modular inverse, which may not be optimal for large values of 'm'. Instead, we can utilize the Extended Euclidean Algorithm to compute the modular inverse more efficiently. #1442