X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2F_assignment4.mdwn;h=38e3180f6f8d79c83e9d965496023f53041aaedb;hp=226741e14c1f136f738019543eeea238351aa9fa;hb=701998a14b92fc759963d258f2e425587a246d48;hpb=f18d270f9c73466e1ec28afb184a0fdb3fc343af;ds=sidebyside

diff --git a/exercises/_assignment4.mdwn b/exercises/_assignment4.mdwn
index 226741e1..38e3180f 100644
--- a/exercises/_assignment4.mdwn
+++ b/exercises/_assignment4.mdwn
@@ -117,8 +117,8 @@ is unchanged after adding 1 to it.  It makes a certain amount of sense
 to use this object to model arithmetic infinity.  For instance,
 depending on implementation details, it might happen that `leq n ξ` is
 true for all (finite) natural numbers `n`.  However, the fixed point
-you found for `succ` may not be a fixed point for `mult n` or for
-`exp n`.
+you found for `succ` and `(+n)` may not be a fixed point for `(*n)` or for
+`(^n)`.
 
 
 ## Mutually-recursive functions ##