diff --git a/test/unit_test/runtime/magnitude_test.cpp b/test/unit_test/runtime/magnitude_test.cpp
index 9958c715..9db7b696 100644
--- a/test/unit_test/runtime/magnitude_test.cpp
+++ b/test/unit_test/runtime/magnitude_test.cpp
@@ -156,16 +156,6 @@ TEST_CASE("make_ratio performs prime factorization correctly")
     as_magnitude<ratio(16'605'390'666'050, 10'000'000'000'000)>();
   }
 
-  SECTION("Can handle prime number which would exceed GCC iteration limit")
-  {
-    // GCC 10 has a constexpr loop iteration limit of 262144.  A naive algorithm, which performs trial division on 2 and
-    // all odd numbers up to sqrt(N), will exceed this limit for the following prime.  Thus, for this test to pass, we
-    // need to be using a more efficient algorithm.  (We could increase the limit, but we don't want users to have to
-    // mess with compiler flags just to compile the code.)
-    constexpr std::intmax_t big_prime = 414'131;
-    as_magnitude<big_prime * big_prime>();
-  }
-
   SECTION("Can bypass computing primes by providing known_first_factor<N>")
   {
     // Sometimes, even wheel factorization isn't enough to handle the compilers' limits on constexpr steps and/or