The Newton–Raphson Method Finding roots with tangent lines — from the idea to Olympiad problems Theory · Convergence proofs · Failure modes · Worked examples · 14 exercises with hints and answers How to use this booklet. Part 1–3 give the method and the theory of why it works and when it fails. Part 4 contains the iterations that matter most in mathematics competitions (square roots, reciprocals, Pell equations, real-rooted polynomials). Study the worked examples in Part 5, then attempt Part 7 using only the hints. Answers are at the very end. The Newton–Raphson Method — Theory, Examples and Exercises Page 1 Contents 1. The idea and the formula 2. Convergence theory 3. When Newton’s method fails 4. Classic special cases 5. Worked examples (10) 6. Beyond the real line: complex Newton, optimisation, cousins of Newton 7. Exercises 8. Hints 9. Final answers The Newton–Raphson Method — Theory, Examples and Exercises Page 2 1. The idea and the formula We want to solve f(x) = 0 where f is a differentiable function. Suppose we have a rough guess x0. Near x0 the graph of f looks almost like its tangent line, and a line is easy to intersect with the x-axis. So we replace f by its tangent at x0, find where that line crosses the axis, call it x1, and repeat. Newton’s method for f(x) = x² − 2 starting at x₀ = 2. Each tangent line meets the axis at the next approximation (x₁ = 1.5, x₂ = 1.41667, …). Derivation. The tangent to the graph at the point (xn, f(xn)) is y = f(xn) + f′(xn)(x − xn). Setting y = 0 and solving for x (assuming f′(xn) ≠ 0) gives: Theorem — Newton–Raphson iteration xn+1 = xn − f(xn) / f′(xn) The correction term f/f′ is the horizontal distance from the current point to where the tangent hits the axis. Algebraic reading. If f(x) = 0 at x = r, then f(xn) ≈ f′(xn)(xn − r) for xn close to r. So xn − f/f′ ≈ r: the correction removes (approximately) the entire error in one step. Remark — a minimal algorithm x = x0 for k in 1..N: if f'(x) == 0: stop (bad start) x_new = x - f(x)/f'(x) if |x_new - x| < tol: return x_new x = x_new return FAILED Always cap the number of iterations, and check f′ ≠ 0. Stopping when two consecutive iterates agree is the usual criterion; for quadratic convergence this almost always means the error is far below the tolerance. The Newton–Raphson Method — Theory, Examples and Exercises Page 3 2. Convergence theory 2.1 The error recursion Let r be a root and en = xn − r the error. Newton’s method has a beautiful exact error formula. Theorem — error formula Let f be twice differentiable and f′(x ) ≠ 0. Then for some ξ between x and r: n e n+1 n = [ f″(ξ) / (2f′(x )) ] · e 2 n n Proof. Taylor’s theorem with Lagrange remainder at xn: 0 = f(r) = f(xn) + f′(xn)(r − xn) + ½f″(ξ)(r − xn)2. Divide by f′(xn): 0 = f/f′ + (r − xn) + [f″(ξ)/(2f′)](r − xn)2. Since xn+1 = xn − f/f′, we have f/f′ + r − xn = r − xn+1. Hence r − xn+1 = −[f″/(2f′)](r − xn)2, i.e. the formula. ∎ Theorem — local quadratic convergence Let f be C2 near a simple root r (f(r) = 0, f′(r) ≠ 0). Then there is δ > 0 such that for every x0 with |x0 − r| < δ Newton’s method converges to r, and en+1 / en2 → f″(r) / (2f′(r)). Proof. By continuity pick δ so small that on [r − δ, r + δ] we have |f″(ξ)/(2f′(x))| ≤ M and Mδ < 1. The error formula gives |en+1| ≤ Men2, i.e. M|en+1| ≤ (M|en|)2. With M|e0| < Mδ n < 1, induction yields M|en| ≤ (M|e0|)2 → 0 (doubly exponentially). The limit of the ratio follows by letting xn, ξ → r. ∎ What “quadratic” means in practice. The number of correct digits roughly doubles at every step once you are close. For √2 starting at 1: n 0 1 2 3 4 5 xn 1 1.5 1.4166667 1.41421569 1.41421356237469 1.41421356237310 error |xn − √2| correct digits −1 0 −2 1 −3 2 −6 5 −12 11 −25 24 4.1 × 10 8.6 × 10 2.5 × 10 2.1 × 10 1.6 × 10 9.0 × 10 2.2 The fixed-point viewpoint Newton’s iteration is the fixed-point iteration xn+1 = φ(xn) with φ(x) = x − f(x)/f′(x). Differentiating: φ′(x) = f(x)f″(x) / f′(x)2, which vanishes at every simple root. A fixed-point iteration with φ′(r) = 0 converges faster than linearly, which is exactly why Newton is special. 2.3 Global monotone convergence The local theorem only says “if you start close enough”. Convexity gives a clean global statement, going back to Fourier. Theorem — monotone convergence The Newton–Raphson Method — Theory, Examples and Exercises Page 4 Let f be convex and strictly increasing on [r, b] with f(r) = 0. If x0 ∈ [r, b], then Newton’s iterates satisfy x0 ≥ x1 ≥ … ≥ r and converge to r. Proof. A convex function lies above its tangent lines: 0 = f(r) ≥ f(xn) + f′(xn)(r − xn), which rearranges to xn − f/f′ ≥ r, i.e. xn+1 ≥ r. Since f(xn) ≥ 0 and f′ > 0 we have xn+1 ≤ xn. A decreasing sequence bounded below converges to some L ≥ r; passing to the limit in the recursion gives f(L) = 0, and f is strictly increasing so L = r. ∎ (Mirror-image statements hold for concave or decreasing functions.) The practical rule: start on the side where f and f″ have the same sign. 2.4 Multiple roots If r is a root of multiplicity m ≥ 2 then f′(r) = 0 and the quadratic-convergence argument breaks down. For f(x) = (x − r)m the iteration gives xn+1 − r = (1 − 1/m)(xn − r): only linear convergence with ratio (m−1)/m. The cure is the modified Newton method xn+1 = xn − m f(xn)/f′(xn), which restores quadratic convergence when m is known. The Newton–Raphson Method — Theory, Examples and Exercises Page 5 3. When Newton’s method fails Newton’s method is fast but not foolproof. The common failure modes: Left: for f(x) = x³ − 2x + 2 the start x₀ = 0 gives x₁ = 1, x₂ = 0, … forever. Right: for arctan x the start x₀ = 1.5 overshoots further at every step. Failure Example What happens Zero derivative f(x) = x2 − 2 with x0 = 0 Division by zero; the tangent is horizontal and never meets the axis. 0 → 1 → 0 → 1 → … (check: f(0)=2, f′(0)=−2 ⇒ x1=1; f(1)=1, f′(1)=1 ⇒ x2=0). 3 Cycling f(x) = x − 2x + 2, x0 = 0 Divergence f(x) = arctan 1.3917… Divergence (cube root) f(x) = x1/3 f/f′ = 3x, so xn+1 = −2xn: doubles every step, for any start. Wrong root Several roots A start near a local extremum can shoot you to a distant root. Slow (linear) convergence Multiple root Error shrinks only factor; see §2.4. x, |x0| > Each tangent |xn+1| > |xn|. overshoots by a further: constant Key idea — defensive habits (1) Locate the root first: find a sign change (f(a)f(b) < 0) and use bisection a few times to get a good x0. (2) Check each Newton step stays inside the bracket; if it jumps out, fall back to bisection. (3) Use the monotone convergence theorem when it applies: pick x0 on the side where f·f″ > 0. 4. Classic special cases 4.1 Square roots (Heron / Babylonian method) For f(x) = x2 − a (a > 0), Newton’s formula becomes The Newton–Raphson Method — Theory, Examples and Exercises Page 6 xn+1 = ½ ( xn + a/xn ) the average of xn and a/xn. Two exact facts make this iteration a favourite in contests: Theorem — Heron’s iteration For any x > 0: (i) x − √a = (x − √a)2 / (2x ); 0 n+1 n n sequence is decreasing from x on; (iii) x → √a. 1 (ii) x ≥ √a for all n ≥ 1, and the n n Proof. (i) xn+1 − √a = (xn2 + a − 2√a xn)/(2xn) = (xn − √a)2/(2xn). (ii) By (i) with xn > 0, xn+1 ≥ √a. For n ≥ 1: xn ≥ √a ⇒ xn2 ≥ a ⇒ a/xn ≤ xn ⇒ xn+1 ≤ xn. (iii) A decreasing sequence bounded below converges; the limit L ≥ √a > 0 satisfies L = ½(L + a/L), so L2 = a. ∎ So the method converges from every positive start: if x0 is below √a, the first step simply jumps to the other side of √a. 4.2 k-th roots For f(x) = xk − a: xn+1 = ( (k−1)xn + a/xnk−1 ) / k. This is a weighted AM of xn (weight k−1) and a/xnk−1 (weight 1); by weighted AM-GM it is ≥ a1/k, so again xn ≥ a1/k from n ≥ 1. 4.3 Division without division To compute 1/a using only multiplication and subtraction, apply Newton to f(x) = 1/x − a: since f′ = −1/x2, xn+1 = xn(2 − axn) Let ρn = 1 − axn be the relative error. Then 1 − axn+1 = 1 − 2axn + a2xn2 = (1 − axn)2, i.e. ρn+1 = ρn2. So the iteration converges iff |ρ0| < 1, i.e. 0 < x0 < 2/a, and then the relative error is squared every step. This is how computers implement division in hardware. 4.4 A Pell-equation miracle Run Heron’s iteration for √2 from x0 = 1 using exact fractions: 1 → 3/2 → 17/12 → 577/408 → 665857/470832 → …. Notice 3² − 2·2² = 1, 17² − 2·12² = 1, 577² − 2·408² = 1: every iterate p/q solves the Pell equation p2 − 2q2 = 1. This is no accident: Theorem — Newton generates Pell solutions If p2 − 2q2 = ±1, then the Newton step sends p/q to p′/q′ with p′ = p2 + 2q2, q′ = 2pq, and p′2 − 2q′2 = 1. Proof. ½(p/q + 2q/p) = (p2 + 2q2)/(2pq), and (p2 + 2q2)2 − 2(2pq)2 = (p2 − 2q2)2 = 1. ∎ Since the error obeys xn+1 − √2 = (xn − √2)2/(2xn), the fractions give astonishingly good rational approximations: |665857/470832 − √2| ≈ 1.6×10−12. 4.5 Polynomials with only real roots Theorem — monotone convergence for real-rooted polynomials Let p be a polynomial of degree n ≥ 2 with all roots real, and let R be its largest root. For any x0 > R, Newton’s iterates decrease strictly and converge to R. The Newton–Raphson Method — Theory, Examples and Exercises Page 7 Proof. Write p(x) = c∏(x − ri). The logarithmic derivative is p′/p = ∑ 1/(x − ri). For x > R every term is positive, so p′/p > 1/(x − R) (we dropped the other positive terms; strict if n ≥ 2). Therefore 0 < p/p′ < x − R. The step is xn+1 = xn − p/p′, so R < xn+1 < xn. The sequence is decreasing and bounded below by R, so it converges to some L ≥ R. If L > R then p/p′(L) ≠ 0 and the step would be a non-trivial move at the limit, contradiction; so L = R. ∎ Same idea shows: to bound the largest root of such a polynomial, a few Newton steps from any large x0 give rigorous upper bounds. The Newton–Raphson Method — Theory, Examples and Exercises Page 8 5. Worked examples Example — 1. The square root of 2 2 Problem. Use Newton’s method on f(x) = x − 2 with x0 = 1. Solution. The formula is x = ½(x + 2/x ). Then x = ½(1 + 2) = 3/2, x = ½(3/2 + 4/3) n+1 n n 1 2 = 17/12 ≈ 1.416667, x = ½(17/12 + 24/17) = 577/408 ≈ 1.41421569, and x ≈ 3 4 1.41421356237469. The true value is 1.41421356237310…, so after four steps we have 11 correct digits. Example — 2. Newton’s own example Problem. Find the real root of x3 − 2x − 5 = 0 near 2. Solution. f(2) = −1 and f(3) = 16, so there is a root in (2, 3), and f(2) is close to 0. With f′(x) = 3x2 − 2: x1 = 2 − (−1)/10 = 2.1; x2 = 2.1 − f(2.1)/f′(2.1) = 2.1 − 0.061/11.23 ≈ 2.0945681; x3 ≈ 2.0945514817; x4 ≈ 2.09455148154. Root ≈ 2.0945514815. (This is the equation Newton used in 1669 to illustrate his method.) Example — 3. A transcendental equation Problem. Solve cos x = x. Solution. Put f(x) = cos x − x, so f′(x) = −sin x − 1 (never 0 on [0, 1], good). Since f(0) = 1 > 0 > f(1) = cos 1 − 1, a root lies in (0, 1). Start x0 = 1: x1 ≈ 0.750364, x2 ≈ 0.7391129, x3 ≈ 0.73908513, x4 ≈ 0.739085133215. The root is the “Dottie number” 0.7390851332… Example — 4. Connection to Lambert W Problem. Solve x ex = 1 (that is, find the omega constant Ω = W(1)). Solution. f(x) = xex − 1, f′(x) = (x + 1)ex. The iteration simplifies to xn+1 = xn − (xn − e−xn)/(xn + 1) = (xn2 + e−xn)/(xn + 1). From x0 = 1: 0.683940, 0.577454, 0.567230, 0.5671433, 0.56714329041. Ω ≈ 0.567143290. This is how W(x) is computed in practice. (f is increasing and convex for x > −2, so starting to the right of the root the monotone theorem applies.) Example — 5. Reciprocal of 7 without dividing Problem. Approximate 1/7 using xn+1 = xn(2 − 7xn) and x0 = 0.1. Solution. Check the condition 0 < x0 < 2/7 ≈ 0.2857 . x1 = 0.1(2 − 0.7) = 0.13; x2 = 0.13(2 − 0.91) = 0.1417; x3 = 0.1417(2 − 0.9919) ≈ 0.14284777; x4 ≈ 0.1428571422. The relative errors ρn = 1 − 7xn: 0.3, 0.09, 0.0081, 6.6×10−5, … are exactly squared at each step . True value 1/7 = 0.142857142857… Example — 6. A cube root Problem. Approximate 3√10 starting from x0 = 2. Solution. f(x) = x3 − 10 gives xn+1 = (2xn + 10/xn2)/3. x1 = (4 + 2.5)/3 = 2.16667; x2 ≈ 2.154504; x3 ≈ 2.15443469; x4 ≈ 2.15443469003. Indeed 3√10 = 2.154434690031… Example — 7. A double root The Newton–Raphson Method — Theory, Examples and Exercises Page 9 2 Problem. Apply Newton to f(x) = (x − 1) with x0 = 3, and then the modified method. Solution. f/f′ = (x − 1)/2, so x = (x + 1)/2. The iterates 3, 2, 1.5, 1.25, 1.125, … have n+1 n error exactly halved at each step: linear convergence with ratio ½ = (m−1)/m for m = 2. The modified method xn+1 = xn − 2f/f′ = xn − (xn − 1) = 1 lands exactly on the root in one step. Example — 8. Cycling Problem. Show that Newton’s method for f(x) = x3 − 2x + 2 started at 0 never converges, and find the real root by a better start. Solution. f′(x) = 3x2 − 2. x = 0 − 2/(−2) = 1; x = 1 − 1/1 = 0, so the sequence 1 2 alternates 0, 1, 0, 1, … Meanwhile the only real root is ≈ −1.77 (since f(−2) = −2 < 0 < f(−1) = 3). Starting from x = −2: −1.8, −1.769948, −1.7692927, −1.76929235, … 0 converging to −1.7692923542…. Moral: the start matters. Example — 9. A rigorous error bound Problem. Starting from x0 = 3/2, bound the error of x3 for √2 without using decimals beyond what is needed. Solution. By the Heron error formula en+1 = en2/(2xn) with xn ≥ 1.4 (for all n here). Since 1.4 < √2 < 1.42, e0 < 0.1, so e1 < 0.01/2.8 < 0.0036; e2 < (0.0036)2/2.8 < 4.7 × 10−6; e3 < (4.7×10−6)2/2.8 < 8 × 10−12. So x3 = 665857/470832 is within 10−11 of √2: the doubling of correct digits is provable with elementary arithmetic. Example — 10. Pell’s equation from Newton Problem. Prove that the sequence a1 = 1/1, an+1 = (an + 2/an)/2 consists of fractions p/q with p2 − 2q2 = 1 for n ≥ 2. Solution. Start with p = q = 1, so p2 − 2q2 = −1. The step p′ = p2 + 2q2, q′ = 2pq turns ±1 into (±1)2 = +1 (Theorem in §4.4). So 3/2 satisfies 9 − 8 = 1, and from then on the equation remains +1. Thus infinitely many solutions to the Pell equation p2 − 2q2 = 1 arise, and they approximate √2 quadratically. The Newton–Raphson Method — Theory, Examples and Exercises Page 10 6. Beyond the real line 6.1 Complex numbers and fractals Newton’s iteration works verbatim for analytic functions of a complex variable. Which root does a starting point z0 end up at? For f(z) = z3 − 1, the three cube roots of unity attract three regions of the plane — but their boundaries are not smooth curves: they form a fractal (a Julia set), and every boundary point is a boundary of all three basins simultaneously. This is Cayley’s 1879 problem, solved by Julia and Fatou around 1918. Each colour shows which cube root of 1 the Newton iteration reaches from that starting point. 6.2 Chaos on the real line: f(x) = x² + 1 The equation x2 + 1 = 0 has no real root, so Newton’s method on ℝ cannot converge. The iteration is xn+1 = (xn − 1/xn)/2. Write x0 = cot θ. Since cot 2θ = (cot θ − tan θ)/2, we get xn = cot(2nθ): Newton’s method is the angle-doubling map, a textbook example of chaos. Periodic orbits appear when 2kθ ≡ θ (mod π). For example θ = π/3 gives the 2-cycle 1/√3 → −1/√3 → 1/√3 (check: (1/√3 − √3)/2 = −1/√3). 6.3 Optimisation To minimise a smooth function g, solve g′(x) = 0: apply Newton to f = g′, giving xn+1 = xn − g′(xn)/g″(xn). In several variables, this becomes ‘x ← x − [∇²g]−1∇g’ with the Hessian matrix: the basis of second-order optimisation methods. 6.4 Newton and its cousins Method Needs Order Remarks Bisection sign change 1 (ratio ½) Slow but unbreakable. Secant f only (1+√5)/2 ≈ 1.618 Replaces f′ by a difference quotient; no derivative needed. Newton f, f′ 2 Digits double each step. Halley f, f′, f″ 3 Uses curvature: xn+1 = xn − 2ff′/(2f′2 − ff″). The Newton–Raphson Method — Theory, Examples and Exercises Page 11 Remark — which is “best”? A higher order is not automatically cheaper: Newton needs two evaluations per step (f and f′), so per evaluation its growth rate is √2 ≈ 1.414, while the secant method achieves ≈ 1.618 per evaluation. Newton wins when f′ is cheap or available in closed form. The Newton–Raphson Method — Theory, Examples and Exercises Page 12 7. Exercises N1–N4 build technique, N5–N10 are classic competition and analysis material, N11–N14 are conceptual and more demanding. Spend at least 15 minutes on a problem before opening its hint. N1. Apply Newton’s method to f(x) = x2 − 5 with x0 = 2. Compute x1 and x2 as exact fractions. N2. Derive the Newton iteration for 3√2 (i.e. f(x) = x3 − 2) and compute x1, x2 from x0 = 1. N3. Show that the division-free iteration xn+1 = xn(2 − axn) satisfies 1 − axn+1 = (1 − axn)2, and deduce for which starting values it converges to 1/a (a > 0). N4. Let a > 0 and x0 > 0 arbitrary. Prove that xn+1 = ½(xn + a/xn) is decreasing for n ≥ 1 and converges to √a. Where did you use AM-GM? N5. Starting with p0 = q0 = 1, define pk+1 = pk2 + 2qk2, qk+1 = 2pkqk. Prove pk2 − 2qk2 = 1 for k ≥ 1, compute p4/q4, and explain why pk/qk → √2. N6. Show that for f(x) = (x − 2)3 Newton’s method converges only linearly. What is the ratio? Which modification gives the root in one step? N7. (a) Show that Newton’s method for f(x) = x1/3 diverges from every start ≠ 0. (b) For f(x) = arctan x, find the critical starting value c for which Newton cycles: x1 = −x0. Describe the behaviour for |x0| < c and |x0| > c. N8. Prove the theorem of §4.5: if p has only real roots, R is the largest, and x0 > R, Newton’s iterates decrease to R. Then use it to show: if all roots of x3 − 3x + 1 are real (they are), then the largest root is < 1.9. N9. Show that Newton’s method for x3 − 2x + 2 = 0 started at x0 = 1 never converges. Then find a start for which it does, and give the root to 6 decimal places. N10. Use Newton’s method to compute Ω, the solution of xex = 1, to 4 decimal places starting at x0 = 1. Then verify the answer using the identity Ω = e−Ω. N11. Let φ(x) = x − f(x)/f′(x). Prove φ′ = ff″/f′2. Use this to show that if f(r) = 0, f′(r) ≠ 0 then φ′(r) = 0 and φ″(r) = f″(r)/f′(r), explaining the constant ½ in the error formula. N12. Using two Newton steps from x0 = 3, show that 721/228 approximates √10 with error less than 4 × 10−6. N13. Let g(x) = (x − 1/x)/2 (Newton’s map for x2 + 1). (a) Prove g(cot θ) = cot 2θ. (b) Find a 3-cycle of g. (c) Conclude that Newton’s method for x2 + 1 has periodic orbits of arbitrarily large period. N14. Minimise g(x) = x − ln x on (0, ∞) by applying Newton to g′(x) = 0. Show that the iteration is xn+1 = 2xn − xn2 and determine for which starting values in (0, ∞) it converges to the minimiser. The Newton–Raphson Method — Theory, Examples and Exercises Page 13 8. Hints Hints point the way; you finish the proofs and computations. N1. The iteration is xn+1 = ½(xn + 5/xn). Work with fractions; for x2 use a common denominator. N2. f/f′ = (x3 − 2)/(3x2). Simplify xn − f/f′ into a single fraction. n N3. Expand the square. What condition on ρ0 = 1 − ax0 makes ρn = ρ02 tend to 0? What happens when ρ0 = ±1 or |ρ0| > 1? N4. AM-GM on xn and a/xn gives a lower bound for xn+1. Then compare xn+1 with xn, using xn ≥ √a. N5. Compute (p2 + 2q2)2 − 2(2pq)2 and factor. For the limit, relate pk+1/qk+1 to ½(pk/qk + 2qk/pk). N6. Compute f/f′ = (x − 2)/3 and subtract. N7. (a) Compute f/f′ = 3x. (b) f/f′ = (1 + x2) arctan x. The condition x1 = −x0 means x − (1 + x2) arctan x = −x. N8. Use p′/p = ∑ 1/(x − ri) to prove 0 < p/p′ < x − R. For the numerical part apply one Newton step from x0 = 2. N9. Compute x1 and x2 from x0 = 1; recognise the pattern. For a good start look at the sign change of f on the negative axis. N10. Iteration: xn+1 = (xn2 + e−xn)/(xn + 1). Three or four steps suffice. N11. Quotient rule. For φ″ differentiate again and evaluate at r, where f = 0 kills most terms. Compare with the Taylor expansion of φ at r. N12. Compute x1 and x2 exactly. For the error use en+1 = en2/(2xn); first bound e0 using 3.16 < √10 < 3.17. N13. (a) cot 2θ = (cos2θ − sin2θ)/(2 sin θ cos θ). (b) You need 8θ ≡ θ (mod π): try θ = π/7. (c) Which θ satisfy 2kθ ≡ θ (mod π)? N14. g′ = 1 − 1/x, g″ = 1/x2. Set ρn = 1 − xn and compare with Exercise N3. The Newton–Raphson Method — Theory, Examples and Exercises Page 14 9. Final answers Use these only to check your work. N1. x1 = 9/4, x2 = 161/72 ≈ 2.236111 (true √5 = 2.236068…). N2. xn+1 = (2xn + 2/xn2)/3; x1 = 4/3, x2 = 91/72 ≈ 1.26389 (true value 1.259921…). N3. Converges iff |1 − ax0| < 1, i.e. 0 < x0 < 2/a. If x0 = 0 or 2/a the iteration reaches 0 and stays there (ρn = 1); for |ρ0| > 1, |ρn| → ∞. N4. See §4.1: xn+1 ≥ √a by AM-GM for every n ≥ 0; then xn+1 ≤ xn for n ≥ 1; the limit satisfies L2 = a. N5. (p2−2q2)2 = 1 for k ≥ 1. Values: 3/2, 17/12, 577/408, 665857/470832 = p4/q4. The ratio is Newton’s iteration for √2 from 1. N6. en+1 = (2/3)en; the modified step xn − 3f/f′ lands on 2 immediately. N7. (a) xn+1 = −2xn. (b) c solves 2x = (1 + x2) arctan x, c ≈ 1.3917452. Converges (to 0) if |x0| < c, cycles at |x0| = c, diverges if |x0| > c. N8. From x0 = 2: p(2) = 3, p′(2) = 9, so x1 = 2 − 1/3 = 5/3 ≈ 1.667. Therefore R < 5/3 < 1.9 (and in fact R ≈ 1.532). N9. 1 → 0 → 1 → …. Start x0 = −2: converges to −1.769292. N10. Ω ≈ 0.5671 (0.683940, 0.577454, 0.567230, 0.567143). Check: e−0.5671 ≈ 0.5671 . N11. φ′ = ff″/f′2; φ″(r) = f″(r)/f′(r). Taylor: φ(x) − r ≈ ½φ″(r)(x − r)2 = [f″/(2f′)](x − r)2. N12. x1 = 19/6, x2 = 721/228 ≈ 3.1622807. |e0| < 0.17 ⇒ e1 < 0.0289/6 < 0.0049 ⇒ e2 < (0.0049)2/6.3 < 3.8×10−6. N13. 3-cycle: cot(π/7) → cot(2π/7) → cot(4π/7) → cot(8π/7) = cot(π/7). In general θ = π/(2k − 1) has period k. N14. 1 − xn+1 = (1 − xn)2. Converges to 1 iff 0 < x0 < 2 (for x0 > 2 the iterates leave the domain: x1 < 0; for x0 = 2: x1 = 0). The Newton–Raphson Method — Theory, Examples and Exercises Page 15