diff --git a/Maths/GetGCD.js b/Maths/GetEuclidGCD.js
similarity index 78%
rename from Maths/GetGCD.js
rename to Maths/GetEuclidGCD.js
index 0efa695ed..862999961 100644
--- a/Maths/GetGCD.js
+++ b/Maths/GetEuclidGCD.js
@@ -1,5 +1,5 @@
 /*
-    Problem statement and Explanation : https://en.wikipedia.org/wiki/Greatest_common_divisor
+    Problem statement and Explanation : https://en.wikipedia.org/wiki/Euclidean_algorithm
 
     In this method, we have followed the iterative approach to first
     find a minimum of both numbers and go to the next step.
@@ -12,6 +12,10 @@
  * @returns return a `gcd` value of both number.
  */
 const getGcd = (arg1, arg2) => {
+  // firstly, check that input is a number or not.
+  if (typeof arg1 !== 'number' || typeof arg2 !== 'number') {
+    return new TypeError('Argument is not a number.')
+  }
   // Find a minimum of both numbers.
   let less = arg1 > arg2 ? arg2 : arg1
   // Iterate the number and find the gcd of the number using the above explanation.
diff --git a/Maths/ReverseNumber.js b/Maths/ReverseNumber.js
index d3e2695d8..4995761f3 100644
--- a/Maths/ReverseNumber.js
+++ b/Maths/ReverseNumber.js
@@ -8,6 +8,10 @@
  * @returns `Number` n reverse in reverse.
  */
 const ReverseNumber = (number) => {
+  // firstly, check that input is a number or not.
+  if (typeof number !== 'number') {
+    return new TypeError('Argument is not a number.')
+  }
   // A variable for storing the reversed number.
   let reverseNumber = 0
   // Iterate the process until getting the number is 0.