Update documentation

Author: AllenDowney

_images/5f2c6acf2632453c84d4a58782db35679dedcd804dd1683fca0560ccb15d92ea.png

@@ -666,7 +666,7 @@
    "id": "cff0414b",
    "metadata": {},
    "source": [
-    "Similarly, an import statement has an effect -- it imports a module so we can use the values and functions it contains -- but it has no visible effect."
+    "Similarly, an import statement has an effect -- it imports a module so we can use the variables and functions it contains -- but it has no visible effect."
    ]
   },
   {
@@ -1329,7 +1329,7 @@
     "A special word used to specify the structure of a program.\n",
     "\n",
     "**import statement:**\n",
-    "A statement that reads a module file and creates a module object.\n",
+    "A statement that reads a module file so we can use the variables and functions it contains.\n",
     "\n",
     "**module:**\n",
     "A file that contains Python code, including function definitions and sometimes other statements.\n",

_sources/chap02.ipynb

@@ -49,7 +49,7 @@
     "When you call one of these functions, it returns a value you can assign to a variable or use as part of an expression.\n",
     "\n",
     "The functions we have written so far are different.\n",
-    "Some use the `print` function to display values, and some use `Turtle` functions to draw figures.\n",
+    "Some use the `print` function to display values, and some use turtle functions to draw figures.\n",
     "But they don't return values we assign to variables or use in expressions.\n",
     "\n",
     "In this chapter, we'll see how to write functions that return values."
@@ -1162,7 +1162,7 @@
     "n! &= n~(n-1)!\n",
     "\\end{aligned}$$ \n",
     "\n",
-    "This definition says that the factorial of 0 is 1, and the factorial of any other value, $n$, is $n$ multiplied by the factorial of $n-1$.\n",
+    "This definition says that the factorial of $0$ is $1$, and the factorial of any other value, $n$, is $n$ multiplied by the factorial of $n-1$.\n",
     "\n",
     "If you can write a recursive definition of something, you can write a Python program to evaluate it. \n",
     "Following an incremental development process, we'll start with a function that take `n` as a parameter and always returns `0`."
@@ -1184,7 +1184,7 @@
    "id": "ee1f63b8",
    "metadata": {},
    "source": [
-    "Now let's add the first part of the definition -- if the argument happens to be 0, all we have to do is return 1:"
+    "Now let's add the first part of the definition -- if the argument happens to be `0`, all we have to do is return `1`:"
    ]
   },
   {
@@ -1207,7 +1207,7 @@
    "metadata": {},
    "source": [
     "Now let's fill in the second part -- if `n` is not `0`, we have to make a recursive\n",
-    "call to find the factorial of $n-1$ and then multiply the result by $n$:"
+    "call to find the factorial of `n-1` and then multiply the result by `n`:"
    ]
   },
   {
@@ -1401,7 +1401,7 @@
    "metadata": {},
    "source": [
     "If you try to follow the flow of execution here, even for small values of $n$, your head explodes.\n",
-    "But according to the leap of faith, if you assume that the two recursive calls work correctly, you can be confident that the last return statement is correct.\n",
+    "But according to the leap of faith, if you assume that the two recursive calls work correctly, you can be confident that the last `return` statement is correct.\n",
     "\n",
     "As an aside, this way of computing Fibonacci numbers is very inefficient.\n",
     "In [Chapter 10](section_memos) I'll explain why and suggest a way to improve it."
@@ -1652,7 +1652,7 @@
    "metadata": {},
    "source": [
     "`space` is a string of space characters that controls the indentation of\n",
-    "the output. Here is the result of `factorial(4)` :"
+    "the output. Here is the result of `factorial(3)` :"
    ]
   },
   {
@@ -2332,7 +2332,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.10.14"
+   "version": "3.10.11"
   }
  },
  "nbformat": 4,