diff --git a/M2/Macaulay2/packages/MinimalPrimes/doc.m2 b/M2/Macaulay2/packages/MinimalPrimes/doc.m2
index 3f493849ac4..916783f3d7c 100644
--- a/M2/Macaulay2/packages/MinimalPrimes/doc.m2
+++ b/M2/Macaulay2/packages/MinimalPrimes/doc.m2
@@ -234,6 +234,15 @@ Node
       I = intersect(ideal(a^2,b^2,c), ideal(a,b^3,c^2))
       elapsedTime radical(ideal I_*, Strategy => Monomial)
       elapsedTime radical(ideal I_*, Unmixed => true)
+    Text
+      Sometimes when it is computationally expensive to compute the set of minimal primes of an 
+      ideal the strategy Unmixed can be useful for computing the radical as it does so without
+      computing the set of minimal primes. The example below demonstrates one such instance.
+    Example
+      R = QQ[x,y]
+      I = ideal(x^250 - y^250)
+      elapsedTime radical(ideal I_*, Strategy => Decompose)
+      elapsedTime radical(ideal I_*, Strategy => Unmixed)
     Text
       For another example, see @TO "PrimaryDecomposition :: PrimaryDecomposition"@.
   References