clarification as per email

Author: martin-henz

xml/chapter1/section2/subsection2.xml

@@ -675,7 +675,11 @@ f_recursive(5);
     </SPLITINLINE>
     that computes elements of Pascal<APOS/>s triangle by means of a recursive
     process.
-    <SOLUTION>                
+    <SOLUTION>
+      Assuming that we count the rows of the triangle from the top starting
+      at 1 and the numbers in each row using indices from left to right
+      starting at 1, the following function computes the number in the
+      triangle in a given row at a given index.
       <SNIPPET>
 	<NAME>pascal_triangle</NAME>
         <EXAMPLE>example_1.13</EXAMPLE>