X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment3.mdwn;h=8c22dfa4cead672756b7582b230aa570a92e6858;hp=50495f52b2a3bf15d0bd42f8ca8abb304781a8e8;hb=0ba095c6cd0331481a1454283ceeb14be690b5b8;hpb=77c732f19c13e5eea90fb0553c2fcc35afcdea2e

diff --git a/assignment3.mdwn b/assignment3.mdwn
index 50495f52..8c22dfa4 100644
--- a/assignment3.mdwn
+++ b/assignment3.mdwn
@@ -51,7 +51,7 @@ Then `length mylist` evaluates to 3.
 function, write a function that computes factorials.  (Recall that n!,
 the factorial of n, is n times the factorial of n-1.)
 
-Warning: it takes a long time for my browser to compute factorials larger than 4!
+	Warning: it takes a long time for my browser to compute factorials larger than 4!
 
 3. (Easy) Write a function `equal_length` that returns true just in case
 two lists have the same length.  That is,
@@ -108,7 +108,8 @@ whether the length of the list is less than or equal to 1.  This will
 be your base case for your recursive functions that operate on these
 trees.
 
-1.    Write a function that sums the number of leaves in a tree.
+<OL start=6>
+<LI>Write a function that sums the number of leaves in a tree.
 
 Expected behavior:
 
@@ -131,5 +132,7 @@ Expected behavior:
 	sum-leaves tc ~~> 6
 
 
-2.   Write a function that counts the number of leaves.
+<LI>Write a function that counts the number of leaves.
+
+</OL>