diff --git a/math/mod_inverse_by_fermat_theorem.cpp b/math/mod_inverse_by_fermat_theorem.cpp
index e4b0fa095..fde19dc52 100644
--- a/math/mod_inverse_by_fermat_theorem.cpp
+++ b/math/mod_inverse_by_fermat_theorem.cpp
@@ -73,7 +73,7 @@ int main() {
         std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
         std::cout << binExpo(a, m-2, m) << std::endl;
     } else {
-        std::cout << "m must be a prime number to apply Fermat's Little Theorem.";
+        std::cout << "m must be a prime number.";
         std::cout << std::endl;
     }
 }