diff --git a/std/numeric.d b/std/numeric.d
index 0a8fc9084..e88c3546b 100644
--- a/std/numeric.d
+++ b/std/numeric.d
@@ -2931,6 +2931,7 @@ Params:
     T = Any numerical type that supports the modulo operator `%`. If
         bit-shifting `<<` and `>>` are also supported, Stein's algorithm will
         be used; otherwise, Euclid's algorithm is used as _a fallback.
+
 Returns:
     The greatest common divisor of the given arguments.
  */
@@ -2941,20 +2942,6 @@ if (isIntegral!T)
     {
         return gcd!(Unqual!T)(a, b);
     }
-    else version (DigitalMars)
-    {
-        static if (T.min < 0)
-        {
-            assert(a >= 0 && b >= 0);
-        }
-        while (b)
-        {
-            immutable t = b;
-            b = a % b;
-            a = t;
-        }
-        return a;
-    }
     else
     {
         if (a == 0)