From c949c61735472be31d6606e494f352bebe662037 Mon Sep 17 00:00:00 2001 From: Matt McKay Date: Mon, 22 Jun 2026 08:46:53 +1000 Subject: [PATCH] SYNC: update short_path.md from lecture-python-intro Brings lecture-dp's short_path.md back into byte-identical alignment with its primary source (see #7). Upstream landed a single-word fix: - start an initial guess and then iterate. + start with an initial guess and then iterate. No intersphinx prefixes to preserve; short_path.md is not in #7's exception list. Co-Authored-By: Claude Opus 4.7 (1M context) --- lectures/short_path.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lectures/short_path.md b/lectures/short_path.md index ce547ef..3ecc45a 100644 --- a/lectures/short_path.md +++ b/lectures/short_path.md @@ -142,7 +142,7 @@ implement it. ### The algorithm -The standard algorithm for finding $J$ is to start an initial guess and then iterate. +The standard algorithm for finding $J$ is to start with an initial guess and then iterate. This is a standard approach to solving nonlinear equations, often called the method of **successive approximations**.