# HG changeset patch
# User paulson
# Date 990091881 -7200
# Node ID 0db2a02bff99c675f91ff23d384d0b738c07ef62
# Parent  f0661da2f6ae1de76a4ecd51c982f3b4fef80a2a
auto update

diff -r f0661da2f6ae -r 0db2a02bff99 doc-src/TutorialI/Trie/document/Trie.tex
--- a/doc-src/TutorialI/Trie/document/Trie.tex	Thu May 17 11:31:08 2001 +0200
+++ b/doc-src/TutorialI/Trie/document/Trie.tex	Thu May 17 11:31:21 2001 +0200
@@ -127,10 +127,10 @@
 
 \begin{exercise}
   Modify \isa{update} (and its type) such that it allows both insertion and
-  deletion of entries with a single function.  Prove (a modified version of)
-  the main theorem above.
-  Optimize you function such that it shrinks tries after
-  deletion, if possible.
+  deletion of entries with a single function.  Prove the corresponding version 
+  of the main theorem above.
+  Optimize your function such that it shrinks tries after
+  deletion if possible.
 \end{exercise}
 
 \begin{exercise}