diff --git a/Doc/Sd1/statements.xml b/Doc/Sd1/statements.xml
index cef133f8419abcf5eaf59aad7527709cad0153bc..a3eb46157aa61f0479b388904dc24c736f9f7ecc 100644
--- a/Doc/Sd1/statements.xml
+++ b/Doc/Sd1/statements.xml
@@ -2963,8 +2963,13 @@ import java.util.Random;
                 rather then creating and filtering them. Do we really need
                 three nested loops?</para>
 
-                <para>Since we may sort values by size our problem can be
-                stated as finding the set of all triples <inlineequation>
+                <para>Also triples having identical values but in a different
+                order like <code>(40, 399, 401)</code> and <code>(40, 401,
+                399)</code> are equivalent. For this reason we may consider
+                only triples being ordered by size.</para>
+
+                <para>So the problem can be stated to find the set of all
+                triples <inlineequation>
                     <m:math display="inline">
                       <m:mrow>
                         <m:mo>(</m:mo>